Bi-iteration SVD subspace tracking algorithms

  • Authors:
  • P. Strobach

  • Affiliations:
  • Fachhochschule Furtwangen

  • Venue:
  • IEEE Transactions on Signal Processing
  • Year:
  • 1997

Quantified Score

Hi-index 35.69

Visualization

Abstract

We present a class of fast subspace tracking algorithms that arise from a straightforward extension of Bauer's (1957) classical bi-iteration to the sequential processing case. The bi-iteration concept has an unexpected potential in subspace tracking. Our new bi-SVD subspace trackers are well structured and show excellent convergence properties. They outperform the TQR-SVD subspace tracking algorithm. Detailed comparisons confirm our claims. An application to rank and data adaptive signal reconstruction is also discussed