On Faster Convergence of the Bisection Method for all Triangles
From MaRDI portal
Cites work
Cited in
(17)- Local refinement based on the 7-triangle longest-edge partition
- Lepp-bisection algorithms, applications and mathematical properties
- Flexible multibody dynamics and adaptive finite element techniques for model synthesis and estimation
- On global and local mesh refinements by a generalized conforming bisection algorithm
- A mathematical proof of how fast the diameters of a triangle mesh tend to zero after repeated trisection
- Complexity of the bisection method
- Non-degeneracy study of the 8-tetrahedra longest-edge partition
- On generalized bisection of 𝑛-simplices
- Properties of triangulations obtained by the longest-edge bisection
- Multithread parallelization of LEPP-bisection algorithms
- 3D adaptive mesh refinement
- On the Shape of Tetrahedra from Bisection
- On angle conditions in the finite element method
- Improved maximum angle estimate for longest-edge bisection
- On the orbits of similarity classes of tetrahedra generated by the longest-edge bisection algorithm.
- Longest-edge \(n\)-section algorithms: properties and open problems
- On the non-degeneracy property of the longest-edge trisection of triangles
This page was built for publication: On Faster Convergence of the Bisection Method for all Triangles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3914301)