首页 | 本学科首页   官方微博 | 高级检索  
     


The QRPS algorithm: A generalization of the QR algorithm for the singular values decomposition of rectangular matrices
Authors:M. Bolla  G. Tusnády
Affiliation:(1) MTA Számítástechnikai és Automatizálási Kutató Intézet, Kende U. 13-17, P. O. Box 63, H-1502 Budapest, Hungary;(2) MTA Matematikai Kutató Intézet, Reáltanoda U. 13-15, P. O. Box 127, H-1364 Budapest, Hungary
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.
Keywords:Primary 65F15  Secondary 65F25
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号