Texonom
Texonom
/
Science
Science
/Mathematics/Math Field/Algebra/Linear Algebra/Matrix/Matrix Decomposition/
Cholesky decomposition
Search

Cholesky decomposition

Creator
Creator
Seonglae Cho
Created
Created
2021 Aug 8 7:59
Editor
Editor
Seonglae Cho
Edited
Edited
2023 Jun 25 6:17
Refs
Refs
Inverse Matrix
Hermitian matrix
Linear System 효과적으로
역행렬을 구하려고 할 때, 조금 더 효율적으로 구하기 위해
 
 
 
 
Cholesky decomposition
In linear algebra, the Cholesky decomposition or Cholesky factorization (pronounced /ʃəˈlɛski/ 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. It was discovered by André-Louis Cholesky for real matrices, and posthumously published in 1924.[1] When it is applicable, the Cholesky decomposition is roughly twice as efficient as the LU decomposition for solving systems of linear equations.[2]
Cholesky decomposition
https://en.wikipedia.org/wiki/Cholesky_decomposition
Cholesky decomposition
taeyoung96.github.io
https://taeyoung96.github.io/slam/SLAM_02/
 
 

Recommendations

Texonom
Texonom
/
Science
Science
/Mathematics/Math Field/Algebra/Linear Algebra/Matrix/Matrix Decomposition/
Cholesky decomposition
Copyright Seonglae Cho