An algorithm for calculating continued fractions

DOI10.1016/S0377-0427(77)80020-4MaRDI QIDQ1255757zbMATH OpenOpenAlexFDO

Authors Jozef Miklosko

Publication date 1977

Published in Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0377-0427(77)80020-4

zbMATH Keywords

Computational EfficiencyContinued FractionEfficient AlgorithmDirect Backward ComputationEuler AlgorithmRecurrent Relations

Mathematics Subject Classification ID

Computation of special functions and constants, construction of tables (65D20) Analysis of algorithms and problem complexity (68Q25) Continued fractions (11A55) Continued fractions; complex-analytic aspects (30B70) Convergence and divergence of continued fractions (40A15)

Cites work

• scientific article; zbMATH DE number 3527725 (Why is no real title available?)
• Computational Aspects of Three-Term Recurrence Relations
• Numerical Evaluation of Continued Fractions

Cited in

(2)

• Discussion of algorithms for the computation of generalized continued fractions
• An algorithm for calculating generalized continued fractions

This page was built for publication: An algorithm for calculating continued fractions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1255757)