A parallel implementation of the jacobi-davidson eigensolver for unsymmetric matrices

• Type: Article in International Conference Proceedings Book
• Date: 2011

Authors

romero, e (Author) Other; cruz, mb (Author) Other; roman, je (Author) Other; vasconcelos, pb (Author) FEP

Conference proceedings International

Title: High Performance Computing for Computational Science - VECPAR 2010, Revised Selected Papers

Pages: 380-393

9th International Conference on High Performance Computing for Computational Science (VECPAR 2010)

Berkeley, CA, USA, June 22-25, 2010

Indexing

ISI Web of Knowledge - 1 Citation

Scopus - 4 Citations

Other information

Authenticus ID: P-007-XSF

DOI: 10.1007/978-3-642-19328-6_35

Abstract (EN): 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. © 2011 Springer-Verlag Berlin Heidelberg.

Language: English

Type (Professor's evaluation): Scientific

No. of pages: 14