A Parallel Implementation of the Jacobi-Davidson Eigensolver for Unsymmetric Matrices
Eloy Romero (Instituto I3M, Universidad Politecnica de Valencia)Manuel Cruz (Instituto Superior de Engenharia do Porto, Instituto Politecnico do Porto)
Jose Roman (Instituto I3M, Universidad Politecnica de Valencia)
Paulo Vasconcelos (Faculdade de Economia, Universidade do Porto)
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.
Keywords:
Parallel and Distributed Computing, Numerical Algorithms for CS&E
