Amortized bound for root isolation via Sturm sequences
From MaRDI portal
Real polynomials: location of zeros (26C10) Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Numerical computation of solutions to single equations (65H05) Complexity and performance of numerical algorithms (65Y20)
Recommendations
- Continuous amortization and extensions: with applications to bisection-based root isolation
- Real Algebraic Numbers: Complexity Analysis and Experimentation
- SqFreeEVAL: An (almost) optimal real-root isolation algorithm
- Spécialisation de la suite de Sturm et sous-résultants (I)
- On the complexity of real root isolation using continued fractions
Cited in
(20)- On the asymptotic and practical complexity of solving bivariate systems over the reals
- A near-optimal subdivision algorithm for complex root isolation based on the Pellet test and Newton iteration
- Univariate real root isolation in an extension field and applications
- On the topology and isotopic meshing of plane algebraic curves
- The complexity of subdivision for diameter-distance tests
- On the Davenport-Mahler bound
- On the complexity of the Descartes method when using approximate arithmetic
- On the complexity of real root isolation using continued fractions
- A symbolic-numerical algorithm for isolating real roots of certain radical expressions
- Continuous amortization and extensions: with applications to bisection-based root isolation
- Finding the number of roots of a polynomial in a plane region using the winding number
- On the Complexity of Reliable Root Approximation
- A note on Legendre-Fenchel conjugate of the product of two positive-definite quadratic forms
- Improved bounds for the CF algorithm
- Univariate real root isolation over a single logarithmic extension of real algebraic numbers
- Root refinement for real polynomials using quadratic interval refinement
- Computing real roots of real polynomials
- A general approach to isolating roots of a bitstream polynomial
- SqFreeEVAL: An (almost) optimal real-root isolation algorithm
- Nearly optimal refinement of real roots of a univariate polynomial
This page was built for publication: Amortized bound for root isolation via Sturm sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3447174)
