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

Scott, Jennifer; Tůma, Miroslav

 
9783031258190: Algorithms for Sparse Linear Systems (Nečas Center Series)
Tapa blanda
ISBN 10: 3031258193 ISBN 13: 9783031258190
Editorial: Birkhauser Verlag AG, 2023

Sinopsis

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. 

"Sinopsis" puede pertenecer a otra edición de este libro.

Acerca del 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.

De la contraportada

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.

"Sobre este título" puede pertenecer a otra edición de este libro.

Editorial
Birkhauser Verlag AG
Año de publicación
2023
Idioma
Inglés
ISBN 10 
3031258193
ISBN 13 
9783031258190
Encuadernación
Tapa blanda
Número de páginas
180
Contacto del fabricante
no disponible
Persona responsable
CMN Printpool Inh. Mathis Neumann
https://www.also.com/ec/cms5/en_6000/6000/index.jsp

Friedrich-Karl-Str. 9
Hamburg
Alemania

Otras ediciones populares con el mismo título

9783031258213: Algorithms for Sparse Linear Systems

Edición Destacada

ISBN 10:  3031258215 ISBN 13:  9783031258213
Tapa blanda