Effects of problem decomposition (partitioning) on the rate of convergence of parallel numerical algorithms

DOI10.1002/NLA.323MaRDI QIDQ5317893zbMATH OpenOpenAlexFDO

Authors Keith Johnson, Miroslav Tuma, Jane K. Cullum

Publication date 21 September 2005

Published in Numerical Linear Algebra with Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/nla.323

zbMATH Keywords

graph partitioningparallel algorithmsproblem decompositionrate of convergence

Mathematics Subject Classification ID

Multigrid methods; domain decomposition for initial value and initial-boundary value problems involving PDEs (65M55) Parallel numerical computation (65Y05)

Recommendations

• The effect of the number of processors on the convergence of the parallel block Jacobi method
• Convergence analysis of a domain decomposition paradigm
• Partitioning and dynamic load balancing for the numerical solution of partial differential equations
• scientific article; zbMATH DE number 3862363
• Parallel efficiency of domain decomposition methods

Cites work

• Coverings of Bipartite Graphs

Cited in

(4)

• On the impact of heterogeneity-aware mesh partitioning and non-contributing computation removal on parallel reservoir simulations
• The effect of graph partitioning techniques on parallel block FSAI preconditioning: a computational study
• The influence of partitioning on domain decomposition convergence rates
• The effect of the number of processors on the convergence of the parallel block Jacobi method

This page was built for publication: Effects of problem decomposition (partitioning) on the rate of convergence of parallel numerical algorithms

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