Approximating the zeros of analytic functions by the exclusion algorithm

DOI10.1007/BF02149763zbMath0790.65038MaRDI QIDQ1316070

Jean-Claude Yakoubsohn

Publication date: 10 April 1994

Published in: Numerical Algorithms (Search for Journal in Brave)

zbMATH Keywords

iterative algorithmanalytic functionzerosoptimalitypolynomialexclusion function

Mathematics Subject Classification ID

General theory of numerical methods in complex analysis (potential theory, etc.) (65E05) Numerical computation of solutions to single equations (65H05) Real polynomials: location of zeros (26C10)

Related Items (7)

Electromagnetic field generated by a modulated moving point source in a planarly layered waveguide ⋮ The complexity of subdivision for diameter-distance tests ⋮ Univariate Real Root Isolation over a Single Logarithmic Extension of Real Algebraic Numbers ⋮ On symbolic-numeric solving of sine-polynomial equations. ⋮ On continued fraction expansion of real roots of polynomial systems, complexity and condition numbers ⋮ Numerical analysis of a bisection-exclusion method to find zeros of univariate analytic functions ⋮ Effective numerical method of spectral analysis of quantum graphs

Cites Work

• Localization of an algebraic hypersurface by the exclusion algorithm
• Computing the real roots of a polynomial by the exclusion algorithm
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Approximating the zeros of analytic functions by the exclusion algorithm