Graph Partitioning Using Matrix Values for Preconditioning Symmetric Positive Definite Systems

DOI10.1137/120898760zbMath1290.65025arXiv1110.5709OpenAlexW2010869651MaRDI QIDQ5418026

Yousef Saad, Eugene Vecharynski, Masha Sosonkina

Publication date: 26 May 2014

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

Full work available at URL: https://arxiv.org/abs/1110.5709

zbMATH Keywords

convergencenumerical experimentspreconditioninggraph partitioningsymmetric positive definitespectral partitioningCauchy-Bunyakowski-Schwarz (CBS) constantiterative linear system solution

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10) Preconditioners for iterative methods (65F08)

Related Items (9)

Convergence theory for preconditioned eigenvalue solvers in a nutshell ⋮ On the impact of heterogeneity-aware mesh partitioning and non-contributing computation removal on parallel reservoir simulations ⋮ How to Generate Effective Block Jacobi Preconditioners for Solving Large Sparse Linear Systems ⋮ Multi-level spectral graph partitioning method ⋮ \(\text{PSPIKE}+\): A family of parallel hybrid sparse linear system solvers ⋮ Parallel GNFS algorithm integrated with parallel block Wiedemann algorithm for RSA security in cloud computing ⋮ On adaptive BDDC for the flow in heterogeneous porous media. ⋮ Parallelization of Hermitian positive definite systems of equations: a hierarchical Jacobi approach ⋮ The effect of graph partitioning techniques on parallel block FSAI preconditioning: a computational study

Uses Software

• METIS
• JOSTLE
• SPARSKIT
• Scotch
• Chaco

This page was built for publication: Graph Partitioning Using Matrix Values for Preconditioning Symmetric Positive Definite Systems