A Proof of Convergence and an Error Bound for the Method of Bisection in R n

DOI10.2307/2006341MaRDI QIDQ4178403zbMATH OpenOpenAlexFDO

Authors Ralph Baker Kearfott

Publication date 1978

Published in Mathematics of Computation (Search for Journal in Brave)

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

zbMATH Keywords

Error BoundsSystems of Nonlinear EquationsBisection Method in Rn- SpaceSimplexes

Mathematics Subject Classification ID

Numerical computation of solutions to systems of equations (65H10) Degree, winding number (55M25) Software, source code, etc. for problems pertaining to combinatorics (05-04)

Cited in

(15)

• On the Shape of Tetrahedra from Bisection
• Survey on generalizations of the intermediate value theorem and applications
• Longest-edge \(n\)-section algorithms: properties and open problems
• Lepp-bisection algorithms, applications and mathematical properties
• On global and local mesh refinements by a generalized conforming bisection algorithm
• On the exhaustivity of simplicial partitioning
• Complexity of the bisection method
• Improved maximum angle estimate for longest-edge bisection
• Generalizations of the Intermediate Value Theorem for Approximating Fixed Points and Zeros of Continuous Functions
• 3D adaptive mesh refinement
• On Faster Convergence of the Bisection Method for all Triangles
• A mathematical proof of how fast the diameters of a triangle mesh tend to zero after repeated trisection
• On Faster Convergence of the Bisection Method for Certain Triangles
• On generalized bisection of 𝑛-simplices
• On smooth reformulations and direct non-smooth computations for minimax problems

This page was built for publication: A Proof of Convergence and an Error Bound for the Method of Bisection in R n

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4178403)