|
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 |
|
| MINRES () |
|
template<typename MatrixDerived > |
| MINRES (const EigenBase< MatrixDerived > &A) |
|
| ~MINRES () |
|
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_, int UpLo_, typename Preconditioner_>
class Eigen::MINRES< MatrixType_, UpLo_, Preconditioner_ >
A minimal residual solver for sparse symmetric problems.
This class allows to solve for A.x = b sparse linear problems using the MINRES algorithm of Paige and Saunders (1975). The sparse matrix A must be symmetric (possibly indefinite). 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. |
UpLo_ | the triangular part that will be used for the computations. It can be Lower, Upper, or Lower|Upper in which the full matrix entries will be considered. Default is Lower. |
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:
MINRES<SparseMatrix<double> > mr;
mr.compute(A);
std::cout << "#iterations: " << mr.iterations() << std::endl;
std::cout << "estimated error: " << mr.error() << std::endl;
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.
MINRES can also be used in a matrix-free context, see the following example .
- See also
- class ConjugateGradient, BiCGSTAB, SimplicialCholesky, DiagonalPreconditioner, IdentityPreconditioner
Definition at line 197 of file MINRES.h.
template<typename MatrixType_ , int UpLo_, typename Preconditioner_ >
template<typename MatrixDerived >
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().
- Warning
- this class stores a reference to the matrix A as well as some precomputed values that depend on it. Therefore, if A is changed this class becomes invalid. Call compute() to update it with the new matrix A, or modify a copy of A.
Definition at line 231 of file MINRES.h.
SparseMatrix< double, Options_, StorageIndex_ > & derived()