Recommendations
Cites work
- Bisection is not optimal on the average
- Bisection is optimal
- Deterministic and stochastic error bounds in numerical analysis
- scientific article; zbMATH DE number 3673243 (Why is no real title available?)
- scientific article; zbMATH DE number 3740677 (Why is no real title available?)
- scientific article; zbMATH DE number 44104 (Why is no real title available?)
- scientific article; zbMATH DE number 3476451 (Why is no real title available?)
- scientific article; zbMATH DE number 3537171 (Why is no real title available?)
- On the worst-case arithmetic complexity of approximating zeros of polynomials
- Optimal search for the roots of a function satisfying a lipschitz condition
- Optimal solution of nonlinear equations
- Random homeomorphisms
Cited in
(9)- Average errors for zero finding: Lower bounds
- Constructing prior distributions with trees of exchangeable processes
- Average errors for zero finding: Lower bounds for smooth or monotone functions
- Randomly generated distributions
- Some complexity results for zero finding for univariate functions
- scientific article; zbMATH DE number 4070191 (Why is no real title available?)
- scientific article; zbMATH DE number 89008 (Why is no real title available?)
- scientific article; zbMATH DE number 1206072 (Why is no real title available?)
- Determining zeroes of increasing Lipschitz functions
This page was built for publication: Average-case results for zero finding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q582817)