Determining zeroes of increasing Lipschitz functions

DOI10.1007/BF02227451zbMath0727.65040MaRDI QIDQ803731

Erich Novak

Publication date: 1991

Published in: Aequationes Mathematicae (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/137403

zbMATH Keywords

iterative methodsaverage case behaviorsequentially optimal algorithmzeroes of increasing Lipschitz functions

Mathematics Subject Classification ID

Numerical computation of solutions to single equations (65H05)

Cites Work

• Unnamed Item
• The concept of sequential optimality for problems in numerical analysis
• 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: Determining zeroes of increasing Lipschitz functions