Algorithms for calculating continued fractions
From MaRDI portal
Algorithms for calculating continued fractions are proposed. These algorithms are effective for calculating long series of approximants of continued fractions. The algorithms developed are stable with respect to the accumulation of the computational error. Series of approximants of continued fractions can be used to calculate the continued fractions that are divergent in the classical sense.
Recommendations
Cited in
(12)- Rounding error analysis for forward continued fraction algorithms
- Comparison of various generalizations of continued fractions
- A chained-matrices approach for parallel computation of continued fractions and its applications
- Algorithm for summation of divergent continued fractions and some applications
- Description of Generalized Continued Fractions by Finite Automata
- scientific article; zbMATH DE number 3874603 (Why is no real title available?)
- scientific article; zbMATH DE number 3930224 (Why is no real title available?)
- On finite continued fractions
- scientific article; zbMATH DE number 1113823 (Why is no real title available?)
- scientific article; zbMATH DE number 4000289 (Why is no real title available?)
- scientific article; zbMATH DE number 1408352 (Why is no real title available?)
- Some applications of the summation algorithm of continued fractions
This page was built for publication: Algorithms for calculating continued fractions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1571233)