Abstract
A generalization of the QR algorithm proposed by Francis [2] for square matrices is introduced for the singular values decomposition of arbitrary rectangular matrices. Geometrically the algorithm means the subsequent orthogonalization of the image of orthonormal bases produced in the course of the iteration. Our purpose is to show how to get a series of lower triangular matrices by alternate orthogonal-upper triangular decompositions in different dimensions and to prove the convergence of this series.
Similar content being viewed by others
References
A. R. Amir-Moéz andA. Horn, Singular values of a matrix,Amer. Math. Monthly 65 (1958), 742–748.MR 20: 7037
J. Francis, The QR transformation. A unitary analogue to the LR transformation, I–II,Comput. J. 4 (1961–62), 265–271 and 332–345.MR 25: 744
G. H. Golub andG. Reinsch, Singular values decomposition and least squares solutions,Numer. Math. 14 (1970), 403–420.Zbl 188, 222
A. Horn, On the eigenvalues of a matrix with prescribed singular values,Proc. Amer. Math. Soc. 5 (1954), 4–7.MR 15, 847
C. Lánczos, Linear systems in self-adjoint form,Amer. Math. Monthly 65 (1958), 665–679.Zbl 83, 6
J. H. Wilkinson,The algebraic eigenvalue problem, first edition, Clarendon Press, Oxford, 1965.MR 32: 1894
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Bolla, M., Tusnády, G. The QRPS algorithm: A generalization of the QR algorithm for the singular values decomposition of rectangular matrices. Period Math Hung 16, 201–207 (1985). https://doi.org/10.1007/BF01849843
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01849843