Iterative Methods for Solving Linear Systems: Frontiers in Applied Mathematics, cartea 17
Autor Anne Greenbaumen Limba Engleză Paperback – 31 dec 1986
Preț: 383.00 lei
Preț vechi: 439.25 lei
-13% Nou
Puncte Express: 575
Preț estimativ în valută:
73.31€ • 76.40$ • 61.02£
73.31€ • 76.40$ • 61.02£
Carte indisponibilă temporar
Doresc să fiu notificat când acest titlu va fi disponibil:
Se trimite...
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9780898713961
ISBN-10: 089871396X
Pagini: 234
Ilustrații: Illustrations
Dimensiuni: 178 x 255 x 12 mm
Greutate: 0.42 kg
Ediția:New.
Editura: Society for Industrial and Applied Mathematics
Colecția Society for Industrial and Applied Mathematics
Seria Frontiers in Applied Mathematics
Locul publicării:Philadelphia, United States
ISBN-10: 089871396X
Pagini: 234
Ilustrații: Illustrations
Dimensiuni: 178 x 255 x 12 mm
Greutate: 0.42 kg
Ediția:New.
Editura: Society for Industrial and Applied Mathematics
Colecția Society for Industrial and Applied Mathematics
Seria Frontiers in Applied Mathematics
Locul publicării:Philadelphia, United States
Cuprins
List of Algorithms; Preface; 1. Introduction. Brief Overview of the State of the Art; Notation; Review of Relevant Linear Algebra; Part I. Krylov Subspace Approximations. 2. Some Iteration Methods. Simple Iteration; Orthomin(1) and Steepest Descent; Orthomin(2) and CG; Orthodir, MINRES, and GMRES; Derivation of MINRES and CG from the Lanczos Algorithm; 3. Error Bounds for CG, MINRES, and GMRES. Hermitian Problems-CG and MINRES; Non-Hermitian Problems-GMRES; 4. Effects of Finite Precision Arithmetic. Some Numerical Examples; The Lanczos Algorithm; A Hypothetical MINRES/CG Implementation; A Matrix Completion Problem; Orthogonal Polynomials; 5. BiCG and Related Methods. The Two-Sided Lanczos Algorithm; The Biconjugate Gradient Algorithm; The Quasi-Minimal Residual Algorithm; Relation Between BiCG and QMR; The Conjugate Gradient Squared Algorithm; The BiCGSTAB Algorithm; Which Method Should I Use?; 6. Is There A Short Recurrence for a Near-Optimal Approximation? The Faber and Manteuffel Result; Implications; 7. Miscellaneous Issues. Symmetrizing the Problem; Error Estimation and Stopping Criteria; Attainable Accuracy; Multiple Right-Hand Sides and Block Methods; Computer Implementation; Part II. Preconditioners. 8. Overview and Preconditioned Algorithms. 9. Two Example Problems. The Diffusion Equation; The Transport Equation; 10. Comparison of Preconditioners. Jacobi, Gauss--Seidel, SOR; The Perron--Frobenius Theorem; Comparison of Regular Splittings; Regular Splittings Used with the CG Algorithm; Optimal Diagonal and Block Diagonal Preconditioners; 11. Incomplete Decompositions. Incomplete Cholesky Decomposition; Modified Incomplete Cholesky Decomposition; 12. Multigrid and Domain Decomposition Methods. Multigrid Methods; Basic Ideas of Domain Decomposition Methods.
Recenzii
'This graduate-level textbook gives equal weights to iterative methods and preconditioning (including domain decomposition and multigrid), and it approaches Krylov space methods from a somewhat different angle. It also treats some subjects that appear for the first time in a textbook, like new results on roundoff effects in the Lanczos and conjugate gradient algorithms. This well-done introduction to the area can be strongly recommended. It is competently written by an author who has contributed much to the complete reshaping of this field in the last twenty years.' Martin H. Gutknecht, ETH Zurich
'For a course in matrix iterations, this is just the right book. It is wide-ranging, careful about details, and appealingly written - a major addition to the literature in this important area.' Nick Trefethen, Professor of Numerical Analysis, Oxford University
'This book differs substantially from other books on iterative methods, including those recently published, in that it concentrates on several principles behind the derivation and analysis of the most important methods and preconditioning techniques. Individual algorithms serve as examples illustrating the discussed ideas. Strong emphasis is given to motivation and its relation to problems in other areas of mathematics. The book speaks in clear language about principal problems in the area of iterative methods. It represents a comprehensive introduction to the field and stimulates the interest of the reader. It is valuable for students and also for experts working in the area of iterative methods.' Zdenek Strakos, Professor, Czech Academy of Sciences, Institute of Computer Science
'Anne Greenbaum is an admired authority in the field of iterative methods. Engineers and scientists often ask me about the puzzling behavior of iterative methods, which I almost always answer with a reference to Anne's work, now made easy to point to in her new book.' Paul Saylor, Department of Computer Science, University of Illinois, Urbana-Champaign
'For a course in matrix iterations, this is just the right book. It is wide-ranging, careful about details, and appealingly written - a major addition to the literature in this important area.' Nick Trefethen, Professor of Numerical Analysis, Oxford University
'This book differs substantially from other books on iterative methods, including those recently published, in that it concentrates on several principles behind the derivation and analysis of the most important methods and preconditioning techniques. Individual algorithms serve as examples illustrating the discussed ideas. Strong emphasis is given to motivation and its relation to problems in other areas of mathematics. The book speaks in clear language about principal problems in the area of iterative methods. It represents a comprehensive introduction to the field and stimulates the interest of the reader. It is valuable for students and also for experts working in the area of iterative methods.' Zdenek Strakos, Professor, Czech Academy of Sciences, Institute of Computer Science
'Anne Greenbaum is an admired authority in the field of iterative methods. Engineers and scientists often ask me about the puzzling behavior of iterative methods, which I almost always answer with a reference to Anne's work, now made easy to point to in her new book.' Paul Saylor, Department of Computer Science, University of Illinois, Urbana-Champaign
Descriere
Focuses on the analysis of iterative methods for solving linear systems.