A computational algorithm to solve thespectral problems of monster matrices, i.e. finding the eigenvalues and eigenvectors of real symmetricmatrices N N´ A , with N in the thousands or millions, will be presented below. The Krylov subspaceiteration and the Lanczos methods to be presented below are modern versions that have undergone manyimprovements as reported by Lin & Gubernatis and others.M. Bunjamin; FMIPA-UI dan FMIPA-UNAS
