44 CALL_SUBTEST_11(( test_simplicial_cholesky_T<double, int, ColMajor>() ));
46 CALL_SUBTEST_13(( test_simplicial_cholesky_T<double, long int, ColMajor>() ));
47 CALL_SUBTEST_21(( test_simplicial_cholesky_T<double, int, RowMajor>() ));
49 CALL_SUBTEST_23(( test_simplicial_cholesky_T<double, long int, RowMajor>() ));
#define CALL_SUBTEST_12(FUNC)
A versatible sparse matrix representation.
#define CALL_SUBTEST_13(FUNC)
#define CALL_SUBTEST_11(FUNC)
#define CALL_SUBTEST_22(FUNC)
void check_sparse_spd_determinant(Solver &solver)
A direct sparse LDLT Cholesky factorizations without square root.
EIGEN_DECLARE_TEST(simplicial_cholesky)
#define CALL_SUBTEST_23(FUNC)
void test_simplicial_cholesky_T()
#define CALL_SUBTEST_21(FUNC)
#define EIGEN_TEST_MAX_SIZE
A direct sparse LLT Cholesky factorizations.
void check_sparse_spd_solving(Solver &solver, int maxSize=(std::min)(300, EIGEN_TEST_MAX_SIZE), int maxRealWorldSize=100000)