A parallel implementation of the Jacobi-Davidson eigensolver for unsymmetric matrices

  • Authors:
  • Eloy Romero;Manuel B. Cruz;Jose E. Roman;Paulo B. Vasconcelos

  • Affiliations:
  • Instituto I3M, Universidad Politécnica de Valencia, Valencia, Spain;Laboratório de Engenharia Matemática, Instituto Superior de Engenharia do Porto, Porto;Instituto I3M, Universidad Politécnica de Valencia, Valencia, Spain;Centro de Matemática da Universidade do Porto and Faculdade de Economia da Universidade do Porto, Porto, Portugal

  • Venue:
  • VECPAR'10 Proceedings of the 9th international conference on High performance computing for computational science
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper describes a parallel implementation of the Jacobi-Davidson method to compute eigenpairs of large unsymmetric matrices. Taking advantage of the capabilities of the PETSc library --Portable Extensible Toolkit for Scientific Computation--, we build an efficient and robust code adapted either for traditional serial computation or parallel computing environments. Particular emphasis is given to the description of some implementation details of the so-called correction equation, responsible for the subspace expansion, and crucial in the Jacobi-Davidson algorithm. Numerical results are given and the performance of the code is analyzed in terms of serial and parallel efficiency. The developments achieved in the context of this work will be incorporated in future releases of SLEPc --Scalable Library for Eigenvalue Problem Computations--, thus serving the scientific community and guaranteeing dissemination.