This is an abstract class for a Cholesky decomposition. It provides the solvers, but the actual decompsoition is provided in other classes.
A Cholesky Decomposition is a special decomposition for positive-definite symmetric matrices that is more efficient than other general purposes decomposition. It refactors matrices using one of the two following equations:
L*LT=A
RT*R=A
where L is a lower triangular matrix and R is an upper traingular matrix.
|
|