On the product of the largest roots of a polynomial

DOI10.1016/S0747-7171(10)80013-6MaRDI QIDQ1198233zbMATH OpenFDO

Authors Maurice Mignotte

Publication date 16 January 1993

Published in Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0747-7171(10)80013-6

zbMATH Keywords

complex polynomialslargest rootsnumerical resultupper bounds

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)

Review text

New upper bounds for the product of the \(n\) largest moduli of the roots of complex polynomials are derived. One numerical result is given.

Cites work

• Computing the measure of a polynomial
• scientific article; zbMATH DE number 3489473 (Why is no real title available?)
• scientific article; zbMATH DE number 3249033 (Why is no real title available?)
• scientific article; zbMATH DE number 3303655 (Why is no real title available?)
• On finding the largest root of a polynomial

Cited in

(6)

• On the dichotomy of Perron numbers and beta-conjugates
• Note on Jacobi's method for approximating dominant roots
• The Largest Roots of the Mandelbrot Polynomials
• scientific article; zbMATH DE number 7589253 (Why is no real title available?)
• On the height of powers of a polynomial with integer coefficients
• On the rigidity of the roots of power series with constrained coefficients

This page was built for publication: On the product of the largest roots of a polynomial

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1198233)