Root refinement for real polynomials using quadratic interval refinement
From MaRDI portal
Publication:484890
DOI10.1016/j.cam.2014.11.031zbMath1309.65052OpenAlexW2151974897MaRDI QIDQ484890
Michael Sagraloff, Michael Kerber
Publication date: 8 January 2015
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2014.11.031
Related Items (4)
Solving bivariate systems using rational univariate representations ⋮ A near-optimal subdivision algorithm for complex root isolation based on the Pellet test and Newton iteration ⋮ Computing real roots of real polynomials ⋮ Bounds for polynomials on algebraic numbers and application to curve topology
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- ISOLATE
- Exact symbolic-numeric computation of planar algebraic curves
- Efficient polynomial root-refiners: a survey and new record efficiency estimates
- On the topology of real algebraic plane curves
- A general approach to the analysis of controlled perturbation algorithms
- Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding
- A worst-case bound for topology computation of algebraic curves
- On multiple roots in Descartes' rule and their distance to roots of higher derivatives
- Nearly optimal refinement of real roots of a univariate polynomial
- A fast numerical algorithm for the composition of power series with complex coefficients
- Partial fraction decomposition in \(\mathbb{C}(z)\) and simultaneous Newton iteration for factorization in \(\mathbb{C}^{[z}\)]
- A polynomial time algorithm for diophantine equations in one variable
- Efficient isolation of polynomial's real roots.
- Design, analysis, and implementation of a multiprecision polynomial rootfinder
- Optimal and nearly optimal algorithms for approximating polynomial zeros
- Numerical methods for roots of polynomials. II
- On the complexity of the Descartes method when using approximate arithmetic
- Root-Refining for a Polynomial Equation
- Random polynomials and expected complexity of bisection methods for real solving
- From approximate factorization to root isolation
- On the boolean complexity of real root refinement
- Introduction to Interval Analysis
- On the Complexity of Reliable Root Approximation
- Two Efficient Algorithms with Guaranteed Convergence for Finding a Zero of a Function
- Solving a Polynomial Equation: Some History and Recent Progress
- Efficient real root approximation
- A generic algebraic kernel for non-linear geometric applications
- Computer Algebra in Scientific Computing
This page was built for publication: Root refinement for real polynomials using quadratic interval refinement
