Skip to main content
SpringerLink
Log in

An algorithmic decomposition system for second order recurrence relations

  • Published:
BIT Numerical Mathematics Aims and scope Submit manuscript

Abstract

A new technique of accurate stable computation of sequences satisfying non-homogeneous three term recurrence relations is presented. A decomposition system consisting of one non-linear and two linear first order recurrence relations is obtained. Forward or backward recursion directions of the linear relations provide additional flexibility in computation. This leads to an integrated system of three algorithms which can accurately compute the desired solution in each region of the solution set to the original second order relations. Applications are well known and numerical examples include Bessel functions of the second kind, Anger-Weber functions, and Lommel functions.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. M. Abramowitz and I. A. Stegun,Handbook of Mathematical Functions, National Bureau of Standards, Applied Mathematics, Series 55, U.S. Government Printing Office, Washington, D.C., 1964.

    Google Scholar 

  2. V. B. Aggarwal and J. W. Burgmeier,The Computation of Solutions to Second Order Recurrence Relations by Reduction to First Order Relations, Technical Report, The University of Vermont, 1977.

  3. D. E. Amos and J. W. Burgmeier,Computation with three-term linear, nonhomogeneous recursion relations, SIAM Review 15 (1973), 335–351.

    Google Scholar 

  4. W. Gautschi,Computational aspects of three-term recurrence relations, SIAM Review 9 (1967), 24–82.

    Google Scholar 

  5. W. Gautschi,Recursive computation of certain integrals, JACM 8 (1961), 21–40.

    Google Scholar 

  6. J. Oliver,The numerical solution of linear recurrence relations, Numer. Math. 11 (1968), 349–360.

    Google Scholar 

  7. J. Oliver,Relative error propagation in the recursive solution of linear recurrence relations, Numer. Math. 9 (1967), 323–340.

    Google Scholar 

  8. F. W. J. Olver,Numerical solution of second-order linear difference equations, J. Res. Nat. Bur. Standards, Sect. B. 71B (1967), 111–129.

    Google Scholar 

  9. F. W. J. Olver,Bounds for the solutions of second-order linear difference equations, J. Res. Nat. Bur. Standards, Sect. B, 71B (1967), 161–166.

    Google Scholar 

  10. H. Shintani,Note on Miller's recurrence algorithm, J. Sci. Hiroshima Univ. Ser. A-1 29 (1965), 121–133.

    Google Scholar 

  11. G. N. Watson,Theory of Bessel functions, Second Edition, Cambridge University Press, 1944.

  12. British Association for the Advancement of Science,Bessel functions — Part II, Mathematical Tables, 10 (1952), Cambridge University Press.

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, The University of Vermont, 05401, Burlington, Vermont, USA

    Vijay B. Aggarwal & James W. Burgmeier

Authors
  1. Vijay B. Aggarwal
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. James W. Burgmeier
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Aggarwal, V.B., Burgmeier, J.W. An algorithmic decomposition system for second order recurrence relations. BIT 18, 241–258 (1978). https://doi.org/10.1007/BF01930894

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01930894

Keywords

Search

Navigation