Computational Aspects of Three-Term Recurrence Relations
- 1 January 1967
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Review
- Vol. 9 (1), 24-82
- https://doi.org/10.1137/1009002
Abstract
No abstract availableThis publication has 29 references indexed in Scilit:
- Algorithms: Algorithm 259: Legendre Functions for arguments larger than oneCommunications of the ACM, 1965
- Numerical Evaluation of Continued FractionsSIAM Review, 1964
- Algorithm 236: Bessel Functions of the First KindCommunications of the ACM, 1964
- Algorithm 221: Gamma functionsCommunications of the ACM, 1964
- The Numerical Treatment of Differential EquationsPublished by Springer Nature ,1960
- Generation of Spherical Bessel Functions in Digital ComputersJournal of the ACM, 1959
- The numerical solution of linear differential equations in Chebyshev seriesMathematical Proceedings of the Cambridge Philosophical Society, 1957
- On the Computation of Auxiliary Functions for Two-Center Integrals by Means of a High-Speed ComputerThe Journal of Chemical Physics, 1956
- Die Konfluente Hypergeometrische FunktionPublished by Springer Nature ,1953
- Some Recurrence Formulae in the Incomplete Beta Function RatioThe Annals of Mathematical Statistics, 1949