What are the applications of Cholesky decomposition?

Cholesky decomposition is used in solving systems of linear equations, Monte Carlo simulations for generating correlated random variables, Kalman filters in signal processing, least-squares fitting, and optimization algorithms that involve positive-definite Hessian matrices.

How is Cholesky decomposition different from LU decomposition?

LU decomposition works on any invertible matrix and factors it as A = LU (or PA = LU with pivoting). Cholesky decomposition is specialized for symmetric positive-definite matrices and factors as A = L times L-transpose. Cholesky is about twice as fast as LU because it exploits symmetry, and it does not require pivoting.

コレスキー分解電卓

対称正定値行列を A = LLᵀ に分解し、ステップバイステップの計算をアニメーションで表示します。下三角行列 L の各要素が完全な公式で導出される様子を確認し、結果を検証し、分解を視覚的に探索できます。

コレスキー分解電卓

Embed コレスキー分解電卓 Widget

コレスキー分解電卓

The Cholesky Decomposition Calculator factors a symmetric positive-definite matrix A into the product of a lower-triangular matrix L and its transpose Lᵀ, so that A = LLᵀ. This factorization is fundamental in numerical linear algebra, offering roughly twice the efficiency of general LU decomposition by exploiting the symmetry and positive-definiteness of the input matrix. The calculator provides animated step-by-step derivations, interactive cell highlighting, and automatic verification that LLᵀ reconstructs A.

How Cholesky Decomposition Works

Given an n×n symmetric positive-definite matrix A, the algorithm computes L column by column. For each column j:

Diagonal element:

$$L_{jj} = \sqrt{A_{jj} - \sum_{k=1}^{j-1} L_{jk}^2}$$

Off-diagonal elements (for i > j):

$$L_{ij} = \frac{1}{L_{jj}} \left( A_{ij} - \sum_{k=1}^{j-1} L_{ik} L_{jk} \right)$$

The algorithm proceeds left to right across columns. Each diagonal element involves a square root, which is guaranteed to be real and positive when A is positive-definite. If a negative value appears under the square root, the matrix is not positive-definite.

Conditions for Cholesky Decomposition

Condition	Requirement	What Happens If Violated
Symmetric	A = Aᵀ (A[i,j] = A[j,i])	Decomposition is undefined
Positive-Definite	All eigenvalues > 0	Negative under square root
Square	n×n matrix	Not applicable to rectangular

Key Properties

▽

Lower-Triangular

L has zeros above the diagonal

◻

Unique

If A is positive-definite, L is unique

⚡

Efficient

~n³/3 operations vs n³/3 × 2 for LU

⊕

Stable

No pivoting needed — always stable

↔

det(A) = det(L)²

Determinant from diagonal of L

↻

Solving Ax = b

Forward then back substitution

How to Use the Cholesky Decomposition Calculator

Select matrix size — Choose from 2×2 up to 6×6. Cholesky decomposition requires a square matrix.
Enter values — Fill in the matrix cells. The calculator auto-mirrors entries across the diagonal to enforce symmetry (editing A[i,j] automatically sets A[j,i]).
Click Decompose — Press the "Decompose A = LLᵀ" button to compute the factorization.
Explore the result — Review the color-coded equation A = L × Lᵀ. Click any cell in L to see its derivation formula. Use "Play All" to auto-step through every element.
Verify — The calculator multiplies L × Lᵀ back together and reports the maximum error, confirming the decomposition is correct.

Real-World Applications

📊

Monte Carlo

Generate correlated random variables from a covariance matrix

📡

Kalman Filters

State estimation in navigation and signal processing

🤖

Machine Learning

Gaussian processes, covariance inversion

📐

Optimization

Newton's method with positive-definite Hessians

💰

Finance

Portfolio risk modeling via correlation decomposition

🏗

Engineering

Finite element method stiffness matrices

Cholesky vs Other Decompositions

Method	Factorization	Requirements	Complexity
Cholesky	A = LLᵀ	Symmetric positive-definite	n³/3
LU	A = LU (or PA = LU)	Invertible	2n³/3
QR	A = QR	Any matrix	2n³/3 (Householder)
SVD	A = UΣVᵀ	Any matrix	~11n³/3
Eigendecomposition	A = QΛQᵀ	Symmetric	~9n³

Frequently Asked Questions

What is Cholesky decomposition?

Cholesky decomposition (named after Andre-Louis Cholesky) factors a symmetric positive-definite matrix A into A = LLᵀ, where L is a lower-triangular matrix with positive diagonal entries. It is one of the most efficient and numerically stable matrix factorizations available.

When can Cholesky decomposition be applied?

The matrix must be symmetric (A = Aᵀ) and positive-definite (all eigenvalues strictly positive, or equivalently, xᵀAx > 0 for every nonzero vector x). Common examples include covariance matrices, correlation matrices, Gram matrices (XᵀX for full-rank X), and stiffness matrices in structural engineering.

What if my matrix is not positive-definite?

If the matrix is not positive-definite, you will encounter a negative value under a square root during the decomposition, which is not a real number. The calculator will report an error indicating exactly which diagonal step failed. You may want to check your matrix for symmetry errors, or consider LDLᵀ decomposition for positive semi-definite matrices.

How is Cholesky decomposition used to solve linear systems?

To solve Ax = b, first decompose A = LLᵀ. Then solve Ly = b by forward substitution (since L is lower-triangular), and then solve Lᵀx = y by back substitution. This is about twice as fast as solving via LU decomposition because L and Lᵀ share the same data.

What is the relationship between Cholesky and the determinant?

Since A = LLᵀ, we have det(A) = det(L) × det(Lᵀ) = det(L)². And since L is triangular, det(L) is simply the product of its diagonal entries. This provides an efficient way to compute the determinant of a positive-definite matrix.

Can Cholesky decomposition be applied to complex matrices?

Yes, for complex matrices the condition is that A must be Hermitian positive-definite (A = A*, where A* is the conjugate transpose). The decomposition becomes A = LLᵀ where Lᵀ is replaced by L* (the conjugate transpose of L). This calculator handles real-valued matrices.

このコンテンツ、ページ、またはツールを引用する場合は、次のようにしてください：

"コレスキー分解電卓"（https://MiniWebtool.com/ja/コレスキー分解計算機/） MiniWebtool からの引用、https://MiniWebtool.com/

by miniwebtool team. Updated: 2026-04-12

開発者向け API が利用できます: このツールをアプリ、自動化、エージェントから 1 回の JSON HTTP リクエストで実行できます。 API ドキュメントを見る

また、AI 数学ソルバー GPT を使って、自然言語による質問と回答で数学の問題を解決することもできます。