Recycling Krylov Subspaces for Sequences of Linear Systems (2004)
Cached
Download Links
- [www.cse.uiuc.edu]
- [www.cs.sandia.gov]
- [www.cs.sandia.gov]
- [www.cse.uiuc.edu]
- [www.me.mtu.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | SIAM J. Sci. Comput |
| Citations: | 26 - 2 self |
BibTeX
@TECHREPORT{Parks04recyclingkrylov,
author = {Michael L. Parks and Eric De Sturler and Greg Mackey and Duane D. Johnson and Spandan Maiti},
title = {Recycling Krylov Subspaces for Sequences of Linear Systems},
institution = {SIAM J. Sci. Comput},
year = {2004}
}
Years of Citing Articles
OpenURL
Abstract
Many problems in engineering and physics require the solution of a large sequence of linear systems. We can reduce the cost of solving subsequent systems in the sequence by recycling information from previous systems. We consider two dierent approaches. For several model problems, we demonstrate that we can reduce the iteration count required to solve a linear system by a factor of two. We consider both Hermitian and non-Hermitian problems, and present numerical experiments to illustrate the eects of subspace recycling.







