Lentz's algorithm: Difference between revisions

Content deleted Content added
Algorithm: Added cite
Citation bot (talk | contribs)
Alter: title, pages. Add: s2cid, isbn, pages, bibcode, pmid, doi, authors 1-1. Removed proxy/dead URL that duplicated identifier. Removed parameters. Formatted dashes. Some additions/deletions were parameter name changes. | Use this bot. Report bugs. | Suggested by Dominic3203 | Category:Mathematics | #UCB_Category 9/11
Line 1:
In mathematics, '''Lentz's algorithm''' is an [[algorithm]] to evaluate [[generalized continued fraction|continued fraction]]s and compute tables of spherical [[Bessel function]]s.<ref name=":0">{{Cite journal|last=Lentz|first=W. J.|date=1973-09-01|title=A Method of Computing Spherical Bessel Functions of Complex Argument with Tables|url=http://dx.doi.org/10.21236/ad0767223|___location=Fort Belvoir, VA|doi=10.21236/ad0767223 }}</ref>
 
== History ==
The idea was introduced in 1973 by William J. Lentz<ref name=":0" /> and was simplified by him in 1982.<ref>{{Cite book|last=J.|first=Lentz, W.|url=http://worldcat.org/oclc/227549426|title=A Simplification of Lentz's Algorithm.|date=August 1982|publisher=Defense Technical Information Center|oclc=227549426}}</ref> Lentz suggested that calculating ratios of spherical Bessel functions of complex arguments can be difficult. He developed a new continued fraction technique for calculating them. This method was an improvement compared to other methods because it eliminated errors on certain terms or provided zero as a result. The original algorithm assumes that the denominators occurring during execution remain non-zero throughout. Improvements to overcome this limitation include an altered recurrence relation<ref>{{Cite journal|lastlast1=Jaaskelainen|firstfirst1=T.|last2=Ruuskanen|first2=J.|date=1981-10-01|title=Note on Lentz’sLentz's algorithm|url=http://dx.doi.org/10.1364/ao.20.003289|journal=Applied Optics|volume=20|issue=19|pages=3289|doi=10.1364/ao.20.003289|pmid=20333144 |bibcode=1981ApOpt..20.3289J |issn=0003-6935}}</ref> 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.<ref>{{Cite journal|lastlast1=Thompson|firstfirst1=I.J.|last2=Barnett|first2=A.R.|date=1986|title=Coulomb and Bessel functions of complex arguments and order|url=http://dx.doi.org/10.1016/0021-9991(86)90046-x|journal=Journal of Computational Physics|volume=64|issue=2|pages=490–509|doi=10.1016/0021-9991(86)90046-x|bibcode=1986JCoPh..64..490T |issn=0021-9991}}</ref>
 
== Initial work ==
This theory was initially motivated by Lentz's other research when he calculated ratios of Bessel function necessary for [[Mie scattering]]. He demonstrated that the algorithm uses a technique involving the evaluation continued fractions that starts from the beginning and not at the tail. In addition, continued fraction representations for both ratios of Bessel functions and spherical Bessel functions of consecutive order can be computed with Lentz's algorithm.<ref>{{Cite journal|last=Lentz|first=William J.|date=1976-03-01|title=Generating Bessel functions in Mie scattering calculations using continued fractions|url=http://dx.doi.org/10.1364/ao.15.000668|journal=Applied Optics|volume=15|issue=3|pages=668668–671|doi=10.1364/ao.15.000668|pmid=20165036 |bibcode=1976ApOpt..15..668L |issn=0003-6935}}</ref> The algorithm suggested that it is possible to terminate the evaluation of continued fractions when <math>|f_j-f_{j-1} |</math> is relatively small.<ref>{{Cite journal|lastlast1=Masmoudi|firstfirst1=Atef|last2=Bouhlel|first2=Med Salim|last3=Puech|first3=William|date=March 2012|title=Image encryption using chaotic standard map and engle continued fractions map|url=http://dx.doi.org/10.1109/setit.2012.6481959|journal=2012 6th International Conference on Sciences of Electronics, Technologies of Information and Telecommunications (SETIT)|pages=474–480 |publisher=IEEE|doi=10.1109/setit.2012.6481959|isbn=978-1-4673-1658-3 |s2cid=15380706 }}</ref>
 
== Algorithm ==
Line 62:
:<math>{D}_{n} = \frac{1}{{b}_{n} + {a}_{n} {D}_{n - 1}}</math>
 
When the product <math>{C}_{n} {D}_{n}</math> approaches unity with increasing <math>n</math>, it is hoped that <math>{f}_{n}</math> has converged to <math>f</math>.<ref>{{Cite book |lastlast1=Press |firstfirst1=W.H. |title=Numerical Recipes: The Art of Scientific Computing |last2=Teukolsky |first2=S.A. |last3=Vetterling |first3=W.T. |last4=Flannery |first4=B. P. |publisher=Cambridge University Press |year=2007 |edition=3rd |pages=207–208}}</ref>
 
== Applications ==
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 almost as good as the other methods. As an example, it was applied to evaluate exponential integral functions. This application was then called modified Lentz algorithm.<ref>{{Cite journal|lastlast1=Press|firstfirst1=William H.|last2=Teukolsky|first2=Saul A.|date=1988|title=Evaluating Continued Fractions and Computing Exponential Integrals|url=http://dx.doi.org/10.1063/1.4822777|journal=Computers in Physics|volume=2|issue=5|pages=88|doi=10.1063/1.4822777|bibcode=1988ComPh...2...88P |issn=0894-1866|doi-access=free}}</ref> 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.<ref>{{Cite journal|lastlast1=Wand|firstfirst1=Matt P.|last2=Ormerod|first2=John T.|date=2012-09-18|title=Continued fraction enhancement of Bayesian computing|url=http://dx.doi.org/10.1002/sta4.4|journal=Stat|volume=1|issue=1|pages=31–41|doi=10.1002/sta4.4|s2cid=119636237 |issn=2049-1573}}</ref>
 
==References==