## Version 1.2.0

4th April 2013

Recent Changes

Given a real unsymmetric $n×n$ matrix $A=\left\{{a}_{ij}\right\}$, this routine uses subspace iteration to calculate the $r$ eigenvalues ${\lambda }_{i}$, $i=1,2,...,r$, that are right-most, left-most, or are of largest modulus. The right-most (respectively, left-most) eigenvalues are the eigenvalues with the most positive (respectively, negative) real part. A second entry will return the associated eigenvectors ${y}_{i}$, $i=1,2,...,r$, where ${Ay}_{i}={\lambda }_{i}{y}_{i}$. The routine may also be used to calculate a group of eigensolutions elsewhere in the spectrum.