A general approach to isolating roots of a bitstream polynomial

DOI10.1007/s11786-011-0071-8zbMath1229.65077OpenAlexW2026516032MaRDI QIDQ655157

Michael Sagraloff

Publication date: 2 January 2012

Published in: Mathematics in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11786-011-0071-8

zbMATH Keywords

real polynomialroot isolationbitstream coefficientsadaptive precision managementroot perturbation bounds

Mathematics Subject Classification ID

Real polynomials: location of zeros (26C10) Complexity and performance of numerical algorithms (65Y20) Numerical computation of roots of polynomial equations (65H04)

Related Items (3)

Exact symbolic-numeric computation of planar algebraic curves ⋮ On the complexity of the Descartes method when using approximate arithmetic ⋮ Deciding univariate polynomial problems using untrusted certificates in Isabelle/HOL

Uses Software

• ISOLATE

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A deterministic algorithm for isolating real roots of a real polynomial
• On multiple roots in Descartes' rule and their distance to roots of higher derivatives
• Faster algorithms for computing Hong's bound on absolute positiveness
• An efficient algorithm for the stratification and triangulation of an algebraic surface
• Quasi-gcd computations
• Sequential and parallel complexity of approximate evaluation of polynomial zeros
• The fastest exact algorithms for the isolation of the real roots of a polynomial equation
• Efficient isolation of polynomial's real roots.
• A new proof of Vincent's theorem
• Interval arithmetic in cylindrical algebraic decomposition
• Complexity of real root isolation using continued fractions
• New bounds for the Descartes method
• On the complexity of real root isolation using continued fractions
• Modular algorithms in symbolic summation and symbolic integration
• Almost tight recursion tree bounds for the Descartes method
• The fundamental theorem of algebra and complexity theory
• Solving a Polynomial Equation: Some History and Recent Progress
• A simple but exact and efficient algorithm for complex root isolation
• Computer Algebra in Scientific Computing
• Error Bounds for Zeros of a Polynomial Based Upon Gerschgorin's Theorems
• Sylvester-Habicht sequences and fast Cauchy index computation

This page was built for publication: A general approach to isolating roots of a bitstream polynomial