The problem of solving large, sparse, linear systems of algebraic equations is vital in scientific computing, even for applications originating from quite different fields. A Survey of Preconditioned Iterative Methods presents an up to date overview of iterative methods for numerical solution of such systems. Typically, the methods considered are w

The problem of solving large, sparse, linear systems of algebraic equations is vital in scientific computing, even for applications originating from quite different fields. A Survey of Preconditioned Iterative Methods presents an up to date overview of iterative methods for numerical solution of such systems. Typically, the methods considered are w

This book describes, in a basic way, the most useful and effective iterative solvers and appropriate preconditioning techniques for some of the most important classes of large and sparse linear systems. The solution of large and sparse linear systems is the most time-consuming part for most of the scientific computing simulations. Indeed, mathematical models become more and more accurate by including a greater volume of data, but this requires the solution of larger and harder algebraic systems. In recent years, research has focused on the efficient solution of large sparse and/or structured systems generated by the discretization of numerical models by using iterative solvers.

Iterative methods use successive approximations to obtain more accurate solutions. This book gives an introduction to iterative methods and preconditioning for solving discretized elliptic partial differential equations and optimal control problems governed by the Laplace equation, for which the use of matrix-free procedures is crucial. All methods are explained and analyzed starting from the historical ideas of the inventors, which are often quoted from their seminal works. Iterative Methods and Preconditioners for Systems of Linear Equations grew out of a set of lecture notes that were improved and enriched over time, resulting in a clear focus for the teaching methodology, which derives complete convergence estimates for all methods, illustrates and provides MATLAB codes for all methods, and studies and tests all preconditioners first as stationary iterative solvers. This textbook is appropriate for undergraduate and graduate students who want an overview or deeper understanding of iterative methods. Its focus on both analysis and numerical experiments allows the material to be taught with very little preparation, since all the arguments are self-contained, and makes it appropriate for self-study as well. It can be used in courses on iterative methods, Krylov methods and preconditioners, and numerical optimal control. Scientists and engineers interested in new topics and applications will also find the text useful.

Mathematics of Computing -- General.

Precondition Gradient Methods emerged in the early 1970s as the most impressive algorithm for the large sparse definite problems. The method has gained large acceptance throughout the world since then and undergone rapid development. The method has been generalized to non-symmetric and indefinite problems, domain decomposition, eigenvalue problems, and many other application areas. The analysis of the preconditioning strategy is both a mathematically fascinating and complex topic. Since the topic appears to be expanding in importance, it was felt opportune to present this volume containing papers on preconditioned iterative methods, Incomplete Factorisation and SSOR preconditioning and the Preconditioned Conjugate Gradient Method covering symmetric and non-symmetric systems on computers (vector and parallel) for finite element and computational fluid dynamic applications. This volume serves as a useful companion volume to the previously published "Preconditioning Methods: Theory and Application"