Iterative methods for sparse linear systems

By:

Saad, Y

Material type: Text

TextPublication details: Philadelphia : SIAM, c2003.Edition: 2nd edDescription: xviii, 528 pages : illustrationsISBN:

9780898715347
0898715342

Subject(s):

DDC classification:

512.9434 SAA

Online resources:

Contents:

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.

Summary: "[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.

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

Holdings
Item type	Current library	Collection	Call number	Status	Date due	Barcode	Item holds
Permanent Reference	Main Library Permanent Reference	Reference	512.9434 SAA (Browse shelf(Opens below))	Not for loan		015022

Total holds: 0

Includes Index

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.

"[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.

There are no comments on this title.

to post a comment.