LDLT.h file
Robust LDLT Cholesky factorization for dense matrices.
This header provides the LDLT solver class for dense matrices, implementing Cholesky decomposition with pivoting for numerical stability.
Algorithm
The solver computes the following quantity.
where is a permutation matrix, is unit lower triangular, and is diagonal. Pivoting improves numerical stability.
Applicability
- Symmetric indefinite dense matrices
- When numerical stability is critical
- Small to medium-sized systems
- Systems requiring robust factorization
Usage Example
Problem problem(u, v); problem = Integral(Grad(u), Grad(v)) - Integral(f, v); Solver::LDLT solver(problem); solver.solve();
Namespaces
- namespace Rodin
- The Rodin library for finite element methods and shape optimization.
- namespace Rodin::FormLanguage
- Typed expressions for constructing variational forms.
- namespace Rodin::Solver
- Solution of linear and nonlinear discrete systems.
Classes
-
template<class LinearSystem>struct Rodin::FormLanguage::Traits<Solver::LDLT<LinearSystem>>
- Form-language traits for LDLT solvers.
-
template<class Scalar>class Rodin::Solver::LDLT<Math::LinearSystem<Math::Matrix<Scalar>, Math::Vector<Scalar>>>
- Robust LDLT Cholesky factorization with pivoting for dense matrices.