论文信息 - New rigorous perturbation bounds for the generalized Cholesky factorization

New rigorous perturbation bounds for the generalized Cholesky factorization

Some new rigorous perturbation bounds for the generalized Cholesky factorization with normwise or componentwise perturbations in the given matrix are obtained, where the componentwise perturbation has the form of backward rounding error for the generalized Cholesky factorization algorithm. These bounds can be much tighter than some existing ones while the conditions for them to hold are simple and moderate.

Hanyu Li | Yanfei Yang

[1] Xiao-Wen Chang,et al. Componentwise perturbation analyses for the QR factorization , 2001, Numerische Mathematik.

[2] Wei-guo Wang,et al. Perturbation analysis for the generalized Cholesky factorization , 2004, Appl. Math. Comput..

[3] Fang Xi-ming. New Perturbation Analysis for the Generalized Cholesky Factorization , 2009 .

[4] G. Stewart,et al. Matrix Perturbation Theory , 1990 .

[5] A. Sluis. Condition numbers and equilibration of matrices , 1969 .

[6] Hu Yang,et al. A note on the perturbation analysis for the generalized Cholesky factorization , 2010, Appl. Math. Comput..

[7] Nicholas J. Higham,et al. INVERSE PROBLEMS NEWSLETTER , 1991 .

[8] Fang Xi-ming. The Generalized Cholesky Factorization and Perturbation of the Real Symmetric Matrices , 2008 .

[9] Xiao-Wen Chang,et al. Perturbation analysis of some matrix factorizations , 1997 .

[10] Damien Stehlé,et al. Rigorous Perturbation Bounds of Some Matrix Factorizations , 2010, SIAM J. Matrix Anal. Appl..

[11] Nicholas J. Higham,et al. Accuracy and stability of numerical algorithms, Second Edition , 2002 .

[12] Jinxi Zhao,et al. The generalized Cholesky factorization method for saddle point problems , 1998, Appl. Math. Comput..