Bisection is optimal
From MaRDI portal
Publication:1168053
DOI10.1007/BF01459080zbMath0492.65027MaRDI QIDQ1168053
Publication date: 1982
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/132819
Related Items (35)
From linear to nonlinear iterative methods ⋮ A survey of information-based complexity ⋮ Some globally convergent iterative method based on the bisection iteration for solving nonlinear scalar equations ⋮ 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 ⋮ A dimension-reducing method for solving systems of nonlinear equations in ⋮ A dimension-reducing method for unconstrained optimization ⋮ Study of linear information for classes of polynomial equations ⋮ Solving systems of nonlinear equations In using a rotating hyperplane in ⋮ On the complexity of rational verification ⋮ Recent developments in information-based complexity ⋮ On sequential and parallel solution of initial value problems ⋮ Generalizations of the Intermediate Value Theorem for Approximating Fixed Points and Zeros of Continuous Functions ⋮ Asymptotic near optimality of the bisection method ⋮ Topological degree theory and local analysis of area preserving maps ⋮ A note on two fixed point problems ⋮ The implicit function theorem for solving systems of nonlinear equations in ⋮ On the complexity of isolating real roots and computing with certainty the topological degree ⋮ 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 ⋮ Complexity of computing topological degree of Lipschitz functions in n dimensions ⋮ Adaption helps for some nonconvex classes ⋮ Average-case results for zero finding ⋮ Absolute value information for IBC problems ⋮ RFSFNS: A portable package for the numerical determination of the number and the calculation of roots of Bessel functions ⋮ Can adaption help on the average? ⋮ Why does information-based complexity use the real number model? ⋮ Optimal solution of nonlinear equations satisfying a Lipschitz condition ⋮ Determining zeroes of increasing Lipschitz functions ⋮ Survey on generalizations of the intermediate value theorem and applications
Uses Software
Cites Work
This page was built for publication: Bisection is optimal