template<typename MatrixType_, int UpLo_, typename Ordering_>
class Eigen::SimplicialCholesky< MatrixType_, UpLo_, Ordering_ >
- Deprecated:
- use SimplicialLDLT or class SimplicialLLT
- See also
- class SimplicialLDLT, class SimplicialLLT
|
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, StorageIndex > & | permutationP () const |
|
const PermutationMatrix< Dynamic, Dynamic, StorageIndex > & | permutationPinv () const |
|
SimplicialCholesky< MatrixType_, UpLo_, Ordering_ > & | setShift (const RealScalar &offset, const RealScalar &scale=1) |
|
| SimplicialCholeskyBase () |
|
const Solve< SimplicialCholesky< MatrixType_, UpLo_, Ordering_ >, Rhs > | solve (const MatrixBase< Rhs > &b) const |
|
const Solve< SimplicialCholesky< MatrixType_, UpLo_, Ordering_ >, Rhs > | solve (const SparseMatrixBase< Rhs > &b) const |
|
| SparseSolverBase () |
|
|
void | compute (const MatrixType &matrix) |
|
◆ analyzePattern()
template<typename MatrixType_ , int UpLo_, typename Ordering_ >
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()
◆ compute()
template<typename MatrixType_ , int UpLo_, typename Ordering_ >
Computes the sparse Cholesky decomposition of matrix
◆ factorize()
template<typename MatrixType_ , int UpLo_, typename Ordering_ >
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()
The documentation for this class was generated from the following file: