A Proof of Convergence and an Error Bound for the Method of Bisection in R n
From MaRDI portal
Publication:4178403
DOI10.2307/2006341zbMATH Open0395.65021OpenAlexW4255264496MaRDI QIDQ4178403FDOQ4178403
Publication date: 1978
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2006341
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
- Improved Maximum Angle Estimate for Longest-Edge Bisection
- 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
- 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
- On Faster Convergence of the Bisection Method for Certain Triangles
- A mathematical proof of how fast the diameters of a triangle mesh tend to zero after repeated trisection
- 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)
