On efficient computation and asymptotic sharpness of Kalantari’s bounds for zeros of polynomials

DOI10.1090/S0025-5718-06-01868-0zbMath1171.65397MaRDI QIDQ3420238

Yi Jin

Publication date: 1 February 2007

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

zbMATH Keywords

generating functionsrecurrence relationsasymptotic sharpnessbounds on polynomial roots

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Exact enumeration problems, generating functions (05A15) Numerical computation of solutions to single equations (65H05) Polynomials in real and complex fields: location of zeros (algebraic theorems) (12D10)

Related Items (2)

Algorithms for quaternion polynomial root-finding ⋮ A combinatorial construction of high order algorithms for finding polynomial roots of known multiplicity

Cites Work

• A 2002 update of the supplementary bibliography on roots of polynomials
• An infinite family of bounds on zeros of analytic functions and relationship to Smale’s bound
• A Proof in the Spirit of Zeilberger of an Amazing Identity of Ramanujan
• Unnamed Item
• Unnamed Item

This page was built for publication: On efficient computation and asymptotic sharpness of Kalantari’s bounds for zeros of polynomials