Computer Solution of Large Linear Systems
Seiten
1999
North-Holland (Verlag)
978-0-444-50169-1 (ISBN)
North-Holland (Verlag)
978-0-444-50169-1 (ISBN)
- Titel ist leider vergriffen;
keine Neuauflage - Artikel merken
A guide to numerical methods for solving large sparse linear systems of equations, in particular those arising from the discretization of partial differential equations. This text covers both direct and iterative methods, including Gaussian elimination and alternating directions algorithms.
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.
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.
Introductory MaterialGaussian elimination for general linear systemsGaussian elimination for sparse linear systemsFast solvers for separable PDEsClassical iterative methodsThe conjugate gradient and related methodsKrylov methods for non--symmetric systemsPreconditioningMultigrid methods
Erscheint lt. Verlag | 16.6.1999 |
---|---|
Reihe/Serie | Studies in Mathematics & Its Applications |
Sprache | englisch |
Maße | 151 x 229 mm |
Gewicht | 1350 g |
Themenwelt | Informatik ► Theorie / Studium ► Algorithmen |
Mathematik / Informatik ► Mathematik ► Algebra | |
Mathematik / Informatik ► Mathematik ► Analysis | |
ISBN-10 | 0-444-50169-X / 044450169X |
ISBN-13 | 978-0-444-50169-1 / 9780444501691 |
Zustand | Neuware |
Haben Sie eine Frage zum Produkt? |
Mehr entdecken
aus dem Bereich
aus dem Bereich
IT zum Anfassen für alle von 9 bis 99 – vom Navi bis Social Media
Buch | Softcover (2021)
Springer (Verlag)
CHF 41,95
Interlingua zur Gewährleistung semantischer Interoperabilität in der …
Buch (2023)
Springer Fachmedien (Verlag)
CHF 46,15
Eine Einführung mit Java
Buch | Hardcover (2020)
dpunkt (Verlag)
CHF 62,85