
Proceedings Paper
Stable chasing algorithms for modifying complete and partial singular value decompositionsFormat | Member Price | Non-Member Price |
---|---|---|
$14.40 | $18.00 |
![]() |
GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. | Check Access |
Paper Abstract
Methods for updating and downdating singular value decompositions (SVDs) and partially reduced bidiagonal forms (partial SVDs) are introduced. The methods are based upon chasing procedures for updating the SVD and downdating procedures for orthogonal decompositions. The main feature of these methods is the ability to separate the singular values into `large' and `small' sets and then obtain an updated bidiagonal form with corresponding `large' and `small' columns. This makes for a more accurate update or dosndate.
Paper Details
Date Published: 1 November 1993
PDF: 12 pages
Proc. SPIE 2027, Advanced Signal Processing Algorithms, Architectures, and Implementations IV, (1 November 1993); doi: 10.1117/12.160456
Published in SPIE Proceedings Vol. 2027:
Advanced Signal Processing Algorithms, Architectures, and Implementations IV
Franklin T. Luk, Editor(s)
PDF: 12 pages
Proc. SPIE 2027, Advanced Signal Processing Algorithms, Architectures, and Implementations IV, (1 November 1993); doi: 10.1117/12.160456
Show Author Affiliations
Jesse L. Barlow, The Pennsylvania State Univ. (United States)
H. Zha, The Pennsylvania State Univ. (United States)
H. Zha, The Pennsylvania State Univ. (United States)
P. A. Yoon, The Pennsylvania State Univ. (United States)
Published in SPIE Proceedings Vol. 2027:
Advanced Signal Processing Algorithms, Architectures, and Implementations IV
Franklin T. Luk, Editor(s)
© SPIE. Terms of Use
