template<typename MatrixType_, int UpLo_, typename Ordering_>
class Eigen::SimplicialNonHermitianLLT< MatrixType_, UpLo_, Ordering_ >
A direct sparse LLT Cholesky factorizations, for symmetric non-hermitian matrices.
This class provides a LL^T Cholesky factorizations of sparse matrices that are symmetric but not hermitian. For real matrices, this is equivalent to the regular LLT factorization. For real matrices the pivots must be positive, and info() reports NumericalIssue otherwise. For complex matrices a pivot may have any phase and is given a complex square root; only a zero pivot is reported as NumericalIssue. 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.
- Template Parameters
-
| 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 .
- See also
- class SimplicialNonHermitianLDLT, SimplicialLLT, class AMDOrdering, class NaturalOrdering
|
| RealScalar | absDeterminant () const |
| |
| void | analyzePattern (const MatrixType &a) |
| |
| SimplicialNonHermitianLLT & | compute (const MatrixType &matrix) |
| |
| Scalar | determinant () const |
| |
| void | factorize (const MatrixType &a) |
| |
| RealScalar | logAbsDeterminant () const |
| |
| const MatrixL | matrixL () const |
| |
| const MatrixU | matrixU () const |
| |
| Scalar | signDeterminant () const |
| |
| | SimplicialNonHermitianLLT () |
| |
| | SimplicialNonHermitianLLT (const MatrixType &matrix) |
| |
| ComputationInfo | info () const |
| | Reports whether previous computation was successful.
|
| |
| const PermutationMatrix< Dynamic, Dynamic, StorageIndex > & | permutationP () const |
| |
| const PermutationMatrix< Dynamic, Dynamic, StorageIndex > & | permutationPinv () const |
| |
| SimplicialNonHermitianLLT< MatrixType_, UpLo_, Ordering_ > & | setShift (const DiagonalScalar &offset, const DiagonalScalar &scale=1) |
| |
| | SimplicialCholeskyBase () |
| |
| Solve< SimplicialNonHermitianLLT< MatrixType_, UpLo_, Ordering_ >, Rhs > | solve (const MatrixBase< Rhs > &b) const |
| |
| Solve< SimplicialNonHermitianLLT< MatrixType_, UpLo_, Ordering_ >, Rhs > | solve (const SparseMatrixBase< Rhs > &b) const |
| |
| | SparseSolverBase ()=default |
| |