Algorithms for Sparse Linear Systems /

Algorithms for Sparse Linear Systems / / Jennifer Scott, Miroslav Tůma.

Show other versions (1)

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...

Full description

Saved in:
Bibliographic Details
Superior document:Nečas Center Series
VerfasserIn:
Scott, Jennifer,
TeilnehmendeR:
Tůma, Miroslav,
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!
id 993602770204498
ctrlnum (CKB)5720000000183532
(NjHacI)995720000000183532
(PPN)269658254
(MiAaPQ)EBC7243105
(Au-PeEL)EBL7243105
(OCoLC)1378390037
(EXLCZ)995720000000183532
collection bib_alma
record_format marc
spelling Scott, Jennifer, author.
Algorithms for Sparse Linear Systems / Jennifer Scott, Miroslav Tůma.
1st ed.
Cham : Springer International Publishing, 2023.
1 online resource (xix, 242 pages) : illustrations (some color).
text txt rdacontent
computer c rdamedia
online resource cr rdacarrier
Nečas Center Series
Description based on publisher supplied metadata and other sources.
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.
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.
Algorithms Congresses.
Matrius disperses thub
Sistemes lineals thub
Algorismes thub
Llibres electrònics thub
3-031-25819-3
Tůma, Miroslav, editor.
Nečas Center Series.
language English
format eBook
author Scott, Jennifer,
spellingShingle Scott, Jennifer,
Algorithms for Sparse Linear Systems /
Nečas Center Series
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.
author_facet Scott, Jennifer,
Tůma, Miroslav,
author_variant j s js
author_role VerfasserIn
author2 Tůma, Miroslav,
author2_variant m t mt
author2_role TeilnehmendeR
author_sort Scott, Jennifer,
title Algorithms for Sparse Linear Systems /
title_full Algorithms for Sparse Linear Systems / Jennifer Scott, Miroslav Tůma.
title_fullStr Algorithms for Sparse Linear Systems / Jennifer Scott, Miroslav Tůma.
title_full_unstemmed Algorithms for Sparse Linear Systems / Jennifer Scott, Miroslav Tůma.
title_auth Algorithms for Sparse Linear Systems /
title_new Algorithms for Sparse Linear Systems /
title_sort algorithms for sparse linear systems /
series Nečas Center Series
series2 Nečas Center Series
publisher Springer International Publishing,
publishDate 2023
physical 1 online resource (xix, 242 pages) : illustrations (some color).
edition 1st ed.
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.
isbn 3-031-25820-7
3-031-25819-3
callnumber-first Q - Science
callnumber-subject QA - Mathematics
callnumber-label QA9
callnumber-sort QA 19.58 S368 42023
genre Llibres electrònics thub
genre_facet Congresses.
Llibres electrònics
illustrated Illustrated
dewey-hundreds 500 - Science
dewey-tens 510 - Mathematics
dewey-ones 511 - General principles of mathematics
dewey-full 511.8
dewey-sort 3511.8
dewey-raw 511.8
dewey-search 511.8
oclc_num 1378390037
work_keys_str_mv AT scottjennifer algorithmsforsparselinearsystems
AT tumamiroslav algorithmsforsparselinearsystems
status_str n
ids_txt_mv (CKB)5720000000183532
(NjHacI)995720000000183532
(PPN)269658254
(MiAaPQ)EBC7243105
(Au-PeEL)EBL7243105
(OCoLC)1378390037
(EXLCZ)995720000000183532
carrierType_str_mv cr
hierarchy_parent_title Nečas Center Series
is_hierarchy_title Algorithms for Sparse Linear Systems /
container_title Nečas Center Series
author2_original_writing_str_mv noLinkedField
_version_ 1796653177699827712
fullrecord <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02621nam a2200433 i 4500</leader><controlfield tag="001">993602770204498</controlfield><controlfield tag="005">20231206232413.0</controlfield><controlfield tag="006">m o d </controlfield><controlfield tag="007">cr#|||||||||||</controlfield><controlfield tag="008">230531s2023 sz a ob 001 0 eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3-031-25820-7</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(CKB)5720000000183532</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(NjHacI)995720000000183532</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(PPN)269658254</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(MiAaPQ)EBC7243105</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(Au-PeEL)EBL7243105</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1378390037</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(EXLCZ)995720000000183532</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">NjHacI</subfield><subfield code="b">eng</subfield><subfield code="e">rda</subfield><subfield code="c">NjHacl</subfield></datafield><datafield tag="050" ind1=" " ind2="4"><subfield code="a">QA9.58</subfield><subfield code="b">.S368 2023</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">511.8</subfield><subfield code="2">23</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Scott, Jennifer,</subfield><subfield code="e">author.</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Algorithms for Sparse Linear Systems /</subfield><subfield code="c">Jennifer Scott, Miroslav Tůma.</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">1st ed.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cham :</subfield><subfield code="b">Springer International Publishing,</subfield><subfield code="c">2023.</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (xix, 242 pages) :</subfield><subfield code="b">illustrations (some color).</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">computer</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">online resource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Nečas Center Series</subfield></datafield><datafield tag="588" ind1=" " ind2=" "><subfield code="a">Description based on publisher supplied metadata and other sources.</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="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.</subfield></datafield><datafield tag="504" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references and index.</subfield></datafield><datafield tag="505" ind1="0" ind2=" "><subfield code="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.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Algorithms</subfield><subfield code="v">Congresses.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Matrius disperses</subfield><subfield code="2">thub</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Sistemes lineals</subfield><subfield code="2">thub</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Algorismes</subfield><subfield code="2">thub</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="a">Llibres electrònics</subfield><subfield code="2">thub</subfield></datafield><datafield tag="776" ind1=" " ind2=" "><subfield code="z">3-031-25819-3</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Tůma, Miroslav,</subfield><subfield code="e">editor.</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Nečas Center Series.</subfield></datafield><datafield tag="906" ind1=" " ind2=" "><subfield code="a">BOOK</subfield></datafield><datafield tag="ADM" ind1=" " ind2=" "><subfield code="b">2024-02-23 22:45:03 Europe/Vienna</subfield><subfield code="f">system</subfield><subfield code="c">marc21</subfield><subfield code="a">2023-05-13 19:28:35 Europe/Vienna</subfield><subfield code="g">false</subfield></datafield><datafield tag="AVE" ind1=" " ind2=" "><subfield code="i">DOAB Directory of Open Access Books</subfield><subfield code="P">DOAB Directory of Open Access Books</subfield><subfield code="x">https://eu02.alma.exlibrisgroup.com/view/uresolver/43ACC_OEAW/openurl?u.ignore_date_coverage=true&amp;portfolio_pid=5346030070004498&amp;Force_direct=true</subfield><subfield code="Z">5346030070004498</subfield><subfield code="b">Available</subfield><subfield code="8">5346030070004498</subfield></datafield></record></collection>

Similar Items