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.

34 lines
1.5 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, typename I> void test_conjugate_gradient_T()
  12. {
  13. typedef SparseMatrix<T,0,I> SparseMatrixType;
  14. ConjugateGradient<SparseMatrixType, Lower > cg_colmajor_lower_diag;
  15. ConjugateGradient<SparseMatrixType, Upper > cg_colmajor_upper_diag;
  16. ConjugateGradient<SparseMatrixType, Lower|Upper> cg_colmajor_loup_diag;
  17. ConjugateGradient<SparseMatrixType, Lower, IdentityPreconditioner> cg_colmajor_lower_I;
  18. ConjugateGradient<SparseMatrixType, Upper, IdentityPreconditioner> cg_colmajor_upper_I;
  19. CALL_SUBTEST( check_sparse_spd_solving(cg_colmajor_lower_diag) );
  20. CALL_SUBTEST( check_sparse_spd_solving(cg_colmajor_upper_diag) );
  21. CALL_SUBTEST( check_sparse_spd_solving(cg_colmajor_loup_diag) );
  22. CALL_SUBTEST( check_sparse_spd_solving(cg_colmajor_lower_I) );
  23. CALL_SUBTEST( check_sparse_spd_solving(cg_colmajor_upper_I) );
  24. }
  25. void test_conjugate_gradient()
  26. {
  27. CALL_SUBTEST_1(( test_conjugate_gradient_T<double,int>() ));
  28. CALL_SUBTEST_2(( test_conjugate_gradient_T<std::complex<double>, int>() ));
  29. CALL_SUBTEST_3(( test_conjugate_gradient_T<double,long int>() ));
  30. }