A general approach to isolating roots of a bitstream polynomial

DOI10.1007/S11786-011-0071-8MaRDI QIDQ655157zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

root isolationreal polynomialbitstream coefficientsadaptive precision managementroot perturbation bounds

Mathematics Subject Classification ID

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

Recommendations

• Isolating real roots of real polynomials
• A deterministic algorithm for isolating real roots of a real polynomial
• Computer Algebra in Scientific Computing
• Efficient real root approximation
• Efficient isolation of polynomial's real roots.

Cites work

• scientific article; zbMATH DE number 3856407 (Why is no real title available?)
• scientific article; zbMATH DE number 1253988 (Why is no real title available?)
• scientific article; zbMATH DE number 1446863 (Why is no real title available?)
• scientific article; zbMATH DE number 5019917 (Why is no real title available?)
• A comparative study of two real root isolation methods
• A deterministic algorithm for isolating real roots of a real polynomial
• A new proof of Vincent's theorem
• A simple but exact and efficient algorithm for complex root isolation
• Almost tight recursion tree bounds for the Descartes method
• Amortized bound for root isolation via Sturm sequences
• An efficient algorithm for the stratification and triangulation of an algebraic surface
• Complexity of real root isolation using continued fractions
• Computer Algebra in Scientific Computing
• Efficient isolation of polynomial's real roots.
• Error Bounds for Zeros of a Polynomial Based Upon Gerschgorin's Theorems
• Fast and exact geometric analysis of real algebraic plane curves
• Faster algorithms for computing Hong's bound on absolute positiveness
• Interval arithmetic in cylindrical algebraic decomposition
• Modular algorithms in symbolic summation and symbolic integration
• New bounds for the Descartes method
• On multiple roots in Descartes' rule and their distance to roots of higher derivatives
• On the complexity of real root isolation using continued fractions
• Quasi-gcd computations
• Sequential and parallel complexity of approximate evaluation of polynomial zeros
• Solving a Polynomial Equation: Some History and Recent Progress
• Sylvester-Habicht sequences and fast Cauchy index computation
• The fastest exact algorithms for the isolation of the real roots of a polynomial equation
• The fundamental theorem of algebra and complexity theory

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

Describes a project that uses

Uses Software

• ISOLATE

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)