02797nam 2200553 450 991071741190332120231206232413.03-031-25820-7(CKB)5720000000183532(NjHacI)995720000000183532(PPN)269658254(MiAaPQ)EBC7243105(Au-PeEL)EBL7243105(OCoLC)1378390037(EXLCZ)99572000000018353220230531d2023 uy 0engur|||||||||||txtrdacontentcrdamediacrrdacarrierAlgorithms for Sparse Linear Systems /Jennifer Scott, Miroslav Tůma1st ed.Cham :Springer International Publishing,2023.1 online resource (xix, 242 pages) illustrations (some color)Nečas Center Series3-031-25819-3 Includes bibliographical references and index.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.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.Nečas Center Series.AlgorithmsCongressesMatrius dispersesthubSistemes linealsthubAlgorismesthubLlibres electrònicsthubAlgorithmsMatrius dispersesSistemes linealsAlgorismes511.8Scott Jennifer1359751Tůma MiroslavNjHacINjHaclBOOK9910717411903321Algorithms for Sparse Linear Systems3374392UNINA