Nearly optimal refinement of real roots of a univariate polynomial
From MaRDI portal
Publication:898253
Recommendations
- An improved algorithm for real root isolation of univariate polynomials
- Optimal bounds for the roots of polynomials
- Root refinement for real polynomials using quadratic interval refinement
- Univariate polynomials, nearly optimal algorithms for factorization and rootfinding
- Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding
- Simple and nearly optimal polynomial root-finding by means of root radii approximation
- Real radicals and finite convergence of polynomial optimization problems
- A new method for real root isolation of univariate polynomials
- A near-optimal algorithm for computing real roots of sparse polynomials
- Real roots of univariate polynomials and straight line programs
Cites work
- scientific article; zbMATH DE number 1682655 (Why is no real title available?)
- scientific article; zbMATH DE number 432841 (Why is no real title available?)
- scientific article; zbMATH DE number 3856407 (Why is no real title available?)
- scientific article; zbMATH DE number 52304 (Why is no real title available?)
- scientific article; zbMATH DE number 3471577 (Why is no real title available?)
- scientific article; zbMATH DE number 1263253 (Why is no real title available?)
- scientific article; zbMATH DE number 1263299 (Why is no real title available?)
- scientific article; zbMATH DE number 691245 (Why is no real title available?)
- scientific article; zbMATH DE number 1052006 (Why is no real title available?)
- scientific article; zbMATH DE number 1157659 (Why is no real title available?)
- scientific article; zbMATH DE number 1446863 (Why is no real title available?)
- A worst-case bound for topology computation of algebraic curves
- Accelerated approximation of the complex roots of a univariate polynomial
- Algorithms in real algebraic geometry
- Algorithms – ESA 2005
- Amortized bound for root isolation via Sturm sequences
- Approximating complex polynomial zeros: modified Weyl's quadtree construction and improved Newton's iteration.
- Bisection acceleration for the symmetric tridiagonal eigenvalue problem
- Computing Matrix Eigenvalues and Polynomial Zeros Where the Output is Real
- Efficient real root approximation
- Faster integer multiplication
- From approximate factorization to root isolation with application to cylindrical algebraic decomposition
- Modern computer algebra
- Near optimal subdivision algorithms for real root isolation
- Numerical methods for roots of polynomials. II
- On continued fraction expansion of real roots of polynomial systems, complexity and condition numbers
- On solving systems of bivariate polynomials
- On the Boolean complexity of real root refinement
- On the Complexity of Reliable Root Approximation
- On the asymptotic and practical complexity of solving bivariate systems over the reals
- On the complexity of solving a bivariate polynomial system
- On the topology of planar algebraic curves
- On the worst-case arithmetic complexity of approximating zeros of polynomials
- 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]}\)
- Practical divide-and-conquer algorithms for polynomial arithmetic
- Practical improvement of the divide-and-conquer eigenvalue algorithms
- Quadratic interval refinement for real roots
- Quasi-Laguerre Iteration in Solving Symmetric Tridiagonal Eigenvalue Problems
- Random polynomials and expected complexity of bisection methods for real solving
- Real polynomial root-finding by means of matrix and polynomial iterations
- Simple algorithms for approximating all roots of a polynomial with real roots
- The quasi-Laguerre iteration
- Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding
- Univariate real root isolation in an extension field
- When Newton meets Descartes
Cited in
(16)- Root refinement for real polynomials using quadratic interval refinement
- On the Complexity of Reliable Root Approximation
- Efficient sampling in spectrahedra and volume approximation
- On the Boolean complexity of real root refinement
- Simple and nearly optimal polynomial root-finding by means of root radii approximation
- Optimizing a particular real root of a polynomial by a special cylindrical algebraic decomposition
- Root-refining for a polynomial equation
- New Practical Advances in Polynomial Root Clustering
- Polynomial real root isolation by means of root radii approximation
- Real polynomial root-finding by means of matrix and polynomial iterations
- Accelerated approximation of the complex roots and factors of a univariate polynomial
- Efficient real root approximation
- Quadratic interval refinement for real roots
- Nearly optimal computations with structured matrices
- Solving rank-constrained semidefinite programs in exact arithmetic
- Positive root isolation for poly-powers by exclusion and differentiation
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)
