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.4 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_bicgstab_T()
  12. {
  13. BiCGSTAB<SparseMatrix<T,0,I>, DiagonalPreconditioner<T> > bicgstab_colmajor_diag;
  14. BiCGSTAB<SparseMatrix<T,0,I>, IdentityPreconditioner > bicgstab_colmajor_I;
  15. BiCGSTAB<SparseMatrix<T,0,I>, IncompleteLUT<T,I> > bicgstab_colmajor_ilut;
  16. //BiCGSTAB<SparseMatrix<T>, SSORPreconditioner<T> > bicgstab_colmajor_ssor;
  17. bicgstab_colmajor_diag.setTolerance(NumTraits<T>::epsilon()*4);
  18. bicgstab_colmajor_ilut.setTolerance(NumTraits<T>::epsilon()*4);
  19. CALL_SUBTEST( check_sparse_square_solving(bicgstab_colmajor_diag) );
  20. // CALL_SUBTEST( check_sparse_square_solving(bicgstab_colmajor_I) );
  21. CALL_SUBTEST( check_sparse_square_solving(bicgstab_colmajor_ilut) );
  22. //CALL_SUBTEST( check_sparse_square_solving(bicgstab_colmajor_ssor) );
  23. }
  24. void test_bicgstab()
  25. {
  26. CALL_SUBTEST_1((test_bicgstab_T<double,int>()) );
  27. CALL_SUBTEST_2((test_bicgstab_T<std::complex<double>, int>()));
  28. CALL_SUBTEST_3((test_bicgstab_T<double,long int>()));
  29. }