In linear algebra, the Cholesky decomposition, or Cholesky factorization, decomposes a Hermitian positive-definite matrix into the product of a lower triangular matrix and its own conjugate transpose, which is useful for efficient numerical solutions such as Monte Carlo simulations. It was discovered by Andre-Louis Cholesky for real matrices and published only after his death, in 1924, and where it applies it is roughly twice as efficient as the LU decomposition for solving systems of linear equations.
Facts
Origin Yeardiscovered by Andre-Louis Cholesky, posthumously published in 1924 Connections
Attributed To
Source Cholesky Decomposition (Wikipedia)
In Branch
Source Cholesky Decomposition (Wikipedia)
Is Kind Of Object
Sources
1. Cholesky Decomposition (Wikipedia)
Lead section
In linear algebra, the Cholesky decomposition or Cholesky factorization (pronounced shə-LES-kee) is a decomposition of a Hermitian, positive-definite matrix into the product of a lower triangular matrix and its conjugate transpose, which is useful for efficient numerical solutions, e.g., Monte Carlo simulations.
- In Branch: Linear Algebra, Lead sentence
Attributed To: André-Louis Cholesky, Lead sentence, attribution
discovered by André-Louis Cholesky for real matrices
View the SourceWikidata: Cholesky Decomposition
Wikidata Q515375, class allow-list match (w-wdresolver-0926)View the Source Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.