scientific article; zbMATH DE number 4037051

MaRDI QIDQ3776504zbMATH OpenFDO

Authors Ernst-Erich Doberkat

Publication date 1987

zbMATH Keywords

bisection methodbrute forceupper bound for the expected complexityzeros of a continuous function

Mathematics Subject Classification ID

Numerical computation of solutions to single equations (65H05)

Recommendations

• Some complexity results for zero finding for univariate functions
• scientific article; zbMATH DE number 1131781
• On the complexity of the search of an extremum of a function
• On the Complexity of Polynomial Zeros
• On the worst-case arithmetic complexity of approximating zeros of polynomials
• scientific article; zbMATH DE number 3880013
• Complexity analysis of a process for simultaneously obtaining all zeros of polynomials
• On complexity of search of a function extremum
• Complexity estimation for an algorithm of searching for zero of a piecewise linear convex function
• An Upper Bound on Zarankiewicz' Problem

Cited in

(2)

• Topological complexity of zero finding with algebraic operations
• An algorithm that localizes and counts the zeros of a \({C^2}\)-function

This page was built for publication:

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