## Version 1.2.0

Recent Changes

Given a real symmetric matrix $A={\left\{{a}_{ij}\right\}}_{n×n}$ of order $n$, calculates the $k$ largest eigenvalues, ${\lambda }_{1}\ge {\lambda }_{2}\ge ,...,\ge {\lambda }_{k}$ and their associated eigenvectors ${x}_{i},i=1,2,...,k$, where ${Ax}_{i}={\lambda }_{i}{x}_{i}$. The subroutine uses the method of simultaneous iteration and also allows the user to take advantage of sparsity. Eigensolutions from other parts of the spectrum can be obtained by using shifts of the form $A-\beta I$ optionally combined with inversion.