When Newton meets Descartes: A Simple and Fast Algorithm to Isolate the Real 
Roots of a Polynomial

Sagraloff, Michael

doi:10.1145/2442829.2442872

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

When Newton meets Descartes: A Simple and Fast Algorithm to Isolate the Real Roots of a Polynomial

MPS-Authors

/persons/resource/persons45332

Sagraloff, Michael
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Sagraloff, M. (2012). When Newton meets Descartes: A Simple and Fast Algorithm to Isolate the Real Roots of a Polynomial. In J. van der Hoeven, & M. van Hoeij (Eds.), ISSAC 2012 (pp. 297-304). New York, NY: ACM.

Cite as: https://hdl.handle.net/11858/00-001M-0000-0014-BEB4-4

Abstract

There is no abstract available