scientific article; zbMATH DE number 1984134

zbMATH Open1028.65051MaRDI QIDQ4427768FDOQ4427768

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

Publication date: 22 September 2003

Title of this publication is not available (Why is that?)

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
• Random polynomials and expected complexity of bisection methods for real solving
• Efficiently Computing Many Roots of a Function

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)

Cited In (3)

• The Bisection Method: Which Root?
• Title not available (Why is that?)
• Efficiently Computing Many Roots of a 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 Q4427768)