Fast algorithms for updating signal subspaces
- 1 January 1994
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing
- Vol. 41 (8) , 537-549
- https://doi.org/10.1109/82.318942
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- Updating MUSIC and root-MUSIC with the rank-revealing URV decompositionPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Noniterative subspace trackingIEEE Transactions on Signal Processing, 1992
- Minimum-norm updating with the rank-revealing URV decompositionPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1992
- A fast algorithm for signal subspace decomposition and its performance analysisPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1991
- Efficient, numerically stabilized rank-one eigenstructure updating (signal processing)IEEE Transactions on Acoustics, Speech, and Signal Processing, 1990
- Tracking a few extreme singular values and vectors in signal processingProceedings of the IEEE, 1990
- ESPRIT-estimation of signal parameters via rotational invariance techniquesIEEE Transactions on Acoustics, Speech, and Signal Processing, 1989
- Estimating the covariance matrix by signal subspace averagingIEEE Transactions on Acoustics, Speech, and Signal Processing, 1986
- MATRIX DECOMPOSITIONS AND STATISTICAL CALCULATIONS††This work was in part supported by the National Science Foundation and Office of Naval Research.Published by Elsevier ,1969
- Asymptotic Theory for Principal Component AnalysisThe Annals of Mathematical Statistics, 1963