Efficient isolation of polynomial's real roots.
From MaRDI portal
Publication:1421215
DOI10.1016/j.cam.2003.08.015zbMath1040.65041WikidataQ55894335 ScholiaQ55894335MaRDI QIDQ1421215
Fabrice Rouillier, Paul Zimmermann
Publication date: 26 January 2004
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2003.08.015
algorithm; numerical examples; univariate polynomial; bisection method; Descartes's rule of signs; interval-arithmetic filter; isolation of real root
65G30: Interval and finite arithmetic
65H05: Numerical computation of solutions to single equations
26C10: Real polynomials: location of zeros
Related Items
ISOLATE, Topics in computational algebraic number theory, On the computation of an arrangement of quadrics in 3D, On multiple roots in Descartes' rule and their distance to roots of higher derivatives, Near-optimal parameterization of the intersection of quadrics. I. The generic algorithm, Thirty years of polynomial system solving, and now?, Trees and jumps and real roots., Improved algorithms for computing determinants and resultants, Real algebraic numbers and polynomial systems of small degree, New bounds for the Descartes method, On the complexity of real root isolation using continued fractions, Exact, efficient, and complete arrangement computation for cubic curves, Intersecting quadrics: an efficient and exact implementation, Motivations for an arbitrary precision interval arithmetic and the MPFI library, Numerical analysis of a bisection-exclusion method to find zeros of univariate analytic functions, Practical and Theoretical Issues for the Computation of Generalized Critical Values of a Polynomial Mapping
Uses Software
Cites Work
