Computing Real Roots of Real Polynomials ... and now For Real!
From MaRDI portal
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 http://anewdsc.mpi-inf.mpg.de/, 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.
Recommendations
- Computing real roots of real polynomials
- scientific article; zbMATH DE number 1500715
- The exact root algorithm for computing the real roots of an nth degree polynomial
- Computing real radicals and S-radicals of polynomial systems
- scientific article; zbMATH DE number 579389
- Real polynomial root-finding by means of matrix and polynomial iterations
- Real polynomial root-finding by means of matrix and polynomial iterations
- Computing the real roots of a polynomial by the exclusion algorithm
- Computation of dominant real roots of polynomials
- New progress in real and complex polynomial root-finding
Cited in
(23)- Efficient isolation of polynomial's real roots.
- A near-optimal subdivision algorithm for complex root isolation based on the Pellet test and Newton iteration
- Clustering complex zeros of triangular systems of polynomials
- Integer polynomial recovery from outputs and its application to cryptanalysis of a protocol for secure sorting
- Effective coefficient asymptotics of multivariate rational functions via semi-numerical algorithms for polynomial systems
- How to count the number of zeros that a polynomial has on the unit circle?
- Logcf: an efficient tool for real root isolation
- On the resolution of certain discrete univariate max-min problems
- A symbolic-numerical algorithm for isolating real roots of certain radical expressions
- Ising model on random triangulations of the disk: phase transition
- Near optimal subdivision algorithms for real root isolation
- When should a polynomial’s root nearest to a real number be real itself?
- A symbolic computation approach towards the asymptotic stability analysis of differential systems with commensurate delays
- Computing real roots of real polynomials
- Evaluation of Chebyshev Polynomials on Intervals and Application to Root Finding
- New Practical Advances in Polynomial Root Clustering
- Computing totally real hyperplane sections and linear series on algebraic curves
- New progress in univariate polynomial root finding
- SLV: a software for real root isolation
- The integer sequence transform a → b, where bn is the number of real roots of the polynomial a0 + a1x + a2x2 + · · · + anxn
- msolve. A library for solving polynomial systems
- Novel range functions via Taylor expansions and recursive Lagrange interpolation with application to real root isolation
- Root radii and subdivision for polynomial root-finding
This page was built for publication: Computing Real Roots of Real Polynomials ... and now For Real!
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2985841)
