compbio
|
A minimal residual solver for sparse symmetric problems. More...
#include <MINRES.h>
Public Types | |
enum | { UpLo = _UpLo } |
typedef _MatrixType | MatrixType |
typedef MatrixType::Scalar | Scalar |
typedef MatrixType::RealScalar | RealScalar |
typedef _Preconditioner | Preconditioner |
![]() | |
enum | |
typedef internal::traits< MINRES< _MatrixType, _UpLo, _Preconditioner > >::MatrixType | MatrixType |
typedef internal::traits< MINRES< _MatrixType, _UpLo, _Preconditioner > >::Preconditioner | Preconditioner |
typedef MatrixType::Scalar | Scalar |
typedef MatrixType::StorageIndex | StorageIndex |
typedef MatrixType::RealScalar | RealScalar |
Public Member Functions | |
MINRES () | |
Default constructor. More... | |
template<typename MatrixDerived > | |
MINRES (const EigenBase< MatrixDerived > &A) | |
Initialize the solver with matrix A for further Ax=b solving. More... | |
~MINRES () | |
Destructor. More... | |
template<typename Rhs , typename Dest > | |
void | _solve_with_guess_impl (const Rhs &b, Dest &x) const |
template<typename Rhs , typename Dest > | |
void | _solve_impl (const Rhs &b, MatrixBase< Dest > &x) const |
![]() | |
IterativeSolverBase () | |
Default constructor. More... | |
IterativeSolverBase (const EigenBase< MatrixDerived > &A) | |
Initialize the solver with matrix A for further Ax=b solving. More... | |
MINRES< _MatrixType, _UpLo, _Preconditioner > & | analyzePattern (const EigenBase< MatrixDerived > &A) |
Initializes the iterative solver for the sparsity pattern of the matrix A for further solving Ax=b problems. More... | |
MINRES< _MatrixType, _UpLo, _Preconditioner > & | factorize (const EigenBase< MatrixDerived > &A) |
Initializes the iterative solver with the numerical values of the matrix A for further solving Ax=b problems. More... | |
MINRES< _MatrixType, _UpLo, _Preconditioner > & | compute (const EigenBase< MatrixDerived > &A) |
Initializes the iterative solver with the matrix A for further solving Ax=b problems. More... | |
Index | rows () const |
Index | cols () const |
RealScalar | tolerance () const |
MINRES< _MatrixType, _UpLo, _Preconditioner > & | setTolerance (const RealScalar &tolerance) |
Sets the tolerance threshold used by the stopping criteria. More... | |
Preconditioner & | preconditioner () |
const Preconditioner & | preconditioner () const |
Index | maxIterations () const |
MINRES< _MatrixType, _UpLo, _Preconditioner > & | setMaxIterations (Index maxIters) |
Sets the max number of iterations. More... | |
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_impl (const Rhs &b, SparseMatrixBase< DestDerived > &aDest) const |
![]() | |
SparseSolverBase () | |
Default constructor. | |
MINRES< _MatrixType, _UpLo, _Preconditioner > & | derived () |
const MINRES< _MatrixType, _UpLo, _Preconditioner > & | derived () const |
const Solve< MINRES< _MatrixType, _UpLo, _Preconditioner >, Rhs > | solve (const MatrixBase< Rhs > &b) const |
const Solve< MINRES< _MatrixType, _UpLo, _Preconditioner >, Rhs > | solve (const SparseMatrixBase< Rhs > &b) const |
void | _solve_impl (const SparseMatrixBase< Rhs > &b, SparseMatrixBase< Dest > &dest) const |
Additional Inherited Members | |
![]() | |
typedef SparseSolverBase< MINRES< _MatrixType, _UpLo, _Preconditioner > > | Base |
typedef internal::generic_matrix_wrapper< MatrixType > | MatrixWrapper |
typedef MatrixWrapper::ActualMatrixType | ActualMatrixType |
![]() | |
void | init () |
const ActualMatrixType & | matrix () const |
void | grab (const InputType &A) |
![]() | |
MatrixWrapper | m_matrixWrapper |
Preconditioner | m_preconditioner |
Index | m_maxIterations |
RealScalar | m_tolerance |
RealScalar | m_error |
Index | m_iterations |
ComputationInfo | m_info |
bool | m_analysisIsOk |
bool | m_factorizationIsOk |
![]() | |
bool | m_isInitialized |
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.
_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:
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 .
|
inline |
Default constructor.
|
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 |
Destructor.