L.N. Das
ABSTRACT
This paper aims to firstly, holistically analyze Cholesky decomposition, an efficient technique of decomposing a Hermitian, positive-definite matrix into the product of its lower triangular matrix and the conjugate transpose, and secondly, explore the different applications of this technique in various fields ranging from linear least squares, Monte-Karlo simulation, Kalman filters, etc. Additionally, the computation of a few variants of the Cholesky algorithm have been discussed, and other concepts, including the relationship between eigenvalues and eigenvectors with Cholesky decomposition.
- Burian, A. 2006. A fixed-point implementation of matrix inversion using Cholesky decomposition. (2006), 1431–1434. DOI:https://doi.org/10.1109/mwscas.2003.1562564.Google Scholar
- Chandrasekar, J. Cholesky-Based Reduced-Rank Square-Root Kalman Filtering.Google Scholar
- Chen, S. 2020. Cholesky decomposition-based metric learning for video-based human action recognition. IEEE Access. 8, (2020), 36313–36321. DOI:https://doi.org/10.1109/ACCESS.2020.2966329.Google ScholarCross Ref
- Goos, G. and Hartmanis, J. 1980. Lecture notes in computer science.Google Scholar
- Ibrahim, D. 2016. An Overview of Soft Computing. Procedia Computer Science. 102, August (2016), 34–38. DOI:https://doi.org/10.1016/j.procs.2016.09.366.Google ScholarDigital Library
- Matlab 2020. Try This Example. 1 (2020), 1–15.Google Scholar
- Myers, M.E. 2014. Linear Algebra: Foundations to Frontiers. (2014), 4–5.Google Scholar
- Application of square matrix decomposition in the prospectus of Cholesky algorithm
Recommendations
Communication-optimal Parallel and Sequential Cholesky Decomposition
Numerical algorithms have two kinds of costs: arithmetic and communication, by which we mean either moving data between levels of a memory hierarchy (in the sequential case) or over a network connecting processors (in the parallel case). Communication ...
A structure-preserving algorithm for the quaternion Cholesky decomposition
In this paper, we discuss the Cholesky decomposition of the Hermitian positive definite quaternion matrix. For the first time, the structure-preserving Gauss transformation is defined, and then a novel structure-preserving algorithm, which is applied to ...
Matrix Classes That Generate All Matrices with Positive Determinant
New factorization results dealing mainly with P-matrices and M-matrices are presented. It is proved that any matrix in $M_n (\mathbb{R})$ with positive determinant can be written as the product of three P-matrices (compared with the classical result ...
Comments