Recurrence techniques for the calculation of Bessel functions
HTML articles powered by AMS MathViewer
- by M. Goldstein and R. M. Thaler PDF
- Math. Comp. 13 (1959), 102-108 Request permission
References
-
British Association for the Advancement of Science, “Bessel functions, Part II,” Mathematical Tables, Cambridge University Press, 1952. An application of a recurrence technique to the calculation of ${I_n}(x)$ is credited in the Introduction to J. C. P. Miller. An extension of this technique for use on high speed computers for the calculation of Bessel functions of integral and half integral order appeared in print after the completion of this manuscript. I. A. Stegun & M. Abramowitz, “Generation of Bessel functions on high speed computers,” MTAC, v. XI, 1957, p. 255.
- G. N. Watson, A Treatise on the Theory of Bessel Functions, Cambridge University Press, Cambridge, England; The Macmillan Company, New York, 1944. MR 0010746
- Yudell L. Luke, Simple formulas for the evaluation of some higher transcendental functions, J. Math. and Phys. 34 (1956), 298–307. MR 78047, DOI 10.1002/sapm1955341298
- Henry E. Fettis, Numerical calculation of certain definite integrals by Poisson’s summation formula, Math. Tables Aids Comput. 9 (1955), 85–92. MR 72546, DOI 10.1090/S0025-5718-1955-0072546-0
- M. Goldstein and R. M. Thaler, Bessel functions for large arguments, Math. Tables Aids Comput. 12 (1958), 18–26. MR 102906, DOI 10.1090/S0025-5718-1958-0102906-3 M. Goldstein & M. Kresge, NU BES I, Share Distribution 469, Share Program Librarian, IBM, 590 Madison Avenue, New York 22, New York.
Additional Information
- © Copyright 1959 American Mathematical Society
- Journal: Math. Comp. 13 (1959), 102-108
- MSC: Primary 65.00
- DOI: https://doi.org/10.1090/S0025-5718-1959-0105794-5
- MathSciNet review: 0105794