Corpus ID: 10657635

# On the Complexity of Real Root Isolation

@article{Sagraloff2010OnTC,
title={On the Complexity of Real Root Isolation},
author={Michael Sagraloff},
journal={ArXiv},
year={2010},
volume={abs/1011.0344}
}
• Michael Sagraloff
• Published 2010
• Computer Science, Mathematics
• ArXiv
• We introduce a new approach to isolate the real roots of a square-free polynomial $F=\sum_{i=0}^n A_i x^i$ with real coefficients. It is assumed that each coefficient of $F$ can be approximated to any specified error bound. The presented method is exact, complete and deterministic. Due to its similarities to the Descartes method, we also consider it practical and easy to implement. Compared to previous approaches, our new method achieves a significantly better bit complexity. It is further… CONTINUE READING

#### Explore Further: Topics Discussed in This Paper

Computing real roots of real polynomials
• Mathematics, Computer Science
• 2016
• 54
• Open Access
On the complexity of solving a bivariate polynomial system
• Computer Science, Mathematics
• 2012
• 31
• Open Access
Efficient real root approximation
• Computer Science, Mathematics
• 2011
• 25
• Open Access
A worst-case bound for topology computation of algebraic curves
• Mathematics, Computer Science
• 2012
• 33
• Open Access
SqFreeEVAL: An (almost) optimal real-root isolation algorithm
• Computer Science, Mathematics
• 2012
• 24
• Open Access
From approximate factorization to root isolation
• Computer Science, Mathematics
• 2013
• 11
Root Refinement for Real Polynomials
• Computer Science, Mathematics
• 2011
• 5
• Open Access
Univariate real root isolation in an extension field
• Computer Science, Mathematics
• 2011
• 19
• Highly Influenced
• Open Access

#### References

##### Publications referenced by this paper.
SHOWING 1-10 OF 54 REFERENCES