On Faster Convergence of the Bisection Method for all Triangles

DOI10.2307/2006385zbMath0463.65005OpenAlexW4240954566MaRDI QIDQ3914301

Martin Stynes

Publication date: 1980

Full work available at URL: https://doi.org/10.2307/2006385

zbMATH Keywords

convergencebisection methodtriangles

Mathematics Subject Classification ID

Polyhedra and polytopes; regular figures, division of spaces (51M20) Degree, winding number (55M25) Algorithms for approximation of functions (65D15)

Related Items (16)

Complexity of the bisection method ⋮ Flexible multibody dynamics and adaptive finite element techniques for model synthesis and estimation ⋮ Properties of triangulations obtained by the longest-edge bisection ⋮ Improved Maximum Angle Estimate for Longest-Edge Bisection ⋮ Multithread parallelization of LEPP-bisection algorithms ⋮ On angle conditions in the finite element method ⋮ 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 ⋮ 3D adaptive mesh refinement ⋮ On the non-degeneracy property of the longest-edge trisection of triangles ⋮ On the Shape of Tetrahedra from Bisection ⋮ Longest-edge \(n\)-section algorithms: properties and open problems ⋮ Local refinement based on the 7-triangle longest-edge partition ⋮ Lepp-bisection algorithms, applications and mathematical properties ⋮ Non-degeneracy study of the 8-tetrahedra longest-edge partition ⋮ On generalized bisection of 𝑛-simplices

Cites Work

• On \(C^1\)-complexes
• A Lower Bound on the Angles of Triangles Constructed by Bisecting the Longest Side
• 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

This page was built for publication: On Faster Convergence of the Bisection Method for all Triangles