Convergence of algorithms for finding eigenvectors

From MaRDI portal





A new iteration algorithm is introduced for solving symmetric matrix eigenvalue problems. The method is a generalization of the stochastic gradient ascent method used for principal component analysis in pattern recognition. The convergence of the algorithm is proved and numerical examples are presented.











This page was built for publication: Convergence of algorithms for finding eigenvectors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1594858)