A general approach to isolating roots of a bitstream polynomial
type: Item
instance of: scholarly article
title: A general approach to isolating roots of a bitstream polynomial
zbMATH Open document ID: 1229.65077
author: Michael Sagraloff
published in: Mathematics in Computer Science
publication date: 2012-01-02T00:00:00Z
Mathematics Subject Classification ID: 65H04
Mathematics Subject Classification ID: 65Y20
Mathematics Subject Classification ID: 26C10
zbMATH DE Number: 5993984
zbMATH Keywords: real polynomial
zbMATH Keywords: root isolation
zbMATH Keywords: bitstream coefficients
zbMATH Keywords: root perturbation bounds
zbMATH Keywords: adaptive precision management
describes a project that uses: ISOLATE
MaRDI profile type: Publication
full work available at URL: s11786-011-0071-8
OpenAlex ID: W2026516032
cites work: Q3535915
cites work: The fastest exact algorithms for the isolation of the real roots of a polynomial equation
cites work: A new proof of Vincent's theorem
cites work: An efficient algorithm for the stratification and triangulation of an algebraic surface
cites work: Interval arithmetic in cylindrical algebraic decomposition
cites work: Q3447174
cites work: On multiple roots in Descartes' rule and their distance to roots of higher derivatives
cites work: Q5301664
cites work: Computer Algebra in Scientific Computing
cites work: Almost tight recursion tree bounds for the Descartes method
cites work: Modular algorithms in symbolic summation and symbolic integration
cites work: Q4226967
cites work: New bounds for the Descartes method
cites work: Sylvester-Habicht sequences and fast Cauchy index computation
cites work: Faster algorithms for computing Hong's bound on absolute positiveness
cites work: A deterministic algorithm for isolating real roots of a real polynomial
cites work: Q5290272
cites work: Sequential and parallel complexity of approximate evaluation of polynomial zeros
cites work: Solving a Polynomial Equation: Some History and Recent Progress
cites work: Efficient isolation of polynomial's real roots.
cites work: A simple but exact and efficient algorithm for complex root isolation
cites work: Q3325040
cites work: Quasi-gcd computations
cites work: Complexity of real root isolation using continued fractions
cites work: The fundamental theorem of algebra and complexity theory
cites work: Error Bounds for Zeros of a Polynomial Based Upon Gerschgorin's Theorems
cites work: On the complexity of real root isolation using continued fractions
cites work: Q4953977
DOI: 10.1007/S11786-011-0071-8
description: scientific article; zbMATH DE number 5993984