Multithread parallelization of Lepp-bisection algorithms

Longest edge (nested) algorithms for triangulation refinement in two dimensions are able to produce hierarchies of quality and nested irregular triangulations as needed both for adaptive finite element methods and for multigrid methods. They can be formulated in terms of the longest edge propagation...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Applied numerical mathematics Jg. 62; H. 4; S. 473 - 488
Hauptverfasser: Rivara, Maria-Cecilia, Rodriguez, Pedro, Montenegro, Rafael, Jorquera, Gaston
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Elsevier B.V 01.04.2012
Schlagworte:
Algorithms
Charge
Finite element method
Lepp-bisection algorithm
Longest edge bisection
Mathematical analysis
Parallel multithread refinement
Refining
Synchronism
Terminals
Triangles
Triangulation
Triangulation refinement
Finite element method
Parallel multithread refinement
Lepp-bisection algorithm
Triangulation refinement
Longest edge bisection
ISSN:0168-9274, 1873-5460
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Longest edge (nested) algorithms for triangulation refinement in two dimensions are able to produce hierarchies of quality and nested irregular triangulations as needed both for adaptive finite element methods and for multigrid methods. They can be formulated in terms of the longest edge propagation path (Lepp) and terminal edge concepts, to refine the target triangles and some related neighbors. We discuss a parallel multithread algorithm, where every thread is in charge of refining a triangle t and its associated Lepp neighbors. The thread manages a changing Lepp(t) (ordered set of increasing triangles) both to find a last longest (terminal) edge and to refine the pair of triangles sharing this edge. The process is repeated until triangle t is destroyed. We discuss the algorithm, related synchronization issues, and the properties inherited from the serial algorithm. We present an empirical study that shows that a reasonably efficient parallel method with good scalability was obtained.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:0168-9274
1873-5460
DOI:10.1016/j.apnum.2011.07.011