Polynomial Minimum Root Separation

DOI10.2307/2006045MaRDI QIDQ4190721zbMATH OpenOpenAlexFDO

Authors Siegfried M. Rump

Publication date 1979

Full work available at URL https://doi.org/10.2307/2006045

zbMATH Keywords

PolynomialsRoot Separation

Mathematics Subject Classification ID

Polynomials in real and complex fields: location of zeros (algebraic theorems) (12D10) Numerical computation of solutions to single equations (65H05)

Cites work

• An application of Jensen's formula to polynomials
• An Inequality About Factors of Polynomials
• An inequality for the discriminant of a polynomial
• Approximation of algebraic numbers by algebraic numbers
• Approximation to algebraic numbers
• scientific article; zbMATH DE number 3125786 (Why is no real title available?)
• scientific article; zbMATH DE number 3711282 (Why is no real title available?)
• scientific article; zbMATH DE number 3557181 (Why is no real title available?)
• scientific article; zbMATH DE number 3222940 (Why is no real title available?)
• scientific article; zbMATH DE number 3251532 (Why is no real title available?)
• scientific article; zbMATH DE number 3057883 (Why is no real title available?)
• Polynomials with multiple zeros
• The Minimum Root Separation of a Polynomial

Cited in

(18)

• The algebraic degree of geometric optimization problems
• Solving nonlinear systems with least significant bit accuracy
• On the distance between the roots of a polynomial
• Complex spherical codes with three inner products
• Separation bounds for polynomial systems
• The operator approach to entropy games
• Complexity of real root isolation using continued fractions
• Improving root separation bounds
• On the location of roots of non-reciprocal integer polynomials
• Separating linear forms and rational univariate representations of bivariate systems
• Degenerate abstract Volterra equations in locally convex spaces
• The number of solutions to the trinomial Thue equation
• Stability of optimal spherical codes
• Upper bounds on polynomial root separation
• Universal complexity bounds based on value iteration for stochastic mean payoff games and entropy games
• For how long time evolution of chaotic or random systems can be predicted
• Tetranomial Thue equations
• Real root isolation for exp-log-arctan functions

This page was built for publication: Polynomial Minimum Root Separation

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