Lines Matching refs:dA
42 void check_sparse_solving(Solver& solver, const typename Solver::MatrixType& A, const Rhs& b, const DenseMat& dA, const DenseRhs& db)
48 DenseRhs refX = dA.householderQr().solve(db);
177 void check_sparse_determinant(Solver& solver, const typename Solver::MatrixType& A, const DenseMat& dA)
189 Scalar refDet = dA.determinant();
193 void check_sparse_abs_determinant(Solver& solver, const typename Solver::MatrixType& A, const DenseMat& dA)
206 Scalar refDet = abs(dA.determinant());
211 int generate_sparse_spd_problem(Solver& , typename Solver::MatrixType& A, typename Solver::MatrixType& halfA, DenseMat& dA, int maxSize = 300)
226 dA = dM * dM.adjoint();
281 DenseMatrix dA;
283 int size = generate_sparse_spd_problem(solver, A, halfA, dA, maxSize);
295 CALL_SUBTEST( check_sparse_solving(solver, A, b, dA, b) );
296 CALL_SUBTEST( check_sparse_solving(solver, halfA, b, dA, b) );
297 CALL_SUBTEST( check_sparse_solving(solver, A, dB, dA, dB) );
298 CALL_SUBTEST( check_sparse_solving(solver, halfA, dB, dA, dB) );
299 CALL_SUBTEST( check_sparse_solving(solver, A, B, dA, dB) );
300 CALL_SUBTEST( check_sparse_solving(solver, halfA, B, dA, dB) );
301 CALL_SUBTEST( check_sparse_solving(solver, A, c, dA, dc) );
302 CALL_SUBTEST( check_sparse_solving(solver, halfA, c, dA, dc) );
308 check_sparse_solving(solver, A, b, dA, b);
362 DenseMatrix dA;
363 generate_sparse_spd_problem(solver, A, halfA, dA, 30);
366 check_sparse_determinant(solver, A, dA);
367 check_sparse_determinant(solver, halfA, dA );
372 Index generate_sparse_square_problem(Solver&, typename Solver::MatrixType& A, DenseMat& dA, int maxSize = 300, int options = ForceNonZeroDiag)
381 dA.resize(size,size);
383 initSparse<Scalar>(density, dA, A, options);
411 DenseMatrix dA;
413 Index size = generate_sparse_square_problem(solver, A, dA, maxSize);
424 CALL_SUBTEST(check_sparse_solving(solver, A, b, dA, b));
425 CALL_SUBTEST(check_sparse_solving(solver, A, dB, dA, dB));
426 CALL_SUBTEST(check_sparse_solving(solver, A, B, dA, dB));
427 CALL_SUBTEST(check_sparse_solving(solver, A, c, dA, dc));
433 check_sparse_solving(solver, A, b, dA, b);
486 DenseMatrix dA;
489 dA.setRandom(size,size);
491 dA = (dA.array().abs()<0.3).select(0,dA);
492 dA.diagonal() = (dA.diagonal().array()==0).select(1,dA.diagonal());
493 A = dA.sparseView();
496 check_sparse_determinant(solver, A, dA);
509 DenseMatrix dA;
510 generate_sparse_square_problem(solver, A, dA, 30);
512 check_sparse_abs_determinant(solver, A, dA);
517 void generate_sparse_leastsquare_problem(Solver&, typename Solver::MatrixType& A, DenseMat& dA, int maxSize = 300, int options = ForceNonZeroDiag)
527 dA.resize(rows,cols);
529 initSparse<Scalar>(density, dA, A, options);
543 DenseMatrix dA;
545 generate_sparse_leastsquare_problem(solver, A, dA);
554 check_sparse_solving(solver, A, b, dA, b);
555 check_sparse_solving(solver, A, dB, dA, dB);
556 check_sparse_solving(solver, A, B, dA, dB);
562 check_sparse_solving(solver, A, b, dA, b);
