Algorithms for Sparse Linear Systems / / Jennifer Scott, Miroslav Tůma.
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...
Saved in:
Superior document: | Nečas Center Series |
---|---|
VerfasserIn: | |
TeilnehmendeR: | |
Place / Publishing House: | Cham : : Springer International Publishing,, 2023. |
Year of Publication: | 2023 |
Edition: | 1st ed. |
Language: | English |
Series: | Nečas Center Series.
|
Physical Description: | 1 online resource (xix, 242 pages) :; illustrations (some color). |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
LEADER | 02621nam a2200433 i 4500 | ||
---|---|---|---|
001 | 993602770204498 | ||
005 | 20231206232413.0 | ||
006 | m o d | ||
007 | cr#||||||||||| | ||
008 | 230531s2023 sz a ob 001 0 eng d | ||
020 | |a 3-031-25820-7 | ||
035 | |a (CKB)5720000000183532 | ||
035 | |a (NjHacI)995720000000183532 | ||
035 | |a (PPN)269658254 | ||
035 | |a (MiAaPQ)EBC7243105 | ||
035 | |a (Au-PeEL)EBL7243105 | ||
035 | |a (OCoLC)1378390037 | ||
035 | |a (EXLCZ)995720000000183532 | ||
040 | |a NjHacI |b eng |e rda |c NjHacl | ||
050 | 4 | |a QA9.58 |b .S368 2023 | |
082 | 0 | 4 | |a 511.8 |2 23 |
100 | 1 | |a Scott, Jennifer, |e author. | |
245 | 1 | 0 | |a Algorithms for Sparse Linear Systems / |c Jennifer Scott, Miroslav Tůma. |
250 | |a 1st ed. | ||
264 | 1 | |a Cham : |b Springer International Publishing, |c 2023. | |
300 | |a 1 online resource (xix, 242 pages) : |b illustrations (some color). | ||
336 | |a text |b txt |2 rdacontent | ||
337 | |a computer |b c |2 rdamedia | ||
338 | |a online resource |b cr |2 rdacarrier | ||
490 | 1 | |a Nečas Center Series | |
588 | |a Description based on publisher supplied metadata and other sources. | ||
520 | |a 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. | ||
504 | |a Includes bibliographical references and index. | ||
505 | 0 | |a 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. | |
650 | 0 | |a Algorithms |v Congresses. | |
650 | 7 | |a Matrius disperses |2 thub | |
650 | 7 | |a Sistemes lineals |2 thub | |
650 | 7 | |a Algorismes |2 thub | |
655 | 7 | |a Llibres electrònics |2 thub | |
776 | |z 3-031-25819-3 | ||
700 | 1 | |a Tůma, Miroslav, |e editor. | |
830 | 0 | |a Nečas Center Series. | |
906 | |a BOOK | ||
ADM | |b 2024-02-23 22:45:03 Europe/Vienna |f system |c marc21 |a 2023-05-13 19:28:35 Europe/Vienna |g false | ||
AVE | |i DOAB Directory of Open Access Books |P DOAB Directory of Open Access Books |x https://eu02.alma.exlibrisgroup.com/view/uresolver/43ACC_OEAW/openurl?u.ignore_date_coverage=true&portfolio_pid=5346030070004498&Force_direct=true |Z 5346030070004498 |b Available |8 5346030070004498 |