Algorithms for Sparse Linear Systems

Dublin Core

Title

Algorithms for Sparse Linear Systems

Subject

Numerical analysis

Description

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.

Creator

Scott, Jennifer,. Tůma, Miroslav

Source

https://library.oapen.org/bitstream/handle/20.500.12657/62987/978-3-031-25820-6.pdf?sequence=1

Publisher

Springer Nature

Date

2023

Contributor

Baihaqi

Rights

Creative Commons

Format

PDF

Language

English

Type

Textbooks

Files

978-3-031-25820-6.pdf.jpg

Citation

Scott, Jennifer,. Tůma, Miroslav, “Algorithms for Sparse Linear Systems,” Open Educational Resource (OER) - USK Library, accessed July 13, 2024, http://uilis.usk.ac.id/oer/items/show/7560.

Document Viewer