Average-case results for zero finding
From MaRDI portal
Publication:582817
DOI10.1016/0885-064X(89)90022-8zbMath0691.65030MaRDI QIDQ582817
Publication date: 1989
Published in: Journal of Complexity (Search for Journal in Brave)
Related Items (4)
Average errors for zero finding: Lower bounds for smooth or monotone functions ⋮ Randomly generated distributions ⋮ Average errors for zero finding: Lower bounds ⋮ Constructing prior distributions with trees of exchangeable processes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Random homeomorphisms
- Optimal solution of nonlinear equations
- On the worst-case arithmetic complexity of approximating zeros of polynomials
- Bisection is not optimal on the average
- Bisection is optimal
- Deterministic and stochastic error bounds in numerical analysis
- Optimal search for the roots of a function satisfying a lipschitz condition
This page was built for publication: Average-case results for zero finding