besy.f 6.1 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200
  1. *DECK BESY
  2. SUBROUTINE BESY (X, FNU, N, Y)
  3. C***BEGIN PROLOGUE BESY
  4. C***PURPOSE Implement forward recursion on the three term recursion
  5. C relation for a sequence of non-negative order Bessel
  6. C functions Y/SUB(FNU+I-1)/(X), I=1,...,N for real, positive
  7. C X and non-negative orders FNU.
  8. C***LIBRARY SLATEC
  9. C***CATEGORY C10A3
  10. C***TYPE SINGLE PRECISION (BESY-S, DBESY-D)
  11. C***KEYWORDS SPECIAL FUNCTIONS, Y BESSEL FUNCTION
  12. C***AUTHOR Amos, D. E., (SNLA)
  13. C***DESCRIPTION
  14. C
  15. C Abstract
  16. C BESY implements forward recursion on the three term
  17. C recursion relation for a sequence of non-negative order Bessel
  18. C functions Y/sub(FNU+I-1)/(X), I=1,N for real X .GT. 0.0E0 and
  19. C non-negative orders FNU. If FNU .LT. NULIM, orders FNU and
  20. C FNU+1 are obtained from BESYNU which computes by a power
  21. C series for X .LE. 2, the K Bessel function of an imaginary
  22. C argument for 2 .LT. X .LE. 20 and the asymptotic expansion for
  23. C X .GT. 20.
  24. C
  25. C If FNU .GE. NULIM, the uniform asymptotic expansion is coded
  26. C in ASYJY for orders FNU and FNU+1 to start the recursion.
  27. C NULIM is 70 or 100 depending on whether N=1 or N .GE. 2. An
  28. C overflow test is made on the leading term of the asymptotic
  29. C expansion before any extensive computation is done.
  30. C
  31. C Description of Arguments
  32. C
  33. C Input
  34. C X - X .GT. 0.0E0
  35. C FNU - order of the initial Y function, FNU .GE. 0.0E0
  36. C N - number of members in the sequence, N .GE. 1
  37. C
  38. C Output
  39. C Y - a vector whose first N components contain values
  40. C for the sequence Y(I)=Y/sub(FNU+I-1)/(X), I=1,N.
  41. C
  42. C Error Conditions
  43. C Improper input arguments - a fatal error
  44. C Overflow - a fatal error
  45. C
  46. C***REFERENCES F. W. J. Olver, Tables of Bessel Functions of Moderate
  47. C or Large Orders, NPL Mathematical Tables 6, Her
  48. C Majesty's Stationery Office, London, 1962.
  49. C N. M. Temme, On the numerical evaluation of the modified
  50. C Bessel function of the third kind, Journal of
  51. C Computational Physics 19, (1975), pp. 324-337.
  52. C N. M. Temme, On the numerical evaluation of the ordinary
  53. C Bessel function of the second kind, Journal of
  54. C Computational Physics 21, (1976), pp. 343-350.
  55. C***ROUTINES CALLED ASYJY, BESY0, BESY1, BESYNU, I1MACH, R1MACH,
  56. C XERMSG, YAIRY
  57. C***REVISION HISTORY (YYMMDD)
  58. C 800501 DATE WRITTEN
  59. C 890531 Changed all specific intrinsics to generic. (WRB)
  60. C 890531 REVISION DATE from Version 3.2
  61. C 891214 Prologue converted to Version 4.0 format. (BAB)
  62. C 900315 CALLs to XERROR changed to CALLs to XERMSG. (THJ)
  63. C 900326 Removed duplicate information from DESCRIPTION section.
  64. C (WRB)
  65. C 920501 Reformatted the REFERENCES section. (WRB)
  66. C***END PROLOGUE BESY
  67. C
  68. EXTERNAL YAIRY
  69. INTEGER I, IFLW, J, N, NB, ND, NN, NUD, NULIM
  70. INTEGER I1MACH
  71. REAL AZN,CN,DNU,ELIM,FLGJY,FN,FNU,RAN,S,S1,S2,TM,TRX,
  72. 1 W,WK,W2N,X,XLIM,XXN,Y
  73. REAL BESY0, BESY1, R1MACH
  74. DIMENSION W(2), NULIM(2), Y(*), WK(7)
  75. SAVE NULIM
  76. DATA NULIM(1),NULIM(2) / 70 , 100 /
  77. C***FIRST EXECUTABLE STATEMENT BESY
  78. NN = -I1MACH(12)
  79. ELIM = 2.303E0*(NN*R1MACH(5)-3.0E0)
  80. XLIM = R1MACH(1)*1.0E+3
  81. IF (FNU.LT.0.0E0) GO TO 140
  82. IF (X.LE.0.0E0) GO TO 150
  83. IF (X.LT.XLIM) GO TO 170
  84. IF (N.LT.1) GO TO 160
  85. C
  86. C ND IS A DUMMY VARIABLE FOR N
  87. C
  88. ND = N
  89. NUD = INT(FNU)
  90. DNU = FNU - NUD
  91. NN = MIN(2,ND)
  92. FN = FNU + N - 1
  93. IF (FN.LT.2.0E0) GO TO 100
  94. C
  95. C OVERFLOW TEST (LEADING EXPONENTIAL OF ASYMPTOTIC EXPANSION)
  96. C FOR THE LAST ORDER, FNU+N-1.GE.NULIM
  97. C
  98. XXN = X/FN
  99. W2N = 1.0E0-XXN*XXN
  100. IF(W2N.LE.0.0E0) GO TO 10
  101. RAN = SQRT(W2N)
  102. AZN = LOG((1.0E0+RAN)/XXN) - RAN
  103. CN = FN*AZN
  104. IF(CN.GT.ELIM) GO TO 170
  105. 10 CONTINUE
  106. IF (NUD.LT.NULIM(NN)) GO TO 20
  107. C
  108. C ASYMPTOTIC EXPANSION FOR ORDERS FNU AND FNU+1.GE.NULIM
  109. C
  110. FLGJY = -1.0E0
  111. CALL ASYJY(YAIRY,X,FNU,FLGJY,NN,Y,WK,IFLW)
  112. IF(IFLW.NE.0) GO TO 170
  113. IF (NN.EQ.1) RETURN
  114. TRX = 2.0E0/X
  115. TM = (FNU+FNU+2.0E0)/X
  116. GO TO 80
  117. C
  118. 20 CONTINUE
  119. IF (DNU.NE.0.0E0) GO TO 30
  120. S1 = BESY0(X)
  121. IF (NUD.EQ.0 .AND. ND.EQ.1) GO TO 70
  122. S2 = BESY1(X)
  123. GO TO 40
  124. 30 CONTINUE
  125. NB = 2
  126. IF (NUD.EQ.0 .AND. ND.EQ.1) NB = 1
  127. CALL BESYNU(X, DNU, NB, W)
  128. S1 = W(1)
  129. IF (NB.EQ.1) GO TO 70
  130. S2 = W(2)
  131. 40 CONTINUE
  132. TRX = 2.0E0/X
  133. TM = (DNU+DNU+2.0E0)/X
  134. C FORWARD RECUR FROM DNU TO FNU+1 TO GET Y(1) AND Y(2)
  135. IF (ND.EQ.1) NUD = NUD - 1
  136. IF (NUD.GT.0) GO TO 50
  137. IF (ND.GT.1) GO TO 70
  138. S1 = S2
  139. GO TO 70
  140. 50 CONTINUE
  141. DO 60 I=1,NUD
  142. S = S2
  143. S2 = TM*S2 - S1
  144. S1 = S
  145. TM = TM + TRX
  146. 60 CONTINUE
  147. IF (ND.EQ.1) S1 = S2
  148. 70 CONTINUE
  149. Y(1) = S1
  150. IF (ND.EQ.1) RETURN
  151. Y(2) = S2
  152. 80 CONTINUE
  153. IF (ND.EQ.2) RETURN
  154. C FORWARD RECUR FROM FNU+2 TO FNU+N-1
  155. DO 90 I=3,ND
  156. Y(I) = TM*Y(I-1) - Y(I-2)
  157. TM = TM + TRX
  158. 90 CONTINUE
  159. RETURN
  160. C
  161. 100 CONTINUE
  162. C OVERFLOW TEST
  163. IF (FN.LE.1.0E0) GO TO 110
  164. IF (-FN*(LOG(X)-0.693E0).GT.ELIM) GO TO 170
  165. 110 CONTINUE
  166. IF (DNU.EQ.0.0E0) GO TO 120
  167. CALL BESYNU(X, FNU, ND, Y)
  168. RETURN
  169. 120 CONTINUE
  170. J = NUD
  171. IF (J.EQ.1) GO TO 130
  172. J = J + 1
  173. Y(J) = BESY0(X)
  174. IF (ND.EQ.1) RETURN
  175. J = J + 1
  176. 130 CONTINUE
  177. Y(J) = BESY1(X)
  178. IF (ND.EQ.1) RETURN
  179. TRX = 2.0E0/X
  180. TM = TRX
  181. GO TO 80
  182. C
  183. C
  184. C
  185. 140 CONTINUE
  186. CALL XERMSG ('SLATEC', 'BESY', 'ORDER, FNU, LESS THAN ZERO', 2,
  187. + 1)
  188. RETURN
  189. 150 CONTINUE
  190. CALL XERMSG ('SLATEC', 'BESY', 'X LESS THAN OR EQUAL TO ZERO', 2,
  191. + 1)
  192. RETURN
  193. 160 CONTINUE
  194. CALL XERMSG ('SLATEC', 'BESY', 'N LESS THAN ONE', 2, 1)
  195. RETURN
  196. 170 CONTINUE
  197. CALL XERMSG ('SLATEC', 'BESY',
  198. + 'OVERFLOW, FNU OR N TOO LARGE OR X TOO SMALL', 6, 1)
  199. RETURN
  200. END