Algorithms for Sparse Linear Systems / / Jennifer Scott, Miroslav Tůma.
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...
Saved in:
| Superior document: | Nečas Center Series |
|---|---|
| VerfasserIn: | |
| TeilnehmendeR: | |
| Place / Publishing House: | Cham : : Springer International Publishing,, 2023. |
| Year of Publication: | 2023 |
| Edition: | 1st ed. |
| Language: | English |
| Series: | Nečas Center Series.
|
| Physical Description: | 1 online resource (xix, 242 pages) :; illustrations (some color). |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Table of Contents:
- 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.