Pages that link to "Item:Q913453"
From MaRDI portal
The following pages link to Asymptotic near optimality of the bisection method (Q913453):
Displaying 14 items.
- On the complexity of isolating real roots and computing with certainty the topological degree (Q700184) (← links)
- Noisy information for linear problems in the asymptotic setting (Q806961) (← links)
- Lepp-bisection algorithms, applications and mathematical properties (Q1030788) (← links)
- Optimal solution of nonlinear equations (Q1086985) (← links)
- Bisection is optimal (Q1168053) (← links)
- RFSFNS: A portable package for the numerical determination of the number and the calculation of roots of Bessel functions (Q1269369) (← links)
- Why does information-based complexity use the real number model? (Q1292417) (← links)
- Bisection hardly ever converges linearly (Q1347031) (← links)
- Complexity of the bisection method (Q2381525) (← links)
- A polylogarithmic approximation of the minimum bisection (Q2784494) (← links)
- (Q3795154) (← links)
- Average-Case Optimality of a Hybrid Secant-Bisection Method (Q4878510) (← links)
- An Enhancement of the Bisection Method Average Performance Preserving Minmax Optimality (Q5025219) (← links)
- Bisections above Tight Lower Bounds (Q5200505) (← links)