Access

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

If you need an accessible version of this item please contact JSTOR User Support

Note on Backward Recurrence Algorithms

F. W. J. Olver and D. J. Sookne
Mathematics of Computation
Vol. 26, No. 120 (Oct., 1972), pp. 941-947
DOI: 10.2307/2005879
Stable URL: http://www.jstor.org/stable/2005879
Page Count: 7
  • Read Online (Free)
  • Download ($34.00)
  • Subscribe ($19.50)
  • Cite this Item
If you need an accessible version of this item please contact JSTOR User Support
Note on Backward Recurrence Algorithms
Preview not available

Abstract

An algorithm is given for the computation of the recessive solution of a second-order linear difference equation, based upon a combination of algorithms due to J. C. P. Miller and F. W. J. Olver. A special feature is automatic and rigorous control of truncation error. The method is illustrated by application to the well-used example of the Bessel functions $J_r(x)$.

Page Thumbnails

  • Thumbnail: Page 
941
    941
  • Thumbnail: Page 
942
    942
  • Thumbnail: Page 
943
    943
  • Thumbnail: Page 
944
    944
  • Thumbnail: Page 
945
    945
  • Thumbnail: Page 
946
    946
  • Thumbnail: Page 
947
    947