Polynomial Based Iteration Methods for Symmetric Linear Systems
Polynomial Based Iteration Methods for Symmetric Linear Systems
AUD$172.73
exc GSTA concise introduction to computational methods for solving large linear systems of equations. This is the only textbook that treats iteration methods for symmetric linear systems from a polynomial point of view. This particular feature enables readers to understand the convergence behaviour and subtle differences of the various schemes, which are useful tools for the design of powerful preconditioners. First published nearly fifteen years ago, this book continues to be useful to the mathematical, scientific and engineering communities as a presentation of what appear to be the most efficient methods for symmetric linear systems of equations. To help potential users of numerical iteration algorithms design schemes for their particular needs, the author provides MATLAB® code on a supplementary web page to serve as a guideline. The code not only solves the linear system but also computes the underlying residual polynomials, illustrating the convergence behaviour of the given linear system.
- The only textbook available which treats iteration methods from a polynomial point of view
- Provides a complete derivation of iterative methods for linear, indefinite systems
- MATLAB® code is provided on a supplementary web page
Product details
July 2011Paperback
9781611971910
284 pages
229 × 151 × 15 mm
0.39kg
This item is not supplied by Cambridge University Press in your region. Please contact Soc for Industrial & Applied Mathematics for availability.
Table of Contents
- Preface to the Classics Edition
- Preface
- 1. Introduction
- 2. Orthogonal polynomials
- 3. Chebyshev and optimal polynomials
- 4. Orthogonal polynomials and Krylov subspaces
- 5. Estimating the spectrum and the distribution function
- 6. Parameter free methods
- 7. Parameter dependent methods
- 8. The Stokes problem
- 9. Approximating the A-norm
- Bibliography
- Notation
- Index.
