Krylov Subspace Iterations for Sparse Linear Systems
Are Magnus Bruaset · Birkhäuser Boston eBooks · 1997
This chapter is concerned with efficient methods for iterative solution of large sparse systems of linear equations, typically derived from the discretization of an elliptic boundary value problem. In particular, attention is given to the family of Krylov subspace methods, as well as to several preconditioning strategies that are suitable for improving the convergence rates of such iterations. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.