Includes bibliographical references pages 495-516) and index
CONTENTS NOTE
Text of Note
Background in linear algebra -- Discretization of partial differential equations -- Sparse matrices -- Basic iterative methods -- Projection methods -- Krylov subspace methods, part I -- Krylov subspace methods, part II -- Methods related to the normal equations -- Preconditioned iterations -- Preconditioning techniques -- Parallel implementations -- Parallel preconditioners -- Multigrid methods -- Domain decomposition methods
0
SUMMARY OR ABSTRACT
Text of Note
"[This] gives an in-depth, up-to-date view of practical algorithms for solving large-scale linear systems of equations. These equations can number in the millions and are sparse in the sense that each involves only a small number of unknowns. The methods described are iterative, i.e., they provide sequences of approximations that will converge to the solution". --Back cover