On continued fraction expansion of real roots of polynomial systems, complexity and condition numbers
From MaRDI portal
(Redirected from Publication:533873)
Recommendations
- Continued fraction expansion of real roots of polynomial systems
- On the complexity of real root isolation using continued fractions
- Complexity of real root isolation using continued fractions
- Complexity of real root isolation using continued fractions
- On the roots of expanding integer polynomials
- On the complexity of computing real radicals of polynomial systems
- scientific article; zbMATH DE number 3960882
- Univariate Polynomial Real Root Isolation: Continued Fractions Revisited
- On the Real Parts of the Zeros of Complex Polynomials and Applications to Continued Fraction Expansions of Analytic Functions
- Real numbers with polynomial continued fraction expansions
Cites work
- scientific article; zbMATH DE number 3959523 (Why is no real title available?)
- scientific article; zbMATH DE number 1253962 (Why is no real title available?)
- scientific article; zbMATH DE number 784876 (Why is no real title available?)
- scientific article; zbMATH DE number 1446863 (Why is no real title available?)
- scientific article; zbMATH DE number 5019917 (Why is no real title available?)
- scientific article; zbMATH DE number 3191380 (Why is no real title available?)
- A Generalization of a Theorem of Bôcher
- A Short Proof and a Generalization of Miranda's Existence Theorem
- A new proof of Vincent's theorem
- A numerical algorithm for zero counting. I: Complexity and accuracy
- A numerical algorithm for zero counting. II: Distance to ill-posedness and smoothed analysis
- Almost tight recursion tree bounds for the Descartes method
- Approximating the zeros of analytic functions by the exclusion algorithm
- COMPLEXITY AND REAL COMPUTATION: A MANIFESTO
- Complexity of Bezout's Theorem I: Geometric Aspects
- Complexity of real root isolation using continued fractions
- Computation of the solutions of nonlinear polynomial systems
- Computing nearest gcd with certification
- Computing roots of polynomials by quadratic clipping
- Computing the real roots of a polynomial by the exclusion algorithm
- Continued fraction expansion of real roots of polynomial systems
- Faster algorithms for computing Hong's bound on absolute positiveness
- Investigation of a subdivision based algorithm for solving systems of polynomial equations.
- On the complexity of real root isolation using continued fractions
- Real Algebraic Numbers: Complexity Analysis and Experimentation
- Solving a Polynomial Equation: Some History and Recent Progress
- Subdivision methods for solving polynomial equations
- Tame geometry with application in smooth analysis
- The DMM bound: multivariate (aggregate) separation bounds
- Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding
Cited in
(14)- Univariate Polynomial Real Root Isolation: Continued Fractions Revisited
- Continuous amortization and extensions: with applications to bisection-based root isolation
- Continued fraction expansion of real roots of polynomial systems
- A quadratic clipping step with superquadratic convergence for bivariate polynomial systems
- Certified numerical real root isolation for bivariate nonlinear systems
- Effective subdivision algorithm for isolating zeros of real systems of equations, with complexity analysis
- On the complexity of real root isolation using continued fractions
- Nearly optimal refinement of real roots of a univariate polynomial
- Moment closure approximations of the Boltzmann equation based on \(\varphi \)-divergences
- The complexity of subdivision for diameter-distance tests
- Univariate real root isolation over a single logarithmic extension of real algebraic numbers
- Real Root Isolation of Polynomial Equations Based on Hybrid Computation
- Subtropical real root finding
- A generic position based method for real root isolation of zero-dimensional polynomial systems
This page was built for publication: On continued fraction expansion of real roots of polynomial systems, complexity and condition numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q533873)
