On the computing time of the continued fractions method

DOI10.1016/J.JSC.2012.03.003zbMATH Open1250.65066OpenAlexW2005451469MaRDI QIDQ438690FDOQ438690

George E. Collins, Werner Krandick

Publication date: 31 July 2012

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jsc.2012.03.003

Recommendations

• 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
• scientific article; zbMATH DE number 3874603
• On the continued fraction and Berlekamp's algorithm (Corresp.)

zbMATH Keywords

symmetric functionsFibonacci numberssubadditivitycomputing time lower boundscontinued fractions methodloxodromic transformationsmatrix factorization algorithmMignotte polynomialspolynomial real root isolation

Mathematics Subject Classification ID

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)

Cites Work

• Efficient isolation of polynomial's real roots.
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• New bounds for the Descartes method
• Almost tight recursion tree bounds for the Descartes method
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A new proof of Vincent's theorem
• Complexity of real root isolation using continued fractions
• On the complexity of real root isolation using continued fractions
• Implementations of a new theorem for computing bounds for positive roots of polynomials
• On the distance between the roots of a polynomial
• On the Problem of Runs
• The fastest exact algorithms for the isolation of the real roots of a polynomial equation
• Zur Abzählung der reellen Wurzeln algebraischer Gleichungen
• Elements of the theory of functions. Translated by F. Bagemihl
• Advances on the Continued Fractions Method Using Better Estimations of Positive Root Bounds
• Title not available (Why is that?)
• A short note on a new method for polynomial real root isolation
• The Computing Time of the Euclidean Algorithm
• Architecture-aware classical Taylor shift by 1
• Title not available (Why is that?)

Cited In (6)

• Fast computation of periodic continued fractions
• Fast computation of continued fraction expansions.
• Continued fraction real root isolation using the Hong root bound
• On the maximum computing time of the bisection method for real root isolation
• The Computational Complexity of Continued Fractions
• A comparative study of two real root isolation methods

Uses Software

• OEIS
• ISOLATE

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)