sdassl.f 64 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526152715281529153015311532153315341535153615371538153915401541154215431544154515461547154815491550155115521553155415551556155715581559156015611562156315641565156615671568156915701571157215731574157515761577157815791580158115821583158415851586158715881589159015911592159315941595159615971598
  1. *DECK SDASSL
  2. SUBROUTINE SDASSL (RES, NEQ, T, Y, YPRIME, TOUT, INFO, RTOL, ATOL,
  3. * IDID, RWORK, LRW, IWORK, LIW, RPAR, IPAR, JAC)
  4. C***BEGIN PROLOGUE SDASSL
  5. C***PURPOSE This code solves a system of differential/algebraic
  6. C equations of the form G(T,Y,YPRIME) = 0.
  7. C***LIBRARY SLATEC (DASSL)
  8. C***CATEGORY I1A2
  9. C***TYPE SINGLE PRECISION (SDASSL-S, DDASSL-D)
  10. C***KEYWORDS BACKWARD DIFFERENTIATION FORMULAS, DASSL,
  11. C DIFFERENTIAL/ALGEBRAIC, IMPLICIT DIFFERENTIAL SYSTEMS
  12. C***AUTHOR Petzold, Linda R., (LLNL)
  13. C Computing and Mathematics Research Division
  14. C Lawrence Livermore National Laboratory
  15. C L - 316, P.O. Box 808,
  16. C Livermore, CA. 94550
  17. C***DESCRIPTION
  18. C
  19. C *Usage:
  20. C
  21. C EXTERNAL RES, JAC
  22. C INTEGER NEQ, INFO(N), IDID, LRW, LIW, IWORK(LIW), IPAR
  23. C REAL T, Y(NEQ), YPRIME(NEQ), TOUT, RTOL, ATOL,
  24. C * RWORK(LRW), RPAR
  25. C
  26. C CALL SDASSL (RES, NEQ, T, Y, YPRIME, TOUT, INFO, RTOL, ATOL,
  27. C * IDID, RWORK, LRW, IWORK, LIW, RPAR, IPAR, JAC)
  28. C
  29. C
  30. C *Arguments:
  31. C
  32. C RES:EXT This is a subroutine which you provide to define the
  33. C differential/algebraic system.
  34. C
  35. C NEQ:IN This is the number of equations to be solved.
  36. C
  37. C T:INOUT This is the current value of the independent variable.
  38. C
  39. C Y(*):INOUT This array contains the solution components at T.
  40. C
  41. C YPRIME(*):INOUT This array contains the derivatives of the solution
  42. C components at T.
  43. C
  44. C TOUT:IN This is a point at which a solution is desired.
  45. C
  46. C INFO(N):IN The basic task of the code is to solve the system from T
  47. C to TOUT and return an answer at TOUT. INFO is an integer
  48. C array which is used to communicate exactly how you want
  49. C this task to be carried out. (See below for details.)
  50. C N must be greater than or equal to 15.
  51. C
  52. C RTOL,ATOL:INOUT These quantities represent relative and absolute
  53. C error tolerances which you provide to indicate how
  54. C accurately you wish the solution to be computed. You
  55. C may choose them to be both scalars or else both vectors.
  56. C Caution: In Fortran 77, a scalar is not the same as an
  57. C array of length 1. Some compilers may object
  58. C to using scalars for RTOL,ATOL.
  59. C
  60. C IDID:OUT This scalar quantity is an indicator reporting what the
  61. C code did. You must monitor this integer variable to
  62. C decide what action to take next.
  63. C
  64. C RWORK:WORK A real work array of length LRW which provides the
  65. C code with needed storage space.
  66. C
  67. C LRW:IN The length of RWORK. (See below for required length.)
  68. C
  69. C IWORK:WORK An integer work array of length LIW which provides the
  70. C code with needed storage space.
  71. C
  72. C LIW:IN The length of IWORK. (See below for required length.)
  73. C
  74. C RPAR,IPAR:IN These are real and integer parameter arrays which
  75. C you can use for communication between your calling
  76. C program and the RES subroutine (and the JAC subroutine)
  77. C
  78. C JAC:EXT This is the name of a subroutine which you may choose
  79. C to provide for defining a matrix of partial derivatives
  80. C described below.
  81. C
  82. C Quantities which may be altered by SDASSL are:
  83. C T, Y(*), YPRIME(*), INFO(1), RTOL, ATOL,
  84. C IDID, RWORK(*) AND IWORK(*)
  85. C
  86. C *Description
  87. C
  88. C Subroutine SDASSL uses the backward differentiation formulas of
  89. C orders one through five to solve a system of the above form for Y and
  90. C YPRIME. Values for Y and YPRIME at the initial time must be given as
  91. C input. These values must be consistent, (that is, if T,Y,YPRIME are
  92. C the given initial values, they must satisfy G(T,Y,YPRIME) = 0.). The
  93. C subroutine solves the system from T to TOUT. It is easy to continue
  94. C the solution to get results at additional TOUT. This is the interval
  95. C mode of operation. Intermediate results can also be obtained easily
  96. C by using the intermediate-output capability.
  97. C
  98. C The following detailed description is divided into subsections:
  99. C 1. Input required for the first call to SDASSL.
  100. C 2. Output after any return from SDASSL.
  101. C 3. What to do to continue the integration.
  102. C 4. Error messages.
  103. C
  104. C
  105. C -------- INPUT -- WHAT TO DO ON THE FIRST CALL TO SDASSL ------------
  106. C
  107. C The first call of the code is defined to be the start of each new
  108. C problem. Read through the descriptions of all the following items,
  109. C provide sufficient storage space for designated arrays, set
  110. C appropriate variables for the initialization of the problem, and
  111. C give information about how you want the problem to be solved.
  112. C
  113. C
  114. C RES -- Provide a subroutine of the form
  115. C SUBROUTINE RES(T,Y,YPRIME,DELTA,IRES,RPAR,IPAR)
  116. C to define the system of differential/algebraic
  117. C equations which is to be solved. For the given values
  118. C of T,Y and YPRIME, the subroutine should
  119. C return the residual of the differential/algebraic
  120. C system
  121. C DELTA = G(T,Y,YPRIME)
  122. C (DELTA(*) is a vector of length NEQ which is
  123. C output for RES.)
  124. C
  125. C Subroutine RES must not alter T,Y or YPRIME.
  126. C You must declare the name RES in an external
  127. C statement in your program that calls SDASSL.
  128. C You must dimension Y,YPRIME and DELTA in RES.
  129. C
  130. C IRES is an integer flag which is always equal to
  131. C zero on input. Subroutine RES should alter IRES
  132. C only if it encounters an illegal value of Y or
  133. C a stop condition. Set IRES = -1 if an input value
  134. C is illegal, and SDASSL will try to solve the problem
  135. C without getting IRES = -1. If IRES = -2, SDASSL
  136. C will return control to the calling program
  137. C with IDID = -11.
  138. C
  139. C RPAR and IPAR are real and integer parameter arrays which
  140. C you can use for communication between your calling program
  141. C and subroutine RES. They are not altered by SDASSL. If you
  142. C do not need RPAR or IPAR, ignore these parameters by treat-
  143. C ing them as dummy arguments. If you do choose to use them,
  144. C dimension them in your calling program and in RES as arrays
  145. C of appropriate length.
  146. C
  147. C NEQ -- Set it to the number of differential equations.
  148. C (NEQ .GE. 1)
  149. C
  150. C T -- Set it to the initial point of the integration.
  151. C T must be defined as a variable.
  152. C
  153. C Y(*) -- Set this vector to the initial values of the NEQ solution
  154. C components at the initial point. You must dimension Y of
  155. C length at least NEQ in your calling program.
  156. C
  157. C YPRIME(*) -- Set this vector to the initial values of the NEQ
  158. C first derivatives of the solution components at the initial
  159. C point. You must dimension YPRIME at least NEQ in your
  160. C calling program. If you do not know initial values of some
  161. C of the solution components, see the explanation of INFO(11).
  162. C
  163. C TOUT -- Set it to the first point at which a solution
  164. C is desired. You can not take TOUT = T.
  165. C integration either forward in T (TOUT .GT. T) or
  166. C backward in T (TOUT .LT. T) is permitted.
  167. C
  168. C The code advances the solution from T to TOUT using
  169. C step sizes which are automatically selected so as to
  170. C achieve the desired accuracy. If you wish, the code will
  171. C return with the solution and its derivative at
  172. C intermediate steps (intermediate-output mode) so that
  173. C you can monitor them, but you still must provide TOUT in
  174. C accord with the basic aim of the code.
  175. C
  176. C The first step taken by the code is a critical one
  177. C because it must reflect how fast the solution changes near
  178. C the initial point. The code automatically selects an
  179. C initial step size which is practically always suitable for
  180. C the problem. By using the fact that the code will not step
  181. C past TOUT in the first step, you could, if necessary,
  182. C restrict the length of the initial step size.
  183. C
  184. C For some problems it may not be permissible to integrate
  185. C past a point TSTOP because a discontinuity occurs there
  186. C or the solution or its derivative is not defined beyond
  187. C TSTOP. When you have declared a TSTOP point (SEE INFO(4)
  188. C and RWORK(1)), you have told the code not to integrate
  189. C past TSTOP. In this case any TOUT beyond TSTOP is invalid
  190. C input.
  191. C
  192. C INFO(*) -- Use the INFO array to give the code more details about
  193. C how you want your problem solved. This array should be
  194. C dimensioned of length 15, though SDASSL uses only the first
  195. C eleven entries. You must respond to all of the following
  196. C items, which are arranged as questions. The simplest use
  197. C of the code corresponds to answering all questions as yes,
  198. C i.e. setting all entries of INFO to 0.
  199. C
  200. C INFO(1) - This parameter enables the code to initialize
  201. C itself. You must set it to indicate the start of every
  202. C new problem.
  203. C
  204. C **** Is this the first call for this problem ...
  205. C Yes - Set INFO(1) = 0
  206. C No - Not applicable here.
  207. C See below for continuation calls. ****
  208. C
  209. C INFO(2) - How much accuracy you want of your solution
  210. C is specified by the error tolerances RTOL and ATOL.
  211. C The simplest use is to take them both to be scalars.
  212. C To obtain more flexibility, they can both be vectors.
  213. C The code must be told your choice.
  214. C
  215. C **** Are both error tolerances RTOL, ATOL scalars ...
  216. C Yes - Set INFO(2) = 0
  217. C and input scalars for both RTOL and ATOL
  218. C No - Set INFO(2) = 1
  219. C and input arrays for both RTOL and ATOL ****
  220. C
  221. C INFO(3) - The code integrates from T in the direction
  222. C of TOUT by steps. If you wish, it will return the
  223. C computed solution and derivative at the next
  224. C intermediate step (the intermediate-output mode) or
  225. C TOUT, whichever comes first. This is a good way to
  226. C proceed if you want to see the behavior of the solution.
  227. C If you must have solutions at a great many specific
  228. C TOUT points, this code will compute them efficiently.
  229. C
  230. C **** Do you want the solution only at
  231. C TOUT (and not at the next intermediate step) ...
  232. C Yes - Set INFO(3) = 0
  233. C No - Set INFO(3) = 1 ****
  234. C
  235. C INFO(4) - To handle solutions at a great many specific
  236. C values TOUT efficiently, this code may integrate past
  237. C TOUT and interpolate to obtain the result at TOUT.
  238. C Sometimes it is not possible to integrate beyond some
  239. C point TSTOP because the equation changes there or it is
  240. C not defined past TSTOP. Then you must tell the code
  241. C not to go past.
  242. C
  243. C **** Can the integration be carried out without any
  244. C restrictions on the independent variable T ...
  245. C Yes - Set INFO(4)=0
  246. C No - Set INFO(4)=1
  247. C and define the stopping point TSTOP by
  248. C setting RWORK(1)=TSTOP ****
  249. C
  250. C INFO(5) - To solve differential/algebraic problems it is
  251. C necessary to use a matrix of partial derivatives of the
  252. C system of differential equations. If you do not
  253. C provide a subroutine to evaluate it analytically (see
  254. C description of the item JAC in the call list), it will
  255. C be approximated by numerical differencing in this code.
  256. C although it is less trouble for you to have the code
  257. C compute partial derivatives by numerical differencing,
  258. C the solution will be more reliable if you provide the
  259. C derivatives via JAC. Sometimes numerical differencing
  260. C is cheaper than evaluating derivatives in JAC and
  261. C sometimes it is not - this depends on your problem.
  262. C
  263. C **** Do you want the code to evaluate the partial
  264. C derivatives automatically by numerical differences ...
  265. C Yes - Set INFO(5)=0
  266. C No - Set INFO(5)=1
  267. C and provide subroutine JAC for evaluating the
  268. C matrix of partial derivatives ****
  269. C
  270. C INFO(6) - SDASSL will perform much better if the matrix of
  271. C partial derivatives, DG/DY + CJ*DG/DYPRIME,
  272. C (here CJ is a scalar determined by SDASSL)
  273. C is banded and the code is told this. In this
  274. C case, the storage needed will be greatly reduced,
  275. C numerical differencing will be performed much cheaper,
  276. C and a number of important algorithms will execute much
  277. C faster. The differential equation is said to have
  278. C half-bandwidths ML (lower) and MU (upper) if equation i
  279. C involves only unknowns Y(J) with
  280. C I-ML .LE. J .LE. I+MU
  281. C for all I=1,2,...,NEQ. Thus, ML and MU are the widths
  282. C of the lower and upper parts of the band, respectively,
  283. C with the main diagonal being excluded. If you do not
  284. C indicate that the equation has a banded matrix of partial
  285. C derivatives, the code works with a full matrix of NEQ**2
  286. C elements (stored in the conventional way). Computations
  287. C with banded matrices cost less time and storage than with
  288. C full matrices if 2*ML+MU .LT. NEQ. If you tell the
  289. C code that the matrix of partial derivatives has a banded
  290. C structure and you want to provide subroutine JAC to
  291. C compute the partial derivatives, then you must be careful
  292. C to store the elements of the matrix in the special form
  293. C indicated in the description of JAC.
  294. C
  295. C **** Do you want to solve the problem using a full
  296. C (dense) matrix (and not a special banded
  297. C structure) ...
  298. C Yes - Set INFO(6)=0
  299. C No - Set INFO(6)=1
  300. C and provide the lower (ML) and upper (MU)
  301. C bandwidths by setting
  302. C IWORK(1)=ML
  303. C IWORK(2)=MU ****
  304. C
  305. C
  306. C INFO(7) -- You can specify a maximum (absolute value of)
  307. C stepsize, so that the code
  308. C will avoid passing over very
  309. C large regions.
  310. C
  311. C **** Do you want the code to decide
  312. C on its own maximum stepsize?
  313. C Yes - Set INFO(7)=0
  314. C No - Set INFO(7)=1
  315. C and define HMAX by setting
  316. C RWORK(2)=HMAX ****
  317. C
  318. C INFO(8) -- Differential/algebraic problems
  319. C may occasionally suffer from
  320. C severe scaling difficulties on the
  321. C first step. If you know a great deal
  322. C about the scaling of your problem, you can
  323. C help to alleviate this problem by
  324. C specifying an initial stepsize HO.
  325. C
  326. C **** Do you want the code to define
  327. C its own initial stepsize?
  328. C Yes - Set INFO(8)=0
  329. C No - Set INFO(8)=1
  330. C and define HO by setting
  331. C RWORK(3)=HO ****
  332. C
  333. C INFO(9) -- If storage is a severe problem,
  334. C you can save some locations by
  335. C restricting the maximum order MAXORD.
  336. C the default value is 5. for each
  337. C order decrease below 5, the code
  338. C requires NEQ fewer locations, however
  339. C it is likely to be slower. In any
  340. C case, you must have 1 .LE. MAXORD .LE. 5
  341. C **** Do you want the maximum order to
  342. C default to 5?
  343. C Yes - Set INFO(9)=0
  344. C No - Set INFO(9)=1
  345. C and define MAXORD by setting
  346. C IWORK(3)=MAXORD ****
  347. C
  348. C INFO(10) --If you know that the solutions to your equations
  349. C will always be nonnegative, it may help to set this
  350. C parameter. However, it is probably best to
  351. C try the code without using this option first,
  352. C and only to use this option if that doesn't
  353. C work very well.
  354. C **** Do you want the code to solve the problem without
  355. C invoking any special nonnegativity constraints?
  356. C Yes - Set INFO(10)=0
  357. C No - Set INFO(10)=1
  358. C
  359. C INFO(11) --SDASSL normally requires the initial T,
  360. C Y, and YPRIME to be consistent. That is,
  361. C you must have G(T,Y,YPRIME) = 0 at the initial
  362. C time. If you do not know the initial
  363. C derivative precisely, you can let SDASSL try
  364. C to compute it.
  365. C **** Are the initial T, Y, YPRIME consistent?
  366. C Yes - Set INFO(11) = 0
  367. C No - Set INFO(11) = 1,
  368. C and set YPRIME to an initial approximation
  369. C to YPRIME. (If you have no idea what
  370. C YPRIME should be, set it to zero. Note
  371. C that the initial Y should be such
  372. C that there must exist a YPRIME so that
  373. C G(T,Y,YPRIME) = 0.)
  374. C
  375. C RTOL, ATOL -- You must assign relative (RTOL) and absolute (ATOL
  376. C error tolerances to tell the code how accurately you
  377. C want the solution to be computed. They must be defined
  378. C as variables because the code may change them. You
  379. C have two choices --
  380. C Both RTOL and ATOL are scalars. (INFO(2)=0)
  381. C Both RTOL and ATOL are vectors. (INFO(2)=1)
  382. C in either case all components must be non-negative.
  383. C
  384. C The tolerances are used by the code in a local error
  385. C test at each step which requires roughly that
  386. C ABS(LOCAL ERROR) .LE. RTOL*ABS(Y)+ATOL
  387. C for each vector component.
  388. C (More specifically, a root-mean-square norm is used to
  389. C measure the size of vectors, and the error test uses the
  390. C magnitude of the solution at the beginning of the step.)
  391. C
  392. C The true (global) error is the difference between the
  393. C true solution of the initial value problem and the
  394. C computed approximation. Practically all present day
  395. C codes, including this one, control the local error at
  396. C each step and do not even attempt to control the global
  397. C error directly.
  398. C Usually, but not always, the true accuracy of the
  399. C computed Y is comparable to the error tolerances. This
  400. C code will usually, but not always, deliver a more
  401. C accurate solution if you reduce the tolerances and
  402. C integrate again. By comparing two such solutions you
  403. C can get a fairly reliable idea of the true error in the
  404. C solution at the bigger tolerances.
  405. C
  406. C Setting ATOL=0. results in a pure relative error test on
  407. C that component. Setting RTOL=0. results in a pure
  408. C absolute error test on that component. A mixed test
  409. C with non-zero RTOL and ATOL corresponds roughly to a
  410. C relative error test when the solution component is much
  411. C bigger than ATOL and to an absolute error test when the
  412. C solution component is smaller than the threshhold ATOL.
  413. C
  414. C The code will not attempt to compute a solution at an
  415. C accuracy unreasonable for the machine being used. It will
  416. C advise you if you ask for too much accuracy and inform
  417. C you as to the maximum accuracy it believes possible.
  418. C
  419. C RWORK(*) -- Dimension this real work array of length LRW in your
  420. C calling program.
  421. C
  422. C LRW -- Set it to the declared length of the RWORK array.
  423. C You must have
  424. C LRW .GE. 40+(MAXORD+4)*NEQ+NEQ**2
  425. C for the full (dense) JACOBIAN case (when INFO(6)=0), or
  426. C LRW .GE. 40+(MAXORD+4)*NEQ+(2*ML+MU+1)*NEQ
  427. C for the banded user-defined JACOBIAN case
  428. C (when INFO(5)=1 and INFO(6)=1), or
  429. C LRW .GE. 40+(MAXORD+4)*NEQ+(2*ML+MU+1)*NEQ
  430. C +2*(NEQ/(ML+MU+1)+1)
  431. C for the banded finite-difference-generated JACOBIAN case
  432. C (when INFO(5)=0 and INFO(6)=1)
  433. C
  434. C IWORK(*) -- Dimension this integer work array of length LIW in
  435. C your calling program.
  436. C
  437. C LIW -- Set it to the declared length of the IWORK array.
  438. C You must have LIW .GE. 20+NEQ
  439. C
  440. C RPAR, IPAR -- These are parameter arrays, of real and integer
  441. C type, respectively. You can use them for communication
  442. C between your program that calls SDASSL and the
  443. C RES subroutine (and the JAC subroutine). They are not
  444. C altered by SDASSL. If you do not need RPAR or IPAR,
  445. C ignore these parameters by treating them as dummy
  446. C arguments. If you do choose to use them, dimension
  447. C them in your calling program and in RES (and in JAC)
  448. C as arrays of appropriate length.
  449. C
  450. C JAC -- If you have set INFO(5)=0, you can ignore this parameter
  451. C by treating it as a dummy argument. Otherwise, you must
  452. C provide a subroutine of the form
  453. C SUBROUTINE JAC(T,Y,YPRIME,PD,CJ,RPAR,IPAR)
  454. C to define the matrix of partial derivatives
  455. C PD=DG/DY+CJ*DG/DYPRIME
  456. C CJ is a scalar which is input to JAC.
  457. C For the given values of T,Y,YPRIME, the
  458. C subroutine must evaluate the non-zero partial
  459. C derivatives for each equation and each solution
  460. C component, and store these values in the
  461. C matrix PD. The elements of PD are set to zero
  462. C before each call to JAC so only non-zero elements
  463. C need to be defined.
  464. C
  465. C Subroutine JAC must not alter T,Y,(*),YPRIME(*), or CJ.
  466. C You must declare the name JAC in an EXTERNAL statement in
  467. C your program that calls SDASSL. You must dimension Y,
  468. C YPRIME and PD in JAC.
  469. C
  470. C The way you must store the elements into the PD matrix
  471. C depends on the structure of the matrix which you
  472. C indicated by INFO(6).
  473. C *** INFO(6)=0 -- Full (dense) matrix ***
  474. C Give PD a first dimension of NEQ.
  475. C When you evaluate the (non-zero) partial derivative
  476. C of equation I with respect to variable J, you must
  477. C store it in PD according to
  478. C PD(I,J) = "DG(I)/DY(J)+CJ*DG(I)/DYPRIME(J)"
  479. C *** INFO(6)=1 -- Banded JACOBIAN with ML lower and MU
  480. C upper diagonal bands (refer to INFO(6) description
  481. C of ML and MU) ***
  482. C Give PD a first dimension of 2*ML+MU+1.
  483. C when you evaluate the (non-zero) partial derivative
  484. C of equation I with respect to variable J, you must
  485. C store it in PD according to
  486. C IROW = I - J + ML + MU + 1
  487. C PD(IROW,J) = "DG(I)/DY(J)+CJ*DG(I)/DYPRIME(J)"
  488. C
  489. C RPAR and IPAR are real and integer parameter arrays
  490. C which you can use for communication between your calling
  491. C program and your JACOBIAN subroutine JAC. They are not
  492. C altered by SDASSL. If you do not need RPAR or IPAR,
  493. C ignore these parameters by treating them as dummy
  494. C arguments. If you do choose to use them, dimension
  495. C them in your calling program and in JAC as arrays of
  496. C appropriate length.
  497. C
  498. C
  499. C OPTIONALLY REPLACEABLE NORM ROUTINE:
  500. C
  501. C SDASSL uses a weighted norm SDANRM to measure the size
  502. C of vectors such as the estimated error in each step.
  503. C A FUNCTION subprogram
  504. C REAL FUNCTION SDANRM(NEQ,V,WT,RPAR,IPAR)
  505. C DIMENSION V(NEQ),WT(NEQ)
  506. C is used to define this norm. Here, V is the vector
  507. C whose norm is to be computed, and WT is a vector of
  508. C weights. A SDANRM routine has been included with SDASSL
  509. C which computes the weighted root-mean-square norm
  510. C given by
  511. C SDANRM=SQRT((1/NEQ)*SUM(V(I)/WT(I))**2)
  512. C this norm is suitable for most problems. In some
  513. C special cases, it may be more convenient and/or
  514. C efficient to define your own norm by writing a function
  515. C subprogram to be called instead of SDANRM. This should,
  516. C however, be attempted only after careful thought and
  517. C consideration.
  518. C
  519. C
  520. C -------- OUTPUT -- AFTER ANY RETURN FROM SDASSL ---------------------
  521. C
  522. C The principal aim of the code is to return a computed solution at
  523. C TOUT, although it is also possible to obtain intermediate results
  524. C along the way. To find out whether the code achieved its goal
  525. C or if the integration process was interrupted before the task was
  526. C completed, you must check the IDID parameter.
  527. C
  528. C
  529. C T -- The solution was successfully advanced to the
  530. C output value of T.
  531. C
  532. C Y(*) -- Contains the computed solution approximation at T.
  533. C
  534. C YPRIME(*) -- Contains the computed derivative
  535. C approximation at T.
  536. C
  537. C IDID -- Reports what the code did.
  538. C
  539. C *** Task completed ***
  540. C Reported by positive values of IDID
  541. C
  542. C IDID = 1 -- A step was successfully taken in the
  543. C intermediate-output mode. The code has not
  544. C yet reached TOUT.
  545. C
  546. C IDID = 2 -- The integration to TSTOP was successfully
  547. C completed (T=TSTOP) by stepping exactly to TSTOP.
  548. C
  549. C IDID = 3 -- The integration to TOUT was successfully
  550. C completed (T=TOUT) by stepping past TOUT.
  551. C Y(*) is obtained by interpolation.
  552. C YPRIME(*) is obtained by interpolation.
  553. C
  554. C *** Task interrupted ***
  555. C Reported by negative values of IDID
  556. C
  557. C IDID = -1 -- A large amount of work has been expended.
  558. C (About 500 steps)
  559. C
  560. C IDID = -2 -- The error tolerances are too stringent.
  561. C
  562. C IDID = -3 -- The local error test cannot be satisfied
  563. C because you specified a zero component in ATOL
  564. C and the corresponding computed solution
  565. C component is zero. Thus, a pure relative error
  566. C test is impossible for this component.
  567. C
  568. C IDID = -6 -- SDASSL had repeated error test
  569. C failures on the last attempted step.
  570. C
  571. C IDID = -7 -- The corrector could not converge.
  572. C
  573. C IDID = -8 -- The matrix of partial derivatives
  574. C is singular.
  575. C
  576. C IDID = -9 -- The corrector could not converge.
  577. C there were repeated error test failures
  578. C in this step.
  579. C
  580. C IDID =-10 -- The corrector could not converge
  581. C because IRES was equal to minus one.
  582. C
  583. C IDID =-11 -- IRES equal to -2 was encountered
  584. C and control is being returned to the
  585. C calling program.
  586. C
  587. C IDID =-12 -- SDASSL failed to compute the initial
  588. C YPRIME.
  589. C
  590. C
  591. C
  592. C IDID = -13,..,-32 -- Not applicable for this code
  593. C
  594. C *** Task terminated ***
  595. C Reported by the value of IDID=-33
  596. C
  597. C IDID = -33 -- The code has encountered trouble from which
  598. C it cannot recover. A message is printed
  599. C explaining the trouble and control is returned
  600. C to the calling program. For example, this occurs
  601. C when invalid input is detected.
  602. C
  603. C RTOL, ATOL -- These quantities remain unchanged except when
  604. C IDID = -2. In this case, the error tolerances have been
  605. C increased by the code to values which are estimated to
  606. C be appropriate for continuing the integration. However,
  607. C the reported solution at T was obtained using the input
  608. C values of RTOL and ATOL.
  609. C
  610. C RWORK, IWORK -- Contain information which is usually of no
  611. C interest to the user but necessary for subsequent calls.
  612. C However, you may find use for
  613. C
  614. C RWORK(3)--Which contains the step size H to be
  615. C attempted on the next step.
  616. C
  617. C RWORK(4)--Which contains the current value of the
  618. C independent variable, i.e., the farthest point
  619. C integration has reached. This will be different
  620. C from T only when interpolation has been
  621. C performed (IDID=3).
  622. C
  623. C RWORK(7)--Which contains the stepsize used
  624. C on the last successful step.
  625. C
  626. C IWORK(7)--Which contains the order of the method to
  627. C be attempted on the next step.
  628. C
  629. C IWORK(8)--Which contains the order of the method used
  630. C on the last step.
  631. C
  632. C IWORK(11)--Which contains the number of steps taken so
  633. C far.
  634. C
  635. C IWORK(12)--Which contains the number of calls to RES
  636. C so far.
  637. C
  638. C IWORK(13)--Which contains the number of evaluations of
  639. C the matrix of partial derivatives needed so
  640. C far.
  641. C
  642. C IWORK(14)--Which contains the total number
  643. C of error test failures so far.
  644. C
  645. C IWORK(15)--Which contains the total number
  646. C of convergence test failures so far.
  647. C (includes singular iteration matrix
  648. C failures.)
  649. C
  650. C
  651. C -------- INPUT -- WHAT TO DO TO CONTINUE THE INTEGRATION ------------
  652. C (CALLS AFTER THE FIRST)
  653. C
  654. C This code is organized so that subsequent calls to continue the
  655. C integration involve little (if any) additional effort on your
  656. C part. You must monitor the IDID parameter in order to determine
  657. C what to do next.
  658. C
  659. C Recalling that the principal task of the code is to integrate
  660. C from T to TOUT (the interval mode), usually all you will need
  661. C to do is specify a new TOUT upon reaching the current TOUT.
  662. C
  663. C Do not alter any quantity not specifically permitted below,
  664. C in particular do not alter NEQ,T,Y(*),YPRIME(*),RWORK(*),IWORK(*)
  665. C or the differential equation in subroutine RES. Any such
  666. C alteration constitutes a new problem and must be treated as such,
  667. C i.e., you must start afresh.
  668. C
  669. C You cannot change from vector to scalar error control or vice
  670. C versa (INFO(2)), but you can change the size of the entries of
  671. C RTOL, ATOL. Increasing a tolerance makes the equation easier
  672. C to integrate. Decreasing a tolerance will make the equation
  673. C harder to integrate and should generally be avoided.
  674. C
  675. C You can switch from the intermediate-output mode to the
  676. C interval mode (INFO(3)) or vice versa at any time.
  677. C
  678. C If it has been necessary to prevent the integration from going
  679. C past a point TSTOP (INFO(4), RWORK(1)), keep in mind that the
  680. C code will not integrate to any TOUT beyond the currently
  681. C specified TSTOP. Once TSTOP has been reached you must change
  682. C the value of TSTOP or set INFO(4)=0. You may change INFO(4)
  683. C or TSTOP at any time but you must supply the value of TSTOP in
  684. C RWORK(1) whenever you set INFO(4)=1.
  685. C
  686. C Do not change INFO(5), INFO(6), IWORK(1), or IWORK(2)
  687. C unless you are going to restart the code.
  688. C
  689. C *** Following a completed task ***
  690. C If
  691. C IDID = 1, call the code again to continue the integration
  692. C another step in the direction of TOUT.
  693. C
  694. C IDID = 2 or 3, define a new TOUT and call the code again.
  695. C TOUT must be different from T. You cannot change
  696. C the direction of integration without restarting.
  697. C
  698. C *** Following an interrupted task ***
  699. C To show the code that you realize the task was
  700. C interrupted and that you want to continue, you
  701. C must take appropriate action and set INFO(1) = 1
  702. C If
  703. C IDID = -1, The code has taken about 500 steps.
  704. C If you want to continue, set INFO(1) = 1 and
  705. C call the code again. An additional 500 steps
  706. C will be allowed.
  707. C
  708. C IDID = -2, The error tolerances RTOL, ATOL have been
  709. C increased to values the code estimates appropriate
  710. C for continuing. You may want to change them
  711. C yourself. If you are sure you want to continue
  712. C with relaxed error tolerances, set INFO(1)=1 and
  713. C call the code again.
  714. C
  715. C IDID = -3, A solution component is zero and you set the
  716. C corresponding component of ATOL to zero. If you
  717. C are sure you want to continue, you must first
  718. C alter the error criterion to use positive values
  719. C for those components of ATOL corresponding to zero
  720. C solution components, then set INFO(1)=1 and call
  721. C the code again.
  722. C
  723. C IDID = -4,-5 --- Cannot occur with this code.
  724. C
  725. C IDID = -6, Repeated error test failures occurred on the
  726. C last attempted step in SDASSL. A singularity in the
  727. C solution may be present. If you are absolutely
  728. C certain you want to continue, you should restart
  729. C the integration. (Provide initial values of Y and
  730. C YPRIME which are consistent)
  731. C
  732. C IDID = -7, Repeated convergence test failures occurred
  733. C on the last attempted step in SDASSL. An inaccurate
  734. C or ill-conditioned JACOBIAN may be the problem. If
  735. C you are absolutely certain you want to continue, you
  736. C should restart the integration.
  737. C
  738. C IDID = -8, The matrix of partial derivatives is singular.
  739. C Some of your equations may be redundant.
  740. C SDASSL cannot solve the problem as stated.
  741. C It is possible that the redundant equations
  742. C could be removed, and then SDASSL could
  743. C solve the problem. It is also possible
  744. C that a solution to your problem either
  745. C does not exist or is not unique.
  746. C
  747. C IDID = -9, SDASSL had multiple convergence test
  748. C failures, preceded by multiple error
  749. C test failures, on the last attempted step.
  750. C It is possible that your problem
  751. C is ill-posed, and cannot be solved
  752. C using this code. Or, there may be a
  753. C discontinuity or a singularity in the
  754. C solution. If you are absolutely certain
  755. C you want to continue, you should restart
  756. C the integration.
  757. C
  758. C IDID =-10, SDASSL had multiple convergence test failures
  759. C because IRES was equal to minus one.
  760. C If you are absolutely certain you want
  761. C to continue, you should restart the
  762. C integration.
  763. C
  764. C IDID =-11, IRES=-2 was encountered, and control is being
  765. C returned to the calling program.
  766. C
  767. C IDID =-12, SDASSL failed to compute the initial YPRIME.
  768. C This could happen because the initial
  769. C approximation to YPRIME was not very good, or
  770. C if a YPRIME consistent with the initial Y
  771. C does not exist. The problem could also be caused
  772. C by an inaccurate or singular iteration matrix.
  773. C
  774. C IDID = -13,..,-32 --- Cannot occur with this code.
  775. C
  776. C
  777. C *** Following a terminated task ***
  778. C
  779. C If IDID= -33, you cannot continue the solution of this problem.
  780. C An attempt to do so will result in your
  781. C run being terminated.
  782. C
  783. C
  784. C -------- ERROR MESSAGES ---------------------------------------------
  785. C
  786. C The SLATEC error print routine XERMSG is called in the event of
  787. C unsuccessful completion of a task. Most of these are treated as
  788. C "recoverable errors", which means that (unless the user has directed
  789. C otherwise) control will be returned to the calling program for
  790. C possible action after the message has been printed.
  791. C
  792. C In the event of a negative value of IDID other than -33, an appro-
  793. C priate message is printed and the "error number" printed by XERMSG
  794. C is the value of IDID. There are quite a number of illegal input
  795. C errors that can lead to a returned value IDID=-33. The conditions
  796. C and their printed "error numbers" are as follows:
  797. C
  798. C Error number Condition
  799. C
  800. C 1 Some element of INFO vector is not zero or one.
  801. C 2 NEQ .le. 0
  802. C 3 MAXORD not in range.
  803. C 4 LRW is less than the required length for RWORK.
  804. C 5 LIW is less than the required length for IWORK.
  805. C 6 Some element of RTOL is .lt. 0
  806. C 7 Some element of ATOL is .lt. 0
  807. C 8 All elements of RTOL and ATOL are zero.
  808. C 9 INFO(4)=1 and TSTOP is behind TOUT.
  809. C 10 HMAX .lt. 0.0
  810. C 11 TOUT is behind T.
  811. C 12 INFO(8)=1 and H0=0.0
  812. C 13 Some element of WT is .le. 0.0
  813. C 14 TOUT is too close to T to start integration.
  814. C 15 INFO(4)=1 and TSTOP is behind T.
  815. C 16 --( Not used in this version )--
  816. C 17 ML illegal. Either .lt. 0 or .gt. NEQ
  817. C 18 MU illegal. Either .lt. 0 or .gt. NEQ
  818. C 19 TOUT = T.
  819. C
  820. C If SDASSL is called again without any action taken to remove the
  821. C cause of an unsuccessful return, XERMSG will be called with a fatal
  822. C error flag, which will cause unconditional termination of the
  823. C program. There are two such fatal errors:
  824. C
  825. C Error number -998: The last step was terminated with a negative
  826. C value of IDID other than -33, and no appropriate action was
  827. C taken.
  828. C
  829. C Error number -999: The previous call was terminated because of
  830. C illegal input (IDID=-33) and there is illegal input in the
  831. C present call, as well. (Suspect infinite loop.)
  832. C
  833. C ---------------------------------------------------------------------
  834. C
  835. C***REFERENCES A DESCRIPTION OF DASSL: A DIFFERENTIAL/ALGEBRAIC
  836. C SYSTEM SOLVER, L. R. PETZOLD, SAND82-8637,
  837. C SANDIA NATIONAL LABORATORIES, SEPTEMBER 1982.
  838. C***ROUTINES CALLED R1MACH, SDAINI, SDANRM, SDASTP, SDATRP, SDAWTS,
  839. C XERMSG
  840. C***REVISION HISTORY (YYMMDD)
  841. C 830315 DATE WRITTEN
  842. C 880387 Code changes made. All common statements have been
  843. C replaced by a DATA statement, which defines pointers into
  844. C RWORK, and PARAMETER statements which define pointers
  845. C into IWORK. As well the documentation has gone through
  846. C grammatical changes.
  847. C 881005 The prologue has been changed to mixed case.
  848. C The subordinate routines had revision dates changed to
  849. C this date, although the documentation for these routines
  850. C is all upper case. No code changes.
  851. C 890511 Code changes made. The DATA statement in the declaration
  852. C section of SDASSL was replaced with a PARAMETER
  853. C statement. Also the statement S = 100.E0 was removed
  854. C from the top of the Newton iteration in SDASTP.
  855. C The subordinate routines had revision dates changed to
  856. C this date.
  857. C 890517 The revision date syntax was replaced with the revision
  858. C history syntax. Also the "DECK" comment was added to
  859. C the top of all subroutines. These changes are consistent
  860. C with new SLATEC guidelines.
  861. C The subordinate routines had revision dates changed to
  862. C this date. No code changes.
  863. C 891013 Code changes made.
  864. C Removed all occurrences of FLOAT. All operations
  865. C are now performed with "mixed-mode" arithmetic.
  866. C Also, specific function names were replaced with generic
  867. C function names to be consistent with new SLATEC guidelines.
  868. C In particular:
  869. C Replaced AMIN1 with MIN everywhere.
  870. C Replaced MIN0 with MIN everywhere.
  871. C Replaced AMAX1 with MAX everywhere.
  872. C Replaced MAX0 with MAX everywhere.
  873. C Also replaced REVISION DATE with REVISION HISTORY in all
  874. C subordinate routines.
  875. C 901004 Miscellaneous changes to prologue to complete conversion
  876. C to SLATEC 4.0 format. No code changes. (F.N.Fritsch)
  877. C 901009 Corrected GAMS classification code and converted subsidiary
  878. C routines to 4.0 format. No code changes. (F.N.Fritsch)
  879. C 901010 Converted XERRWV calls to XERMSG calls. (R.Clemens, AFWL)
  880. C 901019 Code changes made.
  881. C Merged SLATEC 4.0 changes with previous changes made
  882. C by C. Ulrich. Below is a history of the changes made by
  883. C C. Ulrich. (Changes in subsidiary routines are implied
  884. C by this history)
  885. C 891228 Bug was found and repaired inside the SDASSL
  886. C and SDAINI routines. SDAINI was incorrectly
  887. C returning the initial T with Y and YPRIME
  888. C computed at T+H. The routine now returns T+H
  889. C rather than the initial T.
  890. C Cosmetic changes made to SDASTP.
  891. C 900904 Three modifications were made to fix a bug (inside
  892. C SDASSL) re interpolation for continuation calls and
  893. C cases where TN is very close to TSTOP:
  894. C
  895. C 1) In testing for whether H is too large, just
  896. C compare H to (TSTOP - TN), rather than
  897. C (TSTOP - TN) * (1-4*UROUND), and set H to
  898. C TSTOP - TN. This will force SDASTP to step
  899. C exactly to TSTOP under certain situations
  900. C (i.e. when H returned from SDASTP would otherwise
  901. C take TN beyond TSTOP).
  902. C
  903. C 2) Inside the SDASTP loop, interpolate exactly to
  904. C TSTOP if TN is very close to TSTOP (rather than
  905. C interpolating to within roundoff of TSTOP).
  906. C
  907. C 3) Modified IDID description for IDID = 2 to say
  908. C that the solution is returned by stepping exactly
  909. C to TSTOP, rather than TOUT. (In some cases the
  910. C solution is actually obtained by extrapolating
  911. C over a distance near unit roundoff to TSTOP,
  912. C but this small distance is deemed acceptable in
  913. C these circumstances.)
  914. C 901026 Added explicit declarations for all variables and minor
  915. C cosmetic changes to prologue, removed unreferenced labels,
  916. C and improved XERMSG calls. (FNF)
  917. C 901030 Added ERROR MESSAGES section and reworked other sections to
  918. C be of more uniform format. (FNF)
  919. C 910624 Fixed minor bug related to HMAX (six lines after label
  920. C 525). (LRP)
  921. C***END PROLOGUE SDASSL
  922. C
  923. C**End
  924. C
  925. C Declare arguments.
  926. C
  927. INTEGER NEQ, INFO(15), IDID, LRW, IWORK(*), LIW, IPAR(*)
  928. REAL T, Y(*), YPRIME(*), TOUT, RTOL(*), ATOL(*), RWORK(*),
  929. * RPAR(*)
  930. EXTERNAL RES, JAC
  931. C
  932. C Declare externals.
  933. C
  934. EXTERNAL R1MACH, SDAINI, SDANRM, SDASTP, SDATRP, SDAWTS, XERMSG
  935. REAL R1MACH, SDANRM
  936. C
  937. C Declare local variables.
  938. C
  939. INTEGER I, ITEMP, LALPHA, LBETA, LCJ, LCJOLD, LCTF, LDELTA,
  940. * LENIW, LENPD, LENRW, LE, LETF, LGAMMA, LH, LHMAX, LHOLD, LIPVT,
  941. * LJCALC, LK, LKOLD, LIWM, LML, LMTYPE, LMU, LMXORD, LNJE, LNPD,
  942. * LNRE, LNS, LNST, LNSTL, LPD, LPHASE, LPHI, LPSI, LROUND, LS,
  943. * LSIGMA, LTN, LTSTOP, LWM, LWT, MBAND, MSAVE, MXORD, NPD, NTEMP,
  944. * NZFLG
  945. REAL ATOLI, H, HMAX, HMIN, HO, R, RH, RTOLI, TDIST, TN, TNEXT,
  946. * TSTOP, UROUND, YPNORM
  947. LOGICAL DONE
  948. C Auxiliary variables for conversion of values to be included in
  949. C error messages.
  950. CHARACTER*8 XERN1, XERN2
  951. CHARACTER*16 XERN3, XERN4
  952. C
  953. C SET POINTERS INTO IWORK
  954. PARAMETER (LML=1, LMU=2, LMXORD=3, LMTYPE=4, LNST=11,
  955. * LNRE=12, LNJE=13, LETF=14, LCTF=15, LNPD=16,
  956. * LIPVT=21, LJCALC=5, LPHASE=6, LK=7, LKOLD=8,
  957. * LNS=9, LNSTL=10, LIWM=1)
  958. C
  959. C SET RELATIVE OFFSET INTO RWORK
  960. PARAMETER (NPD=1)
  961. C
  962. C SET POINTERS INTO RWORK
  963. PARAMETER (LTSTOP=1, LHMAX=2, LH=3, LTN=4,
  964. * LCJ=5, LCJOLD=6, LHOLD=7, LS=8, LROUND=9,
  965. * LALPHA=11, LBETA=17, LGAMMA=23,
  966. * LPSI=29, LSIGMA=35, LDELTA=41)
  967. C
  968. C***FIRST EXECUTABLE STATEMENT SDASSL
  969. IF(INFO(1).NE.0)GO TO 100
  970. C
  971. C-----------------------------------------------------------------------
  972. C THIS BLOCK IS EXECUTED FOR THE INITIAL CALL ONLY.
  973. C IT CONTAINS CHECKING OF INPUTS AND INITIALIZATIONS.
  974. C-----------------------------------------------------------------------
  975. C
  976. C FIRST CHECK INFO ARRAY TO MAKE SURE ALL ELEMENTS OF INFO
  977. C ARE EITHER ZERO OR ONE.
  978. DO 10 I=2,11
  979. IF(INFO(I).NE.0.AND.INFO(I).NE.1)GO TO 701
  980. 10 CONTINUE
  981. C
  982. IF(NEQ.LE.0)GO TO 702
  983. C
  984. C CHECK AND COMPUTE MAXIMUM ORDER
  985. MXORD=5
  986. IF(INFO(9).EQ.0)GO TO 20
  987. MXORD=IWORK(LMXORD)
  988. IF(MXORD.LT.1.OR.MXORD.GT.5)GO TO 703
  989. 20 IWORK(LMXORD)=MXORD
  990. C
  991. C COMPUTE MTYPE,LENPD,LENRW.CHECK ML AND MU.
  992. IF(INFO(6).NE.0)GO TO 40
  993. LENPD=NEQ**2
  994. LENRW=40+(IWORK(LMXORD)+4)*NEQ+LENPD
  995. IF(INFO(5).NE.0)GO TO 30
  996. IWORK(LMTYPE)=2
  997. GO TO 60
  998. 30 IWORK(LMTYPE)=1
  999. GO TO 60
  1000. 40 IF(IWORK(LML).LT.0.OR.IWORK(LML).GE.NEQ)GO TO 717
  1001. IF(IWORK(LMU).LT.0.OR.IWORK(LMU).GE.NEQ)GO TO 718
  1002. LENPD=(2*IWORK(LML)+IWORK(LMU)+1)*NEQ
  1003. IF(INFO(5).NE.0)GO TO 50
  1004. IWORK(LMTYPE)=5
  1005. MBAND=IWORK(LML)+IWORK(LMU)+1
  1006. MSAVE=(NEQ/MBAND)+1
  1007. LENRW=40+(IWORK(LMXORD)+4)*NEQ+LENPD+2*MSAVE
  1008. GO TO 60
  1009. 50 IWORK(LMTYPE)=4
  1010. LENRW=40+(IWORK(LMXORD)+4)*NEQ+LENPD
  1011. C
  1012. C CHECK LENGTHS OF RWORK AND IWORK
  1013. 60 LENIW=20+NEQ
  1014. IWORK(LNPD)=LENPD
  1015. IF(LRW.LT.LENRW)GO TO 704
  1016. IF(LIW.LT.LENIW)GO TO 705
  1017. C
  1018. C CHECK TO SEE THAT TOUT IS DIFFERENT FROM T
  1019. IF(TOUT .EQ. T)GO TO 719
  1020. C
  1021. C CHECK HMAX
  1022. IF(INFO(7).EQ.0)GO TO 70
  1023. HMAX=RWORK(LHMAX)
  1024. IF(HMAX.LE.0.0E0)GO TO 710
  1025. 70 CONTINUE
  1026. C
  1027. C INITIALIZE COUNTERS
  1028. IWORK(LNST)=0
  1029. IWORK(LNRE)=0
  1030. IWORK(LNJE)=0
  1031. C
  1032. IWORK(LNSTL)=0
  1033. IDID=1
  1034. GO TO 200
  1035. C
  1036. C-----------------------------------------------------------------------
  1037. C THIS BLOCK IS FOR CONTINUATION CALLS
  1038. C ONLY. HERE WE CHECK INFO(1), AND IF THE
  1039. C LAST STEP WAS INTERRUPTED WE CHECK WHETHER
  1040. C APPROPRIATE ACTION WAS TAKEN.
  1041. C-----------------------------------------------------------------------
  1042. C
  1043. 100 CONTINUE
  1044. IF(INFO(1).EQ.1)GO TO 110
  1045. IF(INFO(1).NE.-1)GO TO 701
  1046. C
  1047. C IF WE ARE HERE, THE LAST STEP WAS INTERRUPTED
  1048. C BY AN ERROR CONDITION FROM SDASTP, AND
  1049. C APPROPRIATE ACTION WAS NOT TAKEN. THIS
  1050. C IS A FATAL ERROR.
  1051. WRITE (XERN1, '(I8)') IDID
  1052. CALL XERMSG ('SLATEC', 'SDASSL',
  1053. * 'THE LAST STEP TERMINATED WITH A NEGATIVE VALUE OF IDID = ' //
  1054. * XERN1 // ' AND NO APPROPRIATE ACTION WAS TAKEN. ' //
  1055. * 'RUN TERMINATED', -998, 2)
  1056. RETURN
  1057. 110 CONTINUE
  1058. IWORK(LNSTL)=IWORK(LNST)
  1059. C
  1060. C-----------------------------------------------------------------------
  1061. C THIS BLOCK IS EXECUTED ON ALL CALLS.
  1062. C THE ERROR TOLERANCE PARAMETERS ARE
  1063. C CHECKED, AND THE WORK ARRAY POINTERS
  1064. C ARE SET.
  1065. C-----------------------------------------------------------------------
  1066. C
  1067. 200 CONTINUE
  1068. C CHECK RTOL,ATOL
  1069. NZFLG=0
  1070. RTOLI=RTOL(1)
  1071. ATOLI=ATOL(1)
  1072. DO 210 I=1,NEQ
  1073. IF(INFO(2).EQ.1)RTOLI=RTOL(I)
  1074. IF(INFO(2).EQ.1)ATOLI=ATOL(I)
  1075. IF(RTOLI.GT.0.0E0.OR.ATOLI.GT.0.0E0)NZFLG=1
  1076. IF(RTOLI.LT.0.0E0)GO TO 706
  1077. IF(ATOLI.LT.0.0E0)GO TO 707
  1078. 210 CONTINUE
  1079. IF(NZFLG.EQ.0)GO TO 708
  1080. C
  1081. C SET UP RWORK STORAGE.IWORK STORAGE IS FIXED
  1082. C IN DATA STATEMENT.
  1083. LE=LDELTA+NEQ
  1084. LWT=LE+NEQ
  1085. LPHI=LWT+NEQ
  1086. LPD=LPHI+(IWORK(LMXORD)+1)*NEQ
  1087. LWM=LPD
  1088. NTEMP=NPD+IWORK(LNPD)
  1089. IF(INFO(1).EQ.1)GO TO 400
  1090. C
  1091. C-----------------------------------------------------------------------
  1092. C THIS BLOCK IS EXECUTED ON THE INITIAL CALL
  1093. C ONLY. SET THE INITIAL STEP SIZE, AND
  1094. C THE ERROR WEIGHT VECTOR, AND PHI.
  1095. C COMPUTE INITIAL YPRIME, IF NECESSARY.
  1096. C-----------------------------------------------------------------------
  1097. C
  1098. TN=T
  1099. IDID=1
  1100. C
  1101. C SET ERROR WEIGHT VECTOR WT
  1102. CALL SDAWTS(NEQ,INFO(2),RTOL,ATOL,Y,RWORK(LWT),RPAR,IPAR)
  1103. DO 305 I = 1,NEQ
  1104. IF(RWORK(LWT+I-1).LE.0.0E0) GO TO 713
  1105. 305 CONTINUE
  1106. C
  1107. C COMPUTE UNIT ROUNDOFF AND HMIN
  1108. UROUND = R1MACH(4)
  1109. RWORK(LROUND) = UROUND
  1110. HMIN = 4.0E0*UROUND*MAX(ABS(T),ABS(TOUT))
  1111. C
  1112. C CHECK INITIAL INTERVAL TO SEE THAT IT IS LONG ENOUGH
  1113. TDIST = ABS(TOUT - T)
  1114. IF(TDIST .LT. HMIN) GO TO 714
  1115. C
  1116. C CHECK HO, IF THIS WAS INPUT
  1117. IF (INFO(8) .EQ. 0) GO TO 310
  1118. HO = RWORK(LH)
  1119. IF ((TOUT - T)*HO .LT. 0.0E0) GO TO 711
  1120. IF (HO .EQ. 0.0E0) GO TO 712
  1121. GO TO 320
  1122. 310 CONTINUE
  1123. C
  1124. C COMPUTE INITIAL STEPSIZE, TO BE USED BY EITHER
  1125. C SDASTP OR SDAINI, DEPENDING ON INFO(11)
  1126. HO = 0.001E0*TDIST
  1127. YPNORM = SDANRM(NEQ,YPRIME,RWORK(LWT),RPAR,IPAR)
  1128. IF (YPNORM .GT. 0.5E0/HO) HO = 0.5E0/YPNORM
  1129. HO = SIGN(HO,TOUT-T)
  1130. C ADJUST HO IF NECESSARY TO MEET HMAX BOUND
  1131. 320 IF (INFO(7) .EQ. 0) GO TO 330
  1132. RH = ABS(HO)/RWORK(LHMAX)
  1133. IF (RH .GT. 1.0E0) HO = HO/RH
  1134. C COMPUTE TSTOP, IF APPLICABLE
  1135. 330 IF (INFO(4) .EQ. 0) GO TO 340
  1136. TSTOP = RWORK(LTSTOP)
  1137. IF ((TSTOP - T)*HO .LT. 0.0E0) GO TO 715
  1138. IF ((T + HO - TSTOP)*HO .GT. 0.0E0) HO = TSTOP - T
  1139. IF ((TSTOP - TOUT)*HO .LT. 0.0E0) GO TO 709
  1140. C
  1141. C COMPUTE INITIAL DERIVATIVE, UPDATING TN AND Y, IF APPLICABLE
  1142. 340 IF (INFO(11) .EQ. 0) GO TO 350
  1143. CALL SDAINI(TN,Y,YPRIME,NEQ,
  1144. * RES,JAC,HO,RWORK(LWT),IDID,RPAR,IPAR,
  1145. * RWORK(LPHI),RWORK(LDELTA),RWORK(LE),
  1146. * RWORK(LWM),IWORK(LIWM),HMIN,RWORK(LROUND),
  1147. * INFO(10),NTEMP)
  1148. IF (IDID .LT. 0) GO TO 390
  1149. C
  1150. C LOAD H WITH HO. STORE H IN RWORK(LH)
  1151. 350 H = HO
  1152. RWORK(LH) = H
  1153. C
  1154. C LOAD Y AND H*YPRIME INTO PHI(*,1) AND PHI(*,2)
  1155. ITEMP = LPHI + NEQ
  1156. DO 370 I = 1,NEQ
  1157. RWORK(LPHI + I - 1) = Y(I)
  1158. 370 RWORK(ITEMP + I - 1) = H*YPRIME(I)
  1159. C
  1160. 390 GO TO 500
  1161. C
  1162. C-------------------------------------------------------
  1163. C THIS BLOCK IS FOR CONTINUATION CALLS ONLY. ITS
  1164. C PURPOSE IS TO CHECK STOP CONDITIONS BEFORE
  1165. C TAKING A STEP.
  1166. C ADJUST H IF NECESSARY TO MEET HMAX BOUND
  1167. C-------------------------------------------------------
  1168. C
  1169. 400 CONTINUE
  1170. UROUND=RWORK(LROUND)
  1171. DONE = .FALSE.
  1172. TN=RWORK(LTN)
  1173. H=RWORK(LH)
  1174. IF(INFO(7) .EQ. 0) GO TO 410
  1175. RH = ABS(H)/RWORK(LHMAX)
  1176. IF(RH .GT. 1.0E0) H = H/RH
  1177. 410 CONTINUE
  1178. IF(T .EQ. TOUT) GO TO 719
  1179. IF((T - TOUT)*H .GT. 0.0E0) GO TO 711
  1180. IF(INFO(4) .EQ. 1) GO TO 430
  1181. IF(INFO(3) .EQ. 1) GO TO 420
  1182. IF((TN-TOUT)*H.LT.0.0E0)GO TO 490
  1183. CALL SDATRP(TN,TOUT,Y,YPRIME,NEQ,IWORK(LKOLD),
  1184. * RWORK(LPHI),RWORK(LPSI))
  1185. T=TOUT
  1186. IDID = 3
  1187. DONE = .TRUE.
  1188. GO TO 490
  1189. 420 IF((TN-T)*H .LE. 0.0E0) GO TO 490
  1190. IF((TN - TOUT)*H .GT. 0.0E0) GO TO 425
  1191. CALL SDATRP(TN,TN,Y,YPRIME,NEQ,IWORK(LKOLD),
  1192. * RWORK(LPHI),RWORK(LPSI))
  1193. T = TN
  1194. IDID = 1
  1195. DONE = .TRUE.
  1196. GO TO 490
  1197. 425 CONTINUE
  1198. CALL SDATRP(TN,TOUT,Y,YPRIME,NEQ,IWORK(LKOLD),
  1199. * RWORK(LPHI),RWORK(LPSI))
  1200. T = TOUT
  1201. IDID = 3
  1202. DONE = .TRUE.
  1203. GO TO 490
  1204. 430 IF(INFO(3) .EQ. 1) GO TO 440
  1205. TSTOP=RWORK(LTSTOP)
  1206. IF((TN-TSTOP)*H.GT.0.0E0) GO TO 715
  1207. IF((TSTOP-TOUT)*H.LT.0.0E0)GO TO 709
  1208. IF((TN-TOUT)*H.LT.0.0E0)GO TO 450
  1209. CALL SDATRP(TN,TOUT,Y,YPRIME,NEQ,IWORK(LKOLD),
  1210. * RWORK(LPHI),RWORK(LPSI))
  1211. T=TOUT
  1212. IDID = 3
  1213. DONE = .TRUE.
  1214. GO TO 490
  1215. 440 TSTOP = RWORK(LTSTOP)
  1216. IF((TN-TSTOP)*H .GT. 0.0E0) GO TO 715
  1217. IF((TSTOP-TOUT)*H .LT. 0.0E0) GO TO 709
  1218. IF((TN-T)*H .LE. 0.0E0) GO TO 450
  1219. IF((TN - TOUT)*H .GT. 0.0E0) GO TO 445
  1220. CALL SDATRP(TN,TN,Y,YPRIME,NEQ,IWORK(LKOLD),
  1221. * RWORK(LPHI),RWORK(LPSI))
  1222. T = TN
  1223. IDID = 1
  1224. DONE = .TRUE.
  1225. GO TO 490
  1226. 445 CONTINUE
  1227. CALL SDATRP(TN,TOUT,Y,YPRIME,NEQ,IWORK(LKOLD),
  1228. * RWORK(LPHI),RWORK(LPSI))
  1229. T = TOUT
  1230. IDID = 3
  1231. DONE = .TRUE.
  1232. GO TO 490
  1233. 450 CONTINUE
  1234. C CHECK WHETHER WE ARE WITHIN ROUNDOFF OF TSTOP
  1235. IF(ABS(TN-TSTOP).GT.100.0E0*UROUND*
  1236. * (ABS(TN)+ABS(H)))GO TO 460
  1237. CALL SDATRP(TN,TSTOP,Y,YPRIME,NEQ,IWORK(LKOLD),
  1238. * RWORK(LPHI),RWORK(LPSI))
  1239. IDID=2
  1240. T=TSTOP
  1241. DONE = .TRUE.
  1242. GO TO 490
  1243. 460 TNEXT=TN+H
  1244. IF((TNEXT-TSTOP)*H.LE.0.0E0)GO TO 490
  1245. H=TSTOP-TN
  1246. RWORK(LH)=H
  1247. C
  1248. 490 IF (DONE) GO TO 580
  1249. C
  1250. C-------------------------------------------------------
  1251. C THE NEXT BLOCK CONTAINS THE CALL TO THE
  1252. C ONE-STEP INTEGRATOR SDASTP.
  1253. C THIS IS A LOOPING POINT FOR THE INTEGRATION STEPS.
  1254. C CHECK FOR TOO MANY STEPS.
  1255. C UPDATE WT.
  1256. C CHECK FOR TOO MUCH ACCURACY REQUESTED.
  1257. C COMPUTE MINIMUM STEPSIZE.
  1258. C-------------------------------------------------------
  1259. C
  1260. 500 CONTINUE
  1261. C CHECK FOR FAILURE TO COMPUTE INITIAL YPRIME
  1262. IF (IDID .EQ. -12) GO TO 527
  1263. C
  1264. C CHECK FOR TOO MANY STEPS
  1265. IF((IWORK(LNST)-IWORK(LNSTL)).LT.500)
  1266. * GO TO 510
  1267. IDID=-1
  1268. GO TO 527
  1269. C
  1270. C UPDATE WT
  1271. 510 CALL SDAWTS(NEQ,INFO(2),RTOL,ATOL,RWORK(LPHI),
  1272. * RWORK(LWT),RPAR,IPAR)
  1273. DO 520 I=1,NEQ
  1274. IF(RWORK(I+LWT-1).GT.0.0E0)GO TO 520
  1275. IDID=-3
  1276. GO TO 527
  1277. 520 CONTINUE
  1278. C
  1279. C TEST FOR TOO MUCH ACCURACY REQUESTED.
  1280. R=SDANRM(NEQ,RWORK(LPHI),RWORK(LWT),RPAR,IPAR)*
  1281. * 100.0E0*UROUND
  1282. IF(R.LE.1.0E0)GO TO 525
  1283. C MULTIPLY RTOL AND ATOL BY R AND RETURN
  1284. IF(INFO(2).EQ.1)GO TO 523
  1285. RTOL(1)=R*RTOL(1)
  1286. ATOL(1)=R*ATOL(1)
  1287. IDID=-2
  1288. GO TO 527
  1289. 523 DO 524 I=1,NEQ
  1290. RTOL(I)=R*RTOL(I)
  1291. 524 ATOL(I)=R*ATOL(I)
  1292. IDID=-2
  1293. GO TO 527
  1294. 525 CONTINUE
  1295. C
  1296. C COMPUTE MINIMUM STEPSIZE
  1297. HMIN=4.0E0*UROUND*MAX(ABS(TN),ABS(TOUT))
  1298. C
  1299. C TEST H VS. HMAX
  1300. IF (INFO(7) .NE. 0) THEN
  1301. RH = ABS(H)/RWORK(LHMAX)
  1302. IF (RH .GT. 1.0E0) H = H/RH
  1303. ENDIF
  1304. C
  1305. CALL SDASTP(TN,Y,YPRIME,NEQ,
  1306. * RES,JAC,H,RWORK(LWT),INFO(1),IDID,RPAR,IPAR,
  1307. * RWORK(LPHI),RWORK(LDELTA),RWORK(LE),
  1308. * RWORK(LWM),IWORK(LIWM),
  1309. * RWORK(LALPHA),RWORK(LBETA),RWORK(LGAMMA),
  1310. * RWORK(LPSI),RWORK(LSIGMA),
  1311. * RWORK(LCJ),RWORK(LCJOLD),RWORK(LHOLD),
  1312. * RWORK(LS),HMIN,RWORK(LROUND),
  1313. * IWORK(LPHASE),IWORK(LJCALC),IWORK(LK),
  1314. * IWORK(LKOLD),IWORK(LNS),INFO(10),NTEMP)
  1315. 527 IF(IDID.LT.0)GO TO 600
  1316. C
  1317. C--------------------------------------------------------
  1318. C THIS BLOCK HANDLES THE CASE OF A SUCCESSFUL RETURN
  1319. C FROM SDASTP (IDID=1). TEST FOR STOP CONDITIONS.
  1320. C--------------------------------------------------------
  1321. C
  1322. IF(INFO(4).NE.0)GO TO 540
  1323. IF(INFO(3).NE.0)GO TO 530
  1324. IF((TN-TOUT)*H.LT.0.0E0)GO TO 500
  1325. CALL SDATRP(TN,TOUT,Y,YPRIME,NEQ,
  1326. * IWORK(LKOLD),RWORK(LPHI),RWORK(LPSI))
  1327. IDID=3
  1328. T=TOUT
  1329. GO TO 580
  1330. 530 IF((TN-TOUT)*H.GE.0.0E0)GO TO 535
  1331. T=TN
  1332. IDID=1
  1333. GO TO 580
  1334. 535 CALL SDATRP(TN,TOUT,Y,YPRIME,NEQ,
  1335. * IWORK(LKOLD),RWORK(LPHI),RWORK(LPSI))
  1336. IDID=3
  1337. T=TOUT
  1338. GO TO 580
  1339. 540 IF(INFO(3).NE.0)GO TO 550
  1340. IF((TN-TOUT)*H.LT.0.0E0)GO TO 542
  1341. CALL SDATRP(TN,TOUT,Y,YPRIME,NEQ,
  1342. * IWORK(LKOLD),RWORK(LPHI),RWORK(LPSI))
  1343. T=TOUT
  1344. IDID=3
  1345. GO TO 580
  1346. 542 IF(ABS(TN-TSTOP).LE.100.0E0*UROUND*
  1347. * (ABS(TN)+ABS(H)))GO TO 545
  1348. TNEXT=TN+H
  1349. IF((TNEXT-TSTOP)*H.LE.0.0E0)GO TO 500
  1350. H=TSTOP-TN
  1351. GO TO 500
  1352. 545 CALL SDATRP(TN,TSTOP,Y,YPRIME,NEQ,
  1353. * IWORK(LKOLD),RWORK(LPHI),RWORK(LPSI))
  1354. IDID=2
  1355. T=TSTOP
  1356. GO TO 580
  1357. 550 IF((TN-TOUT)*H.GE.0.0E0)GO TO 555
  1358. IF(ABS(TN-TSTOP).LE.100.0E0*UROUND*(ABS(TN)+ABS(H)))GO TO 552
  1359. T=TN
  1360. IDID=1
  1361. GO TO 580
  1362. 552 CALL SDATRP(TN,TSTOP,Y,YPRIME,NEQ,
  1363. * IWORK(LKOLD),RWORK(LPHI),RWORK(LPSI))
  1364. IDID=2
  1365. T=TSTOP
  1366. GO TO 580
  1367. 555 CALL SDATRP(TN,TOUT,Y,YPRIME,NEQ,
  1368. * IWORK(LKOLD),RWORK(LPHI),RWORK(LPSI))
  1369. T=TOUT
  1370. IDID=3
  1371. GO TO 580
  1372. C
  1373. C--------------------------------------------------------
  1374. C ALL SUCCESSFUL RETURNS FROM SDASSL ARE MADE FROM
  1375. C THIS BLOCK.
  1376. C--------------------------------------------------------
  1377. C
  1378. 580 CONTINUE
  1379. RWORK(LTN)=TN
  1380. RWORK(LH)=H
  1381. RETURN
  1382. C
  1383. C-----------------------------------------------------------------------
  1384. C THIS BLOCK HANDLES ALL UNSUCCESSFUL
  1385. C RETURNS OTHER THAN FOR ILLEGAL INPUT.
  1386. C-----------------------------------------------------------------------
  1387. C
  1388. 600 CONTINUE
  1389. ITEMP=-IDID
  1390. GO TO (610,620,630,690,690,640,650,660,670,675,
  1391. * 680,685), ITEMP
  1392. C
  1393. C THE MAXIMUM NUMBER OF STEPS WAS TAKEN BEFORE
  1394. C REACHING TOUT
  1395. 610 WRITE (XERN3, '(1P,E15.6)') TN
  1396. CALL XERMSG ('SLATEC', 'SDASSL',
  1397. * 'AT CURRENT T = ' // XERN3 // ' 500 STEPS TAKEN ON THIS ' //
  1398. * 'CALL BEFORE REACHING TOUT', IDID, 1)
  1399. GO TO 690
  1400. C
  1401. C TOO MUCH ACCURACY FOR MACHINE PRECISION
  1402. 620 WRITE (XERN3, '(1P,E15.6)') TN
  1403. CALL XERMSG ('SLATEC', 'SDASSL',
  1404. * 'AT T = ' // XERN3 // ' TOO MUCH ACCURACY REQUESTED FOR ' //
  1405. * 'PRECISION OF MACHINE. RTOL AND ATOL WERE INCREASED TO ' //
  1406. * 'APPROPRIATE VALUES', IDID, 1)
  1407. GO TO 690
  1408. C
  1409. C WT(I) .LE. 0.0 FOR SOME I (NOT AT START OF PROBLEM)
  1410. 630 WRITE (XERN3, '(1P,E15.6)') TN
  1411. CALL XERMSG ('SLATEC', 'SDASSL',
  1412. * 'AT T = ' // XERN3 // ' SOME ELEMENT OF WT HAS BECOME .LE. ' //
  1413. * '0.0', IDID, 1)
  1414. GO TO 690
  1415. C
  1416. C ERROR TEST FAILED REPEATEDLY OR WITH H=HMIN
  1417. 640 WRITE (XERN3, '(1P,E15.6)') TN
  1418. WRITE (XERN4, '(1P,E15.6)') H
  1419. CALL XERMSG ('SLATEC', 'SDASSL',
  1420. * 'AT T = ' // XERN3 // ' AND STEPSIZE H = ' // XERN4 //
  1421. * ' THE ERROR TEST FAILED REPEATEDLY OR WITH ABS(H)=HMIN',
  1422. * IDID, 1)
  1423. GO TO 690
  1424. C
  1425. C CORRECTOR CONVERGENCE FAILED REPEATEDLY OR WITH H=HMIN
  1426. 650 WRITE (XERN3, '(1P,E15.6)') TN
  1427. WRITE (XERN4, '(1P,E15.6)') H
  1428. CALL XERMSG ('SLATEC', 'SDASSL',
  1429. * 'AT T = ' // XERN3 // ' AND STEPSIZE H = ' // XERN4 //
  1430. * ' THE CORRECTOR FAILED TO CONVERGE REPEATEDLY OR WITH ' //
  1431. * 'ABS(H)=HMIN', IDID, 1)
  1432. GO TO 690
  1433. C
  1434. C THE ITERATION MATRIX IS SINGULAR
  1435. 660 WRITE (XERN3, '(1P,E15.6)') TN
  1436. WRITE (XERN4, '(1P,E15.6)') H
  1437. CALL XERMSG ('SLATEC', 'SDASSL',
  1438. * 'AT T = ' // XERN3 // ' AND STEPSIZE H = ' // XERN4 //
  1439. * ' THE ITERATION MATRIX IS SINGULAR', IDID, 1)
  1440. GO TO 690
  1441. C
  1442. C CORRECTOR FAILURE PRECEDED BY ERROR TEST FAILURES.
  1443. 670 WRITE (XERN3, '(1P,E15.6)') TN
  1444. WRITE (XERN4, '(1P,E15.6)') H
  1445. CALL XERMSG ('SLATEC', 'SDASSL',
  1446. * 'AT T = ' // XERN3 // ' AND STEPSIZE H = ' // XERN4 //
  1447. * ' THE CORRECTOR COULD NOT CONVERGE. ALSO, THE ERROR TEST ' //
  1448. * 'FAILED REPEATEDLY.', IDID, 1)
  1449. GO TO 690
  1450. C
  1451. C CORRECTOR FAILURE BECAUSE IRES = -1
  1452. 675 WRITE (XERN3, '(1P,E15.6)') TN
  1453. WRITE (XERN4, '(1P,E15.6)') H
  1454. CALL XERMSG ('SLATEC', 'SDASSL',
  1455. * 'AT T = ' // XERN3 // ' AND STEPSIZE H = ' // XERN4 //
  1456. * ' THE CORRECTOR COULD NOT CONVERGE BECAUSE IRES WAS EQUAL ' //
  1457. * 'TO MINUS ONE', IDID, 1)
  1458. GO TO 690
  1459. C
  1460. C FAILURE BECAUSE IRES = -2
  1461. 680 WRITE (XERN3, '(1P,E15.6)') TN
  1462. WRITE (XERN4, '(1P,E15.6)') H
  1463. CALL XERMSG ('SLATEC', 'SDASSL',
  1464. * 'AT T = ' // XERN3 // ' AND STEPSIZE H = ' // XERN4 //
  1465. * ' IRES WAS EQUAL TO MINUS TWO', IDID, 1)
  1466. GO TO 690
  1467. C
  1468. C FAILED TO COMPUTE INITIAL YPRIME
  1469. 685 WRITE (XERN3, '(1P,E15.6)') TN
  1470. WRITE (XERN4, '(1P,E15.6)') HO
  1471. CALL XERMSG ('SLATEC', 'SDASSL',
  1472. * 'AT T = ' // XERN3 // ' AND STEPSIZE H = ' // XERN4 //
  1473. * ' THE INITIAL YPRIME COULD NOT BE COMPUTED', IDID, 1)
  1474. GO TO 690
  1475. C
  1476. 690 CONTINUE
  1477. INFO(1)=-1
  1478. T=TN
  1479. RWORK(LTN)=TN
  1480. RWORK(LH)=H
  1481. RETURN
  1482. C
  1483. C-----------------------------------------------------------------------
  1484. C THIS BLOCK HANDLES ALL ERROR RETURNS DUE
  1485. C TO ILLEGAL INPUT, AS DETECTED BEFORE CALLING
  1486. C SDASTP. FIRST THE ERROR MESSAGE ROUTINE IS
  1487. C CALLED. IF THIS HAPPENS TWICE IN
  1488. C SUCCESSION, EXECUTION IS TERMINATED
  1489. C
  1490. C-----------------------------------------------------------------------
  1491. 701 CALL XERMSG ('SLATEC', 'SDASSL',
  1492. * 'SOME ELEMENT OF INFO VECTOR IS NOT ZERO OR ONE', 1, 1)
  1493. GO TO 750
  1494. C
  1495. 702 WRITE (XERN1, '(I8)') NEQ
  1496. CALL XERMSG ('SLATEC', 'SDASSL',
  1497. * 'NEQ = ' // XERN1 // ' .LE. 0', 2, 1)
  1498. GO TO 750
  1499. C
  1500. 703 WRITE (XERN1, '(I8)') MXORD
  1501. CALL XERMSG ('SLATEC', 'SDASSL',
  1502. * 'MAXORD = ' // XERN1 // ' NOT IN RANGE', 3, 1)
  1503. GO TO 750
  1504. C
  1505. 704 WRITE (XERN1, '(I8)') LENRW
  1506. WRITE (XERN2, '(I8)') LRW
  1507. CALL XERMSG ('SLATEC', 'SDASSL',
  1508. * 'RWORK LENGTH NEEDED, LENRW = ' // XERN1 //
  1509. * ', EXCEEDS LRW = ' // XERN2, 4, 1)
  1510. GO TO 750
  1511. C
  1512. 705 WRITE (XERN1, '(I8)') LENIW
  1513. WRITE (XERN2, '(I8)') LIW
  1514. CALL XERMSG ('SLATEC', 'SDASSL',
  1515. * 'IWORK LENGTH NEEDED, LENIW = ' // XERN1 //
  1516. * ', EXCEEDS LIW = ' // XERN2, 5, 1)
  1517. GO TO 750
  1518. C
  1519. 706 CALL XERMSG ('SLATEC', 'SDASSL',
  1520. * 'SOME ELEMENT OF RTOL IS .LT. 0', 6, 1)
  1521. GO TO 750
  1522. C
  1523. 707 CALL XERMSG ('SLATEC', 'SDASSL',
  1524. * 'SOME ELEMENT OF ATOL IS .LT. 0', 7, 1)
  1525. GO TO 750
  1526. C
  1527. 708 CALL XERMSG ('SLATEC', 'SDASSL',
  1528. * 'ALL ELEMENTS OF RTOL AND ATOL ARE ZERO', 8, 1)
  1529. GO TO 750
  1530. C
  1531. 709 WRITE (XERN3, '(1P,E15.6)') TSTOP
  1532. WRITE (XERN4, '(1P,E15.6)') TOUT
  1533. CALL XERMSG ('SLATEC', 'SDASSL',
  1534. * 'INFO(4) = 1 AND TSTOP = ' // XERN3 // ' BEHIND TOUT = ' //
  1535. * XERN4, 9, 1)
  1536. GO TO 750
  1537. C
  1538. 710 WRITE (XERN3, '(1P,E15.6)') HMAX
  1539. CALL XERMSG ('SLATEC', 'SDASSL',
  1540. * 'HMAX = ' // XERN3 // ' .LT. 0.0', 10, 1)
  1541. GO TO 750
  1542. C
  1543. 711 WRITE (XERN3, '(1P,E15.6)') TOUT
  1544. WRITE (XERN4, '(1P,E15.6)') T
  1545. CALL XERMSG ('SLATEC', 'SDASSL',
  1546. * 'TOUT = ' // XERN3 // ' BEHIND T = ' // XERN4, 11, 1)
  1547. GO TO 750
  1548. C
  1549. 712 CALL XERMSG ('SLATEC', 'SDASSL',
  1550. * 'INFO(8)=1 AND H0=0.0', 12, 1)
  1551. GO TO 750
  1552. C
  1553. 713 CALL XERMSG ('SLATEC', 'SDASSL',
  1554. * 'SOME ELEMENT OF WT IS .LE. 0.0', 13, 1)
  1555. GO TO 750
  1556. C
  1557. 714 WRITE (XERN3, '(1P,E15.6)') TOUT
  1558. WRITE (XERN4, '(1P,E15.6)') T
  1559. CALL XERMSG ('SLATEC', 'SDASSL',
  1560. * 'TOUT = ' // XERN3 // ' TOO CLOSE TO T = ' // XERN4 //
  1561. * ' TO START INTEGRATION', 14, 1)
  1562. GO TO 750
  1563. C
  1564. 715 WRITE (XERN3, '(1P,E15.6)') TSTOP
  1565. WRITE (XERN4, '(1P,E15.6)') T
  1566. CALL XERMSG ('SLATEC', 'SDASSL',
  1567. * 'INFO(4)=1 AND TSTOP = ' // XERN3 // ' BEHIND T = ' // XERN4,
  1568. * 15, 1)
  1569. GO TO 750
  1570. C
  1571. 717 WRITE (XERN1, '(I8)') IWORK(LML)
  1572. CALL XERMSG ('SLATEC', 'SDASSL',
  1573. * 'ML = ' // XERN1 // ' ILLEGAL. EITHER .LT. 0 OR .GT. NEQ',
  1574. * 17, 1)
  1575. GO TO 750
  1576. C
  1577. 718 WRITE (XERN1, '(I8)') IWORK(LMU)
  1578. CALL XERMSG ('SLATEC', 'SDASSL',
  1579. * 'MU = ' // XERN1 // ' ILLEGAL. EITHER .LT. 0 OR .GT. NEQ',
  1580. * 18, 1)
  1581. GO TO 750
  1582. C
  1583. 719 WRITE (XERN3, '(1P,E15.6)') TOUT
  1584. CALL XERMSG ('SLATEC', 'SDASSL',
  1585. * 'TOUT = T = ' // XERN3, 19, 1)
  1586. GO TO 750
  1587. C
  1588. 750 IDID=-33
  1589. IF(INFO(1).EQ.-1) THEN
  1590. CALL XERMSG ('SLATEC', 'SDASSL',
  1591. * 'REPEATED OCCURRENCES OF ILLEGAL INPUT$$' //
  1592. * 'RUN TERMINATED. APPARENT INFINITE LOOP', -999, 2)
  1593. ENDIF
  1594. C
  1595. INFO(1)=-1
  1596. RETURN
  1597. C-----------END OF SUBROUTINE SDASSL------------------------------------
  1598. END