Skip to content
You are not logged in |Login  
     
Limit search to available items
Book Cover
Bestseller
BestsellerE-Book
Author Scott, Jennifer, author.

Title Algorithms for sparse linear systems / Jennifer Scott, Miroslav Tůma.

Publication Info. Cham : Birkhäuser, 2023.

Copies

Location Call No. Status
 University of Saint Joseph: Pope Pius XII Library - Internet  WORLD WIDE WEB E-BOOK Springer    Downloadable
Please click here to access this Springer resource
Description 1 online resource (xix, 242 pages) : illustrations (some color).
Series Nečas Center series, 2523-3351
Nečas Center series, 2523-3351
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.
Access Open access. GW5XE
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.
Note Online resource; title from PDF title page (SpringerLink, viewed May 3, 2023).
Local Note Springer Nature Springer Nature - SpringerLink eBooks - Fully Open Access
Subject Sparse matrices.
Linear systems.
Algorithms.
algorithms.
Algorithms
Linear systems
Sparse matrices
Added Author Tuma, M. (Miroslav), author. https://id.oclc.org/worldcat/entity/E39PCjrfhCkhm4fCPdHJpjKMvb
ISBN 9783031258206 electronic book
3031258207 electronic book
9783031258190
Standard No. 10.1007/978-3-031-25820-6 doi
-->
Add a Review