A fast algorithm for repeated computation of linear recurrence relations

DOI10.1007/BF01933452zbMath0378.65064OpenAlexW2064110565MaRDI QIDQ4157912

Jozef Miklosko

Publication date: 1977

Published in: BIT (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01933452

Mathematics Subject Classification ID

Extrapolation to the limit, deferred corrections (65B05) Iterative numerical methods for linear systems (65F10) Convergence and divergence of continued fractions (40A15)

Related Items (1)

An algorithm for calculating generalized continued fractions

This page was built for publication: A fast algorithm for repeated computation of linear recurrence relations