Parallel Triangular Mesh Refinement by Longest Edge Bisection

DOI10.1137/140973840zbMath1323.65104OpenAlexW2135141146MaRDI QIDQ3447471

Bilal Hatipoglu, Can Özturan

Publication date: 27 October 2015

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/28ee3709515677725e0745c466e5f7dd6a4fec1c

zbMATH Keywords

unstructured meshparalleladaptive refinement

Mathematics Subject Classification ID

Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs (65N50) Mesh generation, refinement, and adaptive methods for the numerical solution of initial value and initial-boundary value problems involving PDEs (65M50)

Uses Software

• CUDA
• p4est
• CUDPP

Cites Work

• Unnamed Item
• Multithread parallelization of LEPP-bisection algorithms
• Parallel tetrahedral mesh adaptation with dynamic load balancing
• p4est: Scalable Algorithms for Parallel Adaptive Mesh Refinement on Forests of Octrees
• Algorithms for refining triangular grids suitable for adaptive and multigrid techniques
• Mesh Refinement Processes Based on the Generalized Bisection of Simplices
• On the Angle Condition in the Finite Element Method
• Parallel Algorithms for Adaptive Mesh Refinement
• The 4-triangles longest-side partition of triangles and linear refinement algorithms
• Condition of finite element matrices generated from nonuniform meshes.

This page was built for publication: Parallel Triangular Mesh Refinement by Longest Edge Bisection