Distributed Newest Vertex Bisection
Martin Alk\"amper, Robert Kl\"ofkorn
TL;DR
This paper analyzes the bounds on iterations needed for distributed adaptive mesh refinement using newest vertex bisection, implementing the approach in DUNE-ALUGrid to improve efficiency.
Contribution
It provides theoretical bounds on iteration counts for distributed refinement and demonstrates implementation within a software package.
Findings
Bounds on maximum number of iterations established
Implementation in DUNE-ALUGrid software
Enhanced understanding of distributed mesh refinement efficiency
Abstract
Distributed adaptive conforming refinement requires multiple iterations of the serial refinement algorithm and global communication as the refinement can be propagated over several processor boundaries. We show bounds on the maximum number of iterations. The algorithm is implemented within the software package DUNE-ALUGrid.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.