compbio
|
A conjugate gradient solver for sparse (or dense) least-square problems. More...
#include <LeastSquareConjugateGradient.h>
Public Types | |
typedef _MatrixType | MatrixType |
typedef MatrixType::Scalar | Scalar |
typedef MatrixType::RealScalar | RealScalar |
typedef _Preconditioner | Preconditioner |
![]() | |
enum | |
typedef internal::traits< LeastSquaresConjugateGradient< _MatrixType, _Preconditioner > >::MatrixType | MatrixType |
typedef internal::traits< LeastSquaresConjugateGradient< _MatrixType, _Preconditioner > >::Preconditioner | Preconditioner |
typedef MatrixType::Scalar | Scalar |
typedef MatrixType::StorageIndex | StorageIndex |
typedef MatrixType::RealScalar | RealScalar |
Public Member Functions | |
LeastSquaresConjugateGradient () | |
Default constructor. More... | |
template<typename MatrixDerived > | |
LeastSquaresConjugateGradient (const EigenBase< MatrixDerived > &A) | |
Initialize the solver with matrix A for further Ax=b solving. 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 MatrixBase< Rhs > &b, Dest &x) const |
![]() | |
IterativeSolverBase () | |
Default constructor. More... | |
IterativeSolverBase (const EigenBase< MatrixDerived > &A) | |
Initialize the solver with matrix A for further Ax=b solving. More... | |
LeastSquaresConjugateGradient< _MatrixType, _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... | |
LeastSquaresConjugateGradient< _MatrixType, _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... | |
LeastSquaresConjugateGradient< _MatrixType, _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 |
LeastSquaresConjugateGradient< _MatrixType, _Preconditioner > & | setTolerance (const RealScalar &tolerance) |
Sets the tolerance threshold used by the stopping criteria. More... | |
Preconditioner & | preconditioner () |
const Preconditioner & | preconditioner () const |
Index | maxIterations () const |
LeastSquaresConjugateGradient< _MatrixType, _Preconditioner > & | setMaxIterations (Index maxIters) |
Sets the max number of iterations. More... | |
Index | iterations () const |
RealScalar | error () const |
const SolveWithGuess< LeastSquaresConjugateGradient< _MatrixType, _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. | |
LeastSquaresConjugateGradient< _MatrixType, _Preconditioner > & | derived () |
const LeastSquaresConjugateGradient< _MatrixType, _Preconditioner > & | derived () const |
const Solve< LeastSquaresConjugateGradient< _MatrixType, _Preconditioner >, Rhs > | solve (const MatrixBase< Rhs > &b) const |
const Solve< LeastSquaresConjugateGradient< _MatrixType, _Preconditioner >, Rhs > | solve (const SparseMatrixBase< Rhs > &b) const |
void | _solve_impl (const SparseMatrixBase< Rhs > &b, SparseMatrixBase< Dest > &dest) const |
Additional Inherited Members | |
![]() | |
typedef SparseSolverBase< LeastSquaresConjugateGradient< _MatrixType, _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 conjugate gradient solver for sparse (or dense) least-square problems.
This class allows to solve for A x = b linear problems using an iterative conjugate gradient algorithm. The matrix A can be non symmetric and rectangular, but the matrix A' A should be positive-definite to guaranty stability. Otherwise, the SparseLU or SparseQR classes might be preferable. The matrix A and the vectors x and b can be either dense or sparse.
_MatrixType | the type of the matrix A, can be a dense or a sparse matrix. |
_Preconditioner | the type of the preconditioner. Default is LeastSquareDiagonalPreconditioner |
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.
|
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().