Premium
Flexible subspace iteration with moments for an effective contour integration‐based eigensolver
Author(s) -
Huber Sarah,
Futamura Yasunori,
Galgon Martin,
Imakura Akira,
Lang Bruno,
Sakurai Tetsuya
Publication year - 2022
Publication title -
numerical linear algebra with applications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.02
H-Index - 53
eISSN - 1099-1506
pISSN - 1070-5325
DOI - 10.1002/nla.2447
Subject(s) - subspace topology , heuristics , robustness (evolution) , mathematical optimization , methods of contour integration , eigenvalues and eigenvectors , scheme (mathematics) , mathematics , krylov subspace , algorithm , heuristic , computer science , iterative method , mathematical analysis , biochemistry , chemistry , physics , quantum mechanics , gene
Contour integration schemes are a valuable tool for the solution of difficult interior eigenvalue problems. However, the solution of many large linear systems with multiple right hand sides may prove a prohibitive computational expense. The number of right hand sides, and thus, computational cost may be reduced if the projected subspace is created using multiple moments. In this work, we explore heuristics for the choice and application of moments with respect to various other important parameters in a contour integration scheme. We provide evidence for the expected performance, accuracy, and robustness of various schemes, showing that good heuristic choices can provide a scheme featuring good properties in all three of these measures.