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
§ analyzePattern()
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()
§ compute()
Computes the sparse Cholesky decomposition of matrix
§ factorize()
void factorize |
( |
const MatrixType & |
a | ) |
|
|
inline |
§ info()
Reports whether previous computation was successful.
- Returns
Success
if computation was succesful, NumericalIssue
if the matrix.appears to be negative.
§ permutationP()
§ permutationPinv()
§ setShift()
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
.
§ solve() [1/2]
- Returns
- the solution x of
using the current decomposition of A.
- See also
- compute()
§ solve() [2/2]
- Returns
- the solution x of
using the current decomposition of A.
- See also
- compute()
The documentation for this class was generated from the following file: