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

1 files changed, 2 insertions, 2 deletions

diff --git a/test/sparselu.cpp b/test/sparselu.cpp
index 37eb069a9..231c857ad 100644
--- a/test/sparselu.cpp
+++ b/test/sparselu.cpp
@@ -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);