Direct formulation to Cholesky decomposition of a general nonsingular correlation matrix
Vered Madar

TL;DR
This paper introduces two explicit, simplified methods for computing the Cholesky decomposition of nonsingular correlation matrices, with applications in statistical testing and matrix generation, extending to Hermitian matrices.
Contribution
It presents novel explicit representations of Cholesky factors using semi-partial correlations and determinant ratios, improving simplicity over existing methods.
Findings
New explicit formulas for Cholesky decomposition.
Applications include independence testing and random matrix generation.
Extension to nonsingular Hermitian matrices.
Abstract
We present two novel, explicit representations of Cholesky factor of a nonsingular correlation matrix. The first representation uses semi-partial correlation coefficients as its entries. The second, uses an equivalent form of the square roots of the differences between two ratios of successive determinants. Each of the two new forms enjoys parsimony of notations and offers a simpler alternative to both spherical factorization and the multiplicative partial correlation Cholesky matrix (Cooke et al 2011). Two relevant applications are offered for each form: a simple -test for assessing the independence of a single variable in a multivariate normal structure, and a straightforward algorithm for generating random positive-definite correlation matrix. The second representation is also extended to any nonsingular hermitian matrix.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
