โ Scribed by Jeffrey M. Lemm, G. Meurant
No coin nor oath required. For personal study only.
Hardbound. This book deals with numerical methods for solving large sparse linear systems of equations, particularly those arising from the discretization of partial differential equations. It covers both direct and iterative methods. Direct methods which are considered are variants of Gaussian elimination and fast solvers for separable partial differential equations in rectangular domains. The book reviews the classical iterative methods like Jacobi, Gauss-Seidel and alternating directions algorithms. A particular emphasis is put on the conjugate gradient as well as conjugate gradient -like methods for non symmetric problems. Most efficient preconditioners used to speed up convergence are studied. A chapter is devoted to the multigrid method and the book ends with domain decomposition algorithms that are well suited for solving linear systems on parallel computers.
๐ SIMILAR VOLUMES
Very good plus. Looks "almost new". Books normally shipped same day as order. We guarantee satisfaction Introductory Material. Vector and matrices norms. Eigenvalues. Irreducibility and diagonal dominance. M--Matrices and generalizations. Splittings.
Hardbound. This book deals with numerical methods for solving large sparse linear systems of equations, particularly those arising from the discretization of partial differential equations. It covers both direct and iterative methods. Direct methods which are considered are variants of Gaussian elim
<DIV><DIV>Self-contained treatment includes a review of matrix theory and general properties of iterative methods; successive overrelaxation (SOR) method and stationary modified SOR method for consistently ordered matrices; nonstationary methods; generalizations of SOR theory and variants of method;
<div>This self-contained treatment offers a systematic development of the theory of iterative methods. Its focal point resides in an analysis of the convergence properties of the successive overrelaxation (SOR) method, as applied to a linear system with a consistently ordered matrix. The text explor