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...
| Otros Autores: | , |
|---|---|
| Formato: | Libro electrónico |
| Idioma: | Inglés |
| Publicado: |
Cham :
Springer International Publishing
2023.
|
| Edición: | 1st ed |
| Colección: | Nečas Center Series.
|
| Materias: | |
| Ver en Biblioteca Universitat Ramon Llull: | https://discovery.url.edu/permalink/34CSUC_URL/1im36ta/alma991009743532706719 |
Tabla de Contenidos:
- 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.
