Metraipolis › archive › dc_7ccf34da0360

Miller's recurrence algorithm — Wikipedia (en)

Source
Wikipedia (en)
Original
https://en.wikipedia.org/wiki/Miller%27s_recurrence_algorithm
License (as archived)
CC-BY-SA-4.0
Archived
2026-10-07T14:04:27.394Z
SHA-256 of the archived text
f7d8da64a4963becac653023366f5718d3ba5d7588d47f8e4c2b93c1396331ae
Stable URL of this page
https://metraipolis.com/documento/dc_7ccf34da0360

How to cite

Miller's recurrence algorithm — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Miller%27s_recurrence_algorithm (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_7ccf34da0360 (Metraipolis archive dc_7ccf34da0360, sha256 f7d8da64a4963becac653023366f5718d3ba5d7588d47f8e4c2b93c1396331ae)
BibTeX
@misc{dc7ccf34da0360,
  title = {Miller's recurrence algorithm — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/Miller%27s_recurrence_algorithm},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_7ccf34da0360; sha256 f7d8da64a4963becac653023366f5718d3ba5d7588d47f8e4c2b93c1396331ae},
  year = {2026}
}

Archived text

Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Miller%27s_recurrence_algorithm. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Miller's recurrence algorithm is a procedure for the backward calculation of a rapidly decreasing solution of a three-term 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 functions of different orders with common argument x {\displaystyle x} . The modified Bessel functions of the first kind I n ( x ) {\displaystyle I_{n}(x)} satisfy the recurrence relation I n − 1 ( x ) = 2 n x I n ( x ) + I n + 1 ( x ) {\displaystyle I_{n-1}(x)={\frac {2n}{x}}I_{n}(x)+I_{n+1}(x)} . However, the modified Bessel functions of the second kind K n ( x ) {\displaystyle K_{n}(x)} also satisfy the same recurrence relation K n − 1 ( x ) = 2 n x K n ( x ) + K n + 1 ( x ) {\displaystyle K_{n-1}(x)={\frac {2n}{x}}K_{n}(x)+K_{n+1}(x)} . The first solution decreases rapidly with n {\displaystyle n} . The second solution increases rapidly with n {\displaystyle n} . Miller's algorithm provides a numerically stable procedure to obtain the decreasing solution. To compute the terms of a recurrence a 0 {\displaystyle a_{0}} through a N {\displaystyle a_{N}} according to Miller's algorithm, one first chooses a value M {\displaystyle M} much larger than N {\displaystyle N} and computes a trial solution taking initial condition a M {\displaystyle a_{M}} to an arbitrary non-zero value (such as 1) and taking a M + 1 {\displaystyle a_{M+1}} and later terms to be zero. Then the recurrence relation is used to successively compute trial values for a M − 1 {\displaystyle a_{M-1}} , a M − 2 {\displaystyle a_{M-2}} down to a 0 {\displaystyle a_{0}} . Noting that a second sequence obtained from the trial sequence by multiplication by a constant normalizing factor will still satisfy the same recurrence relation, one can then apply a separate normalizing relationship to determine the normalizing factor that yields the actual solution. In the example of the modified Bessel functions, a suitable normalizing relation is a summation involving the even terms of the recurrence: I 0 ( x ) + 2 ∑ m = 1 ∞ ( − 1 ) m I 2 m ( x ) = 1 {\displaystyle I_{0}(x)+2\sum _{m=1}^{\infty }(-1)^{m}I_{2m}(x)=1} where the infinite summation becomes finite due to the approximation that a M + 1 {\displaystyle a_{M+1}} and later terms are zero. Finally, it is confirmed that the approximation error of the procedure is acceptable by repeating the procedure with a second choice of M {\displaystyle M} larger than the initial choice and confirming that the second set of results for a 0 {\displaystyle a_{0}} through a N {\displaystyle a_{N}} agree within the first set within the desired tolerance. Note that to obtain this agreement, the value of M {\displaystyle M} must be large enough s

Tema degli esploratori: statistica e scienza dei dati (deposito sistematico; categoria «Algorithms»).
Fonte: Wikipedia in inglese, voce «Miller's recurrence algorithm» — https://en.wikipedia.org/wiki/Miller%27s_recurrence_algorithm
Wikidata Q65075350 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q65075350
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Miller%27s_recurrence_algorithm?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1334097767, consultata il 2026-10-07T14:01:12.920Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 4610ea0828e9e718ad68f52496b7c8701077f7ac6ffbf4d60fa9d3c69d9ecb74