GMRES convergence bounds for eigenvalue problems
Freitag, Melina A. and Kürschner, Patrick and Pestana, Jennifer (2018) GMRES convergence bounds for eigenvalue problems. Computational Methods in Applied Mathematics, 18 (2). pp. 203-222. ISSN 1609-9389 (https://doi.org/10.1515/cmam-2017-0017)
Preview |
Text.
Filename: Freitag_etal_CMAM_2017_GMRES_convergence_bounds_for_eigenvalue_problems.pdf
Accepted Author Manuscript Download (853kB)| Preview |
Abstract
The convergence of GMRES for solving linear systems can be influenced heavily by the structure of the right hand side. Within the solution of eigenvalue problems via inverse iteration or subspace iteration, the right hand side is generally related to an approximate invariant subspace of the linear system. We give detailed and new bounds on (block) GMRES that take the special behavior of the right hand side into account and explain the initial sharp decrease of the GMRES residual. The bounds motivate the use of specific preconditioners for these eigenvalue problems, e.g. tuned and polynomial preconditioners, as we describe. The numerical results show that the new (block) GMRES bounds are much sharper than conventional bounds and that preconditioned subspace iteration with either a tuned or polynomial preconditioner should be used in practice.
ORCID iDs
Freitag, Melina A., Kürschner, Patrick and Pestana, Jennifer ORCID: https://orcid.org/0000-0003-1527-3178;-
-
Item type: Article ID code: 60768 Dates: DateEvent30 April 2018Published7 June 2017Published Online24 May 2017Accepted19 September 2016SubmittedSubjects: Science > Mathematics Department: Faculty of Science > Mathematics and Statistics Depositing user: Pure Administrator Date deposited: 25 May 2017 10:09 Last modified: 11 Nov 2024 11:32 Related URLs: URI: https://strathprints.strath.ac.uk/id/eprint/60768