A minimal residual solver for sparse symmetric problems. More...

#include <MINRES.h>

Inheritance diagram for Eigen::MINRES< MatrixType_, UpLo_, Preconditioner_ >:

Public Types
enum	{ UpLo = UpLo_ }

typedef MatrixType_	MatrixType

typedef MatrixType::Scalar	Scalar

typedef MatrixType::RealScalar	RealScalar

typedef Preconditioner_	Preconditioner

Public Types inherited from Eigen::IterativeSolverBase< MINRES< MatrixType_, UpLo_, 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 ()

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

Public Member Functions inherited from Eigen::IterativeSolverBase< MINRES< MatrixType_, UpLo_, Preconditioner_ > >
	IterativeSolverBase ()

	IterativeSolverBase (const EigenBase< MatrixDerived > &A)

	IterativeSolverBase (IterativeSolverBase &&)=default

	~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

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_impl (const Rhs &b, Dest &x) const

MINRES< MatrixType_, UpLo_, Preconditioner_ > &	derived ()

const MINRES< MatrixType_, UpLo_, Preconditioner_ > &	derived () const

Public Member Functions inherited from Eigen::SparseSolverBase< Derived >
	SparseSolverBase ()

	SparseSolverBase (SparseSolverBase &&other)

	~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

Private Types
typedef IterativeSolverBase< MINRES >	Base

Private Member Functions
const ActualMatrixType &	matrix () const

Private Attributes
RealScalar	m_error

ComputationInfo	m_info

bool	m_isInitialized

Index	m_iterations

Additional Inherited Members
Protected Types inherited from Eigen::IterativeSolverBase< MINRES< MatrixType_, UpLo_, Preconditioner_ > >
typedef SparseSolverBase< MINRES< MatrixType_, UpLo_, Preconditioner_ > >	Base

typedef internal::generic_matrix_wrapper< MatrixType >	MatrixWrapper

typedef MatrixWrapper::ActualMatrixType	ActualMatrixType

Protected Member Functions inherited from Eigen::IterativeSolverBase< MINRES< MatrixType_, UpLo_, Preconditioner_ > >
void	init ()

const ActualMatrixType &	matrix () const

void	grab (const InputType &A)

Protected Attributes inherited from Eigen::IterativeSolverBase< MINRES< MatrixType_, UpLo_, Preconditioner_ > >
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

Protected Attributes inherited from Eigen::SparseSolverBase< Derived >
bool	m_isInitialized

Detailed Description

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:

int n = 10000;
VectorXd x(n), b(n);
SparseMatrix<double> A(n,n);
// fill A and b
MINRES<SparseMatrix<double> > mr;
mr.compute(A);
x = mr.solve(b);
std::cout << "#iterations:     " << mr.iterations() << std::endl;
std::cout << "estimated error: " << mr.error()      << std::endl;
// update b, and solve again
x = mr.solve(b);

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

Member Typedef Documentation

◆ Base

template<typename MatrixType_ , int UpLo_, typename Preconditioner_ >

typedef IterativeSolverBase<MINRES> Eigen::MINRES< MatrixType_, UpLo_, Preconditioner_ >::Base

private

◆ MatrixType

template<typename MatrixType_ , int UpLo_, typename Preconditioner_ >

typedef MatrixType_ Eigen::MINRES< MatrixType_, UpLo_, Preconditioner_ >::MatrixType

◆ Preconditioner

template<typename MatrixType_ , int UpLo_, typename Preconditioner_ >

typedef Preconditioner_ Eigen::MINRES< MatrixType_, UpLo_, Preconditioner_ >::Preconditioner

◆ RealScalar

template<typename MatrixType_ , int UpLo_, typename Preconditioner_ >

typedef MatrixType::RealScalar Eigen::MINRES< MatrixType_, UpLo_, Preconditioner_ >::RealScalar

◆ Scalar

template<typename MatrixType_ , int UpLo_, typename Preconditioner_ >

typedef MatrixType::Scalar Eigen::MINRES< MatrixType_, UpLo_, Preconditioner_ >::Scalar

Member Enumeration Documentation

◆ anonymous enum

template<typename MatrixType_ , int UpLo_, typename Preconditioner_ >

anonymous enum

Enumerator
UpLo

203 { UpLo = UpLo_ };

Eigen::MINRES::UpLo

@ UpLo

Definition: MINRES.h:203

Constructor & Destructor Documentation

◆ MINRES() [1/2]

template<typename MatrixType_ , int UpLo_, typename Preconditioner_ >

Eigen::MINRES< MatrixType_, UpLo_, Preconditioner_ >::MINRES ( )

inline

Default constructor.

207 : Base() {}

Eigen::MINRES::Base

IterativeSolverBase< MINRES > Base

Definition: MINRES.h:189

◆ MINRES() [2/2]

template<typename MatrixType_ , int UpLo_, typename Preconditioner_ >

template<typename MatrixDerived >

Eigen::MINRES< MatrixType_, UpLo_, Preconditioner_ >::MINRES ( const EigenBase< MatrixDerived > & A )

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().

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.

220 : Base(A.derived()) {}

◆ ~MINRES()

template<typename MatrixType_ , int UpLo_, typename Preconditioner_ >

Eigen::MINRES< MatrixType_, UpLo_, Preconditioner_ >::~MINRES ( )

inline

Destructor.

223 {}

Member Function Documentation

◆ _solve_impl()

template<typename MatrixType_ , int UpLo_, typename Preconditioner_ >

template<typename Rhs , typename Dest >

void Eigen::IterativeSolverBase< Derived >::_solve_impl	(	typename Rhs	,
		typename Dest
	)

inline

default initial guess = 0

                                                 {
     x.setZero();
     derived()._solve_with_guess_impl(b, x);
   }

◆ _solve_vector_with_guess_impl()

template<typename MatrixType_ , int UpLo_, typename Preconditioner_ >

template<typename Rhs , typename Dest >

void Eigen::MINRES< MatrixType_, UpLo_, Preconditioner_ >::_solve_vector_with_guess_impl	(	const Rhs &	b,
		Dest &	x
	)		const

inline

                                                                   {
     typedef typename Base::MatrixWrapper MatrixWrapper;
     typedef typename Base::ActualMatrixType ActualMatrixType;
     enum {
       TransposeInput = (!MatrixWrapper::MatrixFree) && (UpLo == (Lower | Upper)) && (!MatrixType::IsRowMajor) &&
                        (!NumTraits<Scalar>::IsComplex)
     };
     typedef std::conditional_t<TransposeInput, Transpose<const ActualMatrixType>, ActualMatrixType const&>
         RowMajorWrapper;
     EIGEN_STATIC_ASSERT(internal::check_implication(MatrixWrapper::MatrixFree, UpLo == (Lower | Upper)),
                         MATRIX_FREE_CONJUGATE_GRADIENT_IS_COMPATIBLE_WITH_UPPER_UNION_LOWER_MODE_ONLY);
     typedef std::conditional_t<UpLo == (Lower | Upper), RowMajorWrapper,
                                typename MatrixWrapper::template ConstSelfAdjointViewReturnType<UpLo>::Type>
         SelfAdjointWrapper;
  
     m_iterations = Base::maxIterations();
     m_error = Base::m_tolerance;
     RowMajorWrapper row_mat(matrix());
     internal::minres(SelfAdjointWrapper(row_mat), b, x, Base::m_preconditioner, m_iterations, m_error);
     m_info = m_error <= Base::m_tolerance ? Success : NoConvergence;
   }