An infinite family of bounds on zeros of analytic functions and relationship to Smale’s bound

DOI10.1090/S0025-5718-04-01686-2zbMath1137.65348MaRDI QIDQ4654024

Bahman Kalantari

Publication date: 1 March 2005

Published in: Mathematics of Computation (Search for Journal in Brave)

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Numerical computation of solutions to single equations (65H05) Polynomials in real and complex fields: location of zeros (algebraic theorems) (12D10)

Related Items (7)

Birkhoff-James orthogonality and the zeros of an analytic function ⋮ Algorithms for quaternion polynomial root-finding ⋮ A combinatorial construction of high order algorithms for finding polynomial roots of known multiplicity ⋮ Characterization of the determinant of a Laguerre matrix ⋮ On Geometry of the Zeros of a Polynomial ⋮ Newton–Ellipsoid polynomiography ⋮ On efficient computation and asymptotic sharpness of Kalantari’s bounds for zeros of polynomials

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Extraneous fixed points, basin boundaries and chaotic dynamics for Schröder and König rational iteration functions
• On the order of convergence of a determinantal family of root-finding methods
• A basic family of iteration functions for polynomial root finding and its characterizations
• Estimations for the separation number of a polynomial system
• On extraneous fixed-points of the basic family of iteration functions
• New formulas for approximation of \(\pi\) and other transcendental numbers
• High order iterative methods for approximating square roots
• Newton's method and generation of a determinantal family of iteration functions
• Computational complexity. On the geometry of polynomials and a theory of cost. I
• Solving a Polynomial Equation: Some History and Recent Progress
• COMPLEXITY AND REAL COMPUTATION: A MANIFESTO
• On the Geometry of Halley's Method
• Historical Development of the Newton–Raphson Method
• Generalization of Taylor's theorem and Newton's method via a new family of determinantal interpolation formulas and its applications
• A computational comparison of the first nine members of a determinantal family of root-finding methods

This page was built for publication: An infinite family of bounds on zeros of analytic functions and relationship to Smale’s bound