An optimized and scalable eigensolver for sequences of eigenvalue problems. (19th September 2014)

• Record Type: Journal Article
• Authors: Berljafa, Mario; Wortmann, Daniel; Di Napoli, Edoardo; Hussain, Farookh Khadeer; Wyrzykowski, Roman; Tudruj, Marek
• Is Part Of: Concurrency and computation. Volume 27:Number 4(2015:Mar.)
• Page Start: 905
• Page End: 922
• Publication Date: 2014-09-19
• Subjects: Parallel processing (Electronic computers) -- Periodicals; Parallel computers -- Periodicals; 004.35
• DOI: 10.1002/cpe.3394
• Languages: English
• ISSNs: 1532-0626

Abstract

<abstract abstract-type="main" id="cpe3394-abs-0001"> <title>Summary</title> <p id="cpe3394-para-0001">In many scientific applications, the solution of nonlinear differential equations are obtained through the setup and solution of a number of successive eigenproblems. These eigenproblems can be regarded as a sequence whenever the solution of one problem fosters the initialization of the next. In addition, in some eigenproblem sequences, there is a connection between the solutions of adjacent eigenproblems. Whenever it is possible to unravel the existence of such a connection, the eigenproblem sequence is said to be correlated. When facing with a sequence of correlated eigenproblems, the current strategy amounts to solving each eigenproblem in isolation. We propose an alternative approach that exploits such correlation through the use of an eigensolver based on subspace iteration and accelerated with Chebyshev polynomials (Chebyshev filtered subspace iteration (ChFSI)). The resulting eigensolver is optimized by minimizing the number of matrix–vector multiplications and parallelized using the Elemental library framework. Numerical results show that ChFSI achieves excellent scalability and is competitive with current dense linear algebra parallel eigensolvers. Copyright © 2014 John Wiley &amp; Sons, Ltd.</p> </abstract>