Nearly optimal refinement of real roots of a univariate polynomial

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Faster Integer Multiplication
Algorithms in real algebraic geometry
On the asymptotic and practical complexity of solving bivariate systems over the reals
On the complexity of solving a bivariate polynomial system
On Solving Systems of Bivariate Polynomials
Numerical methods for roots of polynomials. II
Near optimal subdivision algorithms for real root isolation
On continued fraction expansion of real roots of polynomial systems, complexity and condition numbers
On the worst-case arithmetic complexity of approximating zeros of polynomials
Modern computer algebra
On the Complexity of Reliable Root Approximation
From approximate factorization to root isolation with application to cylindrical algebraic decomposition
Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding
Random polynomials and expected complexity of bisection methods for real solving
When Newton meets Descartes
Efficient real root approximation
Quadratic interval refinement for real roots
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]}\)
On the boolean complexity of real root refinement
Approximating complex polynomial zeros: modified Weyl's quadtree construction and improved Newton's iteration.
Practical Divide-and-Conquer Algorithms for Polynomial Arithmetic
Univariate real root isolation in an extension field
Algorithms – ESA 2005
Quasi-Laguerre Iteration in Solving Symmetric Tridiagonal Eigenvalue Problems
The quasi-Laguerre iteration
Computing Matrix Eigenvalues and Polynomial Zeros Where the Output is Real
On the topology of planar algebraic curves
Simple algorithms for approximating all roots of a polynomial with real roots
Real Polynomial Root-Finding by Means of Matrix and Polynomial Iterations
Practical improvement of the divide-and-conquer eigenvalue algorithms
Bisection acceleration for the symmetric tridiagonal eigenvalue problem
Accelerated approximation of the complex roots of a univariate polynomial

Cited In (10)

Optimizing a particular real root of a polynomial by a special cylindrical algebraic decomposition
Solving rank-constrained semidefinite programs in exact arithmetic
Accelerated approximation of the complex roots and factors of a univariate polynomial
Efficient sampling in spectrahedra and volume approximation
Real polynomial root-finding by means of matrix and polynomial iterations
Root refinement for real polynomials using quadratic interval refinement
Nearly optimal computations with structured matrices
New Practical Advances in Polynomial Root Clustering
Positive root isolation for poly-powers by exclusion and differentiation
Simple and Nearly Optimal Polynomial Root-Finding by Means of Root Radii Approximation

Recommendations

This page was built for publication: Nearly optimal refinement of real roots of a univariate polynomial

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