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.
No takes yet. Share an insight, caveat, or question.
Attallah et al. (2001) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: