Effects of problem decomposition (partitioning) on the rate of convergence of parallel numerical algorithms
From MaRDI portal
Publication:5317893
DOI10.1002/nla.323zbMath1071.65193OpenAlexW2032846647MaRDI QIDQ5317893
Miroslav Tůma, Keith Johnson, 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
Parallel numerical computation (65Y05) Multigrid methods; domain decomposition for initial value and initial-boundary value problems involving PDEs (65M55)
Related Items (2)
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
Cites Work
This page was built for publication: Effects of problem decomposition (partitioning) on the rate of convergence of parallel numerical algorithms
