Computing selected eigenvalues of sparse unsymmetric matrices using subspace iteration

  • Authors:

  • I. S. Duff;J. A. Scott

  • Affiliations:

  • Rutherford Appleton Lab, Oxford, UK;Rutherford Appleton Lab, Oxford, UK

  • Venue:
  • ACM Transactions on Mathematical Software (TOMS)
  • Year:
  • 1993

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper discusses the design and development of a code to calculate the eigenvalues of a large sparse real unsymmetric matrix that are the rightmost, leftmost, or are of the largest modulus. A subspace iteration algorithm is used to compute a sequence of sets of vectors that converge to an orthonormal basis for the invariant subspace corresponding to the required eigenvalues. This algorithm is combined with Chebychev acceleration if the rightmost or leftmost eigenvalues are sought, or if the eigenvalues of largest modulus are known to be the rightmost or leftmost eigenvalues. An option exists for computing the corresponding eigenvectors. The code does not need the matrix explicitly since it only requires the user to multiply sets of vectors by the matrix. Sophisticated and novel iteration controls, stopping criteria, and restart facilities are provided. The code is shown to be efficient and competitive on a range of test problems.