Root refinement for real polynomials using quadratic interval refinement

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Efficient isolation of polynomial's real roots.
Design, analysis, and implementation of a multiprecision polynomial rootfinder
ISOLATE
Introduction to Interval Analysis
Numerical methods for roots of polynomials. II
On the complexity of the Descartes method when using approximate arithmetic
From approximate factorization to root isolation
On the Complexity of Reliable Root Approximation
Modern computer algebra
Solving a Polynomial Equation: Some History and Recent Progress
Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding
On the topology of real algebraic plane curves
Random polynomials and expected complexity of bisection methods for real solving
Exact symbolic-numeric computation of planar algebraic curves
Efficient real root approximation
A generic algebraic kernel for non-linear geometric applications
Computer Algebra in Scientific Computing
A worst-case bound for topology computation of algebraic curves
Optimal and nearly optimal algorithms for approximating polynomial zeros
Partial fraction decomposition in \(\mathbb{C}(z)\) and simultaneous Newton iteration for factorization in \(\mathbb{C}^{[z]}\)
Efficient polynomial root-refiners: a survey and new record efficiency estimates
On the boolean complexity of real root refinement
A polynomial time algorithm for diophantine equations in one variable
A fast numerical algorithm for the composition of power series with complex coefficients
Root-Refining for a Polynomial Equation
Two Efficient Algorithms with Guaranteed Convergence for Finding a Zero of a Function
A general approach to the analysis of controlled perturbation algorithms
On multiple roots in Descartes' rule and their distance to roots of higher derivatives
Nearly optimal refinement of real roots of a univariate polynomial

Cited In (6)

Solving bivariate systems using rational univariate representations
A near-optimal subdivision algorithm for complex root isolation based on the Pellet test and Newton iteration
Piecewise quadratic bounding functions for finding real roots of polynomials
Computing real roots of real polynomials
Nearly optimal refinement of real roots of a univariate polynomial
Bounds for polynomials on algebraic numbers and application to curve topology

Uses Software

logcf
ISOLATE
na20
zeroin

This page was built for publication: Root refinement for real polynomials using quadratic interval refinement

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q484890)