scientific article; zbMATH DE number 1984134

MaRDI QIDQ4427768zbMATH OpenFDO

Authors Dimitris J. Kavvadias, Frosso S. Makri, Michael N. Vrahatis

Publication date 22 September 2003

zbMATH Keywords

algorithmexpected behaviorvery large problemsbisection based methodscounting and computing the roots of a functionroot finding process

Mathematics Subject Classification ID

Numerical computation of solutions to single equations (65H05)

Recommendations

• scientific article; zbMATH DE number 1086546
• scientific article; zbMATH DE number 4037050
• Computation of bounds for polynomial roots
• Algorithms for checking rational roots of b-functions and their applications
• Numerical algorithms based on analytic function values at roots of unity
• Numerical analysis of a bisection-exclusion method to find zeros of univariate analytic functions
• On root finding algorithms for complex functions with branch cuts
• scientific article; zbMATH DE number 4199482
• Random polynomials and expected complexity of bisection methods for real solving
• Efficiently Computing Many Roots of a Function

Cited in

(4)

• Efficiently Computing Many Roots of a Function
• Algorithm 987: MANBIS -- a C++ mathematical software package for locating and computing efficiently many roots of a function: theoretical issues
• The Bisection Method: Which Root?
• scientific article; zbMATH DE number 1086546 (Why is no real title available?)

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