Algorithms for Sparse Linear Systems

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 c...

Full description

Saved in:
Bibliographic Details
Main Authors: Scott, Jennifer (Author), Tůma, Miroslav (Author)
Corporate Author: SpringerLink (Online service)
Format: Electronic eBook
Language:English
Published: Cham : Springer International Publishing : Imprint: Birkhäuser, 2023.
Edition:1st ed. 2023.
Series:Nečas Center Series,
Subjects:
Online Access:Link to Metadata
Tags: Add Tag
No Tags, Be the first to tag this record!

MARC

LEADER 00000nam a22000005i 4500
001 978-3-031-25820-6
003 DE-He213
005 20240318093657.0
007 cr nn 008mamaa
008 230429s2023 sz | s |||| 0|eng d
020 |a 9783031258206  |9 978-3-031-25820-6 
024 7 |a 10.1007/978-3-031-25820-6  |2 doi 
050 4 |a QA297-299.4 
072 7 |a PBKS  |2 bicssc 
072 7 |a MAT041000  |2 bisacsh 
072 7 |a PBKS  |2 thema 
082 0 4 |a 518  |2 23 
100 1 |a Scott, Jennifer.  |e author.  |4 aut  |4 http://id.loc.gov/vocabulary/relators/aut 
245 1 0 |a Algorithms for Sparse Linear Systems  |h [electronic resource] /  |c by Jennifer Scott, Miroslav Tůma. 
250 |a 1st ed. 2023. 
264 1 |a Cham :  |b Springer International Publishing :  |b Imprint: Birkhäuser,  |c 2023. 
300 |a XIX, 242 p. 70 illus., 27 illus. in color.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a Nečas Center Series,  |x 2523-3351 
505 0 |a An introduction to sparse matrices -- Sparse matrices and their graphs -- Introduction to matrix factorizations -- Sparse Cholesky sovler: The symbolic phase -- Sparse Cholesky solver: The factorization phase -- Sparse LU factorizations -- Stability, ill-conditioning and symmetric indefinite factorizations -- Sparse matrix ordering algorithms -- Algebraic preconditioning and approximate factorizations -- Incomplete factorizations -- Sparse approximate inverse preconditioners. 
506 0 |a Open Access 
520 |a 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. . 
650 0 |a Numerical analysis. 
650 0 |a Algebras, Linear. 
650 0 |a Mathematics  |x Data processing. 
650 1 4 |a Numerical Analysis. 
650 2 4 |a Linear Algebra. 
650 2 4 |a Computational Science and Engineering. 
700 1 |a Tůma, Miroslav.  |e author.  |4 aut  |4 http://id.loc.gov/vocabulary/relators/aut 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer Nature eBook 
776 0 8 |i Printed edition:  |z 9783031258190 
776 0 8 |i Printed edition:  |z 9783031258213 
830 0 |a Nečas Center Series,  |x 2523-3351 
856 4 0 |u https://doi.org/10.1007/978-3-031-25820-6  |z Link to Metadata 
912 |a ZDB-2-SMA 
912 |a ZDB-2-SXMS 
912 |a ZDB-2-SOB 
950 |a Mathematics and Statistics (SpringerNature-11649) 
950 |a Mathematics and Statistics (R0) (SpringerNature-43713)