pnnzrs.f 7.5 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259
  1. *DECK PNNZRS
  2. SUBROUTINE PNNZRS (I, XVAL, IPLACE, SX, IX, IRCX)
  3. C***BEGIN PROLOGUE PNNZRS
  4. C***SUBSIDIARY
  5. C***PURPOSE Subsidiary to SPLP
  6. C***LIBRARY SLATEC
  7. C***TYPE SINGLE PRECISION (PNNZRS-S, DPNNZR-D)
  8. C***AUTHOR Hanson, R. J., (SNLA)
  9. C Wisniewski, J. A., (SNLA)
  10. C***DESCRIPTION
  11. C
  12. C PNNZRS LIMITS THE TYPE OF STORAGE TO A SEQUENTIAL SCHEME.
  13. C SPARSE MATRIX NON ZERO RETRIEVAL SUBROUTINE.
  14. C
  15. C SUBROUTINE PNNZRS() GETS THE NEXT NONZERO VALUE IN ROW OR COLUMN
  16. C +/- IRCX WITH AN INDEX GREATER THAN THE VALUE OF I.
  17. C
  18. C I ABSOLUTE VALUE OF THIS SUBSCRIPT IS TO BE EXCEEDED
  19. C IN THE SEARCH FOR THE NEXT NONZERO VALUE. A NEGATIVE
  20. C OR ZERO VALUE OF I CAUSES THE SEARCH TO START AT
  21. C THE BEGINNING OF THE VECTOR. A POSITIVE VALUE
  22. C OF I CAUSES THE SEARCH TO CONTINUE FROM THE LAST PLACE
  23. C ACCESSED. ON OUTPUT, THE ARGUMENT I
  24. C CONTAINS THE VALUE OF THE SUBSCRIPT FOUND. AN OUTPUT
  25. C VALUE OF I EQUAL TO ZERO INDICATES THAT ALL COMPONENTS
  26. C WITH AN INDEX GREATER THAN THE INPUT VALUE OF I ARE
  27. C ZERO.
  28. C XVAL VALUE OF THE NONZERO ELEMENT FOUND. ON OUTPUT,
  29. C XVAL=0. WHENEVER I=0.
  30. C IPLACE POINTER INFORMATION WHICH IS MAINTAINED BY THE PACKAGE.
  31. C SX(*),IX(*) THE WORK ARRAYS WHICH ARE USED TO STORE THE SPARSE
  32. C MATRIX. THESE ARRAY CONTENTS ARE AUTOMATICALLY
  33. C MAINTAINED BY THE PACKAGE FOR THE USER.
  34. C IRCX POINTS TO THE VECTOR OF THE MATRIX BEING SCANNED. A
  35. C NEGATIVE VALUE OF IRCX INDICATES THAT ROW -IRCX IS TO BE
  36. C SCANNED. A POSITIVE VALUE OF IRCX INDICATES THAT
  37. C COLUMN IRCX IS TO BE SCANNED. A ZERO VALUE OF IRCX IS
  38. C AN ERROR.
  39. C
  40. C THIS SUBROUTINE IS A MODIFICATION OF THE SUBROUTINE LNNZRS,
  41. C SANDIA LABS. REPT. SAND78-0785.
  42. C MODIFICATIONS BY K.L. HIEBERT AND R.J. HANSON
  43. C REVISED 811130-1000
  44. C REVISED YYMMDD-HHMM
  45. C
  46. C***SEE ALSO SPLP
  47. C***ROUTINES CALLED IPLOC, XERMSG
  48. C***REVISION HISTORY (YYMMDD)
  49. C 811215 DATE WRITTEN
  50. C 890531 Changed all specific intrinsics to generic. (WRB)
  51. C 890605 Removed unreferenced labels. (WRB)
  52. C 891214 Prologue converted to Version 4.0 format. (BAB)
  53. C 900315 CALLs to XERROR changed to CALLs to XERMSG. (THJ)
  54. C 900328 Added TYPE section. (WRB)
  55. C 910403 Updated AUTHOR and DESCRIPTION sections. (WRB)
  56. C***END PROLOGUE PNNZRS
  57. DIMENSION IX(*)
  58. REAL XVAL,SX(*),ZERO
  59. SAVE ZERO
  60. DATA ZERO /0.E0/
  61. C***FIRST EXECUTABLE STATEMENT PNNZRS
  62. IOPT=1
  63. C
  64. C CHECK VALIDITY OF ROW/COL. INDEX.
  65. C
  66. IF (.NOT.(IRCX .EQ.0)) GO TO 20002
  67. NERR=55
  68. CALL XERMSG ('SLATEC', 'PNNZRS', 'IRCX=0.', NERR, IOPT)
  69. C
  70. C LMX IS THE LENGTH OF THE IN-MEMORY STORAGE AREA.
  71. C
  72. 20002 LMX = IX(1)
  73. IF (.NOT.(IRCX.LT.0)) GO TO 20005
  74. C
  75. C CHECK SUBSCRIPTS OF THE ROW. THE ROW NUMBER MUST BE .LE. M AND
  76. C THE INDEX MUST BE .LE. N.
  77. C
  78. IF (.NOT.(IX(2).LT.-IRCX .OR. IX(3).LT.ABS(I))) GO TO 20008
  79. NERR=55
  80. CALL XERMSG ('SLATEC', 'PNNZRS',
  81. + 'SUBSCRIPTS FOR ARRAY ELEMENT TO BE ACCESSED WERE OUT OF ' //
  82. + 'BOUNDS.', NERR, IOPT)
  83. 20008 L=IX(3)
  84. GO TO 20006
  85. C
  86. C CHECK SUBSCRIPTS OF THE COLUMN. THE COL. NUMBER MUST BE .LE. N AND
  87. C THE INDEX MUST BE .LE. M.
  88. C
  89. 20005 IF (.NOT.(IRCX.GT.IX(3) .OR. ABS(I).GT.IX(2))) GO TO 20011
  90. NERR=55
  91. CALL XERMSG ('SLATEC', 'PNNZRS',
  92. + 'SUBSCRIPTS FOR ARRAY ELEMENT TO BE ACCESSED WERE OUT OF ' //
  93. + 'BOUNDS.', NERR, IOPT)
  94. 20011 L=IX(2)
  95. C
  96. C HERE L IS THE LARGEST POSSIBLE SUBSCRIPT WITHIN THE VECTOR.
  97. C
  98. 20006 J=ABS(IRCX)
  99. LL=IX(3)+4
  100. LPG = LMX - LL
  101. IF (.NOT.(IRCX.GT.0)) GO TO 20014
  102. C
  103. C SEARCHING FOR THE NEXT NONZERO IN A COLUMN.
  104. C
  105. C INITIALIZE STARTING LOCATIONS..
  106. IF (.NOT.(I.LE.0)) GO TO 20017
  107. IF (.NOT.(J.EQ.1)) GO TO 20020
  108. IPLACE=LL+1
  109. GO TO 20021
  110. 20020 IPLACE=IX(J+3)+1
  111. 20021 CONTINUE
  112. C
  113. C THE CASE I.LE.0 SIGNALS THAT THE SCAN FOR THE ENTRY
  114. C IS TO BEGIN AT THE START OF THE VECTOR.
  115. C
  116. 20017 I = ABS(I)
  117. IF (.NOT.(J.EQ.1)) GO TO 20023
  118. ISTART = LL+1
  119. GO TO 20024
  120. 20023 ISTART=IX(J+3)+1
  121. 20024 IEND = IX(J+4)
  122. C
  123. C VALIDATE IPLACE. SET TO START OF VECTOR IF OUT OF RANGE.
  124. C
  125. IF (.NOT.(ISTART.GT.IPLACE .OR. IPLACE.GT.IEND)) GO TO 20026
  126. IF (.NOT.(J.EQ.1)) GO TO 20029
  127. IPLACE=LL+1
  128. GO TO 20030
  129. 20029 IPLACE=IX(J+3)+1
  130. 20030 CONTINUE
  131. C
  132. C SCAN THROUGH SEVERAL PAGES, IF NECESSARY, TO FIND MATRIX ENTRY.
  133. C
  134. 20026 IPL = IPLOC(IPLACE,SX,IX)
  135. C
  136. C FIX UP IPLACE AND IPL IF THEY POINT TO PAGING DATA.
  137. C THIS IS NECESSARY BECAUSE THERE IS CONTROL INFORMATION AT THE
  138. C END OF EACH PAGE.
  139. C
  140. IDIFF = LMX - IPL
  141. IF (.NOT.(IDIFF.LE.1.AND.IX(LMX-1).GT.0)) GO TO 20032
  142. C
  143. C UPDATE THE RELATIVE ADDRESS IN A NEW PAGE.
  144. C
  145. IPLACE = IPLACE + IDIFF + 1
  146. IPL = IPLOC(IPLACE,SX,IX)
  147. 20032 NP = ABS(IX(LMX-1))
  148. GO TO 20036
  149. 20035 IF (ILAST.EQ.IEND) GO TO 20037
  150. 20036 ILAST = MIN(IEND,NP*LPG+LL-2)
  151. C
  152. C THE VIRTUAL END OF THE DATA FOR THIS PAGE IS ILAST.
  153. C
  154. IL = IPLOC(ILAST,SX,IX)
  155. IL = MIN(IL,LMX-2)
  156. C
  157. C THE RELATIVE END OF DATA FOR THIS PAGE IS IL.
  158. C SEARCH FOR A NONZERO VALUE WITH AN INDEX .GT. I ON THE PRESENT
  159. C PAGE.
  160. C
  161. 20038 IF (.NOT.(.NOT.(IPL.GE.IL.OR.(IX(IPL).GT.I.AND.SX(IPL).NE.ZERO))))
  162. * GO TO 20039
  163. IPL=IPL+1
  164. GO TO 20038
  165. C
  166. C TEST IF WE HAVE FOUND THE NEXT NONZERO.
  167. C
  168. 20039 IF (.NOT.(IX(IPL).GT.I .AND. SX(IPL).NE.ZERO .AND. IPL.LE.IL)) GO
  169. *TO 20040
  170. I = IX(IPL)
  171. XVAL = SX(IPL)
  172. IPLACE = (NP-1)*LPG + IPL
  173. RETURN
  174. C
  175. C UPDATE TO SCAN THE NEXT PAGE.
  176. 20040 IPL = LL + 1
  177. NP = NP + 1
  178. GO TO 20035
  179. C
  180. C NO DATA WAS FOUND. END OF VECTOR ENCOUNTERED.
  181. C
  182. 20037 I = 0
  183. XVAL = ZERO
  184. IL = IL + 1
  185. IF(IL.EQ.LMX-1) IL = IL + 2
  186. C
  187. C IF A NEW ITEM WOULD BE INSERTED, IPLACE POINTS TO THE PLACE
  188. C TO PUT IT.
  189. C
  190. IPLACE = (NP-1)*LPG + IL
  191. RETURN
  192. C
  193. C SEARCH A ROW FOR THE NEXT NONZERO.
  194. C FIND ELEMENT J=ABS(IRCX) IN ROWS ABS(I)+1,...,L.
  195. C
  196. 20014 I=ABS(I)
  197. C
  198. C CHECK FOR END OF VECTOR.
  199. C
  200. IF (.NOT.(I.EQ.L)) GO TO 20043
  201. I=0
  202. XVAL=ZERO
  203. RETURN
  204. 20043 I1 = I+1
  205. II=I1
  206. N20046=L
  207. GO TO 20047
  208. 20046 II=II+1
  209. 20047 IF ((N20046-II).LT.0) GO TO 20048
  210. C
  211. C INITIALIZE IPPLOC FOR ORTHOGONAL SCAN.
  212. C LOOK FOR J AS A SUBSCRIPT IN ROWS II, II=I+1,...,L.
  213. C
  214. IF (.NOT.(II.EQ.1)) GO TO 20050
  215. IPPLOC = LL + 1
  216. GO TO 20051
  217. 20050 IPPLOC = IX(II+3) + 1
  218. 20051 IEND = IX(II+4)
  219. C
  220. C SCAN THROUGH SEVERAL PAGES, IF NECESSARY, TO FIND MATRIX ENTRY.
  221. C
  222. IPL = IPLOC(IPPLOC,SX,IX)
  223. C
  224. C FIX UP IPPLOC AND IPL TO POINT TO MATRIX DATA.
  225. C
  226. IDIFF = LMX - IPL
  227. IF (.NOT.(IDIFF.LE.1.AND.IX(LMX-1).GT.0)) GO TO 20053
  228. IPPLOC = IPPLOC + IDIFF + 1
  229. IPL = IPLOC(IPPLOC,SX,IX)
  230. 20053 NP = ABS(IX(LMX-1))
  231. GO TO 20057
  232. 20056 IF (ILAST.EQ.IEND) GO TO 20058
  233. 20057 ILAST = MIN(IEND,NP*LPG+LL-2)
  234. IL = IPLOC(ILAST,SX,IX)
  235. IL = MIN(IL,LMX-2)
  236. 20059 IF (.NOT.(.NOT.(IPL.GE.IL .OR. IX(IPL).GE.J))) GO TO 20060
  237. IPL=IPL+1
  238. GO TO 20059
  239. C
  240. C TEST IF WE HAVE FOUND THE NEXT NONZERO.
  241. C
  242. 20060 IF (.NOT.(IX(IPL).EQ.J .AND. SX(IPL).NE.ZERO .AND. IPL.LE.IL)) GO
  243. *TO 20061
  244. I = II
  245. XVAL = SX(IPL)
  246. RETURN
  247. 20061 IF(IX(IPL).GE.J) ILAST = IEND
  248. IPL = LL + 1
  249. NP = NP + 1
  250. GO TO 20056
  251. 20058 GO TO 20046
  252. C
  253. C ORTHOGONAL SCAN FAILED. THE VALUE J WAS NOT A SUBSCRIPT
  254. C IN ANY ROW.
  255. C
  256. 20048 I=0
  257. XVAL=ZERO
  258. RETURN
  259. END