The exponential stability of the invariant-norm PCA algorithm

This brief investigates a recently proposed principal component analysis (PCA) algorithm. We prove that that the solutions of the corresponding differential equations converge to the principal eigenvectors of the autocorrelation matrix and calculate an exponential decaying bound for the error.