Cholesky decomposition is a hermitian positive-definite matrix factorization technique.

For a given hermitian positive-definite matrix A, there exists a decomposition of the form:

  • A = the input matrix of dimension n x n.
  • L = lower triangular matrix

Cholesky-decomp is ~2x faster than LU-decomp for solving linear systems, when applicable.