Krylov Subspace Methods
Abstract
This chapter presents iterative methods for the solution of large, sparse, systems. It begins by describing the CRS format for the representation of a sparse matrix. Following this is a detailed development of the conjugate gradient method. The approach is to first develop the method of steepest descent and then show how it can be improved, leading to the conjugate gradient algorithm (CG). A convergence result is stated but not proved. Preconditioning is introduced, and two methods for preconditioning CG are presented: incomplete Cholesky and SSOR. Examples are provided to illustrate the need for preconditioning CG. A Krylov subspace is defined, and it is shown that CG is actually a Krylov subspace ...
Get Numerical Linear Algebra with Applications now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
