Skip to main content
Log in

A summation technique for minimal solutions of linear homogeneous difference equations

Eine Summationsmethode für Minimallösungen von linearen homogenen Differenzengleichungen

  • Published:
Computing Aims and scope Submit manuscript

Abstract

A computationally economic summation technique for minimal solutions of linear homogeneous difference equations of arbitrary order is presented. Its numerical stability is shown by means of a rounding error analysis. The results are illustrated by numerical examples.

Zusammenfassung

Es wird eine effiziente Summationsmethode für Minimallösungen von linearen homogenen Differenzengleichungen beliebiter Ordnung vorgeschlagen. Ihre numerische Stabilität wird durch eine Rundungsfehleranalyse gezeigt. Die Resultate werden durch numerische Beispiele veranschaulicht.

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

Access this article

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Abromowitz, M., Stegun, I. A. (eds.): Handbook of Mathematical Functions. New York: Dover Publ. 1965.

    Google Scholar 

  2. Barth, W., Martin, R. S., Wilkinson, J. H.: Calculation of the Eigenvalues of a Symmetric Tridiagonal Matrix by the Method of Bisection. Numer. Math.9, 386–393 (1967).

    Google Scholar 

  3. Brand, L.: Differential and Difference Equations. New York: Wiley 1966.

    Google Scholar 

  4. Bulirsch, R., Stoer, J.: Darstellung von Funktionen in Rechenautomaten in [16]. S. 352–445.

    Google Scholar 

  5. Clenshaw, C. W.: A note on the summation of Chebyshev series. MTAC9, 118–120 (1955).

    Google Scholar 

  6. Deuflhard, P.: On Algorithms for the Summation of Certain Special Functions. Computing17, 37–48 (1976).

    Google Scholar 

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

    Google Scholar 

  8. Goertzel, G.: An Algorithm for the Evaluation of Finite Trigonometric Series. Amer. Math. Monthly65, 34–35 (1958).

    Google Scholar 

  9. Meixner, J., Schäfke, W.: Mathieusche Funktionen und Sphäroidfunktionen. Berlin-Göttingen-Heidelberg: Springer 1954.

    Google Scholar 

  10. Miller, J. C. P.: Bessel functions, Part II (Math. Tables X). Cambridge University Press 1952.

  11. Olver, F. W. J.: Error Analysis of Miller's Recurrence Algorithm. Math. Comp.18, 65–74 (1964).

    Google Scholar 

  12. Olver, F. W. J.: Numerical Solution of Second-Order Linear Difference Equations. J. Res. N.B.S.71B, 111–129 (1967).

    Google Scholar 

  13. Olver, F. W. J., Sookne, D. J.: Note on Backward Recurrence Algorithms. Math. Comp.26, 941–947 (1972).

    Google Scholar 

  14. Perron, O.: Die Lehre von den Kettenbrüchen. Stuttgart: Teubner (Bd. I.: 1954, Bd. II: 1957).

    Google Scholar 

  15. Reinsch, Chr.: A Note on Trigonometric Interpolation. Unpublished Manuscript (results available in [4].

    Google Scholar 

  16. Sauer, R., Szabò, I. (eds.): Mathematische Hilfsmittel des Ingenieurs, Teil III. Berlin-Heidelberg-New York: Springer 1968.

    Google Scholar 

  17. Shintani, H.: Note on Miller's Recurrence Algorithm. J. Sci. Hiroshima Univ. Ser.A-I29, 121–133 (1965).

    Google Scholar 

  18. Stoer, J.: Einführung in die Numerische Mathematik I. Berlin-Heidelberg-New York: Springer 1972. (HTB 105.)

    Google Scholar 

  19. Wilkinson, J. H.: The Algebraic Eigenvalue Problem. Oxford: Clarendon Press 1965.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Deuflhard, P. A summation technique for minimal solutions of linear homogeneous difference equations. Computing 18, 1–13 (1977). https://doi.org/10.1007/BF02248773

Download citation

  • Received:

  • Issue Date:

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

Keywords

Navigation