an iterative method for computing eigenpairs of symmetric matrices

An iterative algorithm is proposed in this paper, expanding the classical power method by incorporating the gram-schmidt orthogonalization process. with this improvement, it becomes possible to compute all eigenvalues and eigenvectors of a given symmetric matrix simultaneously. the algorithm has been tested on a variety of benchmark matrices to determine the robustness of the full eigen decomposition, and the results are reported to be accurate.