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.

30 lines
1.2 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/IterativeLinearSolvers>
  11. template<typename T> void test_conjugate_gradient_T()
  12. {
  13. ConjugateGradient<SparseMatrix<T>, Lower> cg_colmajor_lower_diag;
  14. ConjugateGradient<SparseMatrix<T>, Upper> cg_colmajor_upper_diag;
  15. ConjugateGradient<SparseMatrix<T>, Lower, IdentityPreconditioner> cg_colmajor_lower_I;
  16. ConjugateGradient<SparseMatrix<T>, Upper, IdentityPreconditioner> cg_colmajor_upper_I;
  17. CALL_SUBTEST( check_sparse_spd_solving(cg_colmajor_lower_diag) );
  18. CALL_SUBTEST( check_sparse_spd_solving(cg_colmajor_upper_diag) );
  19. CALL_SUBTEST( check_sparse_spd_solving(cg_colmajor_lower_I) );
  20. CALL_SUBTEST( check_sparse_spd_solving(cg_colmajor_upper_I) );
  21. }
  22. void test_conjugate_gradient()
  23. {
  24. CALL_SUBTEST_1(test_conjugate_gradient_T<double>());
  25. CALL_SUBTEST_2(test_conjugate_gradient_T<std::complex<double> >());
  26. }