Iterative Methods for Linear Systems
Iterative Methods for Linear Systems
£57.00
GBPSystems of linear equations are ubiquitous in numerical analysis and scientific computing. and iterative methods are indispensable for the numerical treatment of such systems. This book offers a rigorous introduction to fundamental iterative methods for systems of linear algebraic equations. The book distinguishes itself from other texts on the topic by providing a straightforward yet comprehensive analysis of the Krylov subspace methods, approaching the development and analysis of algorithms from various perspectives, and going beyond the standard description of iterative methods by connecting them in a natural way to the idea of preconditioning. The book supplements standard texts on numerical mathematics for first-year graduate and advanced undergraduate courses and is suitable for advanced graduate classes covering numerical linear algebra and Krylov subspace and multigrid iterative methods. It will be useful to researchers interested in numerical linear algebra and engineers who use iterative methods for solving large algebraic systems.
- Provides a straightforward yet comprehensive analysis of the Krylov subspace methods
- Approaches the development and analysis of iteration schemes from various algorithmic and mathematical perspectives
- Goes beyond the standard description of iterative methods by connecting them in a natural way to the idea of preconditioning
Product details
September 2014Paperback
9781611973457
260 pages
254 × 177 × 15 mm
0.56kg
This item is not supplied by Cambridge University Press in your region. Please contact Soc for Industrial null Mathematics for availability.
Table of Contents
- List of figures
- List of algorithms
- Preface
- 1. Krylov subspace methods
- 2. Toeplitz matrices and preconditioners
- 3. Multigrid preconditioners
- 4. Preconditioners by space decomposition
- 5. Some applications
- Bibliography
- Index.
