In mathematics, Lentz's algorithm is an algorithm to evaluate continued fractions and compute tables of spherical Bessel functions.[1] [2]
The version usually employed now is due to Thompson and Barnett.
The idea was introduced in 1973 by William J. Lentz and was simplified by him in 1982.[3] Lentz suggested that calculating ratios of spherical Bessel functions of complex arguments can be difficult. He developed a new continued fraction technique for calculating the ratios of spherical Bessel functions of consecutive order. This method was an improvement compared to other methods because it started from the beginning of the continued fraction rather than the tail, had a built-in check for convergence, and was numerically stable. The original algorithm uses algebra to bypass a zero in either the numerator or denominator.[4] Simpler Improvements to overcome unwanted zero terms include an altered recurrence relation[5] suggested by Jaaskelainen and Ruuskanen in 1981 or a simple shift of the denominator by a very small number as suggested by Thompson and Barnett in 1986.[6]
This theory was initially motivated by Lentz's need for accurate calculation of ratios of spherical Bessel function necessary for Mie scattering. He created a new continued fraction algorithm that starts from the beginning of the continued fraction and not at the tail-end. This eliminates guessing how many terms of the continued fraction are needed for convergence. In addition, continued fraction representations for both ratios of Bessel functions and spherical Bessel functions of consecutive order themselves can be computed with Lentz's algorithm.[4] The algorithm suggested that it is possible to terminate the evaluation of continued fractions when
|fj-fj-1|
Lentz's algorithm is based on the Wallis-Euler relations. If
{f}0={b}0
{f}1={b}0+
| {a | |
| 1 |
{f}2={b}0+
| {a | |
| 1 |
{f}3={b}0+
| {a | |
| 1 |
etc., or using the big-K notation, if
{f}n={b}0+\underset{j=1}\overset{n}\operatorname{K}
| {a | |
| j |
is the
n
f
{f}n=
| {A | |
| n |
where
{A}n
{B}n
{A}-=1
{B}-=0
{A}0={b}0
{B}0=1
{A}n={b}n{A}n+{a}n{A}n
{B}n={b}n{B}n+{a}n{B}n
Lentz's method defines
{C}n=
| {A | |
| n |
{D}n=
| {B | |
| n |
so that the
n
{f}n={C}n{D}n{f}n
and uses the recurrence relations
{C}0=
| {A | |
| 0 |
{D}0=
| {B | |
| - |
{f}0={b}0
{C}n={b}n+
| {a | |
| n |
{D}n=
| 1 | |
| {b |
n+{a}n{D}n
When the product
{C}n{D}n
n
{f}n
f
Lentz's algorithm was used widely in the late twentieth century. It was suggested that it doesn't have any rigorous analysis of error propagation. However, a few empirical tests suggest that it's at least as good as the other methods.[9] As an example, it was applied to evaluate exponential integral functions. This application was then called modified Lentz algorithm.[10] It's also stated that the Lentz algorithm is not applicable for every calculation, and convergence can be quite rapid for some continued fractions and vice versa for others.[11]