Multithread parallelization of LEPP-bisection algorithms

DOI10.1016/J.APNUM.2011.07.011MaRDI QIDQ412318zbMATH OpenOpenAlexFDO

Authors Maria-Cecilia Rivara, Pedro Rodriguez, R. Montenegro, Gaston Jorquera

Publication date 4 May 2012

Published in Applied Numerical Mathematics (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/10553/16340

zbMATH Keywords

numerical examplesfinite element method-bisection algorithmlongest edge bisectionlongest edge propagation path (LEPP)parallel multithread refinementtriangulation refinement

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs (65N50)

Recommendations

• Parallel Implementation of Lemke's Algorithm on the Hypercube
• On a parallel Lehmer-Euclid GCD algorithm
• Bisection technique for designing synchronous parallel algorithms
• Parallel algorithms and architectures for multisplitting iterative methods
• scientific article; zbMATH DE number 4070182
• Parallelization of diacoptic methods for multiprocessor computing systems
• Parallelization of the Buchberger algorithm
• scientific article; zbMATH DE number 741111
• Multisplittings and parallel iterative methods

Cites work

• scientific article; zbMATH DE number 3978331 (Why is no real title available?)
• scientific article; zbMATH DE number 50052 (Why is no real title available?)
• scientific article; zbMATH DE number 3633698 (Why is no real title available?)
• A 3-D refinement algorithm suitable for adaptive and multi-grid techniques
• A Delaunay Refinement Algorithm for Quality 2-Dimensional Mesh Generation
• A Lower Bound on the Angles of Triangles Constructed by Bisecting the Longest Side
• ASPECTS OF 2-D DELAUNAY MESH GENERATION
• Adaptive refinement of unstructured finite-element meshes
• Algorithm 872
• Algorithms for refining triangular grids suitable for adaptive and multigrid techniques
• An algorithm for adaptive refinement of triangular element meshes
• Automatic mesh generator with specified boundary
• Complexity of the bisection method
• Constrained Delaunay triangulations
• Delaunay refinement algorithms for triangular mesh generation
• Design and data structure of fully adaptive, multigrid, finite-element software
• Generalized two-dimensional Delaunay mesh refinement
• Lepp-bisection algorithms, applications and mathematical properties
• New longest-edge algorithms for the refinement and/or improvement of unstructured triangulations
• On Faster Convergence of the Bisection Method for all Triangles
• On the Angle Condition in the Finite Element Method
• On the Bisection Method for Triangles
• Parallel Algorithms for Adaptive Mesh Refinement
• Parallel Programming
• Parallel automatic adaptive analysis
• Quality Local Refinement of Tetrahedral Meshes Based on Bisection
• Selective refinement/derefinement algorithms for sequences of nested triangulations
• Simple algorithm for adaptive refinement of three-dimensional finite element tetrahedral meshes
• Triangulations in CGAL

Cited in

(2)

• Lepp-bisection algorithms, applications and mathematical properties
• Parallel triangular mesh refinement by longest edge bisection

Describes a project that uses

Uses Software

• Algorithm 872
• 2D triangulations
• 3D triangulations
• Triangle
• CGAL

This page was built for publication: Multithread parallelization of LEPP-bisection algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q412318)