Nonlinear Theory and Its Applications, IEICE
Online ISSN : 2185-4106
Accurate and robust inverse Cholesky factorization
Takeshi OgitaShin'ichi Oishi
Author information

Volume 3 (2012) Issue 1 Pages 103-111

Download PDF (229K) Contact us

In this paper, an algorithm for an accurate matrix factorization based on Cholesky factorization for extremely ill-conditioned matrices is proposed. The Cholesky factorization is widely used for solving a system of linear equations whose coefficient matrix is symmetric and positive definite. However, it sometimes breaks down by the presence of an imaginary root due to the accumulation of rounding errors, even if the matrix is actually positive definite. To overcome this, a completely stable algorithm named inverse Cholesky factorization is investigated, which never breaks down as long as the matrix is symmetric and positive definite. The proposed algorithm consists of standard numerical algorithms and an accurate algorithm for dot products. Moreover, it is shown that the algorithm can also verify the positive definiteness of a given real symmetric matrix. Numerical results are presented for illustrating the performance of the proposed algorithms.

Information related to the author
© 2012 The Institute of Electronics, Information and Communication Engineers
Previous article

Recently visited articles