Average errors for zero finding: Lower bounds for smooth or monotone functions

DOI10.1007/BF01832985zbMath0809.65044MaRDI QIDQ1339671

Klaus Ritter

Publication date: 7 December 1994

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

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

zbMATH Keywords

error analysissuperlinear convergencemonotone functionssmooth functionszero finding

Mathematics Subject Classification ID

Roundoff error (65G50) Numerical computation of solutions to single equations (65H05)

Related Items (2)

Average-Case Optimality of a Hybrid Secant-Bisection Method ⋮ Why does information-based complexity use the real number model?

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Average-case results for zero finding
• Random homeomorphisms
• Approximation of linear functionals on a Banach space with a Gaussian measure
• Optimal solution of nonlinear equations
• Bisection is not optimal on the average
• Study of linear information for classes of polynomial equations
• Average errors for zero finding: Lower bounds
• Some complexity results for zero finding for univariate functions
• The average error of quadrature formulas for functions of bounded variation
• On the efficiency of algorithms of analysis
• Quadrature Formulas for Monotone Functions
• Complexity of Computations with Matrices and Polynomials
• On the Efficiency of Newton's Method in Approximating All Zeros of a System of Complex Polynomials
• The “Pegasus” method for computing the root of an equation
• An improved pegasus method for root finding

This page was built for publication: Average errors for zero finding: Lower bounds for smooth or monotone functions