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

DOI10.1145/2930889.2930937zbMath1365.65142arXiv1605.00410OpenAlexW3101568060WikidataQ60303619 ScholiaQ60303619MaRDI QIDQ2985841

Alexander Kobel, Michael Sagraloff, Fabrice Rouillier

Publication date: 10 May 2017

Published in: Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1605.00410

zbMATH Keywords

Newton's methodnumerical examplesunivariate polynomialsworst-case complexityreal rootsroot findingroot isolationapproximate arithmeticcertified computationhigh-performanceDescartes methodsubdivision performance

Mathematics Subject Classification ID

Complexity and performance of numerical algorithms (65Y20) Numerical computation of roots of polynomial equations (65H04)

Related Items (16)

Root radii and subdivision for polynomial root-finding ⋮ A symbolic-numerical algorithm for isolating real roots of certain radical expressions ⋮ On the resolution of certain discrete univariate max-min problems ⋮ A near-optimal subdivision algorithm for complex root isolation based on the Pellet test and Newton iteration ⋮ Ising model on random triangulations of the disk: phase transition ⋮ Effective coefficient asymptotics of multivariate rational functions via semi-numerical algorithms for polynomial systems ⋮ SLV ⋮ How to count the number of zeros that a polynomial has on the unit circle? ⋮ A Symbolic Computation Approach Towards the Asymptotic Stability Analysis of Differential Systems with Commensurate Delays ⋮ Computing totally real hyperplane sections and linear series on algebraic curves ⋮ Clustering complex zeros of triangular systems of polynomials ⋮ Logcf: an efficient tool for real root isolation ⋮ The integer sequence transform a → b, where b_n is the number of real roots of the polynomial a₀ + a₁x + a₂x² + · · · + a_nxⁿ ⋮ Integer polynomial recovery from outputs and its application to cryptanalysis of a protocol for secure sorting ⋮ Evaluation of Chebyshev Polynomials on Intervals and Application to Root Finding ⋮ New Practical Advances in Polynomial Root Clustering

Uses Software

• Maple
• ANewDsc

This page was built for publication: Computing Real Roots of Real Polynomials ... and now For Real!