bspvn.f 4.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124
  1. *DECK BSPVN
  2. SUBROUTINE BSPVN (T, JHIGH, K, INDEX, X, ILEFT, VNIKX, WORK,
  3. + IWORK)
  4. C***BEGIN PROLOGUE BSPVN
  5. C***PURPOSE Calculate the value of all (possibly) nonzero basis
  6. C functions at X.
  7. C***LIBRARY SLATEC
  8. C***CATEGORY E3, K6
  9. C***TYPE SINGLE PRECISION (BSPVN-S, DBSPVN-D)
  10. C***KEYWORDS EVALUATION OF B-SPLINE
  11. C***AUTHOR Amos, D. E., (SNLA)
  12. C***DESCRIPTION
  13. C
  14. C Written by Carl de Boor and modified by D. E. Amos
  15. C
  16. C Abstract
  17. C BSPVN is the BSPLVN routine of the reference.
  18. C
  19. C BSPVN calculates the value of all (possibly) nonzero basis
  20. C functions at X of order MAX(JHIGH,(J+1)*(INDEX-1)), where
  21. C T(K) .LE. X .LE. T(N+1) and J=IWORK is set inside the routine
  22. C on the first call when INDEX=1. ILEFT is such that T(ILEFT)
  23. C .LE. X .LT. T(ILEFT+1). A call to INTRV(T,N+1,X,ILO,ILEFT,
  24. C MFLAG) produces the proper ILEFT. BSPVN calculates using the
  25. C basic algorithm needed in BSPVD. If only basis functions are
  26. C desired, setting JHIGH=K and INDEX=1 can be faster than
  27. C calling BSPVD, but extra coding is required for derivatives
  28. C (INDEX=2) and BSPVD is set up for this purpose.
  29. C
  30. C Left limiting values are set up as described in BSPVD.
  31. C
  32. C Description of Arguments
  33. C Input
  34. C T - knot vector of length N+K, where
  35. C N = number of B-spline basis functions
  36. C N = sum of knot multiplicities-K
  37. C JHIGH - order of B-spline, 1 .LE. JHIGH .LE. K
  38. C K - highest possible order
  39. C INDEX - INDEX = 1 gives basis functions of order JHIGH
  40. C = 2 denotes previous entry with WORK, IWORK
  41. C values saved for subsequent calls to
  42. C BSPVN.
  43. C X - argument of basis functions,
  44. C T(K) .LE. X .LE. T(N+1)
  45. C ILEFT - largest integer such that
  46. C T(ILEFT) .LE. X .LT. T(ILEFT+1)
  47. C
  48. C Output
  49. C VNIKX - vector of length K for spline values.
  50. C WORK - a work vector of length 2*K
  51. C IWORK - a work parameter. Both WORK and IWORK contain
  52. C information necessary to continue for INDEX = 2.
  53. C When INDEX = 1 exclusively, these are scratch
  54. C variables and can be used for other purposes.
  55. C
  56. C Error Conditions
  57. C Improper input is a fatal error.
  58. C
  59. C***REFERENCES Carl de Boor, Package for calculating with B-splines,
  60. C SIAM Journal on Numerical Analysis 14, 3 (June 1977),
  61. C pp. 441-472.
  62. C***ROUTINES CALLED XERMSG
  63. C***REVISION HISTORY (YYMMDD)
  64. C 800901 DATE WRITTEN
  65. C 890831 Modified array declarations. (WRB)
  66. C 890831 REVISION DATE from Version 3.2
  67. C 891214 Prologue converted to Version 4.0 format. (BAB)
  68. C 900315 CALLs to XERROR changed to CALLs to XERMSG. (THJ)
  69. C 900326 Removed duplicate information from DESCRIPTION section.
  70. C (WRB)
  71. C 920501 Reformatted the REFERENCES section. (WRB)
  72. C***END PROLOGUE BSPVN
  73. C
  74. INTEGER ILEFT, IMJP1, INDEX, IPJ, IWORK, JHIGH, JP1, JP1ML, K, L
  75. REAL T, VM, VMPREV, VNIKX, WORK, X
  76. C DIMENSION T(ILEFT+JHIGH)
  77. DIMENSION T(*), VNIKX(*), WORK(*)
  78. C CONTENT OF J, DELTAM, DELTAP IS EXPECTED UNCHANGED BETWEEN CALLS.
  79. C WORK(I) = DELTAP(I), WORK(K+I) = DELTAM(I), I = 1,K
  80. C***FIRST EXECUTABLE STATEMENT BSPVN
  81. IF(K.LT.1) GO TO 90
  82. IF(JHIGH.GT.K .OR. JHIGH.LT.1) GO TO 100
  83. IF(INDEX.LT.1 .OR. INDEX.GT.2) GO TO 105
  84. IF(X.LT.T(ILEFT) .OR. X.GT.T(ILEFT+1)) GO TO 110
  85. GO TO (10, 20), INDEX
  86. 10 IWORK = 1
  87. VNIKX(1) = 1.0E0
  88. IF (IWORK.GE.JHIGH) GO TO 40
  89. C
  90. 20 IPJ = ILEFT + IWORK
  91. WORK(IWORK) = T(IPJ) - X
  92. IMJP1 = ILEFT - IWORK + 1
  93. WORK(K+IWORK) = X - T(IMJP1)
  94. VMPREV = 0.0E0
  95. JP1 = IWORK + 1
  96. DO 30 L=1,IWORK
  97. JP1ML = JP1 - L
  98. VM = VNIKX(L)/(WORK(L)+WORK(K+JP1ML))
  99. VNIKX(L) = VM*WORK(L) + VMPREV
  100. VMPREV = VM*WORK(K+JP1ML)
  101. 30 CONTINUE
  102. VNIKX(JP1) = VMPREV
  103. IWORK = JP1
  104. IF (IWORK.LT.JHIGH) GO TO 20
  105. C
  106. 40 RETURN
  107. C
  108. C
  109. 90 CONTINUE
  110. CALL XERMSG ('SLATEC', 'BSPVN', 'K DOES NOT SATISFY K.GE.1', 2,
  111. + 1)
  112. RETURN
  113. 100 CONTINUE
  114. CALL XERMSG ('SLATEC', 'BSPVN',
  115. + 'JHIGH DOES NOT SATISFY 1.LE.JHIGH.LE.K', 2, 1)
  116. RETURN
  117. 105 CONTINUE
  118. CALL XERMSG ('SLATEC', 'BSPVN', 'INDEX IS NOT 1 OR 2', 2, 1)
  119. RETURN
  120. 110 CONTINUE
  121. CALL XERMSG ('SLATEC', 'BSPVN',
  122. + 'X DOES NOT SATISFY T(ILEFT).LE.X.LE.T(ILEFT+1)', 2, 1)
  123. RETURN
  124. END