Continuous amortization and extensions: with applications to bisection-based root isolation
From MaRDI portal
Publication:277222
DOI10.1016/j.jsc.2016.01.007zbMath1358.68328OpenAlexW2309534700MaRDI QIDQ277222
Publication date: 4 May 2016
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jsc.2016.01.007
Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Effectivity, complexity and computational aspects of algebraic geometry (14Q20)
Related Items (6)
Near optimal subdivision algorithms for real root isolation ⋮ Functional norms, condition numbers and numerical algorithms in algebraic geometry ⋮ On the complexity of the Plantinga-Vegter algorithm ⋮ Condition numbers for the cube. I: Univariate polynomials and hypersurfaces ⋮ Certified simultaneous isotopic approximation of pairs of curves via subdivision ⋮ The complexity of subdivision for diameter-distance tests
Uses Software
Cites Work
- On continued fraction expansion of real roots of polynomial systems, complexity and condition numbers
- SqFreeEVAL: An (almost) optimal real-root isolation algorithm
- On the complexity of isolating real roots and computing with certainty the topological degree
- An implementation of Vincent's theorem
- Bounds on a polynomial
- On nearest-neighbor graphs
- On the solution of linear recurrence equations
- Efficient isolation of polynomial's real roots.
- An algebraic algorithm to isolate complex polynomial zeros using Sturm sequences
- Interval arithmetic in cylindrical algebraic decomposition
- On the complexity of computing with planar algebraic curves
- On the complexity of the Descartes method when using approximate arithmetic
- Vincent's theorem of 1836: overview and future research
- New bounds for the Descartes method
- Note on Vincent's theorem
- Near Optimal Subdivision Algorithms for Real Root Isolation
- Almost tight recursion tree bounds for the Descartes method
- An Exact Method for Finding the Roots of a Complex Polynomial
- A Global Bisection Algorithm for Computing the Zeros of Polynomials in the Complex Plane
- On the complexity of solving a bivariate polynomial system
- Near optimal tree size bounds on a simple real root isolation algorithm
- A simple but exact and efficient algorithm for complex root isolation
- Real Algebraic Numbers: Complexity Analysis and Experimentation
- Information Theory and Statistics: A Tutorial
- Algorithms in real algebraic geometry
- Sylvester-Habicht sequences and fast Cauchy index computation
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Continuous amortization and extensions: with applications to bisection-based root isolation
