Share Email Print
cover

Proceedings Paper

Recursive ULV decomposition
Author(s): Hasan Erbay; Jesse L. Barlow
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

The ULV decomposition (ULVD) is an important member of a class of rank-revealing two-sided orthogonal decompositions used to approximate the singular value decomposition (SVD). The ULVD can be modified much faster than the SVD. The accurate computation of the subspaces is required in applications in signal processing. In this paper we introduce a recursive ULVD algorithm which is faster than all available stable SVD algorithms. Moreover, we present an alternative refinement algorithm.

Paper Details

Date Published: 13 November 2000
PDF: 10 pages
Proc. SPIE 4116, Advanced Signal Processing Algorithms, Architectures, and Implementations X, (13 November 2000); doi: 10.1117/12.406492
Show Author Affiliations
Hasan Erbay, The Pennsylvania State Univ. (United States)
Jesse L. Barlow, The Pennsylvania State Univ. (United States)


Published in SPIE Proceedings Vol. 4116:
Advanced Signal Processing Algorithms, Architectures, and Implementations X
Franklin T. Luk, Editor(s)

© SPIE. Terms of Use
Back to Top