Results 1 
5 of
5
Recycling Krylov Subspaces for Sequences of Linear Systems
 SIAM J. Sci. Comput
, 2004
"... 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 tha ..."
Abstract

Cited by 46 (3 self)
 Add to MetaCart
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 nonHermitian problems, and present numerical experiments to illustrate the eects of subspace recycling.
Recycling Subspace Information for Diffuse Optical Tomography
 SIAM J. Sci. Comput
, 2004
"... We discuss the efficient solution of a large sequence of slowly varying linear systems arising in computations for diffuse optical tomographic imaging. In particular, we analyze a number of strategies for recycling Krylov subspace information for the most efficient solution. We reconstruct threedim ..."
Abstract

Cited by 13 (2 self)
 Add to MetaCart
We discuss the efficient solution of a large sequence of slowly varying linear systems arising in computations for diffuse optical tomographic imaging. In particular, we analyze a number of strategies for recycling Krylov subspace information for the most efficient solution. We reconstruct threedimensional...
A General Algorithm for Reusing Krylov Subspace Information. I. Unsteady NavierStokes
, 2010
"... ..."
1. On a selective reuse of Krylov subspaces in NewtonKrylov
"... approaches for nonlinear elasticity ..."