LIKE NEW: This book is in excellent, like-new condition.
Product Details
This is Volume 17 in theFrontiers in Applied Mathematics series by the Society for Industrial and Applied Mathematics (SIAM).
From the back cover: "Much recent research has concentrated on the efficient solution of large sparse or structured linear systems using iterative methods. A language loaded with acronyms for a thousand different algorithms has developed, and it is often difficult even for specialists to identify the basic principles involved. Several questions are emphasized throughout: Does the method converge? If so, how fast? Is it optimal, among a certain class? If not, can it be shown to be near optimal? The answers are presented clearly, when they are known, and remaining important open questions are laid out for further study."
BRIEF CONTENTS
List of Algorithms
Preface
Chapter 1. Introduction
I. Krylov Subspace Approximations
Chapter 2. Some Iteratin Methods
Chapter 3. Error Bounds for CG, MINRES, and GMRES
Chapter 4. Effects of Finite Precision Arithmetic
Chapter 5. BiCG and Related Methods
Chapter 6. Is There a Short Recurrence for a Near-Optimal Approximation?
Chapter 7. Miscellaneous Issues
II. Preconditioners
Chapter 8. Overview and Preconditioned Algorithms
Chapter 9. Two example Problems
Chapter 10. Comparison of Preconditioners
Chapter 11. Incomplete Decompositions
Chapter 12. Multigrid and Domain Decomposition Methods
References
Index
The author states in the Preface, "The material should be accessible to anyone with graduate-level knowledge of linear algebra and some experience with numerical computing."
