×

The numerical solution of linear recurrence relations. (English) Zbl 0164.45401


PDFBibTeX XMLCite
Full Text: DOI EuDML

References:

[1] British Association for the Advancement of Science: Bessel functions, part II. Mathematical Tables, Vol. X. Cambridge: Cambridge University Press 1952.
[2] Fort, T.: Finite differences. Oxford: Oxford University Press 1948. · Zbl 0030.11902
[3] Fox, L.: The numerical solution of two-point boundary problems in ordinary differential equations. Oxford: Oxford University Press 1957 · Zbl 0077.11202
[4] Gautschi, W.: Computational aspects of three-term recurrence relations. SIAM Rev.9, 24–82 (1967). · Zbl 0168.15004 · doi:10.1137/1009002
[5] Norton, H. J.: The iterative solution of non-linear ordinary differential equations in Chebyshev series. Computer J.7, 76–85 (1964). · Zbl 0133.08704 · doi:10.1093/comjnl/7.1.76
[6] Oliver, J.: The numerical solution of the initial value problem for linear recurrence relations. Ph. D. Thesis, University of Cambridge 1965.
[7] – Relative error propagation in the recursive solution of linear recurrence relations. Numer. Math.9, 323–340 (1967). · Zbl 0171.13604 · doi:10.1007/BF02162423
[8] – On a recurrence algorithm ofNorton andMiller. (To appear.)
[9] – Inherent instability in systems of first order linear differential equations. J. Inst. Math. Appl. (To appear.) · Zbl 0265.65037
[10] Olver, F. W. J.: Error analysis ofMiller’s recurrence algorithm. Math. Comp.18, 65–74 (1964). · Zbl 0115.34502
[11] – Numerical solution of second-order linear difference equations. J. Res. N.B.S.71 B, 111–129 (1967). · Zbl 0171.36601
[12] Wilkinson, J. H.: Rounding errors in algebraic processes. London: Her Majesty’s Stationery Office 1963.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.