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

DOI10.2307/2006341zbMath0395.65021OpenAlexW4255264496MaRDI QIDQ4178403

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)

Related Items (15)

Complexity of the bisection method ⋮ On Faster Convergence of the Bisection Method for Certain Triangles ⋮ On smooth reformulations and direct non-smooth computations for minimax problems ⋮ On Faster Convergence of the Bisection Method for all Triangles ⋮ Improved Maximum Angle Estimate for Longest-Edge Bisection ⋮ Generalizations of the Intermediate Value Theorem for Approximating Fixed Points and Zeros of Continuous Functions ⋮ On the exhaustivity of simplicial partitioning ⋮ 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 Shape of Tetrahedra from Bisection ⋮ Longest-edge \(n\)-section algorithms: properties and open problems ⋮ Lepp-bisection algorithms, applications and mathematical properties ⋮ On generalized bisection of 𝑛-simplices ⋮ Survey on generalizations of the intermediate value theorem and applications

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