Determining zeroes of increasing Lipschitz functions

DOI10.1007/BF02227451MaRDI QIDQ803731zbMATH OpenFDO

Authors 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)

Recommendations

• Determination of the roots and of the global extremum of a lipschitz function
• Average-case results for zero finding
• Average errors for zero finding: Lower bounds for smooth or monotone functions
• scientific article; zbMATH DE number 4037050
• Average-Case Optimality of a Hybrid Secant-Bisection Method

Cites work

• scientific article; zbMATH DE number 193625 (Why is no real title available?)
• 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
• The concept of sequential optimality for problems in numerical analysis

This page was built for publication: Determining zeroes of increasing Lipschitz functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q803731)