Extensions of Certain Graph-based Algorithms for Preconditioning

DOI10.1137/060661284MaRDI QIDQ3525959zbMATH OpenOpenAlexWikidataFDO

Authors David Fritzsche, Andreas Frommer, Daniel B. Szyld

Publication date 23 September 2008

Published in SIAM Journal on Scientific Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/060661284

zbMATH Keywords

block Gauss-Seidelblock partitioningILU decompositionnumerical examplespreconditioningthreshold parametrized block ordering (TPABLO) algorithms

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35)

Recommendations

• scientific article; zbMATH DE number 1304519
• A Block Ordering Method for Sparse Matrices
• Diagonal threshold techniques in robust multi-level ILU preconditioners for general sparse linear systems
• Finding Exact and Approximate Block Structures for ILU Preconditioning
• Preconditioners based on strong subgraphs

Cited in

(4)

• A Block Ordering Method for Sparse Matrices
• scientific article; zbMATH DE number 1304519 (Why is no real title available?)
• Support-Graph Preconditioners
• \(\text{PSPIKE}+\): A family of parallel hybrid sparse linear system solvers

Describes a project that uses

Uses Software

• SparseMatrix
• MA57
• XPABLO

This page was built for publication: Extensions of Certain Graph-based Algorithms for Preconditioning

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