|
void | _solve_impl (const Rhs &b, Dest &x) const |
|
template<typename Rhs , typename Dest > |
void | _solve_vector_with_guess_impl (const Rhs &b, Dest &x) const |
|
Index | get_restart () |
|
| GMRES () |
|
template<typename MatrixDerived > |
| GMRES (const EigenBase< MatrixDerived > &A) |
|
void | set_restart (const Index restart) |
|
| ~GMRES () |
|
void | _solve_impl (const Rhs &b, Dest &x) const |
|
std::enable_if_t< Rhs::ColsAtCompileTime!=1 &&DestDerived::ColsAtCompileTime!=1 > | _solve_with_guess_impl (const Rhs &b, MatrixBase< DestDerived > &aDest) const |
|
std::enable_if_t< Rhs::ColsAtCompileTime==1||DestDerived::ColsAtCompileTime==1 > | _solve_with_guess_impl (const Rhs &b, MatrixBase< DestDerived > &dest) const |
|
void | _solve_with_guess_impl (const Rhs &b, SparseMatrixBase< DestDerived > &aDest) const |
|
Derived & | analyzePattern (const EigenBase< MatrixDerived > &A) |
|
EIGEN_CONSTEXPR Index | cols () const EIGEN_NOEXCEPT |
|
Derived & | compute (const EigenBase< MatrixDerived > &A) |
|
Derived & | derived () |
|
const Derived & | derived () const |
|
RealScalar | error () const |
|
Derived & | factorize (const EigenBase< MatrixDerived > &A) |
|
ComputationInfo | info () const |
|
Index | iterations () const |
|
| IterativeSolverBase () |
|
| IterativeSolverBase (const EigenBase< MatrixDerived > &A) |
|
| IterativeSolverBase (IterativeSolverBase &&)=default |
|
Index | maxIterations () const |
|
Preconditioner & | preconditioner () |
|
const Preconditioner & | preconditioner () const |
|
EIGEN_CONSTEXPR Index | rows () const EIGEN_NOEXCEPT |
|
Derived & | setMaxIterations (Index maxIters) |
|
Derived & | setTolerance (const RealScalar &tolerance) |
|
const SolveWithGuess< Derived, Rhs, Guess > | solveWithGuess (const MatrixBase< Rhs > &b, const Guess &x0) const |
|
RealScalar | tolerance () const |
|
| ~IterativeSolverBase () |
|
Derived & | derived () |
|
const Derived & | derived () const |
|
const Solve< Derived, Rhs > | solve (const MatrixBase< Rhs > &b) const |
|
const Solve< Derived, Rhs > | solve (const SparseMatrixBase< Rhs > &b) const |
|
| SparseSolverBase () |
|
| SparseSolverBase (SparseSolverBase &&other) |
|
| ~SparseSolverBase () |
|
template<typename MatrixType_, typename Preconditioner_>
class Eigen::GMRES< MatrixType_, Preconditioner_ >
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.
- Template Parameters
-
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:
GMRES<SparseMatrix<double> >
solver(A);
std::cout <<
"#iterations: " <<
solver.iterations() << std::endl;
std::cout <<
"estimated error: " <<
solver.error() << std::endl;
BiCGSTAB< SparseMatrix< double > > solver
SparseMatrix< double > A(n, n)
Matrix< double, Dynamic, 1 > VectorXd
By default the iterations start with x=0 as an initial guess of the solution. One can control the start using the solveWithGuess() method.
GMRES can also be used in a matrix-free context, see the following example .
- See also
- class SimplicialCholesky, DiagonalPreconditioner, IdentityPreconditioner
Definition at line 271 of file GMRES.h.