public class CholeskyDecomposition extends Object
For a symmetric, positive definite matrix A, the Cholesky decomposition is an lower triangular matrix L so that A = L*L'.
If the matrix is not symmetric or positive definite, the constructor returns a partial decomposition and sets an internal flag that may be queried by the isSPD() method.
Constructor and Description |
---|
CholeskyDecomposition(double[][] Arg)
Cholesky algorithm for symmetric and positive definite matrix.
|
Modifier and Type | Method and Description |
---|---|
double[][] |
getL()
Return triangular factor.
|
boolean |
isSPD()
Is the matrix symmetric and positive definite?
|
double[][] |
solve(double[][] B)
Solve A*X = B
|
public CholeskyDecomposition(double[][] Arg)
Arg
- Square, symmetric matrix.public boolean isSPD()
public double[][] getL()
public double[][] solve(double[][] B)
B
- A Matrix with as many rows as A and any number of columns.IllegalArgumentException
- Matrix row dimensions must agree.RuntimeException
- Matrix is not symmetric positive definite.Jas4pp 1.5 © Java Analysis Studio for Particle Physics