Recursive ULV decomposition

Hasan Erbay; Jesse L. Barlow

doi:10.1117/12.406492

13 November 2000 Recursive ULV decomposition

Hasan Erbay, Jesse L. Barlow

Proceedings Volume 4116, Advanced Signal Processing Algorithms, Architectures, and Implementations X; (2000) https://doi.org/10.1117/12.406492
Event: International Symposium on Optical Science and Technology, 2000, San Diego, CA, United States

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.

Citation Download Citation

Hasan Erbay and Jesse L. Barlow "Recursive ULV decomposition", Proc. SPIE 4116, Advanced Signal Processing Algorithms, Architectures, and Implementations X, (13 November 2000); https://doi.org/10.1117/12.406492

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available