Skip to Main content Skip to Navigation
New interface
Journal articles

Fast Approximated Power Iteration Subspace Tracking

Abstract : This paper introduces a fast implementation of the power iteration method for subspace tracking, based on an approximation less restrictive than the well known projection approximation. This algorithm, referred to as the fast API method, guarantees the orthonormality of the subspace weighting matrix at each iteration. Moreover, it outperforms many subspace trackers related to the power iteration method, such as PAST, NIC, NP3 and OPAST, while having the same computational complexity. The API method is designed for both exponential windows and sliding windows. Our numerical simulations show that sliding windows offer a faster tracking response to abrupt signal variations.
Complete list of metadata

Cited literature [35 references]  Display  Hide  Download
Contributor : Admin Télécom Paristech Connect in order to contact the contributor
Submitted on : Sunday, May 2, 2010 - 4:22:49 PM
Last modification on : Tuesday, March 8, 2022 - 5:46:03 PM
Long-term archiving on: : Thursday, September 16, 2010 - 1:06:03 PM


Files produced by the author(s)




Roland Badeau, Bertrand David, Gael Richard. Fast Approximated Power Iteration Subspace Tracking. IEEE Transactions on Signal Processing, 2005, 53 (8), pp.2931-2941. ⟨10.1109/TSP.2005.850378⟩. ⟨hal-00479772⟩



Record views


Files downloads