A general approach to isolating roots of a bitstream polynomial
DOI10.1007/S11786-011-0071-8zbMATH Open1229.65077OpenAlexW2026516032MaRDI QIDQ655157FDOQ655157
Authors: 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
Recommendations
root isolationreal polynomialbitstream coefficientsadaptive precision managementroot perturbation bounds
Complexity and performance of numerical algorithms (65Y20) Real polynomials: location of zeros (26C10) Numerical computation of roots of polynomial equations (65H04)
Cites Work
- Efficient isolation of polynomial's real roots.
- Quasi-gcd computations
- Interval arithmetic in cylindrical algebraic decomposition
- New bounds for the Descartes method
- Almost tight recursion tree bounds for the Descartes method
- Amortized bound for root isolation via Sturm sequences
- The fundamental theorem of algebra and complexity theory
- Title not available (Why is that?)
- A simple but exact and efficient algorithm for complex root isolation
- Title not available (Why is that?)
- Error Bounds for Zeros of a Polynomial Based Upon Gerschgorin's Theorems
- Sylvester-Habicht sequences and fast Cauchy index computation
- Solving a Polynomial Equation: Some History and Recent Progress
- An efficient algorithm for the stratification and triangulation of an algebraic surface
- A new proof of Vincent's theorem
- Complexity of real root isolation using continued fractions
- On the complexity of real root isolation using continued fractions
- Fast and exact geometric analysis of real algebraic plane curves
- Computer Algebra in Scientific Computing
- A deterministic algorithm for isolating real roots of a real polynomial
- Faster algorithms for computing Hong's bound on absolute positiveness
- The fastest exact algorithms for the isolation of the real roots of a polynomial equation
- On multiple roots in Descartes' rule and their distance to roots of higher derivatives
- A comparative study of two real root isolation methods
- Title not available (Why is that?)
- Title not available (Why is that?)
- Sequential and parallel complexity of approximate evaluation of polynomial zeros
- Modular algorithms in symbolic summation and symbolic integration
Cited In (7)
- A deterministic algorithm for isolating real roots of a real polynomial
- Deciding univariate polynomial problems using untrusted certificates in Isabelle/HOL
- Isolating real roots of real polynomials
- Fast evaluation and root finding for polynomials with floating-point coefficients
- Computer Algebra in Scientific Computing
- On the complexity of the Descartes method when using approximate arithmetic
- Exact symbolic-numeric computation of planar algebraic curves
Uses Software
This page was built for publication: A general approach to isolating roots of a bitstream polynomial
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q655157)
