CholeskyDecomposition<T>
Models & Types · AiDotNet.DecompositionMethods.MatrixDecomposition
Implements the Cholesky decomposition for symmetric positive definite matrices.
Inheritance: MatrixDecompositionBase<T> → CholeskyDecomposition<T>
For Beginners
Cholesky decomposition is like taking the square root of a matrix. Just as 25 = 5 × 5, this method breaks down special matrices into L × L^T, where L is a simpler triangular matrix. This makes complex calculations much faster and more accurate.
How It Works
The Cholesky decomposition breaks down a symmetric positive definite matrix into the product of a lower triangular matrix and its transpose (A = L * L^T). This is useful for solving linear systems and matrix inversion more efficiently.
Real-world applications:
- Solving systems of linear equations in scientific computing
- Covariance matrix decomposition in statistics and machine learning
- Efficient simulation of correlated random variables
Constructors
| Constructor | Summary |
|---|---|
CholeskyDecomposition(Matrix<T> matrix, CholeskyAlgorithmType algorithm) |
Initializes a new instance of the Cholesky decomposition for the specified matrix. |
Properties
| Property | Summary |
|---|---|
Matrix<T> L { get; set; } |
Gets the lower triangular matrix L from the decomposition A = L * L^T. |
Methods
| Method | Summary |
|---|---|
Vector<T> Solve(Vector<T> b) |
Solves the linear system Ax = b using the Cholesky decomposition. |