Effect of normalization of eigenvectors on the past and RP algorithms for PCA

This paper investigates the effect of incorporating normalization of the eigenvectors between iterations in the PAST and RP algorithms for principal component analysis (PCA). In addition, an algorithm denoted as exact eigendecomposition (EE) is proposed for PCA. The algorithms are compared for different configurations using Monte Carlo simulations. Simulation results show that EE has the best performance and that normalization may be used for improving PAST and RP.