On global and local mesh refinements by a generalized conforming bisection algorithm

DOI10.1016/j.cam.2010.05.046zbMath1207.65145OpenAlexW2150727680MaRDI QIDQ1959467

Antti Hannukainen, Sergey Korotov, Michal Křížek

Publication date: 7 October 2010

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2010.05.046

zbMATH Keywords

convergencenumerical resultsfinite element methodmesh refinementmesh density functionconforming bisection algorithmnested triangulations

Mathematics Subject Classification ID

Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Numerical computation of solutions to single equations (65H05) Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs (65N50)

Related Items

A Weak Compatibility Condition for Newest Vertex Bisection in Any Dimension ⋮ Properties of triangulations obtained by the longest-edge bisection ⋮ Improved Maximum Angle Estimate for Longest-Edge Bisection ⋮ The minimum angle condition for \(d\)-simplices ⋮ On angle conditions in the finite element method ⋮ Generalization of the Zlamal condition for simplicial finite elements in \(\mathbb {R}^{d}\) ⋮ A mathematical proof of how fast the diameters of a triangle mesh tend to zero after repeated trisection ⋮ Longest-edge \(n\)-section algorithms: properties and open problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the equivalence of regularity criteria for triangular and tetrahedral finite element partitions
• Lepp-bisection algorithms, applications and mathematical properties
• Local refinement of simplicial grids based on the skeleton
• On the finite element method
• On generalized bisection of 𝑛-simplices
• Algorithms for refining triangular grids suitable for adaptive and multigrid techniques
• A bisection method for systems of nonlinear equations
• Selective refinement/derefinement algorithms for sequences of nested triangulations
• On the Bisection Method for Triangles
• On Faster Convergence of the Bisection Method for all Triangles
• Local mesh refinement in 2 and 3 dimensions
• A 3-D refinement algorithm suitable for adaptive and multi-grid techniques
• A Lower Bound on the Angles of Triangles Constructed by Bisecting the Longest Side
• Optimal Dissection of Simplices
• A Proof of Convergence and an Error Bound for the Method of Bisection in R n
• On Faster Convergence of the Bisection Method for Certain Triangles
• A Three-Dimensional Analogue to the Method of Bisections for Solving Nonlinear Equations
• On the Shape of Tetrahedra from Bisection
• AN ADAPTIVE FINITE ELEMENT METHOD WITH EFFICIENT MAXIMUM NORM ERROR CONTROL FOR ELLIPTIC PROBLEMS
• Local Bisection Refinement for N-Simplicial Grids Generated by Reflection
• Locally Adapted Tetrahedral Meshes Using Bisection
• The 4-triangles longest-side partition of triangles and linear refinement algorithms
• Quality Local Refinement of Tetrahedral Meshes Based on Bisection
• The completion of locally refined simplicial partitions created by bisection