Improving root separation bounds
From MaRDI portal
Publication:2399862
Recommendations
Cites work
- scientific article; zbMATH DE number 1875420 (Why is no real title available?)
- A Poisson formula for the sparse resultant
- Algorithms – ESA 2004
- An Inequality About Factors of Polynomials
- An inequality for the discriminant of a polynomial
- Faster algorithms for computing Hong's bound on absolute positiveness
- ON THE DISTANCE BETWEEN ROOTS OF INTEGER POLYNOMIALS
- On the complexity of real root isolation using continued fractions
- On the distance between the roots of a polynomial
- Polynomial Minimum Root Separation
- Quality of positive root bounds
- Recent progress in exact geometric computation
- Simultaneous elimination by using several tools from real algebraic geometry
- The DMM bound: multivariate (aggregate) separation bounds
- The Minimum Root Separation of a Polynomial
- Using Algebraic Geometry
Cited in
(9)- An algebraic method for separating close-root clusters and the minimum root separation
- On the distance between two algebraic numbers
- An adaptive subdivision method for root finding of univariate polynomials
- The DMM bound: multivariate (aggregate) separation bounds
- Root separation for trinomials
- Absolute root separation
- Algebraic integers close to the unit circle
- Towards more accurate separation bounds of empirical polynomials
- Absolute real root separation
This page was built for publication: Improving root separation bounds
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2399862)