Bibliographic Details
| Title: |
A fast and stable algorithm for downdating the singular value decomposition. |
| Authors: |
Zhang, Jieyuan1,2, Li, Shengguo3 nudtlsg@nudt.edu.cn, Cheng, Lizhi1,2, Liao, Xiangke3, Cheng, Guangquan4 |
| Source: |
Computers & Mathematics with Applications. Nov2014, Vol. 68 Issue 10, p1421-1430. 10p. |
| Subjects: |
Singular value decomposition, Semiseparable matrices, Mathematical programming, Approximation theory, Eigenvectors, Matrix multiplications |
| Abstract: |
In this paper, we modify a classical downdating SVD algorithm and reduce its complexity significantly. We use a structured low-rank approximation algorithm to compute an hierarchically semiseparable (HSS) matrix approximation to the eigenvector matrix of a diagonal matrix plus rank-one modification. The complexity of our downdating algorithm is analyzed. We further show that the structured low-rank approximation algorithm is backward stable. Numerous experiments have been done to show the efficiency of our algorithm. For some matrices with large dimensions, our algorithm can be much faster than that using plain matrix–matrix multiplication routine in Intel MKL in both sequential and parallel cases. [ABSTRACT FROM AUTHOR] |
|
Copyright of Computers & Mathematics with Applications is the property of Pergamon Press - An Imprint of Elsevier Science and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Engineering Source |
