On Faster Convergence of the Bisection Method for Certain Triangles
From MaRDI portal
Polyhedra and polytopes; regular figures, division of spaces (51M20) Length, area and volume in real or complex geometry (51M25) Algorithms for approximation of functions (65D15) Numerical approximation and computational geometry (primarily algorithms) (65D99) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30)
Cites work
- 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
- On the construction of sufficient refinements for computation of topological degree
Cited in
(9)- 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
- Tuned terminal triangles centroid Delaunay algorithm for quality triangulation
- 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 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 Certain Triangles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4191501)
