Root refinement for real polynomials using quadratic interval refinement
From MaRDI portal
Publication:484890
Recommendations
Cites work
- scientific article; zbMATH DE number 3846864 (Why is no real title available?)
- A fast numerical algorithm for the composition of power series with complex coefficients
- A general approach to the analysis of controlled perturbation algorithms
- A generic algebraic kernel for non-linear geometric applications
- A polynomial time algorithm for diophantine equations in one variable
- A worst-case bound for topology computation of algebraic curves
- Amortized bound for root isolation via Sturm sequences
- Computer Algebra in Scientific Computing
- Design, analysis, and implementation of a multiprecision polynomial rootfinder
- Efficient isolation of polynomial's real roots.
- Efficient polynomial root-refiners: a survey and new record efficiency estimates
- Efficient real root approximation
- Exact symbolic-numeric computation of planar algebraic curves
- Fast and exact geometric analysis of real algebraic plane curves
- From approximate factorization to root isolation
- ISOLATE
- Introduction to Interval Analysis
- Modern computer algebra
- Nearly optimal refinement of real roots of a univariate polynomial
- Numerical methods for roots of polynomials. II
- On multiple roots in Descartes' rule and their distance to roots of higher derivatives
- On the Boolean complexity of real root refinement
- On the Complexity of Reliable Root Approximation
- On the complexity of the Descartes method when using approximate arithmetic
- On the topology of real algebraic plane 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]}\)
- Random polynomials and expected complexity of bisection methods for real solving
- Root-refining for a polynomial equation
- Solving a Polynomial Equation: Some History and Recent Progress
- Two Efficient Algorithms with Guaranteed Convergence for Finding a Zero of a Function
- Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding
Cited in
(10)- On the Complexity of Reliable Root Approximation
- 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
- On the Boolean complexity of real root refinement
- Bounds for polynomials on algebraic numbers and application to curve topology
- Efficient real root approximation
- Quadratic interval refinement for real roots
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)
