Numerical analysis of a bisection-exclusion method to find zeros of univariate analytic functions

DOI10.1016/j.jco.2005.06.007zbMath1084.65055OpenAlexW2021573332MaRDI QIDQ2576275

Jean-Claude Yakoubsohn

Publication date: 27 December 2005

Published in: Journal of Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jco.2005.06.007

zbMATH Keywords

algorithmnumerical experimentsanalytic functioncluster of zeroszerobisection-exclusion method

Mathematics Subject Classification ID

Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) General theory of numerical methods in complex analysis (potential theory, etc.) (65E05) Numerical computation of solutions to single equations (65H05)

Related Items (14)

Introducing phase jump tracking -- a fast method for eigenvalue evaluation of the direct Zakharov-Shabat problem ⋮ Unnamed Item ⋮ On parallel complexity of analytic functions ⋮ A near-optimal subdivision algorithm for complex root isolation based on the Pellet test and Newton iteration ⋮ The complexity of subdivision for diameter-distance tests ⋮ Separation bounds for polynomial systems ⋮ A geometric algorithm for winding number computation with complexity analysis ⋮ On the Wiener-Hopf factorization for Lévy processes with bounded positive jumps ⋮ Univariate Real Root Isolation over a Single Logarithmic Extension of Real Algebraic Numbers ⋮ AN ALGORITHM FOR FINDING ALL ZEROS OF VECTOR FUNCTIONS ⋮ On the complexity of the Descartes method when using approximate arithmetic ⋮ SqFreeEVAL: An (almost) optimal real-root isolation algorithm ⋮ A new trigonometrical algorithm for computing real root of non-linear transcendental equations ⋮ On mixed polynomials of bidegree \((n,1)\)

Uses Software

• mctoolbox
• ISOLATE

Cites Work

• On the complexity of exclusion algorithms for optimization
• On the complexity of isolating real roots and computing with certainty the topological degree
• A reliable argument principle algorithm to find the number of zeros of an analytic function in a bounded domain
• Localization of an algebraic hypersurface by the exclusion algorithm
• A reliable method for solving nonlinear systems of equations of few variables
• Computing the real roots of a polynomial by the exclusion algorithm
• Approximating the zeros of analytic functions by the exclusion algorithm
• Efficient isolation of polynomial's real roots.
• Finding a cluster of zeros of univariate polynomials
• A simple reliable solver for all the roots of a nonlinear function in a given domain
• A new exclusion test.
• Approximating complex polynomial zeros: modified Weyl's quadtree construction and improved Newton's iteration.
• On location and approximation of clusters of zeros of analytic functions
• Abstract Generalized Bisection and a Cost Bound
• Some tests of generalized bisection
• A Global Bisection Algorithm for Computing the Zeros of Polynomials in the Complex Plane
• Condition Number Analysis for Sparse Polynomial Systems
• Solving a Polynomial Equation: Some History and Recent Progress
• Algorithms in real algebraic geometry
• Kronecker's and Newton's approaches to solving: a first comparison
• The numerical detection of connecting orbits
• Locating all the zeros of an analytic function in one complex variable
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Numerical analysis of a bisection-exclusion method to find zeros of univariate analytic functions