Miller's Recurrence Algorithm

Miller's recurrence algorithm, developed by J. C. P. Miller, is a numerically stable procedure for computing the rapidly decreasing solutions of a three-term recurrence relation. It was devised to compute tables of the modified Bessel function and also applies to Bessel functions of the first kind and to the coefficients of Chebyshev expansions of other special functions; it is particularly efficient when values are needed for every order from zero up to some maximum N at a given argument, since computing them together this way is cheaper than computing each one independently. This description is adapted from Wikipedia contributors under CC BY-SA 4.0; changes were made. https://creativecommons.org/licenses/by-sa/4.0/