Polynomial Minimum Root Separation
From MaRDI portal
Publication:4190721
DOI10.2307/2006045zbMath0405.12018OpenAlexW4252064131MaRDI QIDQ4190721
Publication date: 1979
Full work available at URL: https://doi.org/10.2307/2006045
Numerical computation of solutions to single equations (65H05) Polynomials in real and complex fields: location of zeros (algebraic theorems) (12D10)
Related Items
Complexity of real root isolation using continued fractions, On the distance between the roots of a polynomial, The algebraic degree of geometric optimization problems, Improving root separation bounds, Separation bounds for polynomial systems, The number of solutions to the trinomial Thue equation, On the location of roots of non-reciprocal integer polynomials, Solving nonlinear systems with least significant bit accuracy, Separating linear forms and rational univariate representations of bivariate systems, Complex spherical codes with three inner products, Tetranomial Thue equations, Real root isolation for exp-log-arctan functions, The operator approach to entropy games, Degenerate abstract Volterra equations in locally convex spaces
Cites Work
- Approximation of algebraic numbers by algebraic numbers
- An inequality for the discriminant of a polynomial
- Approximation to algebraic numbers
- An application of Jensen's formula to polynomials
- An Inequality About Factors of Polynomials
- The Minimum Root Separation of a Polynomial
- Polynomials with multiple zeros
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
