A direct sparse LLT Cholesky factorizations. More...
Public Member Functions | |
void | analyzePattern (const MatrixType &a) |
SimplicialLLT & | compute (const MatrixType &matrix) |
Scalar | determinant () const |
void | factorize (const MatrixType &a) |
const MatrixL | matrixL () const |
const MatrixU | matrixU () const |
SimplicialLLT () | |
SimplicialLLT (const MatrixType &matrix) | |
Public Member Functions inherited from Eigen::SimplicialCholeskyBase< SimplicialLLT< MatrixType_, UpLo_, Ordering_ > > | |
Index | cols () const |
SimplicialLLT< MatrixType_, UpLo_, Ordering_ > & | derived () |
SimplicialLLT< MatrixType_, UpLo_, Ordering_ > & | derived () |
const SimplicialLLT< MatrixType_, UpLo_, Ordering_ > & | derived () const |
const SimplicialLLT< MatrixType_, UpLo_, Ordering_ > & | derived () const |
ComputationInfo | info () const |
Reports whether previous computation was successful. More... | |
const PermutationMatrix< Dynamic, Dynamic, StorageIndex > & | permutationP () const |
const PermutationMatrix< Dynamic, Dynamic, StorageIndex > & | permutationPinv () const |
Index | rows () const |
SimplicialLLT< MatrixType_, UpLo_, Ordering_ > & | setShift (const RealScalar &offset, const RealScalar &scale=1) |
SimplicialCholeskyBase () | |
SimplicialCholeskyBase (const MatrixType &matrix) | |
~SimplicialCholeskyBase () | |
Public Member Functions inherited from Eigen::SparseSolverBase< SimplicialLLT< MatrixType_, UpLo_, Ordering_ > > | |
SimplicialLLT< MatrixType_, UpLo_, Ordering_ > & | derived () |
const SimplicialLLT< MatrixType_, UpLo_, Ordering_ > & | derived () const |
const Solve< SimplicialLLT< MatrixType_, UpLo_, Ordering_ >, Rhs > | solve (const MatrixBase< Rhs > &b) const |
const Solve< SimplicialLLT< MatrixType_, UpLo_, Ordering_ >, Rhs > | solve (const SparseMatrixBase< Rhs > &b) const |
SparseSolverBase () | |
SparseSolverBase (SparseSolverBase &&other) | |
~SparseSolverBase () | |
A direct sparse LLT Cholesky factorizations.
This class provides a LL^T Cholesky factorizations of sparse matrices that are selfadjoint and positive definite. The factorization allows for solving A.X = B where X and B can be either dense or sparse.
In order to reduce the fill-in, a symmetric permutation P is applied prior to the factorization such that the factorized matrix is P A P^-1.
MatrixType_ | the type of the sparse matrix A, it must be a SparseMatrix<> |
UpLo_ | the triangular part that will be used for the computations. It can be Lower or Upper. Default is Lower. |
Ordering_ | The ordering method to use, either AMDOrdering<> or NaturalOrdering<>. Default is AMDOrdering<> |
This class follows the sparse solver concept .
Definition at line 340 of file SimplicialCholesky.h.
typedef SimplicialCholeskyBase<SimplicialLLT> Eigen::SimplicialLLT< MatrixType_, UpLo_, Ordering_ >::Base |
Definition at line 345 of file SimplicialCholesky.h.
typedef SparseMatrix<Scalar,ColMajor,Index> Eigen::SimplicialLLT< MatrixType_, UpLo_, Ordering_ >::CholMatrixType |
Definition at line 349 of file SimplicialCholesky.h.
typedef Traits::MatrixL Eigen::SimplicialLLT< MatrixType_, UpLo_, Ordering_ >::MatrixL |
Definition at line 352 of file SimplicialCholesky.h.
typedef MatrixType_ Eigen::SimplicialLLT< MatrixType_, UpLo_, Ordering_ >::MatrixType |
Definition at line 343 of file SimplicialCholesky.h.
typedef Traits::MatrixU Eigen::SimplicialLLT< MatrixType_, UpLo_, Ordering_ >::MatrixU |
Definition at line 353 of file SimplicialCholesky.h.
typedef MatrixType::RealScalar Eigen::SimplicialLLT< MatrixType_, UpLo_, Ordering_ >::RealScalar |
Definition at line 347 of file SimplicialCholesky.h.
typedef MatrixType::Scalar Eigen::SimplicialLLT< MatrixType_, UpLo_, Ordering_ >::Scalar |
Definition at line 346 of file SimplicialCholesky.h.
typedef MatrixType::StorageIndex Eigen::SimplicialLLT< MatrixType_, UpLo_, Ordering_ >::StorageIndex |
Definition at line 348 of file SimplicialCholesky.h.
typedef internal::traits<SimplicialLLT> Eigen::SimplicialLLT< MatrixType_, UpLo_, Ordering_ >::Traits |
Definition at line 351 of file SimplicialCholesky.h.
typedef Matrix<Scalar,Dynamic,1> Eigen::SimplicialLLT< MatrixType_, UpLo_, Ordering_ >::VectorType |
Definition at line 350 of file SimplicialCholesky.h.
anonymous enum |
|
inline |
Default constructor
Definition at line 356 of file SimplicialCholesky.h.
|
inlineexplicit |
Constructs and performs the LLT factorization of matrix
Definition at line 358 of file SimplicialCholesky.h.
|
inline |
Performs a symbolic decomposition on the sparcity of matrix.
This function is particularly useful when solving for several problems having the same structure.
Definition at line 386 of file SimplicialCholesky.h.
|
inline |
Computes the sparse Cholesky decomposition of matrix
Definition at line 374 of file SimplicialCholesky.h.
|
inline |
Definition at line 403 of file SimplicialCholesky.h.
|
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.
Definition at line 397 of file SimplicialCholesky.h.
|
inline |
Definition at line 362 of file SimplicialCholesky.h.
|
inline |