Share Email Print

Proceedings Paper

Computing the signal subspaces of a sparse and/or structured matrix
Author(s): Ricardo D. Fierro
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

Many techniques involve the computation of singular subspaces associated with an extreme cluster of singular values of an m X n data matrix A. Frequently A is sparse and/or structured, which usually means matrix-vector multiplications involving A and its transpose can be done with much less than (sigma) (mn) flops, and A and its transpose can be stored in static data structures with much less than (sigma) )(mn) storage locations. Standard complete orthogonal decompositions may be unattractive due to the computational and dynamic storage overhead associated with the initial preprocessing of the data. We describe an efficient Matlab implementation of the low-rank ULV algorithm for extracting reliable and accurate approximations to the singular subspaces associated with the cluster of large singular values without altering the matrix. The user can choose any principal singular vector estimator to underwrite the algorithm, may call a specialized routine to compute matrix-vector products involving A and its transpose, and can choose the desired level of accuracy of a residual. The main computational savings stems from preserving A and avoiding the explicit formation of unwanted information.

Paper Details

Date Published: 24 October 1997
PDF: 7 pages
Proc. SPIE 3162, Advanced Signal Processing: Algorithms, Architectures, and Implementations VII, (24 October 1997); doi: 10.1117/12.279498
Show Author Affiliations
Ricardo D. Fierro, California State Univ./San Marcos (United States)

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

© SPIE. Terms of Use
Back to Top