Error analysis of recurrence equations
HTML articles powered by AMS MathViewer
- by R. Tait PDF
- Math. Comp. 21 (1967), 629-638 Request permission
Abstract:
An error analysis of the Miller algorithm for computation from threeterm recurrence equations is given. Bounds are supplied in terms of the known coefficients and a method of finding suitable starting values for prescribed relative error is investigated.References
- Tomlinson Fort, Finite Differences and Difference Equations in the Real Domain, Oxford, at the Clarendon Press, 1948. MR 0024567
- A. Ya. Khintchine, Continued fractions, P. Noordhoff Ltd., Groningen, 1963. Translated by Peter Wynn. MR 0161834
- Alexey Nikolaevitch Khovanskii, The application of continued fractions and their generalizations to problems in approximation theory, P. Noordhoff N. V., Groningen, 1963. Translated by Peter Wynn. MR 0156126 S. Makinouchi, Tech. Rep. Osaka Univ., No. 659, Vol. 15, Osaka, Japan. J. C. P. Miller, "Bessel functions, Part II," in Mathematical Tables, Vol. X, British Assoc. Advancement Sci., Cambridge Univ. Press, New York, 1952.
- F. W. J. Olver, Error analysis of Miller’s recurrence algorithm, Math. Comp. 18 (1964), 65–74. MR 169406, DOI 10.1090/S0025-5718-1964-0169406-9 H. Shintani, J. Sci. Hiroshima Univ., Ser. A-I, v. 29, 1965, pp. 121–133.
- Irene A. Stegun and Milton Abramowitz, Generation of Bessel functions on high speed computers, Math. Tables Aids Comput. 11 (1957), 255–257. MR 93939, DOI 10.1090/S0025-5718-1957-0093939-3
- Milton Abramowitz and Irene A. Stegun, Handbook of mathematical functions with formulas, graphs, and mathematical tables, National Bureau of Standards Applied Mathematics Series, No. 55, U. S. Government Printing Office, Washington, D.C., 1964. For sale by the Superintendent of Documents. MR 0167642
Additional Information
- © Copyright 1967 American Mathematical Society
- Journal: Math. Comp. 21 (1967), 629-638
- MSC: Primary 65.25
- DOI: https://doi.org/10.1090/S0025-5718-1967-0221736-0
- MathSciNet review: 0221736