|
enum | { UpLo = UpLo_
} |
|
typedef MatrixType_ | MatrixType |
|
typedef SimplicialCholeskyBase< SimplicialCholesky > | Base |
|
typedef MatrixType::Scalar | Scalar |
|
typedef MatrixType::RealScalar | RealScalar |
|
typedef MatrixType::StorageIndex | StorageIndex |
|
typedef SparseMatrix< Scalar, ColMajor, StorageIndex > | CholMatrixType |
|
typedef Matrix< Scalar, Dynamic, 1 > | VectorType |
|
typedef internal::traits< SimplicialLDLT< MatrixType, UpLo > > | LDLTTraits |
|
typedef internal::traits< SimplicialLLT< MatrixType, UpLo > > | LLTTraits |
|
enum | |
|
enum | |
|
typedef internal::traits< SimplicialCholesky< MatrixType_, UpLo_, Ordering_ > >::MatrixType | MatrixType |
|
typedef internal::traits< SimplicialCholesky< MatrixType_, UpLo_, Ordering_ > >::OrderingType | OrderingType |
|
typedef MatrixType::Scalar | Scalar |
|
typedef MatrixType::RealScalar | RealScalar |
|
typedef internal::traits< SimplicialCholesky< MatrixType_, UpLo_, Ordering_ > >::DiagonalScalar | DiagonalScalar |
|
typedef MatrixType::StorageIndex | StorageIndex |
|
typedef SparseMatrix< Scalar, ColMajor, StorageIndex > | CholMatrixType |
|
typedef CholMatrixType const * | ConstCholMatrixPtr |
|
typedef Matrix< Scalar, Dynamic, 1 > | VectorType |
|
typedef Matrix< StorageIndex, Dynamic, 1 > | VectorI |
|
|
| SimplicialCholesky () |
|
| SimplicialCholesky (const MatrixType &matrix) |
|
SimplicialCholesky & | setMode (SimplicialCholeskyMode mode) |
|
const VectorType | vectorD () const |
|
const CholMatrixType | rawMatrix () const |
|
SimplicialCholesky & | compute (const MatrixType &matrix) |
|
void | analyzePattern (const MatrixType &a) |
|
void | factorize (const MatrixType &a) |
|
template<typename Rhs , typename Dest > |
void | _solve_impl (const MatrixBase< Rhs > &b, MatrixBase< Dest > &dest) const |
|
template<typename Rhs , typename Dest > |
void | _solve_impl (const SparseMatrixBase< Rhs > &b, SparseMatrixBase< Dest > &dest) const |
|
Scalar | determinant () const |
|
| SimplicialCholeskyBase () |
|
| SimplicialCholeskyBase (const MatrixType &matrix) |
|
| ~SimplicialCholeskyBase () |
|
SimplicialCholesky< MatrixType_, UpLo_, Ordering_ > & | derived () |
|
const SimplicialCholesky< MatrixType_, UpLo_, Ordering_ > & | derived () const |
|
SimplicialCholesky< MatrixType_, UpLo_, Ordering_ > & | derived () |
|
const SimplicialCholesky< MatrixType_, UpLo_, Ordering_ > & | derived () const |
|
Index | cols () const |
|
Index | rows () 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 |
|
SimplicialCholesky< MatrixType_, UpLo_, Ordering_ > & | setShift (const DiagonalScalar &offset, const DiagonalScalar &scale=1) |
|
void | dumpMemory (Stream &s) |
|
void | _solve_impl (const MatrixBase< Rhs > &b, MatrixBase< Dest > &dest) const |
|
void | _solve_impl (const SparseMatrixBase< Rhs > &b, SparseMatrixBase< Dest > &dest) const |
|
| SparseSolverBase () |
|
| SparseSolverBase (SparseSolverBase &&other) |
|
| ~SparseSolverBase () |
|
SimplicialCholesky< MatrixType_, UpLo_, Ordering_ > & | derived () |
|
const SimplicialCholesky< MatrixType_, UpLo_, Ordering_ > & | derived () const |
|
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 |
|
void | _solve_impl (const SparseMatrixBase< Rhs > &b, SparseMatrixBase< Dest > &dest) const |
|
template<typename MatrixType_ , int UpLo_, typename Ordering_ >
template<typename Rhs , typename Dest >
775 "The decomposition is not in a valid state for solving, you must first call either compute() or "
776 "symbolic()/numeric()");
#define eigen_assert(x)
Definition: Macros.h:910
Scalar Scalar int size
Definition: benchVecAdd.cpp:17
Scalar * b
Definition: benchVecAdd.cpp:17
CholMatrixType m_matrix
Definition: SimplicialCholesky.h:240
VectorType m_diag
Definition: SimplicialCholesky.h:241
Index rows() const
Definition: SimplicialCholesky.h:88
bool m_factorizationIsOk
Definition: SimplicialCholesky.h:237
ComputationInfo m_info
Definition: SimplicialCholesky.h:236
PermutationMatrix< Dynamic, Dynamic, StorageIndex > m_Pinv
Definition: SimplicialCholesky.h:245
PermutationMatrix< Dynamic, Dynamic, StorageIndex > m_P
Definition: SimplicialCholesky.h:244
@ Success
Definition: Constants.h:440
References b, eigen_assert, Eigen::SimplicialCholeskyBase< Derived >::m_diag, Eigen::SimplicialCholeskyBase< Derived >::m_factorizationIsOk, Eigen::SimplicialCholeskyBase< Derived >::m_info, Eigen::SimplicialCholesky< MatrixType_, UpLo_, Ordering_ >::m_LDLT, Eigen::SimplicialCholeskyBase< Derived >::m_matrix, Eigen::SimplicialCholeskyBase< Derived >::m_P, Eigen::SimplicialCholeskyBase< Derived >::m_Pinv, Eigen::SimplicialCholeskyBase< SimplicialCholesky< MatrixType_, UpLo_, Ordering_ > >::rows(), size, and Eigen::Success.
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()
753 Base::template analyzePattern<true, false>(
a);
755 Base::template analyzePattern<false, false>(
a);
const Scalar * a
Definition: level2_cplx_impl.h:32
References a, and Eigen::SimplicialCholesky< MatrixType_, UpLo_, Ordering_ >::m_LDLT.
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()
766 Base::template factorize<true, false>(
a);
768 Base::template factorize<false, false>(
a);
References a, and Eigen::SimplicialCholesky< MatrixType_, UpLo_, Ordering_ >::m_LDLT.