![]() |
Eigen-unsupported
3.2.7
|
A GMRES solver for sparse square problems.
This class allows to solve for A.x = b sparse linear problems using a generalized minimal residual method. The vectors x and b can be either dense or sparse.
_MatrixType | the type of the sparse matrix A, can be a dense or a sparse matrix. |
_Preconditioner | the type of the preconditioner. Default is DiagonalPreconditioner |
The maximal number of iterations and tolerance value can be controlled via the setMaxIterations() and setTolerance() methods. The defaults are the size of the problem for the maximal number of iterations and NumTraits<Scalar>::epsilon() for the tolerance.
This class can be used as the direct solver classes. Here is a typical usage example:
By default the iterations start with x=0 as an initial guess of the solution. One can control the start using the solveWithGuess() method.
Inherits IterativeSolverBase< GMRES< _MatrixType, _Preconditioner > >.
Public Member Functions | |
int | get_restart () |
GMRES () | |
template<typename MatrixDerived > | |
GMRES (const EigenBase< MatrixDerived > &A) | |
void | set_restart (const int restart) |
template<typename Rhs , typename Guess > | |
const internal::solve_retval_with_guess < GMRES, Rhs, Guess > | solveWithGuess (const MatrixBase< Rhs > &b, const Guess &x0) const |
|
inline |
Default constructor.
Referenced by GMRES< _MatrixType, _Preconditioner >::solveWithGuess().
|
inlineexplicit |
Initialize the solver with matrix A for further Ax=b
solving.
This constructor is a shortcut for the default constructor followed by a call to compute().
|
inline |
Get the number of iterations after that a restart is performed.
|
inline |
Set the number of iterations after that a restart is performed.
restart | number of iterations for a restarti, default is 30. |
|
inline |
References GMRES< _MatrixType, _Preconditioner >::GMRES().