On the computing time of the continued fractions method
symmetric functionsFibonacci numberssubadditivitycomputing time lower boundscontinued fractions methodloxodromic transformationsmatrix factorization algorithmMignotte polynomialspolynomial real root isolation
Complexity and performance of numerical algorithms (65Y20) Continued fractions (11A55) Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Real polynomials: location of zeros (26C10) Numerical computation of roots of polynomial equations (65H04) Polynomials in real and complex fields: location of zeros (algebraic theorems) (12D10)
- The Computational Complexity of Continued Fractions
- Fast computation of continued fractions
- Fast computation of periodic continued fractions
- scientific article; zbMATH DE number 3965304
- scientific article; zbMATH DE number 1408352
- scientific article; zbMATH DE number 4074374
- scientific article; zbMATH DE number 3874603
- On the continued fraction and Berlekamp's algorithm (Corresp.)
- scientific article; zbMATH DE number 3750284 (Why is no real title available?)
- scientific article; zbMATH DE number 3785018 (Why is no real title available?)
- scientific article; zbMATH DE number 1253962 (Why is no real title available?)
- scientific article; zbMATH DE number 718142 (Why is no real title available?)
- scientific article; zbMATH DE number 1157659 (Why is no real title available?)
- scientific article; zbMATH DE number 1975686 (Why is no real title available?)
- scientific article; zbMATH DE number 194969 (Why is no real title available?)
- scientific article; zbMATH DE number 3273551 (Why is no real title available?)
- scientific article; zbMATH DE number 3303654 (Why is no real title available?)
- scientific article; zbMATH DE number 3032896 (Why is no real title available?)
- scientific article; zbMATH DE number 3057883 (Why is no real title available?)
- scientific article; zbMATH DE number 3058859 (Why is no real title available?)
- A new proof of Vincent's theorem
- A short note on a new method for polynomial real root isolation
- Advances on the Continued Fractions Method Using Better Estimations of Positive Root Bounds
- Almost tight recursion tree bounds for the Descartes method
- Architecture-aware classical Taylor shift by 1
- Complexity of real root isolation using continued fractions
- Complexity of real root isolation using continued fractions
- Efficient isolation of polynomial's real roots.
- Elements of the theory of functions. Translated by F. Bagemihl
- Implementations of a new theorem for computing bounds for positive roots of polynomials
- New bounds for the Descartes method
- On the Problem of Runs
- On the complexity of real root isolation using continued fractions
- On the distance between the roots of a polynomial
- The Computing Time of the Euclidean Algorithm
- The fastest exact algorithms for the isolation of the real roots of a polynomial equation
- Zur Abzählung der reellen Wurzeln algebraischer Gleichungen
- A comparative study of two real root isolation methods
- Fast computation of periodic continued fractions
- Fast computation of continued fraction expansions.
- Complexity of real root isolation using continued fractions
- Continued fraction real root isolation using the Hong root bound
- Complexity of real root isolation using continued fractions
- Tree breadth of the continued fractions root finding method
- On the maximum computing time of the bisection method for real root isolation
- The Computational Complexity of Continued Fractions
This page was built for publication: On the computing time of the continued fractions method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q438690)
