SqFreeEVAL: An (almost) optimal real-root isolation algorithm

@article{Burr2011SqFreeEVALA,
  title={SqFreeEVAL: An (almost) optimal real-root isolation algorithm},
  author={Michael A. Burr and Felix Krahmer},
  journal={ArXiv},
  year={2011},
  volume={abs/1102.5266}
}
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 isolating the real roots of f in a given interval. In this paper, we consider a simple subdivision algorithm whose primitives are purely numerical (e.g., function evaluation). The complexity of this algorithm is adaptive because the algorithm makes decisions based on local data. The complexity analysis of adaptive… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 16 CITATIONS

Near optimal tree size bounds on a simple real root isolation algorithm

VIEW 14 EXCERPTS
CITES BACKGROUND, RESULTS & METHODS
HIGHLY INFLUENCED

References

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

Evaluation-based root isolation

Burr, Michael, +3 authors Chee
  • Technical Report TR09-136,
  • 2009
VIEW 14 EXCERPTS
HIGHLY INFLUENTIAL

A Survey of Subdivision-Based Tools for Surface Modeling

  • Geometric and Algorithmic Aspects of Computer-Aided Design and Manufacturing
  • 2003
VIEW 3 EXCERPTS
HIGHLY INFLUENTIAL

Applicable Algebra in Engineering, Communication and Computing 2 (4), 239–256

httpddm.org. Du, Zilin, +3 authors Chee
  • Domain Decomposition Methods,
  • 2011
VIEW 2 EXCERPTS

On the complexity of real root isolation using continued fractions

Jean-Claude Yakoubsohn
  • Theoretical Computer Science
  • 2008

Symbolic and Algebraic Computation, ISSAC’06, Genova, Italy

Emiris, Z Ioannis, +3 authors P Elias
  • Jul 9–12,
  • 2008
VIEW 3 EXCERPTS