A Variant of the Continued Fraction Expansion Algorithm
Alexandru Horváth · Procedia Technology · 2015
In this note we introduce a new algorithm to compute the continued fraction of a real number. The main difference to the classical algorithm is that our algorithm uses only the number itself to be developed in continued fraction in every step of the iteration process, i.e. the number to be developed in continued fraction is not altered during the steps of the iteration process. By this way the cumulative numerical errors of the floating point computations of the traditional algorithm can be avoided.