Error analysis of Miller’s recurrence algorithm
- 1 January 1964
- journal article
- Published by American Mathematical Society (AMS) in Mathematics of Computation
- Vol. 18 (85) , 65-74
- https://doi.org/10.1090/s0025-5718-1964-0169406-9
Abstract
Miller’s algorithm is a device for computing the most rapidly decreasing solution of a second-order linear difference equation. In this paper strict upper bounds are given for the errors in the values yielded by the algorithm, and general conclusions are drawn concerning the accuracy of the process.Keywords
This publication has 11 references indexed in Scilit:
- Chebyshev Methods for Ordinary Differential EquationsThe Computer Journal, 1962
- Recursive Computation of the Repeated Integrals of the Error FunctionMathematics of Computation, 1961
- The Calculation of Toroidal HarmonicsMathematics of Computation, 1960
- Generation of Spherical Bessel Functions in Digital ComputersJournal of the ACM, 1959
- Recurrence Techniques for the Calculation of Bessel FunctionsMathematical Tables and Other Aids to Computation, 1959
- Note on empirical bounds for generating Bessel functionsCommunications of the ACM, 1958
- Generation of Bessel Functions on High Speed ComputersMathematical Tables and Other Aids to Computation, 1957
- 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
- RPublished by Elsevier ,1956