The Triangular Decomposition(LL~T) of the Positive Semidefinite Symmetric Real Matrix
Yuan Li
Abstract
Yuan Li
Abstract
Let n×n be positive semi definite symmetric real matrix.It is called triangular decomposition of matrix A if A=LL T ,Matrix L is a lower triangular matrix whose elements on diagnal line are noanegative.In this paper,discussed is the existence and a necessary and sufficient condition of the triangular decomposition uniqueness,and then presented is algorithm of the triangular decompsition of the positive semi definite symmetric real matrix.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Let n×n be positive semi definite symmetric real matrix.It is called triangular decomposition of matrix A if A=LL T ,Matrix L is a lower triangular matrix whose elements on diagnal line are noanegative.In this paper,discussed is the existence and a necessary and sufficient condition of the triangular decomposition uniqueness,and then presented is algorithm of the triangular decompsition of the positive semi definite symmetric real matrix.
Key concepts: Positive-definite matrix, Triangular matrix, Symmetric matrix, Mathematics, Matrix (chemical analysis), Uniqueness, Combinatorics, Band matrix