Pages that link to "Item:Q4178403"
From MaRDI portal
The following pages link to A Proof of Convergence and an Error Bound for the Method of Bisection in R n (Q4178403):
Displaying 15 items.
- On smooth reformulations and direct non-smooth computations for minimax problems (Q386469) (← links)
- Longest-edge \(n\)-section algorithms: properties and open problems (Q747921) (← links)
- Lepp-bisection algorithms, applications and mathematical properties (Q1030788) (← links)
- On global and local mesh refinements by a generalized conforming bisection algorithm (Q1959467) (← links)
- Survey on generalizations of the intermediate value theorem and applications (Q2109973) (← links)
- A mathematical proof of how fast the diameters of a triangle mesh tend to zero after repeated trisection (Q2229910) (← links)
- Complexity of the bisection method (Q2381525) (← links)
- On the exhaustivity of simplicial partitioning (Q2442641) (← links)
- On generalized bisection of 𝑛-simplices (Q3127327) (← links)
- On Faster Convergence of the Bisection Method for all Triangles (Q3914301) (← links)
- On Faster Convergence of the Bisection Method for Certain Triangles (Q4191501) (← links)
- 3D adaptive mesh refinement (Q4213690) (← links)
- On the Shape of Tetrahedra from Bisection (Q4305978) (← links)
- Improved Maximum Angle Estimate for Longest-Edge Bisection (Q5104664) (← links)
- Generalizations of the Intermediate Value Theorem for Approximating Fixed Points and Zeros of Continuous Functions (Q5122292) (← links)
