Distributed Newest Vertex Bisection

Martin Alkämper; Robert Klöfkorn

doi:10.1016/j.jpdc.2016.12.003

Distributed Newest Vertex Bisection

Research output: Contribution to journal › Article › peer-review

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.

Original language	English
Pages (from-to)	1-11
Number of pages	11
Journal	Journal of Parallel and Distributed Computing
Volume	104
DOIs	https://doi.org/10.1016/j.jpdc.2016.12.003
Publication status	Published - 2017 Jun 1
Externally published	Yes

Free keywords

Adaptive method
DUNE
Mesh refinement
Parallel

Access to Document

10.1016/j.jpdc.2016.12.003

Cite this

@article{958c3c2e2ebc48d1859177c2fcda782c,

title = "Distributed Newest Vertex Bisection",

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.",

keywords = "Adaptive method, DUNE, Mesh refinement, Parallel",

author = "Martin Alk{\"a}mper and Robert Kl{\"o}fkorn",

year = "2017",

month = jun,

day = "1",

doi = "10.1016/j.jpdc.2016.12.003",

language = "English",

volume = "104",

pages = "1--11",

journal = "Journal of Parallel and Distributed Computing",

issn = "0743-7315",

publisher = "Academic Press",

}

TY - JOUR

T1 - Distributed Newest Vertex Bisection

AU - Alkämper, Martin

AU - Klöfkorn, Robert

PY - 2017/6/1

Y1 - 2017/6/1

N2 - 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.

AB - 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.

KW - Adaptive method

KW - DUNE

KW - Mesh refinement

KW - Parallel

UR - http://www.scopus.com/inward/record.url?scp=85011844262&partnerID=8YFLogxK

U2 - 10.1016/j.jpdc.2016.12.003

DO - 10.1016/j.jpdc.2016.12.003

M3 - Article

AN - SCOPUS:85011844262

SN - 0743-7315

VL - 104

SP - 1

EP - 11

JO - Journal of Parallel and Distributed Computing

JF - Journal of Parallel and Distributed Computing

ER -

Distributed Newest Vertex Bisection

Abstract

Free keywords

Access to Document

Other files and links

Fingerprint

Cite this