Cholesky decomposition

related topics
{math, number, function}
{rate, high, increase}

In linear algebra, the Cholesky decomposition or Cholesky triangle is a decomposition of a symmetric, positive-definite matrix into the product of a lower triangular matrix and its conjugate transpose. It was discovered by André-Louis Cholesky for real matrices and is an example of a square root of a matrix. When it is applicable, the Cholesky decomposition is roughly twice as efficient as the LU decomposition for solving systems of linear equations.[1]

Contents

Statement

Full article ▸

related documents
Integer
Square root
Template (programming)
Kernel (matrix)
Icon (programming language)
Uniform continuity
Extended Euclidean algorithm
Tail recursion
Taylor's theorem
Hausdorff dimension
Cantor's diagonal argument
Equivalence relation
Standard ML
Supremum
Metric space
Dirac delta function
Complete metric space
L'Hôpital's rule
Insertion sort
Vigenère cipher
Set (mathematics)
PL/SQL
Operator
Interpolation
Exponential function
Monoid
Semidirect product
Riemannian manifold
Communication complexity
Abstraction (computer science)