Iterative Solution of Large Sparse Systems of Equations

Wolfgang Hackbusch

ISBN 10: 3319284819 / ISBN 13: 9783319284811

Editore: Springer, Springer International Publishing, 2016

Riguardo questo articolo

Druck auf Anfrage Neuware - Printed after ordering - In the second edition of this classic monograph, complete with four new chapters and updated references, readers will now have access to content describing and analysing classical and modern methods with emphasis on the algebraic structure of linear iteration, which is usually ignored in other literature.The necessary amount of work increases dramatically with the size of systems, so one has to search for algorithms that most efficiently and accurately solve systems of, e.g., several million equations. The choice of algorithms depends on the special properties the matrices in practice have. An important class of large systems arises from the discretization of partial differential equations. In this case, the matrices are sparse (i.e., they contain mostly zeroes) and well-suited to iterative algorithms.The first edition of this book grew out of a series of lectures given by the author at the Christian-Albrecht University of Kiel to students of mathematics. The second edition includes quite novel approaches.

Codice articolo 9783319284811

Dati bibliografici

• Titolo: Iterative Solution of Large Sparse Systems of Equations
• Editore: Springer, Springer International Publishing
• Data di pubblicazione: 2016
• Lingua: Inglese
• ISBN 10: 3319284819
• ISBN 13: 9783319284811
• Rilegatura: Buch
• Edizione: seconda edizione
• Condizione: Neu
• Dimensioni: 241 L x 160 A x 35 P (millimetri) 241 millimetri di larghezza per 160 millimetri di altezza per 35 millimetri di profondità
• Peso: 963 grammi

Descrizione articolo

Riassunto

In the second edition of this classic monograph, complete with four new chapters and updated references, readers will now have access to content describing and analysing classical and modern methods with emphasis on the algebraic structure of linear iteration, which is usually ignored in other literature.

The necessary amount of work increases dramatically with the size of systems, so one has to search for algorithms that most efficiently and accurately solve systems of, e.g., several million equations. The choice of algorithms depends on the special properties the matrices in practice have. An important class of large systems arises from the discretization of partial differential equations. In this case, the matrices are sparse (i.e., they contain mostly zeroes) and well-suited to iterative algorithms.

The first edition of this book grew out of a series of lectures given by the author at the Christian-Albrecht University of Kiel to students of mathematics. The second edition includes quite novel approaches.

Informazioni sull?autore

Wolfgang Hackbusch is a Professor in the Scientific Computing department at Max Planck Institute for Mathematics in the Sciences. His research areas include numerical treatment of partial differential equations, numerical treatment of integral equations, and hierarchical matrices.