Fast computation of periodic continued fractions (Q750520)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4175088
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fast computation of periodic continued fractions |
scientific article; zbMATH DE number 4175088 |
Statements
Fast computation of periodic continued fractions (English)
0 references
1989
0 references
The authors describe an O(log n) algorithm for computing the n-th convergent of a periodic continued fraction. Their algorithm is based on a scheme for substituting rational forms as symbolic terms in other rational forms. This allows a successive doubling of the number of cycles computed, where the first cycle is the periodic component of the continued fraction. The applications listed are to the computation of quadratic surds and to second order linear recurrences.
0 references
substitution scheme
0 references
algorithm
0 references
convergent of a periodic continued fraction
0 references
rational forms
0 references
computation of quadratic surds
0 references
second order linear recurrences
0 references
0 references
0.9732504
0 references
0.94182014
0 references
0.92560077
0 references
0.9245656
0 references
0 references
0.90311927
0 references
