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.

56 lines
2.6 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. #include <Eigen/CholmodSupport>
  11. template<typename T> void test_cholmod_T()
  12. {
  13. CholmodDecomposition<SparseMatrix<T>, Lower> g_chol_colmajor_lower; g_chol_colmajor_lower.setMode(CholmodSupernodalLLt);
  14. CholmodDecomposition<SparseMatrix<T>, Upper> g_chol_colmajor_upper; g_chol_colmajor_upper.setMode(CholmodSupernodalLLt);
  15. CholmodDecomposition<SparseMatrix<T>, Lower> g_llt_colmajor_lower; g_llt_colmajor_lower.setMode(CholmodSimplicialLLt);
  16. CholmodDecomposition<SparseMatrix<T>, Upper> g_llt_colmajor_upper; g_llt_colmajor_upper.setMode(CholmodSimplicialLLt);
  17. CholmodDecomposition<SparseMatrix<T>, Lower> g_ldlt_colmajor_lower; g_ldlt_colmajor_lower.setMode(CholmodLDLt);
  18. CholmodDecomposition<SparseMatrix<T>, Upper> g_ldlt_colmajor_upper; g_ldlt_colmajor_upper.setMode(CholmodLDLt);
  19. CholmodSupernodalLLT<SparseMatrix<T>, Lower> chol_colmajor_lower;
  20. CholmodSupernodalLLT<SparseMatrix<T>, Upper> chol_colmajor_upper;
  21. CholmodSimplicialLLT<SparseMatrix<T>, Lower> llt_colmajor_lower;
  22. CholmodSimplicialLLT<SparseMatrix<T>, Upper> llt_colmajor_upper;
  23. CholmodSimplicialLDLT<SparseMatrix<T>, Lower> ldlt_colmajor_lower;
  24. CholmodSimplicialLDLT<SparseMatrix<T>, Upper> ldlt_colmajor_upper;
  25. check_sparse_spd_solving(g_chol_colmajor_lower);
  26. check_sparse_spd_solving(g_chol_colmajor_upper);
  27. check_sparse_spd_solving(g_llt_colmajor_lower);
  28. check_sparse_spd_solving(g_llt_colmajor_upper);
  29. check_sparse_spd_solving(g_ldlt_colmajor_lower);
  30. check_sparse_spd_solving(g_ldlt_colmajor_upper);
  31. check_sparse_spd_solving(chol_colmajor_lower);
  32. check_sparse_spd_solving(chol_colmajor_upper);
  33. check_sparse_spd_solving(llt_colmajor_lower);
  34. check_sparse_spd_solving(llt_colmajor_upper);
  35. check_sparse_spd_solving(ldlt_colmajor_lower);
  36. check_sparse_spd_solving(ldlt_colmajor_upper);
  37. // check_sparse_spd_determinant(chol_colmajor_lower);
  38. // check_sparse_spd_determinant(chol_colmajor_upper);
  39. // check_sparse_spd_determinant(llt_colmajor_lower);
  40. // check_sparse_spd_determinant(llt_colmajor_upper);
  41. // check_sparse_spd_determinant(ldlt_colmajor_lower);
  42. // check_sparse_spd_determinant(ldlt_colmajor_upper);
  43. }
  44. void test_cholmod_support()
  45. {
  46. CALL_SUBTEST_1(test_cholmod_T<double>());
  47. CALL_SUBTEST_2(test_cholmod_T<std::complex<double> >());
  48. }