Miller's recurrence algorithm
id:
miller-s-recurrence-algorithm-196-2670405
title:
Miller's recurrence algorithm
text:
Miller's recurrence algorithm is a procedure for calculating a rapidly decreasing solution of a linear recurrence relation developed by J. C. P. Miller. It was originally developed to compute tables of the modified Bessel function but also applies to Bessel functions of the first kind and has other applications such as computation of the coefficients of Chebyshev expansions of other special functions. Many families of special functions satisfy a recurrence relation that relates the values of the
brand slug:
wiki
category slug:
encyclopedia
description:
Procedure for calculating a rapidly decreasing solution of a linear recurrence relation
original url:
https://en.wikipedia.org/wiki/Miller%27s_recurrence_algorithm
date created:
date modified:
2021-12-17T14:35:07Z
main entity:
{"identifier":"Q65075350","url":"https://www.wikidata.org/entity/Q65075350"}
image:
fields total:
13
integrity:
14