Skip too large real-world problems for solvers that do not scale (e.g., SimplicialLLT without reordering)

This commit is contained in:
Gael Guennebaud
2015-06-09 09:29:53 +02:00
parent 9a2447b0c9
commit 9aef0db992
3 changed files with 44 additions and 26 deletions

View File

@@ -42,8 +42,8 @@ template<typename T> void test_sparselu_T()
SparseLU<SparseMatrix<T, ColMajor, long int>, NaturalOrdering<long int> > sparselu_natural;
check_sparse_square_solving(sparselu_colamd);
check_sparse_square_solving(sparselu_amd);
check_sparse_square_solving(sparselu_natural);
check_sparse_square_solving(sparselu_amd, 300, 2000);
check_sparse_square_solving(sparselu_natural, 300, 2000);
check_sparse_square_abs_determinant(sparselu_colamd);
check_sparse_square_abs_determinant(sparselu_amd);