You are here: MIMS > EPrints
MIMS EPrints

2014.39: Zolotarev quadrature rules and load balancing for the FEAST eigensolver

2014.39: Stefan Güttel, Eric Polizzi, Peter Tang and Gautier Viaud (2014) Zolotarev quadrature rules and load balancing for the FEAST eigensolver.

There is a more recent version of this eprint available. Click here to view it.

Full text available as:

PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
451 Kb

Abstract

The FEAST method for solving large sparse eigenproblems is equivalent to subspace iteration with an approximate spectral projector and implicit orthogonalization. This relation allows to characterize the convergence of this method in terms of the error of a certain rational approximant to an indicator function. We propose improved rational approximants leading to FEAST variants with faster convergence, in particular, when using rational approximants based on the work of Zolotarev. Numerical experiments demonstrate the possible computational savings especially for pencils whose eigenvalues are not well separated and when the dimension of the search space is only slightly larger than the number of wanted eigenvalues. The new approach improves both convergence robustness and load balancing when FEAST runs on multiple search intervals in parallel.

Item Type:MIMS Preprint
Uncontrolled Keywords:generalized eigenproblem, FEAST, quadrature, Zolotarev, filter design, load balancing
Subjects:MSC 2000 > 41 Approximations and expansions
MSC 2000 > 65 Numerical analysis
MIMS number:2014.39
Deposited By:Stefan Güttel
Deposited On:30 July 2014

Available Versions of this Item

Download Statistics: last 4 weeks
Repository Staff Only: edit this item