You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

47 lines
2.1 KiB

  1. // This file is part of Eigen, a lightweight C++ template library
  2. // for linear algebra.
  3. //
  4. // Copyright (C) 2011 Gael Guennebaud <g.gael@free.fr>
  5. //
  6. // This Source Code Form is subject to the terms of the Mozilla
  7. // Public License v. 2.0. If a copy of the MPL was not distributed
  8. // with this file, You can obtain one at http://mozilla.org/MPL/2.0/.
  9. #include "sparse_solver.h"
  10. template<typename T, typename I> void test_simplicial_cholesky_T()
  11. {
  12. typedef SparseMatrix<T,0,I> SparseMatrixType;
  13. SimplicialCholesky<SparseMatrixType, Lower> chol_colmajor_lower_amd;
  14. SimplicialCholesky<SparseMatrixType, Upper> chol_colmajor_upper_amd;
  15. SimplicialLLT< SparseMatrixType, Lower> llt_colmajor_lower_amd;
  16. SimplicialLLT< SparseMatrixType, Upper> llt_colmajor_upper_amd;
  17. SimplicialLDLT< SparseMatrixType, Lower> ldlt_colmajor_lower_amd;
  18. SimplicialLDLT< SparseMatrixType, Upper> ldlt_colmajor_upper_amd;
  19. SimplicialLDLT< SparseMatrixType, Lower, NaturalOrdering<I> > ldlt_colmajor_lower_nat;
  20. SimplicialLDLT< SparseMatrixType, Upper, NaturalOrdering<I> > ldlt_colmajor_upper_nat;
  21. check_sparse_spd_solving(chol_colmajor_lower_amd);
  22. check_sparse_spd_solving(chol_colmajor_upper_amd);
  23. check_sparse_spd_solving(llt_colmajor_lower_amd);
  24. check_sparse_spd_solving(llt_colmajor_upper_amd);
  25. check_sparse_spd_solving(ldlt_colmajor_lower_amd);
  26. check_sparse_spd_solving(ldlt_colmajor_upper_amd);
  27. check_sparse_spd_determinant(chol_colmajor_lower_amd);
  28. check_sparse_spd_determinant(chol_colmajor_upper_amd);
  29. check_sparse_spd_determinant(llt_colmajor_lower_amd);
  30. check_sparse_spd_determinant(llt_colmajor_upper_amd);
  31. check_sparse_spd_determinant(ldlt_colmajor_lower_amd);
  32. check_sparse_spd_determinant(ldlt_colmajor_upper_amd);
  33. check_sparse_spd_solving(ldlt_colmajor_lower_nat, 300, 1000);
  34. check_sparse_spd_solving(ldlt_colmajor_upper_nat, 300, 1000);
  35. }
  36. void test_simplicial_cholesky()
  37. {
  38. CALL_SUBTEST_1(( test_simplicial_cholesky_T<double,int>() ));
  39. CALL_SUBTEST_2(( test_simplicial_cholesky_T<std::complex<double>, int>() ));
  40. CALL_SUBTEST_3(( test_simplicial_cholesky_T<double,long int>() ));
  41. }