Algorithms for sparse linear systems

Scott, J. ORCID: https://orcid.org/0000-0003-2130-1091 and Tůma, M. (2023) Algorithms for sparse linear systems. Nečas Center Series. Springer, Cham, pp242. ISBN 9783031258190 doi: 10.1007/978-3-031-25820-6

Abstract/Summary

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.

Additional Information	Open Access for this book was funded by the University of Reading. The book is available under a CC BY licence - https://creativecommons.org/licenses/by/4.0/.
Item Type	Book
URI	https://reading-clone.eprints-hosting.org/id/eprint/111892
Item Type	Book
Refereed	Yes
Divisions	Science > School of Mathematical, Physical and Computational Sciences > Department of Mathematics and Statistics
Additional Information	Open Access for this book was funded by the University of Reading. The book is available under a CC BY licence - https://creativecommons.org/licenses/by/4.0/.
Publisher	Springer
Download/View statistics	View download statistics for this item