On the parallel iterative solution of linear systems arising in the FEAST algorithm for computing inner eigenvalues

• Published in: Parallel computing Vol. 49; pp. 153 - 163
• Main Authors: Galgon, Martin, Krämer, Lukas, Thies, Jonas, Basermann, Achim, Lang, Bruno
• Format: Journal Article
• Language: English
• Published: Elsevier B.V 01.11.2015
• Subjects: CARP-CG; FEAST; Graphene modeling; Multi-coloring; Parallel inner eigenvalue computation; Sparse linear systems; CARP-CG; Parallel inner eigenvalue computation; FEAST; Multi-coloring; Sparse linear systems; Graphene modeling
• ISSN: 0167-8191; 1872-7336
• DOI: 10.1016/j.parco.2015.06.005

•Parallel iterative solution of linear systems from FEAST algorithm.•Hybrid parallel implementation.•CG variant with multi-coloring approach for better performance on hybrid systems. Methods for the solution of sparse eigenvalue problems that are based on spectral projectors and contour integration have recently attracted more and more attention. Such methods require the solution of many shifted sparse linear systems of full size. In most of the literature concerning these eigenvalue solvers, only few words are said on the solution of the linear systems, but they turn out to be very hard to solve by iterative linear solvers in practice. In this work we identify a row projection method for the solution of the inner linear systems encountered in the FEAST algorithm and introduce a novel hybrid parallel and fully iterative implementation of the eigenvalue solver. Our approach ultimately aims at achieving extreme parallelism by exploiting the algorithm’s potential on several levels. We present numerical examples where graphene modeling is one of the target applications. In this application, several hundred or even thousands of eigenvalues from the interior of the spectrum are required, which is a big challenge for state-of-the-art numerical methods.