Abstract
The paper presents a rigorous perturbation analysis of the QR decomposition A=QR of an n×m matrix A using the method of splitting operators. New asymptotic componentwise perturbation bounds are derived for the elements of Q and R and the subspaces spanned by the first p≤m columns of A. The new bounds are less conservative than the known bounds and are significantly better than the normwise bounds. An iterative scheme is proposed to determine global componentwise bounds in the case of perturbations for which such bounds are valid. Several numerical results are given that illustrate the analysis and the quality of the bounds obtained.
Subject
General Mathematics,Engineering (miscellaneous),Computer Science (miscellaneous)
Reference30 articles.
1. Stewart, G.W. (1998). Matrix Algorithms, SIAM. Vol. I: Basic Decompositions.
2. Stewart, G.W., and Sun, J.-G. (1990). Matrix Perturbation Theory, Academic Press.
3. Matrix factorizations and their perturbations;Bhatia;Linear Algebra Appl.,1994
4. Hogben, L. (2014). Handbook of Linear Algebra, CRC Press. [2nd ed.]. Chapter 21.
5. Gautchi, W. (1994). Mathematics of Computation 1943–1993: A Half Century of Computational Mathematics, Amer. Mathematical Society.