Two algorithms for fast approximate subspace tracking
- 1 July 1999
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 47 (7) , 1936-1945
- https://doi.org/10.1109/78.771042
Abstract
New fast algorithms are presented for tracking singular values, singular vectors, and the dimension of a signal subspace through an overlapping sequence of data matrices. The basic algorithm is called fast approximate subspace tracking (FAST). The algorithm is derived for the special case in which the matrix is changed by deleting the oldest column, shifting the remaining columns to the left, and adding a new column on the right. A second algorithm (FAST2) is specified by modifying FAST to trade reduced accuracy for higher speed. The speed and accuracy are compared with the PL algorithm, the PAST and PASTd algorithms, and the FST algorithm. An extension to multicolumn updates for the FAST algorithm is also discussedKeywords
This publication has 19 references indexed in Scilit:
- Fast approximate subspace tracking (FAST)Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Fast, rank adaptive subspace tracking and applicationsIEEE Transactions on Signal Processing, 1996
- Projection approximation subspace trackingIEEE Transactions on Signal Processing, 1995
- A Second-Order Perturbation Expansion for the SVDSIAM Journal on Matrix Analysis and Applications, 1994
- Determination of the dimension of a signal subspace from short data recordsIEEE Transactions on Signal Processing, 1994
- Unified analysis for DOA estimation algorithms in array signal processingSignal Processing, 1991
- Analysis of Min-Norm and MUSIC with arbitrary array geometryIEEE Transactions on Aerospace and Electronic Systems, 1990
- The effects of perturbations on matrix-based signal processingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1990
- Error and Perturbation Bounds for Subspaces Associated with Certain Eigenvalue ProblemsSIAM Review, 1973
- The approximation of one matrix by another of lower rankPsychometrika, 1936