Skip to Main content Skip to Navigation
Journal articles

ZOLOTAREV QUADRATURE RULES AND LOAD BALANCING FOR THE FEAST EIGENSOLVER

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 us 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.
Document type :
Journal articles
Complete list of metadatas

https://hal-centralesupelec.archives-ouvertes.fr/hal-02418265
Contributor : Delphine Le Piolet <>
Submitted on : Wednesday, December 18, 2019 - 4:16:34 PM
Last modification on : Thursday, July 2, 2020 - 9:12:02 AM

Links full text

Identifiers

Citation

Stefan Guettel, Eric Polizzi, Ping Tak Peter Tang, Gautier Viaud. ZOLOTAREV QUADRATURE RULES AND LOAD BALANCING FOR THE FEAST EIGENSOLVER. SIAM Journal on Scientific Computing, Society for Industrial and Applied Mathematics, 2015, 37 (4), pp.A2100-A2122. ⟨10.1137/140980090⟩. ⟨hal-02418265⟩

Share

Metrics

Record views

35