Fast algorithms for subspace tracking

Authors:
  • KAK. Abed-Meraim
    K. Abed-Meraim

Abstract
We present two normalized versions of Oja's (1992) algorithm (NOja and NOOja), which can be used for the estimation of minor and principal subspaces of a vector sequence. The new algorithms offer, as compared to Oja, a faster convergence, orthogonality, and a better numerical stability with a slight increase in computational complexity.

This publication has 7 references indexed in Scilit: