Eigen  3.2.7
 All Classes Namespaces Functions Variables Typedefs Enumerations Enumerator Friends Groups Pages
List of all members | Public Member Functions
SimplicialCholesky< _MatrixType, _UpLo, _Ordering > Class Template Reference
SparseCholesky module

Detailed Description

template<typename _MatrixType, int _UpLo = Lower, typename _Ordering = AMDOrdering<typename _MatrixType::Index>>
class Eigen::SimplicialCholesky< _MatrixType, _UpLo, _Ordering >

Deprecated:
use SimplicialLDLT or class SimplicialLLT
See Also
class SimplicialLDLT, class SimplicialLLT
+ Inheritance diagram for SimplicialCholesky< _MatrixType, _UpLo, _Ordering >:

Public Member Functions

void analyzePattern (const MatrixType &a)
 
SimplicialCholesky & compute (const MatrixType &matrix)
 
void factorize (const MatrixType &a)
 
ComputationInfo info () const
 Reports whether previous computation was successful. More...
 
const PermutationMatrix
< Dynamic, Dynamic, Index > & 		permutationP () const
 
const PermutationMatrix
< Dynamic, Dynamic, Index > & 		permutationPinv () const
 
SimplicialCholesky
< _MatrixType, _UpLo,
_Ordering > & 		setShift (const RealScalar &offset, const RealScalar &scale=1)
 
const internal::solve_retval
< SimplicialCholeskyBase, Rhs > 		solve (const MatrixBase< Rhs > &b) const
 
const
internal::sparse_solve_retval
< SimplicialCholeskyBase, Rhs > 		solve (const SparseMatrixBase< Rhs > &b) const
 

Member Function Documentation

void analyzePattern ( const MatrixType &  a)
inline

Performs a symbolic decomposition on the sparcity of matrix.

This function is particularly useful when solving for several problems having the same structure.

See Also
factorize()
SimplicialCholesky& compute ( const MatrixType &  matrix)
inline

Computes the sparse Cholesky decomposition of matrix

void factorize ( const MatrixType &  a)
inline

Performs a numeric decomposition of matrix

The given matrix must has the same sparcity than the matrix on which the symbolic decomposition has been performed.

See Also
analyzePattern()
ComputationInfo info ( ) const
inlineinherited

Reports whether previous computation was successful.

Returns
Success if computation was succesful, NumericalIssue if the matrix.appears to be negative.
const PermutationMatrix<Dynamic,Dynamic,Index>& permutationP ( ) const
inlineinherited
Returns
the permutation P
See Also
permutationPinv()
const PermutationMatrix<Dynamic,Dynamic,Index>& permutationPinv ( ) const
inlineinherited
Returns
the inverse P^-1 of the permutation P
See Also
permutationP()
SimplicialCholesky< _MatrixType, _UpLo, _Ordering > & setShift ( const RealScalar &  offset,
const RealScalar &  scale = 1 
)
inlineinherited

Sets the shift parameters that will be used to adjust the diagonal coefficients during the numerical factorization.

During the numerical factorization, the diagonal coefficients are transformed by the following linear model:
d_ii = offset + scale * d_ii

The default is the identity transformation with offset=0, and scale=1.

Returns
a reference to *this.
const internal::solve_retval<SimplicialCholeskyBase, Rhs> solve ( const MatrixBase< Rhs > &  b) const
inlineinherited
Returns
the solution x of $ A x = b $ using the current decomposition of A.
See Also
compute()
const internal::sparse_solve_retval<SimplicialCholeskyBase, Rhs> solve ( const SparseMatrixBase< Rhs > &  b) const
inlineinherited
Returns
the solution x of $ A x = b $ using the current decomposition of A.
See Also
compute()
The documentation for this class was generated from the following file: