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. <ref>{{Cite book |last1=Press |first1=W.H. |title=Numerical Recipes in Fortran, 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=1992 |edition=2nd |page=165}}</ref>As an example, it was applied to evaluate exponential integral functions. This application was then called modified Lentz algorithm.<ref>{{Cite journal|last1=Press|first1=William H.|last2=Teukolsky|first2=Saul A.|date=1988|title=Evaluating Continued Fractions and Computing Exponential Integrals|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|last1=Wand|first1=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|pmid=22533111 |s2cid=119636237 |issn=2049-1573}}</ref>
