On Faster Convergence of the Bisection Method for Certain Triangles

DOI10.2307/2006306zbMath0405.65010OpenAlexW4243780036MaRDI QIDQ4191501

Martin Stynes

Publication date: 1979

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

zbMATH Keywords

TrianglesRate of ConvergenceFaster ConvergenceBisection Method

Mathematics Subject Classification ID

Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Polyhedra and polytopes; regular figures, division of spaces (51M20) Algorithms for approximation of functions (65D15) Length, area and volume in real or complex geometry (51M25) Numerical approximation and computational geometry (primarily algorithms) (65D99)

Related Items

On Faster Convergence of the Bisection Method for all Triangles, Properties of triangulations obtained by the longest-edge bisection, On angle conditions in the finite element method, On global and local mesh refinements by a generalized conforming bisection algorithm, Tuned Terminal Triangles Centroid Delaunay Algorithm for Quality Triangulation, A mathematical proof of how fast the diameters of a triangle mesh tend to zero after repeated trisection, On the non-degeneracy property of the longest-edge trisection of triangles, Longest-edge \(n\)-section algorithms: properties and open problems

Cites Work

• On the construction of sufficient refinements for computation of topological degree
• 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
• An algorithm for numerical calculation of topological degree