%0 Journal Article
%T A Subspace Iteration for Calculating a Cluster of Exterior Eigenvalues
%A Achiya Dax
%J Advances in Linear Algebra & Matrix Theory
%P 76-89
%@ 2165-3348
%D 2015
%I Scientific Research Publishing
%R 10.4236/alamt.2015.53008
%X In this
paper we present a new subspace iteration for calculating eigenvalues of symmetric
matrices. The method is designed to compute a cluster of <i>k</i> exterior eigenvalues. For example, <i>k</i> eigenvalues with the largest absolute values, the <i>k</i> algebraically largest eigenvalues, or
the <i>k</i> algebraically smallest
eigenvalues. The new iteration applies a Restarted Krylov method to collect
information on the desired cluster. It is shown that the estimated eigenvalues
proceed monotonically toward their limits. Another innovation regards the
choice of starting points for the Krylov subspaces, which leads to fast rate of
convergence. Numerical experiments illustrate the viability of the proposed
ideas.
%K Exterior Eigenvalues
%K Symmetric Matrices
%K Subspace Iterations
%K Interlacing
%K Restarted Krylov Methods
%U http://www.scirp.org/journal/PaperInformation.aspx?PaperID=59314