摘要
In this paper we give a rigorous analysis of convergence of algorithms for finding eigenvectors of a real symmetric matrix. The algorithms are deterministic and our methods are very intuitive.
In this paper we give a rigorous analysis of convergence of algorithms for finding eigenvectors of a real symmetric matrix. The algorithms are deterministic and our methods are very intuitive.