Perturbation Bounds for the $QR$ Factorization of a Matrix
- 1 June 1977
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Numerical Analysis
- Vol. 14 (3) , 509-518
- https://doi.org/10.1137/0714030
Abstract
Let A be an $m \times n$ matrix of rank n. The $QR$ factorization of A decomposes A into the product of an $m \times n$ matrix Q with orthonormal columns and a nonsingular upper triangular matrix R. The decomposition is essentially unique, Q being determined up to the signs of its columns and R up to the signs of its rows. If E is an $m \times n$ matrix such that $A + E$ is of rank n, then $A + E$ has an essentially unique factorization $(Q + W)(R + F)$. In this paper bounds on $\| W \|$ and $\| F \|$ in terms of $\| E \|$ are given. In addition perturbation bounds are given for the closely related Cholesky factorization of a positive definite matrix B into the product $R^T R$ of a lower triangular matrix and its transpose.
Keywords
This publication has 4 references indexed in Scilit:
- Simultaneous iteration for computing invariant subspaces of non-Hermitian matricesNumerische Mathematik, 1976
- Error and Perturbation Bounds for Subspaces Associated with Certain Eigenvalue ProblemsSIAM Review, 1973
- Computational aspects of F. L. Bauer's simultaneous iteration methodNumerische Mathematik, 1969
- Calculating the Singular Values and Pseudo-Inverse of a MatrixJournal of the Society for Industrial and Applied Mathematics Series B Numerical Analysis, 1965