%0 Journal Article %1 alkamper2017distributed %A Alkämper, Martin %A Klöfkorn, Robert %D 2017 %J Journal of Parallel and Distributed Computing %K Adaptive from:mhartmann ians method vorlaeufig %P 1 - 11 %R http://dx.doi.org/10.1016/j.jpdc.2016.12.003 %T Distributed Newest Vertex Bisection %U http://www.sciencedirect.com/science/article/pii/S0743731516301782 %V 104 %X 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 open-source software package Dune-ALUGrid.

@article{alkamper2017distributed, 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 open-source software package Dune-ALUGrid.}, added-at = {2018-07-20T10:54:57.000+0200}, author = {Alk{\"a}mper, Martin and Kl{\"o}fkorn, Robert}, biburl = {https://puma.ub.uni-stuttgart.de/bibtex/2cb88371212f23f2387c876de0c82ad50/mathematik}, doi = {http://dx.doi.org/10.1016/j.jpdc.2016.12.003}, interhash = {20fdeaf87d8fa0f67305283fd3e0234d}, intrahash = {cb88371212f23f2387c876de0c82ad50}, issn = {0743-7315}, journal = {Journal of Parallel and Distributed Computing}, keywords = {Adaptive from:mhartmann ians method vorlaeufig}, pages = {1 - 11}, timestamp = {2019-12-18T14:37:55.000+0100}, title = {Distributed Newest Vertex Bisection}, url = {http://www.sciencedirect.com/science/article/pii/S0743731516301782}, volume = 104, year = 2017 }