|
| | MINRES () |
| |
| template<typename MatrixDerived > |
| | MINRES (const EigenBase< MatrixDerived > &A) |
| |
| | ~MINRES () |
| |
| template<typename Rhs , typename Dest > |
| void | _solve_vector_with_guess_impl (const Rhs &b, Dest &x) const |
| |
| template<typename Rhs , typename Dest > |
| void | _solve_impl (const Rhs &b, Dest &x) const |
| |
| | IterativeSolverBase () |
| |
| | IterativeSolverBase (const EigenBase< MatrixDerived > &A) |
| |
| | ~IterativeSolverBase () |
| |
| MINRES< _MatrixType, _UpLo, _Preconditioner > & | analyzePattern (const EigenBase< MatrixDerived > &A) |
| |
| MINRES< _MatrixType, _UpLo, _Preconditioner > & | factorize (const EigenBase< MatrixDerived > &A) |
| |
| MINRES< _MatrixType, _UpLo, _Preconditioner > & | compute (const EigenBase< MatrixDerived > &A) |
| |
| EIGEN_CONSTEXPR Index | rows () const EIGEN_NOEXCEPT |
| |
| EIGEN_CONSTEXPR Index | cols () const EIGEN_NOEXCEPT |
| |
| RealScalar | tolerance () const |
| |
| MINRES< _MatrixType, _UpLo, _Preconditioner > & | setTolerance (const RealScalar &tolerance) |
| |
| Preconditioner & | preconditioner () |
| |
| const Preconditioner & | preconditioner () const |
| |
| Index | maxIterations () const |
| |
| MINRES< _MatrixType, _UpLo, _Preconditioner > & | setMaxIterations (Index maxIters) |
| |
| Index | iterations () const |
| |
| RealScalar | error () const |
| |
| const SolveWithGuess< MINRES< _MatrixType, _UpLo, _Preconditioner >, Rhs, Guess > | solveWithGuess (const MatrixBase< Rhs > &b, const Guess &x0) const |
| |
| ComputationInfo | info () const |
| |
| void | _solve_with_guess_impl (const Rhs &b, SparseMatrixBase< DestDerived > &aDest) const |
| |
| internal::enable_if< Rhs::ColsAtCompileTime!=1 &&DestDerived::ColsAtCompileTime!=1 >::type | _solve_with_guess_impl (const Rhs &b, MatrixBase< DestDerived > &aDest) const |
| |
| internal::enable_if< Rhs::ColsAtCompileTime==1||DestDerived::ColsAtCompileTime==1 >::type | _solve_with_guess_impl (const Rhs &b, MatrixBase< DestDerived > &dest) const |
| |
| void | _solve_impl (const Rhs &b, Dest &x) const |
| |
| MINRES< _MatrixType, _UpLo, _Preconditioner > & | derived () |
| |
| const MINRES< _MatrixType, _UpLo, _Preconditioner > & | derived () const |
| |
| | SparseSolverBase () |
| |
| | ~SparseSolverBase () |
| |
| Derived & | derived () |
| |
| const Derived & | derived () const |
| |
| template<typename Rhs > |
| const Solve< Derived, Rhs > | solve (const MatrixBase< Rhs > &b) const |
| |
| template<typename Rhs > |
| const Solve< Derived, Rhs > | solve (const SparseMatrixBase< Rhs > &b) const |
| |
| template<typename Rhs , typename Dest > |
| void | _solve_impl (const SparseMatrixBase< Rhs > &b, SparseMatrixBase< Dest > &dest) const |
| |
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:
std::cout <<
"#iterations: " << mr.
iterations() << std::endl;
std::cout <<
"estimated error: " << mr.
error() << std::endl;
int n
Definition BiCGSTAB_simple.cpp:1
Scalar * b
Definition benchVecAdd.cpp:17
Matrix< SCALARA, Dynamic, Dynamic, opt_A > A
Definition bench_gemm.cpp:48
RealScalar error() const
Definition IterativeSolverBase.h:305
Derived & compute(const EigenBase< MatrixDerived > &A)
Definition IterativeSolverBase.h:238
Index iterations() const
Definition IterativeSolverBase.h:296
A minimal residual solver for sparse symmetric problems.
Definition MINRES.h:196
The matrix class, also used for vectors and row-vectors.
Definition Matrix.h:180
A versatible sparse matrix representation.
Definition SparseMatrix.h:98
const Solve< Derived, Rhs > solve(const MatrixBase< Rhs > &b) const
Definition SparseSolverBase.h:88
set noclip points set clip one set noclip two set bar set border lt lw set xdata set ydata set zdata set x2data set y2data set boxwidth set dummy x
Definition gnuplot_common_settings.hh:12
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