论文信息 - Indefinite QR Factorization

Indefinite QR Factorization

Let A be a Hermitian positive definite matrix given by its rectangular factor G such that A=G*G. It is well known that the Cholesky factorization of A is equivalent to the QR factorization of G. In this paper, an analogue of the QR factorization for Hermitian indefinite matrices is constructed. This problem has been considered by many authors, but the problem of zero diagonal elements has not been solved so far. Here we show how to overcome this difficulty.

Sanja Singer

[1] K. Veselic. On a new class of elementary matrices , 1979 .

[2] J. Bunch. Analysis of the Diagonal Pivoting Method , 1971 .

[3] Alle-Jan van der Veen,et al. A Schur Method for Low-Rank Matrix Approximation , 1996, SIAM J. Matrix Anal. Appl..

[4] J. Bunch,et al. Some stable methods for calculating inertia and solving symmetric linear systems , 1977 .

[5] Nicholas J. Higham,et al. J-Orthogonal Matrices: Properties and Generation , 2003, SIAM Rev..

[6] J. Bunch. Partial Pivoting Strategies for Symmetric Matrices , 1972 .

[7] J. Bunch,et al. Decomposition of a symmetric matrix , 1976 .

[8] A. Bunse-Gerstner. An analysis of the HR algorithm for computing the eigenvalues of a matrix , 1981 .

[9] Ivan Slapničar,et al. Accurate Symmetric Eigenreduction by a Jacobi Method , 1993 .

[10] J. Bunch,et al. Direct Methods for Solving Symmetric Indefinite Systems of Linear Equations , 1971 .

[11] Sanja Singer,et al. Rounding-error and perturbation bounds for the indefinite QR factorization , 2000 .

[12] H. Zha. A note on the existence of the hyperbolic singular value decomposition , 1996 .