gmres.cpp File Reference
#include "../../test/sparse_solver.h"
#include <Eigen/IterativeSolvers>

Functions

template<typename T >
void test_gmres_T ()
 
 EIGEN_DECLARE_TEST (gmres)
 

Function Documentation

◆ EIGEN_DECLARE_TEST()

EIGEN_DECLARE_TEST ( gmres  )
27  {
28  CALL_SUBTEST_1(test_gmres_T<double>());
29  CALL_SUBTEST_2(test_gmres_T<std::complex<double> >());
30 }
void test_gmres_T()
Definition: gmres.cpp:15
#define CALL_SUBTEST_1(FUNC)
Definition: split_test_helper.h:4
#define CALL_SUBTEST_2(FUNC)
Definition: split_test_helper.h:10

References CALL_SUBTEST_1, CALL_SUBTEST_2, and test_gmres_T().

◆ test_gmres_T()

template<typename T >
void test_gmres_T ( )
15  {
16  GMRES<SparseMatrix<T>, DiagonalPreconditioner<T> > gmres_colmajor_diag;
18  GMRES<SparseMatrix<T>, IncompleteLUT<T> > gmres_colmajor_ilut;
19  // GMRES<SparseMatrix<T>, SSORPreconditioner<T> > gmres_colmajor_ssor;
20 
21  CALL_SUBTEST(check_sparse_square_solving(gmres_colmajor_diag));
22  // CALL_SUBTEST( check_sparse_square_solving(gmres_colmajor_I) );
23  CALL_SUBTEST(check_sparse_square_solving(gmres_colmajor_ilut));
24  // CALL_SUBTEST( check_sparse_square_solving(gmres_colmajor_ssor) );
25 }
A preconditioner based on the digonal entries.
Definition: BasicPreconditioners.h:39
A GMRES solver for sparse square problems.
Definition: GMRES.h:255
A naive preconditioner which approximates any matrix as the identity matrix.
Definition: BasicPreconditioners.h:181
Incomplete LU factorization with dual-threshold strategy.
Definition: IncompleteLUT.h:102
#define CALL_SUBTEST(FUNC)
Definition: main.h:382
void check_sparse_square_solving(Solver &solver, int maxSize=300, int maxRealWorldSize=100000, bool checkDeficient=false)
Definition: sparse_solver.h:613

References CALL_SUBTEST, and check_sparse_square_solving().

Referenced by EIGEN_DECLARE_TEST().