Computing Real Roots of Real Polynomials ... and now For Real!

Abstract : Very recent work introduces an asymptotically fast subdivision algorithm, denoted ANewDsc, for isolating the real roots of a univariate real polynomial. The method combines Descartes' Rule of Signs to test intervals for the existence of roots, Newton iteration to speed up convergence against clusters of roots, and approximate computation to decrease the required precision. It achieves record bounds on the worst-case complexity for the considered problem, matching the complexity of Pan's method for computing all complex roots and improving upon the complexity of other subdivision methods by several magnitudes. In the article at hand, we report on an implementation of ANewDsc on top of the RS root isolator. RS is a highly efficient realization of the classical Descartes method and currently serves as the default real root solver in Maple. We describe crucial design changes within ANewDsc and RS that led to a high-performance implementation without harming the theoretical complexity of the underlying algorithm. With an excerpt of our extensive collection of benchmarks, available online at this http URL, we illustrate that the theoretical gain in performance of ANewDsc over other subdivision methods also transfers into practice. These experiments also show that our new implementation outperforms both RS and mature competitors by magnitudes for notoriously hard instances with clustered roots. For all other instances, we avoid almost any overhead by integrating additional optimizations and heuristics.
Type de document :
Communication dans un congrès
ISSAC '16 Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation, Jul 2016, Waterloo, Canada. pp.7, 2016, ISSAC '16 Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation. 〈10.1145/2930889.2930937〉
Liste complète des métadonnées

https://hal.inria.fr/hal-01363955
Contributeur : Fabrice Rouillier <>
Soumis le : lundi 12 septembre 2016 - 10:36:14
Dernière modification le : jeudi 26 avril 2018 - 10:28:02

Lien texte intégral

Identifiants

Collections

UPMC | INRIA | USPC | IMJ

Citation

Alexander Kobel, Fabrice Rouillier, Michael Sagraloff. Computing Real Roots of Real Polynomials ... and now For Real!. ISSAC '16 Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation, Jul 2016, Waterloo, Canada. pp.7, 2016, ISSAC '16 Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation. 〈10.1145/2930889.2930937〉. 〈hal-01363955〉

Partager

Métriques

Consultations de la notice

211