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...
Guardado en:
| Autor principal: | |
|---|---|
| Otros Autores: | |
| Formato: | Electrónico Capítulo de libro |
| Lenguaje: | inglés |
| Publicado: |
Cham
Springer Nature
2023
|
| Colección: | Nečas Center Series
|
| Materias: | |
| Acceso en línea: | OAPEN Library: download the publication OAPEN Library: description of the publication |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| Sumario: | 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. |
|---|---|
| Descripción Física: | 1 electronic resource (242 p.) |
| ISBN: | 978-3-031-25820-6 9783031258206 9783031258190 |
| Acceso: | Open Access |