Approximated power iterations for fast subspace tracking

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

This paper introduces a fast implementation of the power iterations method for subspace tracking, based on an approximation less restrictive than the well-known projection approximation. This algorithm guarantees the orthonormality of the estimated subspace-weighting matrix at each iteration, and satisfies a global and exponential convergence property. Moreover, it outperforms many subspace trackers related to the power method, such as PAST, NIC, NP3 and OPAST, while keeping the same computational complexity.

Original languageEnglish
Title of host publicationProceedings - 7th International Symposium on Signal Processing and Its Applications, ISSPA 2003
PublisherIEEE Computer Society
Pages583-586
Number of pages4
ISBN (Print)0780379462, 9780780379466
DOIs
Publication statusPublished - 1 Jan 2003
Event7th International Symposium on Signal Processing and Its Applications, ISSPA 2003 - Paris, France
Duration: 1 Jul 20034 Jul 2003

Publication series

NameProceedings - 7th International Symposium on Signal Processing and Its Applications, ISSPA 2003
Volume2

Conference

Conference7th International Symposium on Signal Processing and Its Applications, ISSPA 2003
Country/TerritoryFrance
CityParis
Period1/07/034/07/03

Fingerprint

Dive into the research topics of 'Approximated power iterations for fast subspace tracking'. Together they form a unique fingerprint.

Cite this