Numerische Mathematik

, Volume 58, Issue 1, pp 779–805

A parallel algorithm for the eigenvalues and eigenvectors of a general complex matrix

  • Gautam M. Shroff
Article

DOI: 10.1007/BF01385654

Cite this article as:
Shroff, G.M. Numer. Math. (1990) 58: 779. doi:10.1007/BF01385654

Summary

A new parallel Jacobi-like algorithm is developed for computing the eigenvalues of a general complex matrix. Most parallel methods for this problem typically display only linear convergence, Sequential ‘norm-reducing’ algorithms also exist and they display quadratic convergence in most cases. The new algorithm is a parallel form of the ‘norm-reducing’ algorithm due to Eberlein. It is proven that the asymptotic convergence rate of this algorithm is quadratic. Numerical experiments are presented which demonstrate the quadratic convergence of the algorithm and certain situations where the convergence is slow are also identified. The algorithm promises to be very competitive on a variety of parallel architectures. In particular, the algorithm can be implemented usingn2/4 processors, takingO(n log2n) time for random matrices.

Subject classification

AMS (MOS) CRO65

Copyright information

© Springer-Verlag 1991

Authors and Affiliations

  • Gautam M. Shroff
    • 1
  1. 1.Computer Science DepartmentRensselaer Polytechnic InstituteTroyUSA