Verwandte Artikel zu Algorithms for Sparse Linear Systems (Nečas Center...

Algorithms for Sparse Linear Systems (Nečas Center Series) - Softcover

Scott, Jennifer; Tůma, Miroslav

 
9783031258190: Algorithms for Sparse Linear Systems (Nečas Center Series)
Softcover
ISBN 10: 3031258193 ISBN 13: 9783031258190
Verlag: Birkhäuser, 2023

Inhaltsangabe

Large sparse linear systems of equations are ubiquitous in science, engineering and beyond. This open access monograph focuses on factorization algorithms for solving such systems.  It presents classical techniques for complete factorizations that are used in sparse direct methods and discusses the computation of approximate direct and inverse factorizations that are key to constructing general-purpose algebraic preconditioners for iterative solvers.  A unified framework is used that emphasizes the underlying sparsity structures and highlights the importance of understanding sparse direct methods when developing algebraic preconditioners.  Theoretical results are complemented by sparse matrix algorithm outlines.

This monograph is aimed at students of applied mathematics and scientific computing, as well as computational scientists and software developers who are interested in understanding the theory and algorithms needed to tackle sparse systems. It is assumed that the reader has completed a basic course in linear algebra and numerical mathematics. 

Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.

Über die Autorin bzw. den Autor

​Jennifer Scott is a Professor of Mathematics at the University of Reading and an Individual Merit Research Fellow at the Rutherford Appleton Laboratory. She is a SIAM Fellow and a Fellow of the Institute of Mathematics and its Applications. She is the author of many widely used sparse matrix packages that are available as part of the HSL Mathematical Software Library.


Miroslav Tuma is a Professor and Head of the Department of Numerical Mathematics at Charles University and was formerly a Professor at the Institute of Computer Science of the Academy of Sciences of the Czech Republic. His research has included important contributions to the development of algebraic preconditioners for iterative solvers. He was the recipient of a SIAM outstanding paper prize for his work on sparse approximate inverse preconditioners.

Von der hinteren Coverseite

Large sparse linear systems of equations are ubiquitous in science, engineering and beyond. This open access monograph focuses on factorization algorithms for solving such systems. It presents classical techniques for complete factorizations that are used in sparse direct methods and discusses the computation of approximate direct and inverse factorizations that are key to constructing general-purpose algebraic preconditioners for iterative solvers.  A unified framework is used that emphasizes the underlying sparsity structures and highlights the importance of understanding sparse direct methods when developing algebraic preconditioners. Theoretical results are complemented by sparse matrix algorithm outlines.

This monograph is aimed at students of applied mathematics and scientific computing, as well as computational scientists and software developers who are interested in understanding the theory and algorithms needed to tackle sparsesystems. It is assumed that the reader has completed a basic course in linear algebra and numerical mathematics. 

„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.

Verlag
Birkhäuser
Erscheinungsdatum
2023
Sprache
Englisch
ISBN 10 
3031258193
ISBN 13 
9783031258190
Einband
Taschenbuch
Auflage
1
Anzahl der Seiten
264
Kontakt zum Hersteller
Springer Nature Customer Service Center GmbH
ProductSafety@springernature.com

Europaplatz 3
Heidelberg
69115
Deutschland