Pages that link to "Item:Q4878510"
From MaRDI portal
The following pages link to Average-Case Optimality of a Hybrid Secant-Bisection Method (Q4878510):
Displaying 16 items.
- Adaptive approximation of the minimum of Brownian motion (Q511112) (← links)
- A lower bound on complexity of optimization under the \(r\)-fold integrated Wiener measure (Q544129) (← links)
- Average-case results for zero finding (Q582817) (← links)
- Determining zeroes of increasing Lipschitz functions (Q803731) (← links)
- Average errors for zero finding: Lower bounds (Q1204311) (← links)
- Why does information-based complexity use the real number model? (Q1292417) (← links)
- An infinite precision bracketing algorithm with guaranteed convergence (Q1293733) (← links)
- Efficient hybrid algorithms for finding zeros of convex functions (Q1333238) (← links)
- Combining binary search and Newton's method to compute real roots for a class of real functions (Q1336478) (← links)
- A new trigonometrical algorithm for computing real root of non-linear transcendental equations (Q1738746) (← links)
- Lower bound on complexity of optimization of continuous functions (Q1888381) (← links)
- A modified Brent's method for finding zeros of functions (Q1938820) (← links)
- A method to accelerate the convergence of the secant algorithm (Q2260479) (← links)
- A note on two fixed point problems (Q2465828) (← links)
- (Q4984904) (← links)
- ON NEW HYBRID ROOT-FINDING ALGORITHMS FOR SOLVING TRANSCENDENTAL EQUATIONS USING EXPONENTIAL AND HALLEY'S METHODS (Q6081709) (← links)
