Fast and stable YAST algorithm for principal and minor subspace tracking

Abstract : This paper presents a new implementation of the YAST algorithm for principal and minor subspace tracking. YAST was initially derived from the Subspace Projection (SP) algorithm by C.E. Davila, which was known for its exceptional convergence rate, compared to other classical principal subspace trackers. The novelty in the YAST algorithm was the lower computational cost (linear if the data correlation matrix satisfies a so-called shift-invariance property), and the extension to minor subspace tracking. However, the original implementation of the YAST algorithm suffered from a numerical stability problem (the subspace weighting matrix slowly loses its orthonormality). We thus propose in this paper a new implementation of YAST, whose stability is established theoretically and tested via numerical simulations. This algorithm combines all the desired properties for a subspace tracker: remarkably high convergence rate, lowest steady state error, linear complexity, and numerical stability regarding the orthonormality of the subspace weighting matrix.
Type de document :
Article dans une revue
IEEE_J_SP, IEEE, 2008, 56 (8), pp.3437--3446
Liste complète des métadonnées

Littérature citée [22 références]  Voir  Masquer  Télécharger
Contributeur : Roland Badeau <>
Soumis le : lundi 24 mars 2014 - 16:16:37
Dernière modification le : jeudi 11 janvier 2018 - 06:23:38
Document(s) archivé(s) le : mardi 24 juin 2014 - 10:41:30


Fichiers produits par l'(les) auteur(s)


  • HAL Id : hal-00945194, version 1


Roland Badeau, Gaël Richard, Bertrand David. Fast and stable YAST algorithm for principal and minor subspace tracking. IEEE_J_SP, IEEE, 2008, 56 (8), pp.3437--3446. 〈hal-00945194〉



Consultations de la notice


Téléchargements de fichiers