pith. sign in

arxiv: 1603.04891 · v1 · pith:UFRNEZNMnew · submitted 2016-03-15 · 💻 cs.DC · cs.NA· math.NA

Distributed Newest Vertex Bisection

classification 💻 cs.DC cs.NAmath.NA
keywords refinementalgorithmdistributediterationsadaptivebisectionboundariesbounds
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.