[UP]

Manual Reference Pages  - besj (3)

NAME
besj(3f) - [M_bessel] compute the J Bessel function for a given argument and order

CONTENTS

Synopsis
Description
Options
Example

SYNOPSIS
subroutine besj(x,n,bj,d,ier)

DESCRIPTION

    REMARKS
N must be greater than or equal to zero, but it must be less than
20+10*X-X** 2/3
  For X less than or equal to 15
90+X/2 For X greater than 15

    SUBROUTINES AND FUNCTION SUBPROGRAMS REQUIRED
none

    METHOD
Recurrence relation technique described by H. Goldstein and R.M. Thaler,"Recurrence Techniques for the Calculation of Bessel Functions",M.T.A.C.,V.13,PP.102-108 and I.A. Stegun and M. Abramowitz,"Generation of Bessel Functions on High Speed Computers",M.T.A.C.,V.11,1957,PP.255-257

OPTIONS

Description of Parameters 

           X    The argument of the J Bessel function desired
           N    The order of the J Bessel function desired
           BJ   The resultant J Bessel function
           D    Required accuracy
           IER  Resultant error code where


                 IER=0  No error
                 IER=1  N is negative
                 IER=2  X is negative or zero
                 IER=3  Required accuracy not obtained
                 IER=4  Range of N compared to X not correct (see remarks)

EXAMPLE

besj (3) March 11, 2021
Generated by manServer 1.08 from c505a9d4-c63c-4b9f-942d-4f1dd3592215 using man macros.