Abstract
A deation by restriction scheme is developed for the inverse-free preconditioned Krylov subspace method for computing a few extreme eigen-values of the definite symmetric generalized eigenvalue problem Ax =λBx. The convergence theory for the inverse-free preconditioned Krylov subspace method is generalized to include this deation scheme and numerical examples are presented to demonstrate the convergence properties of the algorithm with the deation scheme.
| Original language | English |
|---|---|
| Pages (from-to) | 55-71 |
| Number of pages | 17 |
| Journal | Numerical Algebra, Control and Optimization |
| Volume | 6 |
| Issue number | 1 |
| DOIs | |
| State | Published - Mar 1 2016 |
Bibliographical note
Publisher Copyright:© 2016, American Institute of Mathematical Sciences. All rights reserved.
Funding
| Funders | Funder number |
|---|---|
| National Science Foundation (NSF) | 1318633, 1317424 |
ASJC Scopus subject areas
- Algebra and Number Theory
- Control and Optimization
- Applied Mathematics
Fingerprint
Dive into the research topics of 'Deflation by restriction for the inverse-free preconditioned krylov subspace method'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver