Segmental Refinement: A Multigrid Technique for Data Locality

DOI10.1137/140975127zbMath1375.65167arXiv1406.7808MaRDI QIDQ3186115

Matthew G. Knepley, Jed Brown, Mark F. Adams, Ravi Samtaney

Publication date: 8 August 2016

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

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

zbMATH Keywords

multigrid; nonlinear elliptic boundary value problems; communication complexity; parallel multigrid; distributed memory multigrid; segmental refinement

Mathematics Subject Classification ID

65N55: Multigrid methods; domain decomposition for boundary value problems involving PDEs

35J60: Nonlinear elliptic equations

65Y05: Parallel numerical computation

65Y20: Complexity and performance of numerical algorithms

Related Items

Exploiting spatial symmetries for solving Poisson's equation, Fast multipole preconditioners for sparse matrices arising from elliptic equations, Resilience for Massively Parallel Multigrid Solvers

Uses Software

• SRGMG

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Toward textbook multigrid efficiency for fully implicit resistive magnetohydrodynamics
• Multigrid Techniques
• An Optimal Order Process for Solving Finite Element Equations
• Multi-Level Adaptive Solutions to Boundary-Value Problems
• A relaxation method for solving elliptic difference equations
• Textbook multigrid efficiency for the incompressible Navier-Stokes equations: High Reynolds number wakes and boundary layers