Bisection is optimal

DOI10.1007/BF01459080MaRDI QIDQ1168053zbMATH OpenFDO

Authors S. Singh

Publication date 1982

Published in Numerische Mathematik (Search for Journal in Brave)

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

zbMATH Keywords

bisection algorithmsimple zerozero of a continuous function

Mathematics Subject Classification ID

Numerical computation of solutions to single equations (65H05)

Cites work

• Asymptotic near optimality of the bisection method
• scientific article; zbMATH DE number 3688714 (Why is no real title available?)
• scientific article; zbMATH DE number 3537171 (Why is no real title available?)
• scientific article; zbMATH DE number 3388498 (Why is no real title available?)

Cited in

(36)

• Optimal solution of nonlinear equations satisfying a Lipschitz condition
• A survey of information-based complexity
• For which error criteria can we solve nonlinear equations?
• Optimal solution of nonlinear equations
• Complexity of fixed points. I
• Asymptotic error of algorithms for solving nonlinear problems
• On a class of omnibus algorithms for zero-finding
• Can we approximate zeros of functions with nonzero topological degree?
• Bisection is not optimal on the average
• Study of linear information for classes of polynomial equations
• RFSFNS: A portable package for the numerical determination of the number and the calculation of roots of Bessel functions
• Why does information-based complexity use the real number model?
• Some globally convergent iterative method based on the bisection iteration for solving nonlinear scalar equations
• From linear to nonlinear iterative methods
• A dimension-reducing method for unconstrained optimization
• Survey on generalizations of the intermediate value theorem and applications
• Absolute value information for IBC problems
• A note on two fixed point problems
• Solving systems of nonlinear equations In using a rotating hyperplane in
• Recent developments in information-based complexity
• The implicit function theorem for solving systems of nonlinear equations in
• A dimension-reducing method for solving systems of nonlinear equations in
• Generalizations of the Intermediate Value Theorem for Approximating Fixed Points and Zeros of Continuous Functions
• Topological degree theory and local analysis of area preserving maps
• Complexity of computing topological degree of Lipschitz functions in n dimensions
• Adaption helps for some nonconvex classes
• Average-case results for zero finding
• Application of the characteristic bisection method for locating and computing periodic orbits in molecular systems
• Locating and computing in parallel all the simple roots of special functions using PVM
• On the complexity of rational verification
• Approximate peak time and its application to time-domain fluorescence diffuse optical tomography
• On the complexity of isolating real roots and computing with certainty the topological degree
• Can adaption help on the average?
• Determining zeroes of increasing Lipschitz functions
• On sequential and parallel solution of initial value problems
• Asymptotic near optimality of the bisection method

Describes a project that uses

Uses Software

• BRENT

This page was built for publication: Bisection is optimal

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