Solving Parametric Sparse Linear Systems by Local Blocking

DOI10.1007/978-3-319-10515-4_29MaRDI QIDQ2879345zbMATH OpenOpenAlexFDO

Authors Tateaki Sasaki, Daiju Inaba, Fujio Kako

Publication date 8 September 2014

Published in Computer Algebra in Scientific Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-10515-4_29

zbMATH Keywords

application-oriented methodblock triangularizationlocal blocksparametric sparse linear systemstrongly connected subgraph

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10) Computational methods for sparse matrices (65F50)

Recommendations

• A block algorithm of Lanczos type for solving sparse systems of linear equations
• scientific article; zbMATH DE number 434542
• Version of block Lanczos-type algorithm for solving sparse linear systems
• scientific article; zbMATH DE number 3992794
• scientific article; zbMATH DE number 440681
• On Solving Block-Structured Indefinite Linear Systems
• Reordering strategy for blocking optimization in sparse linear solvers
• Sparse Approximate Solutions to Linear Systems

Cited in

(1)

• A Bridge between Euclid and Buchberger: (An Attempt to Enhance Gröbner Basis Algorithm by PRSs and GCDs)

This page was built for publication: Solving Parametric Sparse Linear Systems by Local Blocking

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2879345)