Store besparelser
Hurtig levering
Gemte
Log ind
0
Kurv
Kurv

Algorithms for Sparse Linear Systems

Af: Jennifer Scott, Miroslav Tuma Engelsk Paperback

Algorithms for Sparse Linear Systems

Af: Jennifer Scott, Miroslav Tuma Engelsk Paperback
Tjek vores konkurrenters priser
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. 

Tjek vores konkurrenters priser
Normalpris
kr 383
Fragt: 39 kr
6 - 8 hverdage
20 kr
Pakkegebyr
God 4 anmeldelser på
Tjek vores konkurrenters priser
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. 

Produktdetaljer
Sprog: Engelsk
Sider: 242
ISBN-13: 9783031258190
Indbinding: Paperback
Udgave:
ISBN-10: 3031258193
Kategori: Numerisk analyse
Udg. Dato: 30 apr 2023
Længde: 17mm
Bredde: 234mm
Højde: 154mm
Forlag: Birkhauser Verlag AG
Oplagsdato: 30 apr 2023
Forfatter(e): Jennifer Scott, Miroslav Tuma
Forfatter(e) Jennifer Scott, Miroslav Tuma


Kategori Numerisk analyse


ISBN-13 9783031258190


Sprog Engelsk


Indbinding Paperback


Sider 242


Udgave


Længde 17mm


Bredde 234mm


Højde 154mm


Udg. Dato 30 apr 2023


Oplagsdato 30 apr 2023


Forlag Birkhauser Verlag AG

Kategori sammenhænge