Sciweavers

63 search results - page 3 / 13
» Isolating real roots of real polynomials
Sort
View
CORR
2011
Springer
158views Education» more  CORR 2011»
13 years 1 months ago
SqFreeEVAL: An (almost) optimal real-root isolation algorithm
Let f be a univariate polynomial with real coefficients, f ∈ R[X]. Subdivision algorithms based on algebraic techniques (e.g., Sturm or Descartes methods) are widely used for is...
Michael Burr, Felix Krahmer
DAGSTUHL
2008
13 years 7 months ago
Real Algebraic Numbers: Complexity Analysis and Experimentation
Abstract. We present algorithmic, complexity and implementation results concerning real root isolation of a polynomial of degree d, with integer coefficients of bit size , using S...
Ioannis Z. Emiris, Bernard Mourrain, Elias P. Tsig...
JSC
2010
99views more  JSC 2010»
13 years 4 months ago
Faster algorithms for computing Hong's bound on absolute positiveness
We show how to compute Hong’s bound for the absolute positiveness of a polynomial in d variables with maximum degree δ in O(n logd n) time, where n is the number of non-zero co...
Kurt Mehlhorn, Saurabh Ray
ESA
2004
Springer
139views Algorithms» more  ESA 2004»
13 years 11 months ago
Comparing Real Algebraic Numbers of Small Degree
We study polynomials of degree up to 4 over the rationals or a computable real subfield. Our motivation comes from the need to evaluate predicates in nonlinear computational geome...
Ioannis Z. Emiris, Elias P. Tsigaridas