subroutine lsoibt (res, adda, jac, neq, y, ydoti, t, tout, itol,
1 rtol, atol, itask, istate, iopt, rwork, lrw, iwork, liw, mf )
external res, adda, jac
integer neq, itol, itask, istate, iopt, lrw, iwork, liw, mf
double precision y, ydoti, t, tout, rtol, atol, rwork
dimension neq(1), y(1), ydoti(1), rtol(1), atol(1), rwork(lrw),
1 iwork(liw)
c-----------------------------------------------------------------------
c this is the june 22, 1984 version of lsoibt..
c livermore solver for ordinary differential equations given in
c implicit form, with block-tridiagonal jacobian treatment.
c this version is in double precision.
c
c lsoibt solves the initial value problem for linearly implicit
c systems of first order ode-s,
c a(t,y) * dy/dt = g(t,y) , where a(t,y) is a square matrix,
c or, in component form,
c ( a * ( dy / dt )) + ... + ( a * ( dy / dt )) =
c i,1 1 i,neq neq
c
c = g ( t, y , y ,..., y ) ( i = 1,...,neq )
c i 1 2 neq
c
c if a is singular, this is a differential-algebraic system.
c
c lsoibt is a variant version of the lsodi package, for the case where
c the matrices a, dg/dy, and d(a*s)/dy are all block-tridiagonal.
c-----------------------------------------------------------------------
c reference..
c alan c. hindmarsh, odepack, a systematized collection of ode
c solvers, in scientific computing, r. s. stepleman et al. (eds.),
c north-holland, amsterdam, 1983, pp. 53-64.
c-----------------------------------------------------------------------
c authors.. charles s. kenney
c numerical mathematics and scientific computing branch
c code 3873
c naval weapons center
c china lake, ca 93555
c and
c jeffrey f. painter and
c alan c. hindmarsh
c mathematics and statistics division, l-316
c lawrence livermore national laboratory
c livermore, ca 94550.
c-----------------------------------------------------------------------
c summary of usage.
c
c communication between the user and the lsoibt package, for normal
c situations, is summarized here. this summary describes only a subset
c of the full set of options available. see the full description for
c details, including optional communication, nonstandard options,
c and instructions for special situations. see also the example
c problem (with program and output) following this summary.
c
c a. first, provide a subroutine of the form..
c subroutine res (neq, t, y, s, r, ires)
c dimension y(neq), s(neq), r(neq)
c which computes the residual function
c r = g(t,y) - a(t,y) * s ,
c as a function of t and the vectors y and s. (s is an internally
c generated approximation to dy/dt.) the arrays y and s are inputs
c to the res routine and should not be altered. the residual
c vector is to be stored in the array r. the argument ires should be
c ignored for casual use of lsoibt. (for uses of ires, see the
c paragraph on res in the full description below.)
c
c b. next, identify the block structure of the matrices a = a(t,y) and
c dr/dy. lsoibt must deal internally with a linear combination, p, of
c these two matrices. the matrix p (hence both a and dr/dy) must have
c a block-tridiagonal form with fixed structure parameters
c mb = block size, mb .ge. 1, and
c nb = number of blocks in each direction, nb .ge. 4,
c with mb*nb = neq. in each of the nb block-rows of the matrix p
c (each consisting of mb consecutive rows), the nonzero elements are
c to lie in three consecutive mb by mb blocks. in block-rows
c 2 through nb - 1, these are centered about the main diagonal.
c in block-rows 1 and nb, they are the diagonal blocks and the two
c blocks adjacent to the diagonal block. (thus block positions (1,3)
c and (nb,nb-2) can be nonzero.)
c alternatively, p (hence a and dr/dy) may be only approximately
c equal to matrices with this form, and lsoibt should still succeed.
c the block-tridiagonal matrix p is described by three arrays,
c each of size mb by mb by nb..
c pa = array of diagonal blocks,
c pb = array of superdiagonal (and one subdiagonal) blocks, and
c pc = array of subdiagonal (and one superdiagonal) blocks.
c specifically, the three mb by mb blocks in the k-th block-row of p
c are stored in (reading across)..
c pc(*,*,k) = block to the left of the diagonal block,
c pa(*,*,k) = diagonal block, and
c pb(*,*,k) = block to the right of the diagonal block,
c except for k = 1, where the three blocks (reading across) are
c pa(*,*,1) (= diagonal block), pb(*,*,1), and pc(*,*,1),
c and k = nb, where they are
c pb(*,*,nb), pc(*,*,nb), and pa(*,*,nb) (= diagonal block).
c (each asterisk * stands for an index that ranges from 1 to mb.)
c
c c. you must also provide a subroutine of the form..
c subroutine adda (neq, t, y, mb, nb, pa, pb, pc)
c dimension y(neq), pa(mb,mb,nb), pb(mb,mb,nb), pc(mb,mb,nb)
c which adds the nonzero blocks of the matrix a = a(t,y) to the
c contents of the arrays pa, pb, and pc, following the structure
c description in paragraph b above.
c t and the y array are input and should not be altered.
c thus the affect of adda should be the following..
c do 30 k = 1,nb
c do 20 j = 1,mb
c do 10 i = 1,mb
c pa(i,j,k) = pa(i,j,k) +
c ( (i,j) element of k-th diagonal block of a)
c pb(i,j,k) = pb(i,j,k) +
c ( (i,j) element of block in block position (k,k+1) of a,
c or in block position (nb,nb-2) if k = nb)
c pc(i,j,k) = pc(i,j,k) +
c ( (i,j) element of block in block position (k,k-1) of a,
c or in block position (1,3) if k = 1)
c 10 continue
c 20 continue
c 30 continue
c
c d. for the sake of efficiency, you are encouraged to supply the
c jacobian matrix dr/dy in closed form, where r = g(t,y) - a(t,y)*s
c (s = a fixed vector) as above. if dr/dy is being supplied,
c use mf = 21, and provide a subroutine of the form..
c subroutine jac (neq, t, y, s, mb, nb, pa, pb, pc)
c dimension y(neq), s(neq), pa(mb,mb,nb), pb(mb,mb,nb), pc(mb,mb,nb)
c which computes dr/dy as a function of t, y, and s. here t, y, and
c s are inputs, and the routine is to load dr/dy into pa, pb, pc,
c according to the structure description in paragraph b above.
c that is, load the diagonal blocks into pa, the superdiagonal blocks
c (and block (nb,nb-2) ) into pb, and the subdiagonal blocks (and
c block (1,3) ) into pc. the blocks in block-row k of dr/dy are to
c be loaded into pa(*,*,k), pb(*,*,k), and pc(*,*,k).
c only nonzero elements need be loaded, and the indexing
c of pa, pb, and pc is the same as in the adda routine.
c note that if a is independent of y (or this dependence
c is weak enough to be ignored) then jac is to compute dg/dy.
c if it is not feasible to provide a jac routine, use
c mf = 22, and lsoibt will compute an approximate jacobian
c internally by difference quotients.
c
c e. next decide whether or not to provide the initial value of the
c derivative vector dy/dt. if the initial value of a(t,y) is
c nonsingular (and not too ill-conditioned), you may let lsoibt compute
c this vector (istate = 0). (lsoibt will solve the system a*s = g for
c s, with initial values of a and g.) if a(t,y) is initially
c singular, then the system is a differential-algebraic system, and
c you must make use of the particular form of the system to compute the
c initial values of y and dy/dt. in that case, use istate = 1 and
c load the initial value of dy/dt into the array ydoti.
c the input array ydoti and the initial y array must be consistent with
c the equations a*dy/dt = g. this implies that the initial residual
c r = g(t,y) - a(t,y)*ydoti must be approximately zero.
c
c f. write a main program which calls subroutine lsoibt once for
c each point at which answers are desired. this should also provide
c for possible use of logical unit 6 for output of error messages
c by lsoibt. on the first call to lsoibt, supply arguments as follows..
c res = name of user subroutine for residual function r.
c adda = name of user subroutine for computing and adding a(t,y).
c jac = name of user subroutine for jacobian matrix dr/dy
c (mf = 21). if not used, pass a dummy name.
c note.. the names for the res and adda routines and (if used) the
c jac routine must be declared external in the calling program.
c neq = number of scalar equations in the system.
c y = array of initial values, of length neq.
c ydoti = array of length neq (containing initial dy/dt if istate = 1).
c t = the initial value of the independent variable.
c tout = first point where output is desired (.ne. t).
c itol = 1 or 2 according as atol (below) is a scalar or array.
c rtol = relative tolerance parameter (scalar).
c atol = absolute tolerance parameter (scalar or array).
c the estimated local error in y(i) will be controlled so as
c to be roughly less (in magnitude) than
c ewt(i) = rtol*abs(y(i)) + atol if itol = 1, or
c ewt(i) = rtol*abs(y(i)) + atol(i) if itol = 2.
c thus the local error test passes if, in each component,
c either the absolute error is less than atol (or atol(i)),
c or the relative error is less than rtol.
c use rtol = 0.0 for pure absolute error control, and
c use atol = 0.0 (or atol(i) = 0.0) for pure relative error
c control. caution.. actual (global) errors may exceed these
c local tolerances, so choose them conservatively.
c itask = 1 for normal computation of output values of y at t = tout.
c istate = integer flag (input and output). set istate = 1 if the
c initial dy/dt is supplied, and 0 otherwise.
c iopt = 0 to indicate no optional inputs used.
c rwork = real work array of length at least..
c 22 + 9*neq + 3*mb*mb*nb for mf = 21 or 22.
c lrw = declared length of rwork (in user-s dimension).
c iwork = integer work array of length at least 20 + neq.
c input in iwork(1) the block size mb and in iwork(2) the
c number nb of blocks in each direction along the matrix a.
c these must satisfy mb .ge. 1, nb .ge. 4, and mb*nb = neq.
c liw = declared length of iwork (in user-s dimension).
c mf = method flag. standard values are..
c 21 for a user-supplied jacobian.
c 22 for an internally generated jacobian.
c for other choices of mf, see the paragraph on mf in
c the full description below.
c note that the main program must declare arrays y, ydoti, rwork, iwork,
c and possibly atol.
c
c g. the output from the first call (or any call) is..
c y = array of computed values of y(t) vector.
c t = corresponding value of independent variable (normally tout).
c istate = 2 if lsoibt was successful, negative otherwise.
c -1 means excess work done on this call (check all inputs).
c -2 means excess accuracy requested (tolerances too small).
c -3 means illegal input detected (see printed message).
c -4 means repeated error test failures (check all inputs).
c -5 means repeated convergence failures (perhaps bad jacobian
c supplied or wrong choice of tolerances).
c -6 means error weight became zero during problem. (solution
c component i vanished, and atol or atol(i) = 0.)
c -7 cannot occur in casual use.
c -8 means lsoibt was unable to compute the initial dy/dt.
c in casual use, this means a(t,y) is initially singular.
c supply ydoti and use istate = 1 on the first call.
c
c if lsoibt returns istate = -1, -4, or -5, then the output of
c lsoibt also includes ydoti = array containing residual vector
c r = g - a * dy/dt evaluated at the current t, y, and dy/dt.
c
c h. to continue the integration after a successful return, simply
c reset tout and call lsoibt again. no other parameters need be reset.
c
c
c-----------------------------------------------------------------------
c example problem.
c
c the following is an example problem, with the coding needed
c for its solution by lsoibt. the problem comes from the partial
c differential equation (the burgers equation)
c du/dt = - u * du/dx + eta * d**2 u/dx**2, eta = .05,
c on -1 .le. x .le. 1. the boundary conditions are
c du/dx = 0 at x = -1 and at x = 1.
c the initial profile is a square wave,
c u = 1 in abs(x) .lt. .5, u = .5 at abs(x) = .5, u = 0 elsewhere.
c the p.d.e. is discretized in x by a simplified galerkin method,
c using piecewise linear basis functions, on a grid of 40 intervals.
c the equations at x = -1 and 1 use a 3-point difference approximation
c for the right-hand side. the result is a system a * dy/dt = g(y),
c of size neq = 41, where y(i) is the approximation to u at x = x(i),
c with x(i) = -1 + (i-1)*delx, delx = 2/(neq-1) = .05. the individual
c equations in the system are
c dy(1)/dt = ( y(3) - 2*y(2) + y(1) ) * eta / delx**2,
c dy(neq)/dt = ( y(neq-2) - 2*y(neq-1) + y(neq) ) * eta / delx**2,
c and for i = 2, 3, ..., neq-1,
c (1/6) dy(i-1)/dt + (4/6) dy(i)/dt + (1/6) dy(i+1)/dt
c = ( y(i-1)**2 - y(i+1)**2 ) / (4*delx)
c + ( y(i+1) - 2*y(i) + y(i-1) ) * eta / delx**2.
c the following coding solves the problem with mf = 21, with output
c of solution statistics at t = .1, .2, .3, and .4, and of the
c solution vector at t = .4. here the block size is just mb = 1.
c
c external resid, addabt, jacbt
c double precision atol, rtol, rwork, t, tout, y, ydoti
c dimension y(41), ydoti(41), rwork(514), iwork(61)
c neq = 41
c do 10 i = 1,neq
c 10 y(i) = 0.0d0
c y(11) = 0.5d0
c do 20 i = 12,30
c 20 y(i) = 1.0d0
c y(31) = 0.5d0
c t = 0.0d0
c tout = 0.1d0
c itol = 1
c rtol = 1.0d-4
c atol = 1.0d-5
c itask = 1
c istate = 0
c iopt = 0
c lrw = 514
c liw = 61
c iwork(1) = 1
c iwork(2) = neq
c mf = 21
c do 40 io = 1,4
c call lsoibt (resid, addabt, jacbt, neq, y, ydoti, t, tout,
c 1 itol,rtol,atol, itask, istate, iopt, rwork,lrw,iwork,liw, mf)
c write (6,30) t, iwork(11), iwork(12), iwork(13)
c 30 format(7h at t =,f5.2,14h no. steps =,i4,11h no. r-s =,i4,
c 1 11h no. j-s =,i3)
c if (istate .ne. 2) go to 90
c tout = tout + 0.1d0
c 40 continue
c write(6,50) (y(i),i=1,neq)
c 50 format(/24h final solution values../9(5e12.4/))
c stop
c 90 write(6,95) istate
c 95 format(///22h error halt.. istate =,i3)
c stop
c end
c
c subroutine resid (n, t, y, s, r, ires)
c double precision delx, eta, eodsq, r, s, t, y
c dimension y(n), s(n), r(n)
c data eta/0.05d0/, delx/0.05d0/
c eodsq = eta/delx**2
c r(1) = eodsq*(y(3) - 2.0d0*y(2) + y(1)) - s(1)
c nm1 = n - 1
c do 10 i = 2,nm1
c r(i) = (y(i-1)**2 - y(i+1)**2)/(4.0d0*delx)
c 1 + eodsq*(y(i+1) - 2.0d0*y(i) + y(i-1))
c 2 - (s(i-1) + 4.0d0*s(i) + s(i+1))/6.0d0
c 10 continue
c r(n) = eodsq*(y(n-2) - 2.0d0*y(nm1) + y(n)) - s(n)
c return
c end
c
c subroutine addabt (n, t, y, mb, nb, pa, pb, pc)
c double precision pa, pb, pc, t, y
c dimension y(n), pa(mb,mb,nb), pb(mb,mb,nb), pc(mb,mb,nb)
c pa(1,1,1) = pa(1,1,1) + 1.0d0
c nm1 = n - 1
c do 10 k = 2,nm1
c pa(1,1,k) = pa(1,1,k) + (4.0d0/6.0d0)
c pb(1,1,k) = pb(1,1,k) + (1.0d0/6.0d0)
c pc(1,1,k) = pc(1,1,k) + (1.0d0/6.0d0)
c 10 continue
c pa(1,1,n) = pa(1,1,n) + 1.0d0
c return
c end
c
c subroutine jacbt (n, t, y, s, mb, nb, pa, pb, pc)
c double precision delx, eta, eodsq, pa, pb, pc, s, t, y
c dimension y(n), s(n), pa(mb,mb,nb),pb(mb,mb,nb),pc(mb,mb,nb)
c data eta/0.05d0/, delx/0.05d0/
c eodsq = eta/delx**2
c pa(1,1,1) = eodsq
c pb(1,1,1) = -2.0d0*eodsq
c pc(1,1,1) = eodsq
c do 10 k = 2,n
c pa(1,1,k) = -2.0d0*eodsq
c pb(1,1,k) = -y(k+1)*(0.5d0/delx) + eodsq
c pc(1,1,k) = y(k-1)*(0.5d0/delx) + eodsq
c 10 continue
c pb(1,1,n) = eodsq
c pc(1,1,n) = -2.0d0*eodsq
c pa(1,1,n) = eodsq
c return
c end
c
c the output of this program (on a cdc-7600 in single precision)
c is as follows..
c
c at t = 0.10 no. steps = 35 no. r-s = 45 no. j-s = 9
c at t = 0.20 no. steps = 43 no. r-s = 54 no. j-s = 10
c at t = 0.30 no. steps = 48 no. r-s = 60 no. j-s = 11
c at t = 0.40 no. steps = 51 no. r-s = 64 no. j-s = 12
c
c final solution values..
c 1.2747e-02 1.1997e-02 1.5560e-02 2.3767e-02 3.7224e-02
c 5.6646e-02 8.2645e-02 1.1557e-01 1.5541e-01 2.0177e-01
c 2.5397e-01 3.1104e-01 3.7189e-01 4.3530e-01 5.0000e-01
c 5.6472e-01 6.2816e-01 6.8903e-01 7.4612e-01 7.9829e-01
c 8.4460e-01 8.8438e-01 9.1727e-01 9.4330e-01 9.6281e-01
c 9.7632e-01 9.8426e-01 9.8648e-01 9.8162e-01 9.6617e-01
c 9.3374e-01 8.7535e-01 7.8236e-01 6.5321e-01 5.0003e-01
c 3.4709e-01 2.1876e-01 1.2771e-01 7.3671e-02 5.0642e-02
c 5.4496e-02
c-----------------------------------------------------------------------
c full description of user interface to lsoibt.
c
c the user interface to lsoibt consists of the following parts.
c
c i. the call sequence to subroutine lsoibt, which is a driver
c routine for the solver. this includes descriptions of both
c the call sequence arguments and of user-supplied routines.
c following these descriptions is a description of
c optional inputs available through the call sequence, and then
c a description of optional outputs (in the work arrays).
c
c ii. descriptions of other routines in the lsoibt package that may be
c (optionally) called by the user. these provide the ability to
c alter error message handling, save and restore the internal
c common, and obtain specified derivatives of the solution y(t).
c
c iii. descriptions of common blocks to be declared in overlay
c or similar environments, or to be saved when doing an interrupt
c of the problem and continued solution later.
c
c iv. description of two routines in the lsoibt package, either of
c which the user may replace with his own version, if desired.
c these relate to the measurement of errors.
c
c-----------------------------------------------------------------------
c part i. call sequence.
c
c the call sequence parameters used for input only are
c res, adda, jac, neq, tout, itol, rtol, atol, itask,
c iopt, lrw, liw, mf,
c and those used for both input and output are
c y, t, istate, ydoti.
c the work arrays rwork and iwork are also used for additional and
c optional inputs and optional outputs. (the term output here refers
c to the return from subroutine lsoibt to the user-s calling program.)
c
c the legality of input parameters will be thoroughly checked on the
c initial call for the problem, but not checked thereafter unless a
c change in input parameters is flagged by istate = 3 on input.
c
c the descriptions of the call arguments are as follows.
c
c res = the name of the user-supplied subroutine which supplies
c the residual vector for the ode system, defined by
c r = g(t,y) - a(t,y) * s
c as a function of the scalar t and the vectors
c s and y ( s approximates dy/dt ). this
c subroutine is to have the form
c subroutine res ( neq, t, y, s, r, ires )
c dimension y(1), s(1), r(1)
c where neq, t, y, s, and ires are input, and r and
c ires are output. y, s, and r are arrays of length neq.
c in dimension statements such as that above, 1 is a
c dummy dimension. it can be replaced by any value.
c on input, ires indicates how lsoibt will use the
c returned array r, as follows..
c ires = 1 means that lsoibt needs the full residual,
c r = g - a*s, exactly.
c ires = -1 means that lsoibt is using r only to compute
c the jacobian dr/dy by difference quotients.
c the res routine can ignore ires, or it can omit some terms
c if ires = -1. if a does not depend on y, then res can
c just return r = g when ires = -1. if g - a*s contains other
c additive terms that are independent of y, these can also be
c dropped, if done consistently, when ires = -1.
c the subroutine should set the flag ires if it
c encounters a halt condition or illegal input.
c otherwise, it should not reset ires. on output,
c ires = 1 or -1 represents a normal return, and
c lsoibt continues integrating the ode. leave ires
c unchanged from its input value.
c ires = 2 tells lsoibt to immediately return control
c to the calling program, with istate = 3. this lets
c the calling program change parameters of the prob-
c lem if necessary.
c ires = 3 represents an error condition (for example, an
c illegal value of y). lsoibt tries to integrate the ode
c without getting ires = 3 from res. if it cannot, lsoibt
c returns with istate = -7 or -1.
c on an lsoibt return with istate = 3, -1, or -7, the values
c of t and y returned correspond to the last point reached
c successfully without getting the flag ires = 2 or 3.
c the flag values ires = 2 and 3 should not be used to
c handle switches or root-stop conditions. this is better
c done by calling lsoibt in a one-step mode and checking the
c stopping function for a sign change at each step.
c res must be declared external in the calling
c program. see note below for more about res.
c
c adda = the name of the user-supplied subroutine which adds the
c matrix a = a(t,y) to another matrix, p, stored in
c block-tridiagonal form. this routine is to have the form
c subroutine adda (neq, t, y, mb, nb, pa, pb, pc)
c dimension y(neq),
c 1 pa(mb,mb,nb), pb(mb,mb,nb), pc(mb,mb,nb)
c where neq, t, y, mb, nb, and the arrays pa, pb, and pc
c are input, and the arrays pa, pb, and pc are output.
c y is an array of length neq, and the arrays pa, pb, pc
c are all mb by mb by nb.
c here a block-tridiagonal structure is assumed for a(t,y),
c and also for the matrix p to which a is added here,
c as described in paragraph b of the summary of usage above.
c thus the affect of adda should be the following..
c do 30 k = 1,nb
c do 20 j = 1,mb
c do 10 i = 1,mb
c pa(i,j,k) = pa(i,j,k) +
c ( (i,j) element of k-th diagonal block of a)
c pb(i,j,k) = pb(i,j,k) +
c ( (i,j) element of block (k,k+1) of a,
c or block (nb,nb-2) if k = nb)
c pc(i,j,k) = pc(i,j,k) +
c ( (i,j) element of block (k,k-1) of a,
c or block (1,3) if k = 1)
c 10 continue
c 20 continue
c 30 continue
c adda must be declared external in the calling program.
c see note below for more information about adda.
c
c jac = the name of the user-supplied subroutine which supplies
c the jacobian matrix, dr/dy, where r = g-a*s. jac is
c required if miter = 1 -- otherwise a dummy name can be
c passed. this subroutine is to have the form
c subroutine jac (neq, t, y, s, mb, nb, pa, pb, pc)
c dimension y(neq), s(neq),
c 1 pa(mb,mb,nb), pb(mb,mb,nb), pc(mb,mb,nb)
c where neq, t, y, s, mb, nb, and the arrays pa, pb, and pc
c are input, and the arrays pa, pb, and pc are output.
c y and s are arrays of length neq, and the arrays pa, pb, pc
c are all mb by mb by nb.
c pa, pb, and pc are to be loaded with partial derivatives
c (elements of the jacobian matrix) on output, in terms of the
c block-tridiagonal structure assumed, as described
c in paragraph b of the summary of usage above.
c that is, load the diagonal blocks into pa, the
c superdiagonal blocks (and block (nb,nb-2) ) intp pb, and
c the subdiagonal blocks (and block (1,3) ) into pc.
c the blocks in block-row k of dr/dy are to be loaded into
c pa(*,*,k), pb(*,*,k), and pc(*,*,k).
c thus the affect of jac should be the following..
c do 30 k = 1,nb
c do 20 j = 1,mb
c do 10 i = 1,mb
c pa(i,j,k) = ( (i,j) element of
c k-th diagonal block of dr/dy)
c pb(i,j,k) = ( (i,j) element of block (k,k+1)
c of dr/dy, or block (nb,nb-2) if k = nb)
c pc(i,j,k) = ( (i,j) element of block (k,k-1)
c of dr/dy, or block (1,3) if k = 1)
c 10 continue
c 20 continue
c 30 continue
c pa, pb, and pc are preset to zero by the solver,
c so that only the nonzero elements need be loaded by jac.
c each call to jac is preceded by a call to res with the same
c arguments neq, t, y, and s. thus to gain some efficiency,
c intermediate quantities shared by both calculations may be
c saved in a user common block by res and not recomputed by jac
c if desired. also, jac may alter the y array, if desired.
c jac need not provide dr/dy exactly. a crude
c approximation will do, so that lsoibt may be used when
c a and dr/dy are not really block-tridiagonal, but are close
c to matrices that are.
c jac must be declared external in the calling program.
c see note below for more about jac.
c
c note on res, adda, and jac-- these
c subroutines may access user-defined quantities in
c neq(2),... and y(neq(1)+1),... if neq is an array
c (dimensioned in the subroutines) and y has length exceeding
c neq(1). however, these subroutines should not alter
c neq(1), y(1),...,y(neq) or any other input variables.
c see the descriptions of neq and y below.
c
c neq = the size of the system (number of first order ordinary
c differential equations or scalar algebraic equations).
c used only for input.
c neq may be decreased, but not increased, during the problem.
c if neq is decreased (with istate = 3 on input), the
c remaining components of y should be left undisturbed, if
c these are to be accessed in res, adda, or jac.
c
c normally, neq is a scalar, and it is generally referred to
c as a scalar in this user interface description. however,
c neq may be an array, with neq(1) set to the system size.
c (the lsoibt package accesses only neq(1).) in either case,
c this parameter is passed as the neq argument in all calls
c to res, adda, and jac. hence, if it is an array,
c locations neq(2),... may be used to store other integer data
c and pass it to res, adda, or jac. each such subroutine
c must include neq in a dimension statement in that case.
c
c y = a real array for the vector of dependent variables, of
c length neq or more. used for both input and output on the
c first call (istate = 0 or 1), and only for output on other
c calls. on the first call, y must contain the vector of
c initial values. on output, y contains the computed solution
c vector, evaluated at t. if desired, the y array may be used
c for other purposes between calls to the solver.
c
c this array is passed as the y argument in all calls to res,
c adda, and jac. hence its length may exceed neq,
c and locations y(neq+1),... may be used to store other real
c data and pass it to res, adda, or jac. (the lsoibt
c package accesses only y(1),...,y(neq). )
c
c ydoti = a real array for the initial value of the vector
c dy/dt and for work space, of dimension at least neq.
c
c on input...
c if istate = 0 then lsoibt will compute the initial value
c of dy/dt, if a is nonsingular. thus ydoti will
c serve only as work space and may have any value.
c if istate = 1 then ydoti must contain the initial value
c of dy/dt.
c if istate = 2 or 3 (continuation calls) then ydoti
c may have any value.
c n.b.- if the initial value of a is singular, then
c lsoibt cannot compute the initial value of dy/dt, so
c it must be provided in ydoti, with istate=1.
c
c on output, when lsoibt terminates abnormally with istate =
c -1, -4, or -5, ydoti will contain the residual
c r = g(t,y) - a(t,y)*(dy/dt). if r is large, t is near
c its initial value, and ydoti is supplied with istate=1,
c there may have been an incorrect input value of
c ydoti = dy/dt or the problem ( as given to lsoibt )
c may not have a solution.
c
c if desired, the ydoti array may be used for other
c purposes between calls to the solver.
c
c t = the independent variable. on input, t is used only on the
c first call, as the initial point of the integration.
c on output, after each call, t is the value at which a
c computed solution y is evaluated (usually the same as tout).
c on an error return, t is the farthest point reached.
c
c tout = the next value of t at which a computed solution is desired.
c used only for input.
c
c when starting the problem (istate = 0 or 1), tout may be
c equal to t for one call, then should .ne. t for the next
c call. for the initial t, an input value of tout .ne. t is
c used in order to determine the direction of the integration
c (i.e. the algebraic sign of the step sizes) and the rough
c scale of the problem. integration in either direction
c (forward or backward in t) is permitted.
c
c if itask = 2 or 5 (one-step modes), tout is ignored after
c the first call (i.e. the first call with tout .ne. t).
c otherwise, tout is required on every call.
c
c if itask = 1, 3, or 4, the values of tout need not be
c monotone, but a value of tout which backs up is limited
c to the current internal t interval, whose endpoints are
c tcur - hu and tcur (see optional outputs, below, for
c tcur and hu).
c
c itol = an indicator for the type of error control. see
c description below under atol. used only for input.
c
c rtol = a relative error tolerance parameter, either a scalar or
c an array of length neq. see description below under atol.
c input only.
c
c atol = an absolute error tolerance parameter, either a scalar or
c an array of length neq. input only.
c
c the input parameters itol, rtol, and atol determine
c the error control performed by the solver. the solver will
c control the vector e = (e(i)) of estimated local errors
c in y, according to an inequality of the form
c rms-norm of ( e(i)/ewt(i) ) .le. 1,
c where ewt(i) = rtol(i)*abs(y(i)) + atol(i),
c and the rms-norm (root-mean-square norm) here is
c rms-norm(v) = sqrt(sum v(i)**2 / neq). here ewt = (ewt(i))
c is a vector of weights which must always be positive, and
c the values of rtol and atol should all be non-negative.
c the following table gives the types (scalar/array) of
c rtol and atol, and the corresponding form of ewt(i).
c
c itol rtol atol ewt(i)
c 1 scalar scalar rtol*abs(y(i)) + atol
c 2 scalar array rtol*abs(y(i)) + atol(i)
c 3 array scalar rtol(i)*abs(y(i)) + atol
c 4 array scalar rtol(i)*abs(y(i)) + atol(i)
c
c when either of these parameters is a scalar, it need not
c be dimensioned in the user-s calling program.
c
c if none of the above choices (with itol, rtol, and atol
c fixed throughout the problem) is suitable, more general
c error controls can be obtained by substituting
c user-supplied routines for the setting of ewt and/or for
c the norm calculation. see part iv below.
c
c if global errors are to be estimated by making a repeated
c run on the same problem with smaller tolerances, then all
c components of rtol and atol (i.e. of ewt) should be scaled
c down uniformly
c
c itask = an index specifying the task to be performed.
c input only. itask has the following values and meanings.
c 1 means normal computation of output values of y(t) at
c t = tout (by overshooting and interpolating).
c 2 means take one step only and return.
c 3 means stop at the first internal mesh point at or
c beyond t = tout and return.
c 4 means normal computation of output values of y(t) at
c t = tout but without overshooting t = tcrit.
c tcrit must be input as rwork(1). tcrit may be equal to
c or beyond tout, but not behind it in the direction of
c integration. this option is useful if the problem
c has a singularity at or beyond t = tcrit.
c 5 means take one step, without passing tcrit, and return.
c tcrit must be input as rwork(1).
c
c note.. if itask = 4 or 5 and the solver reaches tcrit
c (within roundoff), it will return t = tcrit (exactly) to
c indicate this (unless itask = 4 and tout comes before tcrit,
c in which case answers at t = tout are returned first).
c
c istate = an index used for input and output to specify the
c state of the calculation.
c
c on input, the values of istate are as follows.
c 0 means this is the first call for the problem, and
c lsoibt is to compute the initial value of dy/dt
c (while doing other initializations). see note below.
c 1 means this is the first call for the problem, and
c the initial value of dy/dt has been supplied in
c ydoti (lsoibt will do other initializations). see note
c below.
c 2 means this is not the first call, and the calculation
c is to continue normally, with no change in any input
c parameters except possibly tout and itask.
c (if itol, rtol, and/or atol are changed between calls
c with istate = 2, the new values will be used but not
c tested for legality.)
c 3 means this is not the first call, and the
c calculation is to continue normally, but with
c a change in input parameters other than
c tout and itask. changes are allowed in
c neq, itol, rtol, atol, iopt, lrw, liw, mf, mb, nb,
c and any of the optional inputs except h0.
c (see iwork description for mb and nb.)
c note.. a preliminary call with tout = t is not counted
c as a first call here, as no initialization or checking of
c input is done. (such a call is sometimes useful for the
c purpose of outputting the initial conditions.)
c thus the first call for which tout .ne. t requires
c istate = 0 or 1 on input.
c
c on output, istate has the following values and meanings.
c 0 or 1 means nothing was done, as tout was equal to t with
c istate = 0 or 1 on input. (however, an internal counter
c was set to detect and prevent repeated calls of this
c type. )
c 2 means that the integration was performed successfully.
c 3 means that the user-supplied subroutine res signalled
c lsoibt to halt the integration and return (ires=2).
c integration as far as t was achieved with no occurrence
c of ires=2, but this flag was set on attempting the next
c step.
c -1 means an excessive amount of work (more than mxstep
c steps) was done on this call, before completing the
c requested task, but the integration was otherwise
c successful as far as t. (mxstep is an optional input
c and is normally 500.) to continue, the user may
c simply reset istate to a value .gt. 1 and call again
c (the excess work step counter will be reset to 0).
c in addition, the user may increase mxstep to avoid
c this error return (see below on optional inputs).
c -2 means too much accuracy was requested for the precision
c of the machine being used. this was detected before
c completing the requested task, but the integration
c was successful as far as t. to continue, the tolerance
c parameters must be reset, and istate must be set
c to 3. the optional output tolsf may be used for this
c purpose. (note.. if this condition is detected before
c taking any steps, then an illegal input return
c (istate = -3) occurs instead.)
c -3 means illegal input was detected, before taking any
c integration steps. see written message for details.
c note.. if the solver detects an infinite loop of calls
c to the solver with illegal input, it will cause
c the run to stop.
c -4 means there were repeated error test failures on
c one attempted step, before completing the requested
c task, but the integration was successful as far as t.
c the problem may have a singularity, or the input
c may be inappropriate.
c -5 means there were repeated convergence test failures on
c one attempted step, before completing the requested
c task, but the integration was successful as far as t.
c this may be caused by an inaccurate jacobian matrix.
c -6 means ewt(i) became zero for some i during the
c integration. pure relative error control (atol(i)=0.0)
c was requested on a variable which has now vanished.
c the integration was successful as far as t.
c -7 means that the user-supplied subroutine res set
c its error flag (ires=3) despite repeated tries by lsoibt
c to avoid that condition.
c -8 means that istate was 0 on input but lsoibt was unable
c to compute the initial value of dy/dt. see the
c printed message for details.
c
c note.. since the normal output value of istate is 2,
c it does not need to be reset for normal continuation.
c similarly, istate need not be reset if res told lsoibt
c to return because the calling program must change
c the parameters of the problem.
c also, since a negative input value of istate will be
c regarded as illegal, a negative output value requires the
c user to change it, and possibly other inputs, before
c calling the solver again.
c
c iopt = an integer flag to specify whether or not any optional
c inputs are being used on this call. input only.
c the optional inputs are listed separately below.
c iopt = 0 means no optional inputs are being used.
c default values will be used in all cases.
c iopt = 1 means one or more optional inputs are being used.
c
c rwork = a real working array (double precision).
c the length of rwork must be at least
c 20 + nyh*(maxord + 1) + 3*neq + lenwm where
c nyh = the initial value of neq,
c maxord = 12 (if meth = 1) or 5 (if meth = 2) (unless a
c smaller value is given as an optional input),
c lenwm = 3*mb*mb*nb + 2.
c (see mf description for the definition of meth.)
c thus if maxord has its default value and neq is constant,
c this length is
c 22 + 16*neq + 3*mb*mb*nb for mf = 11 or 12,
c 22 + 9*neq + 3*mb*mb*nb for mf = 21 or 22.
c the first 20 words of rwork are reserved for conditional
c and optional inputs and optional outputs.
c
c the following word in rwork is a conditional input..
c rwork(1) = tcrit = critical value of t which the solver
c is not to overshoot. required if itask is
c 4 or 5, and ignored otherwise. (see itask.)
c
c lrw = the length of the array rwork, as declared by the user.
c (this will be checked by the solver.)
c
c iwork = an integer work array. the length of iwork must be at least
c 20 + neq . the first few words of iwork are used for
c additional and optional inputs and optional outputs.
c
c the following 2 words in iwork are additional required
c inputs to lsoibt..
c iwork(1) = mb = block size
c iwork(2) = nb = number of blocks in the main diagonal
c these must satisfy mb .ge. 1, nb .ge. 4, and mb*nb = neq.
c
c liw = the length of the array iwork, as declared by the user.
c (this will be checked by the solver.)
c
c note.. the work arrays must not be altered between calls to lsoibt
c for the same problem, except possibly for the additional and
c optional inputs, and except for the last 3*neq words of rwork.
c the latter space is used for internal scratch space, and so is
c available for use by the user outside lsoibt between calls, if
c desired (but not for use by res, adda, or jac).
c
c mf = the method flag. used only for input. the legal values of
c mf are 11, 12, 21, and 22.
c mf has decimal digits meth and miter.. mf = 10*meth + miter.
c meth indicates the basic linear multistep method..
c meth = 1 means the implicit adams method.
c meth = 2 means the method based on backward
c differentiation formulas (bdf-s).
c the bdf method is strongly preferred for stiff prob-
c lems, while the adams method is preferred when the prob-
c lem is not stiff. if the matrix a(t,y) is nonsingular,
c stiffness here can be taken to mean that of the explicit
c ode system dy/dt = a**(-1) * g. if a is singular, the
c concept of stiffness is not well defined.
c if you do not know whether the problem is stiff, we
c recommend using meth = 2. if it is stiff, the advan-
c tage of meth = 2 over 1 will be great, while if it is
c not stiff, the advantage of meth = 1 will be slight.
c if maximum efficiency is important, some experimentation
c with meth may be necessary.
c miter indicates the corrector iteration method..
c miter = 1 means chord iteration with a user-supplied
c block-tridiagonal jacobian.
c miter = 2 means chord iteration with an internally
c generated (difference quotient) block-
c tridiagonal jacobian approximation, using
c 3*mb+1 extra calls to res per dr/dy evaluation.
c if miter = 1, the user must supply a subroutine
c jac (the name is arbitrary) as described above under jac.
c for miter = 2, a dummy argument can be used.
c-----------------------------------------------------------------------
c optional inputs.
c
c the following is a list of the optional inputs provided for in the
c call sequence. (see also part ii.) for each such input variable,
c this table lists its name as used in this documentation, its
c location in the call sequence, its meaning, and the default value.
c the use of any of these inputs requires iopt = 1, and in that
c case all of these inputs are examined. a value of zero for any
c of these optional inputs will cause the default value to be used.
c thus to use a subset of the optional inputs, simply preload
c locations 5 to 10 in rwork and iwork to 0.0 and 0 respectively, and
c then set those of interest to nonzero values.
c
c name location meaning and default value
c
c h0 rwork(5) the step size to be attempted on the first step.
c the default value is determined by the solver.
c
c hmax rwork(6) the maximum absolute step size allowed.
c the default value is infinite.
c
c hmin rwork(7) the minimum absolute step size allowed.
c the default value is 0. (this lower bound is not
c enforced on the final step before reaching tcrit
c when itask = 4 or 5.)
c
c maxord iwork(5) the maximum order to be allowed. the default
c value is 12 if meth = 1, and 5 if meth = 2.
c if maxord exceeds the default value, it will
c be reduced to the default value.
c if maxord is changed during the problem, it may
c cause the current order to be reduced.
c
c mxstep iwork(6) maximum number of (internally defined) steps
c allowed during one call to the solver.
c the default value is 500.
c
c mxhnil iwork(7) maximum number of messages printed (per problem)
c warning that t + h = t on a step (h = step size).
c this must be positive to result in a non-default
c value. the default value is 10.
c-----------------------------------------------------------------------
c optional outputs.
c
c as optional additional output from lsoibt, the variables listed
c below are quantities related to the performance of lsoibt
c which are available to the user. these are communicated by way of
c the work arrays, but also have internal mnemonic names as shown.
c except where stated otherwise, all of these outputs are defined
c on any successful return from lsoibt, and on any return with
c istate = -1, -2, -4, -5, -6, or -7. on a return with -3 (illegal
c input) or -8, they will be unchanged from their existing values
c (if any), except possibly for tolsf, lenrw, and leniw.
c on any error return, outputs relevant to the error will be defined,
c as noted below.
c
c name location meaning
c
c hu rwork(11) the step size in t last used (successfully).
c
c hcur rwork(12) the step size to be attempted on the next step.
c
c tcur rwork(13) the current value of the independent variable
c which the solver has actually reached, i.e. the
c current internal mesh point in t. on output, tcur
c will always be at least as far as the argument
c t, but may be farther (if interpolation was done).
c
c tolsf rwork(14) a tolerance scale factor, greater than 1.0,
c computed when a request for too much accuracy was
c detected (istate = -3 if detected at the start of
c the problem, istate = -2 otherwise). if itol is
c left unaltered but rtol and atol are uniformly
c scaled up by a factor of tolsf for the next call,
c then the solver is deemed likely to succeed.
c (the user may also ignore tolsf and alter the
c tolerance parameters in any other way appropriate.)
c
c nst iwork(11) the number of steps taken for the problem so far.
c
c nre iwork(12) the number of residual evaluations (res calls)
c for the problem so far.
c
c nje iwork(13) the number of jacobian evaluations (each involving
c an evaluation of a and dr/dy) for the problem so
c far. this equals the number of calls to adda and
c (if miter = 1) to jac, and the number of matrix
c l-u decompositions.
c
c nqu iwork(14) the method order last used (successfully).
c
c nqcur iwork(15) the order to be attempted on the next step.
c
c imxer iwork(16) the index of the component of largest magnitude in
c the weighted local error vector ( e(i)/ewt(i) ),
c on an error return with istate = -4 or -5.
c
c lenrw iwork(17) the length of rwork actually required.
c this is defined on normal returns and on an illegal
c input return for insufficient storage.
c
c leniw iwork(18) the length of iwork actually required.
c this is defined on normal returns and on an illegal
c input return for insufficient storage.
c
c
c the following two arrays are segments of the rwork array which
c may also be of interest to the user as optional outputs.
c for each array, the table below gives its internal name,
c its base address in rwork, and its description.
c
c name base address description
c
c yh 21 the nordsieck history array, of size nyh by
c (nqcur + 1), where nyh is the initial value
c of neq. for j = 0,1,...,nqcur, column j+1
c of yh contains hcur**j/factorial(j) times
c the j-th derivative of the interpolating
c polynomial currently representing the solution,
c evaluated at t = tcur.
c
c acor lenrw-neq+1 array of size neq used for the accumulated
c corrections on each step, scaled on output to
c represent the estimated local error in y on the
c last step. this is the vector e in the descrip-
c tion of the error control. it is defined only
c on a return from lsoibt with istate = 2.
c
c-----------------------------------------------------------------------
c part ii. other routines callable.
c
c the following are optional calls which the user may make to
c gain additional capabilities in conjunction with lsoibt.
c (the routines xsetun and xsetf are designed to conform to the
c slatec error handling package.)
c
c form of call function
c call xsetun(lun) set the logical unit number, lun, for
c output of messages from lsoibt, if
c the default is not desired.
c the default value of lun is 6.
c
c call xsetf(mflag) set a flag to control the printing of
c messages by lsoibt.
c mflag = 0 means do not print. (danger..
c this risks losing valuable information.)
c mflag = 1 means print (the default).
c
c either of the above calls may be made at
c any time and will take effect immediately.
c
c call svcom (rsav, isav) store in rsav and isav the contents
c of the internal common blocks used by
c lsoibt (see part iii below).
c rsav must be a real array of length 219
c or more, and isav must be an integer
c array of length 41 or more.
c
c call rscom (rsav, isav) restore, from rsav and isav, the contents
c of the internal common blocks used by
c lsoibt. presumes a prior call to svcom
c with the same arguments.
c
c svcom and rscom are useful if
c interrupting a run and restarting
c later, or alternating between two or
c more problems solved with lsoibt.
c
c call intdy(,,,,,) provide derivatives of y, of various
c (see below) orders, at a specified point t, if
c desired. it may be called only after
c a successful return from lsoibt.
c
c the detailed instructions for using intdy are as follows.
c the form of the call is..
c
c call intdy (t, k, rwork(21), nyh, dky, iflag)
c
c the input parameters are..
c
c t = value of independent variable where answers are desired
c (normally the same as the t last returned by lsoibt).
c for valid results, t must lie between tcur - hu and tcur.
c (see optional outputs for tcur and hu.)
c k = integer order of the derivative desired. k must satisfy
c 0 .le. k .le. nqcur, where nqcur is the current order
c (see optional outputs). the capability corresponding
c to k = 0, i.e. computing y(t), is already provided
c by lsoibt directly. since nqcur .ge. 1, the first
c derivative dy/dt is always available with intdy.
c rwork(21) = the base address of the history array yh.
c nyh = column length of yh, equal to the initial value of neq.
c
c the output parameters are..
c
c dky = a real array of length neq containing the computed value
c of the k-th derivative of y(t).
c iflag = integer flag, returned as 0 if k and t were legal,
c -1 if k was illegal, and -2 if t was illegal.
c on an error return, a message is also written.
c-----------------------------------------------------------------------
c part iii. common blocks.
c
c if lsoibt is to be used in an overlay situation, the user
c must declare, in the primary overlay, the variables in..
c (1) the call sequence to lsoibt,
c (2) the two internal common blocks
c /ls0001/ of length 258 (219 double precision words
c followed by 39 integer words),
c /eh0001/ of length 2 (integer words).
c
c if lsoibt is used on a system in which the contents of internal
c common blocks are not preserved between calls, the user should
c declare the above two common blocks in his main program to insure
c that their contents are preserved.
c
c if the solution of a given problem by lsoibt is to be interrupted
c and then later continued, such as when restarting an interrupted run
c or alternating between two or more problems, the user should save,
c following the return from the last lsoibt call prior to the
c interruption, the contents of the call sequence variables and the
c internal common blocks, and later restore these values before the
c next lsoibt call for that problem. to save and restore the common
c blocks, use subroutines svcom and rscom (see part ii above).
c
c-----------------------------------------------------------------------
c part iv. optionally replaceable solver routines.
c
c below are descriptions of two routines in the lsoibt package which
c relate to the measurement of errors. either routine can be
c replaced by a user-supplied version, if desired. however, since such
c a replacement may have a major impact on performance, it should be
c done only when absolutely necessary, and only with great caution.
c (note.. the means by which the package version of a routine is
c superseded by the user-s version may be system-dependent.)
c
c (a) ewset.
c the following subroutine is called just before each internal
c integration step, and sets the array of error weights, ewt, as
c described under itol/rtol/atol above..
c subroutine ewset (neq, itol, rtol, atol, ycur, ewt)
c where neq, itol, rtol, and atol are as in the lsoibt call sequence,
c ycur contains the current dependent variable vector, and
c ewt is the array of weights set by ewset.
c
c if the user supplies this subroutine, it must return in ewt(i)
c (i = 1,...,neq) a positive quantity suitable for comparing errors
c in y(i) to. the ewt array returned by ewset is passed to the
c vnorx routine (see below), and also used by lsoibt in the computation
c of the optional output imxer, the diagonal jacobian approximation,
c and the increments for difference quotient jacobians.
c
c in the user-supplied version of ewset, it may be desirable to use
c the current values of derivatives of y. derivatives up to order nq
c are available from the history array yh, described above under
c optional outputs. in ewset, yh is identical to the ycur array,
c extended to nq + 1 columns with a column length of nyh and scale
c factors of h**j/factorial(j). on the first call for the problem,
c given by nst = 0, nq is 1 and h is temporarily set to 1.0.
c the quantities nq, nyh, h, and nst can be obtained by including
c in ewset the statements..
c double precision h, rls
c common /ls0001/ rls(219),ils(39)
c nq = ils(35)
c nyh = ils(14)
c nst = ils(36)
c h = rls(213)
c thus, for example, the current value of dy/dt can be obtained as
c ycur(nyh+i)/h (i=1,...,neq) (and the division by h is
c unnecessary when nst = 0).
c
c (b) vnorx.
c the following is a real function routine which computes the weighted
c root-mean-square norm of a vector v..
c d = vnorx (n, v, w)
c where..
c n = the length of the vector,
c v = real array of length n containing the vector,
c w = real array of length n containing weights,
c d = sqrt( (1/n) * sum(v(i)*w(i))**2 ).
c vnorx is called with n = neq and with w(i) = 1.0/ewt(i), where
c ewt is as set by subroutine ewset.
c
c if the user supplies this function, it should return a non-negative
c value of vnorx suitable for use in the error control in lsoibt.
c none of the arguments should be altered by vnorx.
c for example, a user-supplied vnorx routine might..
c -substitute a max-norm of (v(i)*w(i)) for the rms-norm, or
c -ignore some components of v in the norm, with the effect of
c suppressing the error control on those components of y.
c-----------------------------------------------------------------------
c-----------------------------------------------------------------------
c other routines in the lsoibt package.
c
c in addition to subroutine lsoibt, the lsoibt package includes the
c following subroutines and function routines..
c aigbt computes the initial value of the vector
c dy/dt = inverse(a) * g
c intdy computes an interpolated value of the y vector at t = tout.
c stodi is the core integrator, which does one step of the
c integration and the associated error control.
c cfode sets all method coefficients and test constants.
c ewset sets the error weight vector ewt before each step.
c vnorx computes the weighted r.m.s. norm of a vector.
c svcom and rscom are user-callable routines to save and restore,
c respectively, the contents of the internal common blocks.
c pjibt computes and preprocesses the jacobian matrix
c and the newton iteration matrix p.
c slsbt manages solution of linear system in chord iteration.
c decbt and solbt are routines for solving block-tridiagonal
c systems of linear algebraic equations.
c dgefa and dgesl are routines from linpack for solving full
c systems of linear algebraic equations.
c daxpy, dscal, idamax, and ddot are basic linear algebra modules
c (blas) used by the above linpack routines.
c d1mach computes the unit roundoff in a machine-independent manner.
c xerrwx, xsetun, and xsetf handle the printing of all error
c messages and warnings. xerrwx is machine-dependent.
c note.. vnorx, idamax, ddot, and d1mach are function routines.
c all the others are subroutines.
c
c the intrinsic and external routines used by lsoibt are.. dabs,
c dmax1, dmin1, dfloat, iabs, max0, min0, mod, dsign, dsqrt, and write.
c
c a block data subprogram is also included with the package,
c for loading some of the variables in internal common.
c
c-----------------------------------------------------------------------
c the following card is for optimized compilation on llnl compilers.
clll. optimize
c-----------------------------------------------------------------------
external pjibt, slsbt
integer illin, init, lyh, lewt, lacor, lsavr, lwm, liwm,
1 mxstep, mxhnil, nhnil, ntrep, nslast, nyh, iowns
integer icf, ierpj, iersl, jcur, jstart, kflag, l, meth, miter,
1 maxord, maxcor, msbp, mxncf, n, nq, nst, nre, nje, nqu
integer i, i1, i2, ier, iflag, imxer, ires, kgo,
1 leniw, lenrw, lenwm, lp, lyd0, mb, mord, mxhnl0, mxstp0, nb
double precision tret, rowns,
1 ccmax, el0, h, hmin, hmxi, hu, rc, tn, uround
double precision atoli, ayi, big, ewti, h0, hmax, hmx, rh, rtoli,
1 tcrit, tdist, tnext, tol, tolsf, tp, size, sum, w0,
2 d1mach, vnorx
dimension mord(2)
logical ihit
c-----------------------------------------------------------------------
c the following internal common block contains
c (a) variables which are local to any subroutine but whose values must
c be preserved between calls to the routine (own variables), and
c (b) variables which are communicated between subroutines.
c block ls0001 is shared by the lsoibt, lsodi, and lsode packages.
c the structure of ls0001 is as follows.. all real variables are
c listed first, followed by all integers. within each type, the
c variables are grouped with those local to subroutine lsoibt first,
c then those local to subroutine stodi, and finally those used
c for communication. the block is declared in subroutines
c lsoibt, intdy, stodi, pjibt, and slsbt. groups of variables are
c replaced by dummy arrays in the common declarations in routines
c where those variables are not used.
c-----------------------------------------------------------------------
common /ls0001/ tret, rowns(209),
1 ccmax, el0, h, hmin, hmxi, hu, rc, tn, uround,
2 illin, init, lyh, lewt, lacor, lsavr, lwm, liwm,
3 mxstep, mxhnil, nhnil, ntrep, nslast, nyh, iowns(6),
4 icf, ierpj, iersl, jcur, jstart, kflag, l, meth, miter,
5 maxord, maxcor, msbp, mxncf, n, nq, nst, nre, nje, nqu
c
data mord(1),mord(2)/12,5/, mxstp0/500/, mxhnl0/10/
c-----------------------------------------------------------------------
c block a.
c this code block is executed on every call.
c it tests istate and itask for legality and branches appropriately.
c if istate .gt. 1 but the flag init shows that initialization has
c not yet been done, an error return occurs.
c if istate = 0 or 1 and tout = t, jump to block g and return
c immediately.
c-----------------------------------------------------------------------
if (istate .lt. 0 .or. istate .gt. 3) go to 601
if (itask .lt. 1 .or. itask .gt. 5) go to 602
if (istate .le. 1) go to 10
if (init .eq. 0) go to 603
if (istate .eq. 2) go to 200
go to 20
10 init = 0
if (tout .eq. t) go to 430
20 ntrep = 0
c-----------------------------------------------------------------------
c block b.
c the next code block is executed for the initial call (istate = 0 or 1)
c or for a continuation call with parameter changes (istate = 3).
c it contains checking of all inputs and various initializations.
c
c first check legality of the non-optional inputs neq, itol, iopt,
c mf, mb, and nb.
c-----------------------------------------------------------------------
if (neq(1) .le. 0) go to 604
if (istate .le. 1) go to 25
if (neq(1) .gt. n) go to 605
25 n = neq(1)
if (itol .lt. 1 .or. itol .gt. 4) go to 606
if (iopt .lt. 0 .or. iopt .gt. 1) go to 607
meth = mf/10
miter = mf - 10*meth
if (meth .lt. 1 .or. meth .gt. 2) go to 608
if (miter .lt. 1 .or. miter .gt. 2) go to 608
mb = iwork(1)
nb = iwork(2)
if (mb .lt. 1 .or. mb .gt. n) go to 609
if (nb .lt. 4) go to 610
if (mb*nb .ne. n) go to 609
c next process and check the optional inputs. --------------------------
if (iopt .eq. 1) go to 40
maxord = mord(meth)
mxstep = mxstp0
mxhnil = mxhnl0
if (istate .le. 1) h0 = 0.0d0
hmxi = 0.0d0
hmin = 0.0d0
go to 60
40 maxord = iwork(5)
if (maxord .lt. 0) go to 611
if (maxord .eq. 0) maxord = 100
maxord = min0(maxord,mord(meth))
mxstep = iwork(6)
if (mxstep .lt. 0) go to 612
if (mxstep .eq. 0) mxstep = mxstp0
mxhnil = iwork(7)
if (mxhnil .lt. 0) go to 613
if (mxhnil .eq. 0) mxhnil = mxhnl0
if (istate .gt. 1) go to 50
h0 = rwork(5)
if ((tout - t)*h0 .lt. 0.0d0) go to 614
50 hmax = rwork(6)
if (hmax .lt. 0.0d0) go to 615
hmxi = 0.0d0
if (hmax .gt. 0.0d0) hmxi = 1.0d0/hmax
hmin = rwork(7)
if (hmin .lt. 0.0d0) go to 616
c-----------------------------------------------------------------------
c set work array pointers and check lengths lrw and liw.
c pointers to segments of rwork and iwork are named by prefixing l to
c the name of the segment. e.g., the segment yh starts at rwork(lyh).
c segments of rwork (in order) are denoted yh, wm, ewt, savr, acor.
c-----------------------------------------------------------------------
60 lyh = 21
if (istate .le. 1) nyh = n
lwm = lyh + (maxord + 1)*nyh
lenwm = 3*mb*mb*nb + 2
lewt = lwm + lenwm
lsavr = lewt + n
lacor = lsavr + n
lenrw = lacor + n - 1
iwork(17) = lenrw
liwm = 1
leniw = 20 + n
iwork(18) = leniw
if (lenrw .gt. lrw) go to 617
if (leniw .gt. liw) go to 618
c check rtol and atol for legality. ------------------------------------
rtoli = rtol(1)
atoli = atol(1)
do 70 i = 1,n
if (itol .ge. 3) rtoli = rtol(i)
if (itol .eq. 2 .or. itol .eq. 4) atoli = atol(i)
if (rtoli .lt. 0.0d0) go to 619
if (atoli .lt. 0.0d0) go to 620
70 continue
if (istate .le. 1) go to 100
c if istate = 3, set flag to signal parameter changes to stodi. --------
jstart = -1
if (nq .le. maxord) go to 90
c maxord was reduced below nq. copy yh(*,maxord+2) into ydoti.---------
do 80 i = 1,n
80 ydoti(i) = rwork(i+lwm-1)
c reload wm(1) = rwork(lwm), since lwm may have changed. ---------------
90 rwork(lwm) = dsqrt(uround)
if (n .eq. nyh) go to 200
c neq was reduced. zero part of yh to avoid undefined references. -----
i1 = lyh + l*nyh
i2 = lyh + (maxord + 1)*nyh - 1
if (i1 .gt. i2) go to 200
do 95 i = i1,i2
95 rwork(i) = 0.0d0
go to 200
c-----------------------------------------------------------------------
c block c.
c the next block is for the initial call only (istate = 0 or 1).
c it contains all remaining initializations, the call to aigbt
c (if istate = 1), and the calculation of the initial step size.
c the error weights in ewt are inverted after being loaded.
c-----------------------------------------------------------------------
100 uround = d1mach(4)
tn = t
if (itask .ne. 4 .and. itask .ne. 5) go to 105
tcrit = rwork(1)
if ((tcrit - tout)*(tout - t) .lt. 0.0d0) go to 625
if (h0 .ne. 0.0d0 .and. (t + h0 - tcrit)*h0 .gt. 0.0d0)
1 h0 = tcrit - t
105 jstart = 0
rwork(lwm) = dsqrt(uround)
nhnil = 0
nst = 0
nre = 0
nje = 0
nslast = 0
hu = 0.0d0
nqu = 0
ccmax = 0.3d0
maxcor = 3
msbp = 20
mxncf = 10
c compute initial dy/dt, if necessary, and load it and initial y into yh
lyd0 = lyh + nyh
lp = lwm + 1
if ( istate .eq. 1 ) go to 120
c lsoibt must compute initial dy/dt (lyd0 points to yh(*,2)). ----------
call aigbt( res, adda, neq, t, y, rwork(lyd0),
1 mb, nb, rwork(lp), iwork(21), ier )
nre = nre + 1
if (ier) 560,110,565
110 continue
do 115 i = 1, n
115 rwork(i+lyh-1) = y(i)
go to 130
c initial dy/dt has been supplied. -------------------------------------
120 do 125 i = 1, n
rwork(i+lyh-1) = y(i)
125 rwork(i+lyd0-1) = ydoti(i)
c load and invert the ewt array. (h is temporarily set to 1.0.) -------
130 continue
nq = 1
h = 1.0d0
call ewset (n, itol, rtol, atol, rwork(lyh), rwork(lewt))
do 135 i = 1,n
if (rwork(i+lewt-1) .le. 0.0d0) go to 621
135 rwork(i+lewt-1) = 1.0d0/rwork(i+lewt-1)
c-----------------------------------------------------------------------
c the coding below computes the step size, h0, to be attempted on the
c first step, unless the user has supplied a value for this.
c first check that tout - t differs significantly from zero.
c a scalar tolerance quantity tol is computed, as max(rtol(i))
c if this is positive, or max(atol(i)/abs(y(i))) otherwise, adjusted
c so as to be between 100*uround and 1.0e-3.
c then the computed value h0 is given by..
c neq
c h0**2 = tol / ( w0**-2 + (1/neq) * sum ( ydot(i)/ywt(i) )**2 )
c 1
c where w0 = max ( abs(t), abs(tout) ),
c ydot(i) = i-th component of initial value of dy/dt,
c ywt(i) = ewt(i)/tol (a weight for y(i)).
c the sign of h0 is inferred from the initial values of tout and t.
c-----------------------------------------------------------------------
if (h0 .ne. 0.0d0) go to 180
tdist = dabs(tout - t)
w0 = dmax1(dabs(t),dabs(tout))
if (tdist .lt. 2.0d0*uround*w0) go to 622
tol = rtol(1)
if (itol .le. 2) go to 145
do 140 i = 1,n
140 tol = dmax1(tol,rtol(i))
145 if (tol .gt. 0.0d0) go to 160
atoli = atol(1)
do 150 i = 1,n
if (itol .eq. 2 .or. itol .eq. 4) atoli = atol(i)
ayi = dabs(y(i))
if (ayi .ne. 0.0d0) tol = dmax1(tol,atoli/ayi)
150 continue
160 tol = dmax1(tol,100.0d0*uround)
tol = dmin1(tol,0.001d0)
sum = vnorx (n, rwork(lyd0), rwork(lewt))
sum = 1.0d0/(tol*w0*w0) + tol*sum**2
h0 = 1.0d0/dsqrt(sum)
h0 = dmin1(h0,tdist)
h0 = dsign(h0,tout-t)
c adjust h0 if necessary to meet hmax bound. ---------------------------
180 rh = dabs(h0)*hmxi
if (rh .gt. 1.0d0) h0 = h0/rh
c load h with h0 and scale yh(*,2) by h0. ------------------------------
h = h0
do 190 i = 1,n
190 rwork(i+lyd0-1) = h0*rwork(i+lyd0-1)
go to 270
c-----------------------------------------------------------------------
c block d.
c the next code block is for continuation calls only (istate = 2 or 3)
c and is to check stop conditions before taking a step.
c-----------------------------------------------------------------------
200 nslast = nst
go to (210, 250, 220, 230, 240), itask
210 if ((tn - tout)*h .lt. 0.0d0) go to 250
call intdy (tout, 0, rwork(lyh), nyh, y, iflag)
if (iflag .ne. 0) go to 627
t = tout
go to 420
220 tp = tn - hu*(1.0d0 + 100.0d0*uround)
if ((tp - tout)*h .gt. 0.0d0) go to 623
if ((tn - tout)*h .lt. 0.0d0) go to 250
go to 400
230 tcrit = rwork(1)
if ((tn - tcrit)*h .gt. 0.0d0) go to 624
if ((tcrit - tout)*h .lt. 0.0d0) go to 625
if ((tn - tout)*h .lt. 0.0d0) go to 245
call intdy (tout, 0, rwork(lyh), nyh, y, iflag)
if (iflag .ne. 0) go to 627
t = tout
go to 420
240 tcrit = rwork(1)
if ((tn - tcrit)*h .gt. 0.0d0) go to 624
245 hmx = dabs(tn) + dabs(h)
ihit = dabs(tn - tcrit) .le. 100.0d0*uround*hmx
if (ihit) go to 400
tnext = tn + h*(1.0d0 + 4.0d0*uround)
if ((tnext - tcrit)*h .le. 0.0d0) go to 250
h = (tcrit - tn)*(1.0d0 - 4.0d0*uround)
if (istate .eq. 2) jstart = -2
c-----------------------------------------------------------------------
c block e.
c the next block is normally executed for all calls and contains
c the call to the one-step core integrator stodi.
c
c this is a looping point for the integration steps.
c
c first check for too many steps being taken, update ewt (if not at
c start of problem), check for too much accuracy being requested, and
c check for h below the roundoff level in t.
c-----------------------------------------------------------------------
250 continue
if ((nst-nslast) .ge. mxstep) go to 500
call ewset (n, itol, rtol, atol, rwork(lyh), rwork(lewt))
do 260 i = 1,n
if (rwork(i+lewt-1) .le. 0.0d0) go to 510
260 rwork(i+lewt-1) = 1.0d0/rwork(i+lewt-1)
270 tolsf = uround*vnorx (n, rwork(lyh), rwork(lewt))
if (tolsf .le. 1.0d0) go to 280
tolsf = tolsf*2.0d0
if (nst .eq. 0) go to 626
go to 520
280 if ((tn + h) .ne. tn) go to 290
nhnil = nhnil + 1
if (nhnil .gt. mxhnil) go to 290
call xerrwx(50hlsoibt-- warning..internal t (=r1) and h (=r2) are,
1 50, 101, 1, 0, 0, 0, 0, 0.0d0, 0.0d0)
call xerrwx(
1 60h such that in the machine, t + h = t on the next step ,
1 60, 101, 1, 0, 0, 0, 0, 0.0d0, 0.0d0)
call xerrwx(50h (h = step size). solver will continue anyway,
1 50, 101, 1, 0, 0, 0, 2, tn, h)
if (nhnil .lt. mxhnil) go to 290
call xerrwx(50hlsoibt-- above warning has been issued i1 times. ,
1 50, 102, 1, 0, 0, 0, 0, 0.0d0, 0.0d0)
call xerrwx(50h it will not be issued again for this problem,
1 50, 102, 1, 1, mxhnil, 0, 0, 0.0d0, 0.0d0)
290 continue
c-----------------------------------------------------------------------
c call stodi(neq,y,yh,nyh,yh1,ewt,savf,savr,acor,wm,iwm,res,
c adda,jac,pjibt,slsbt)
c note... savf in stodi occupies the same space as ydoti in lsoibt.
c-----------------------------------------------------------------------
call stodi (neq, y, rwork(lyh), nyh, rwork(lyh), rwork(lewt),
1 ydoti, rwork(lsavr), rwork(lacor), rwork(lwm),
2 iwork(liwm), res, adda, jac, pjibt, slsbt )
kgo = 1 - kflag
go to (300, 530, 540, 400, 550), kgo
c
c kgo = 1,success. 2,error test failure. 3,convergence failure.
c 4,res ordered return. 5,res returned error.
c-----------------------------------------------------------------------
c block f.
c the following block handles the case of a successful return from the
c core integrator (kflag = 0). test for stop conditions.
c-----------------------------------------------------------------------
300 init = 1
go to (310, 400, 330, 340, 350), itask
c itask = 1. if tout has been reached, interpolate. -------------------
310 if ((tn - tout)*h .lt. 0.0d0) go to 250
call intdy (tout, 0, rwork(lyh), nyh, y, iflag)
t = tout
go to 420
c itask = 3. jump to exit if tout was reached. ------------------------
330 if ((tn - tout)*h .ge. 0.0d0) go to 400
go to 250
c itask = 4. see if tout or tcrit was reached. adjust h if necessary.
340 if ((tn - tout)*h .lt. 0.0d0) go to 345
call intdy (tout, 0, rwork(lyh), nyh, y, iflag)
t = tout
go to 420
345 hmx = dabs(tn) + dabs(h)
ihit = dabs(tn - tcrit) .le. 100.0d0*uround*hmx
if (ihit) go to 400
tnext = tn + h*(1.0d0 + 4.0d0*uround)
if ((tnext - tcrit)*h .le. 0.0d0) go to 250
h = (tcrit - tn)*(1.0d0 - 4.0d0*uround)
jstart = -2
go to 250
c itask = 5. see if tcrit was reached and jump to exit. ---------------
350 hmx = dabs(tn) + dabs(h)
ihit = dabs(tn - tcrit) .le. 100.0d0*uround*hmx
c-----------------------------------------------------------------------
c block g.
c the following block handles all successful returns from lsoibt.
c if itask .ne. 1, y is loaded from yh and t is set accordingly.
c istate is set to 2, the illegal input counter is zeroed, and the
c optional outputs are loaded into the work arrays before returning. if
c istate = 0 or 1 and tout = t, there is a return with no action taken,
c except that if this has happened repeatedly, the run is terminated.
c-----------------------------------------------------------------------
400 do 410 i = 1,n
410 y(i) = rwork(i+lyh-1)
t = tn
if (itask .ne. 4 .and. itask .ne. 5) go to 420
if (ihit) t = tcrit
420 istate = 2
if ( kflag .eq. -3 ) istate = 3
illin = 0
rwork(11) = hu
rwork(12) = h
rwork(13) = tn
iwork(11) = nst
iwork(12) = nre
iwork(13) = nje
iwork(14) = nqu
iwork(15) = nq
return
c
430 ntrep = ntrep + 1
if (ntrep .lt. 5) return
call xerrwx(
1 60hlsoibt-- repeated calls with istate= 0 or 1 and tout= t(=r1),
1 60, 301, 1, 0, 0, 0, 1, t, 0.0d0)
go to 800
c-----------------------------------------------------------------------
c block h.
c the following block handles all unsuccessful returns other than
c those for illegal input. first the error message routine is called.
c if there was an error test or convergence test failure, imxer is set.
c then y is loaded from yh, t is set to tn, and the illegal input
c counter illin is set to 0. the optional outputs are loaded into
c the work arrays before returning.
c-----------------------------------------------------------------------
c the maximum number of steps was taken before reaching tout. ----------
500 call xerrwx(50hlsoibt-- at current t (=r1), mxstep (=i1) steps ,
1 50, 201, 1, 0, 0, 0, 0, 0.0d0, 0.0d0)
call xerrwx(50h taken on this call before reaching tout ,
1 50, 201, 1, 1, mxstep, 0, 1, tn, 0.0d0)
istate = -1
go to 580
c ewt(i) .le. 0.0 for some i (not at start of problem). ----------------
510 ewti = rwork(lewt+i-1)
call xerrwx(50hlsoibt-- at t (=r1), ewt(i1) has become r2 .le. 0.,
1 50, 202, 1, 1, i, 0, 2, tn, ewti)
istate = -6
go to 590
c too much accuracy requested for machine precision. -------------------
520 call xerrwx(50hlsoibt-- at t (=r1), too much accuracy requested ,
1 50, 203, 1, 0, 0, 0, 0, 0.0d0, 0.0d0)
call xerrwx(50h for precision of machine.. see tolsf (=r2) ,
1 50, 203, 1, 0, 0, 0, 2, tn, tolsf)
rwork(14) = tolsf
istate = -2
go to 590
c kflag = -1. error test failed repeatedly or with abs(h) = hmin. -----
530 call xerrwx(50hlsoibt-- at t (=r1) and step size h (=r2), the ,
1 50, 204, 1, 0, 0, 0, 0, 0.0d0, 0.0d0)
call xerrwx(50herror test failed repeatedly or with abs(h) = hmin,
1 50, 204, 1, 0, 0, 0, 2, tn, h)
istate = -4
go to 570
c kflag = -2. convergence failed repeatedly or with abs(h) = hmin. ----
540 call xerrwx(50hlsoibt-- at t (=r1) and step size h (=r2), the ,
1 50, 205, 1, 0, 0, 0, 0, 0.0d0, 0.0d0)
call xerrwx(50h corrector convergence failed repeatedly ,
1 50, 205, 1, 0, 0, 0, 0, 0.0d0, 0.0d0)
call xerrwx(30h or with abs(h) = hmin ,
1 30, 205, 1, 0, 0, 0, 2, tn, h)
istate = -5
go to 570
c ires = 3 returned by res, despite retries by stodi. ------------------
550 call xerrwx(50hlsoibt-- at t (=r1) residual routine returned ,
1 50, 206, 1, 0, 0, 0, 0, 0.0d0, 0.0d0 )
call xerrwx(30h error ires = 3 repeatedly , 30, 206, 1,
1 0, 0, 0, 1, tn, 0.0d0 )
istate = -7
go to 590
c aigbt failed because a diagonal block of a-matrix was singular. ------
560 ier = -ier
call xerrwx(
1 60hlsoibt-- attempt to initialize dy/dt failed because matrix a,
1 60, 207, 1, 0, 0, 0, 0, 0.0d0, 0.0d0 )
call xerrwx(50hhas a singular diagonal block, block no. = (i1) ,
2 50, 207, 1, 1, ier, 0, 0, 0.0d0, 0.0d0 )
istate = -8
return
c aigbt failed because res set ires to 2 or 3. -------------------------
565 call xerrwx(50hlsoibt-- attempt to initialize dy/dt failed ,
1 50, 208, 1, 0, 0, 0, 0, 0.0d0, 0.0d0 )
call xerrwx(50h because residual routine set its error flag ,
1 50, 208, 1, 0, 0, 0, 0, 0.0d0, 0.0d0 )
call xerrwx(20h to ires = (i1),
1 20, 208, 1, 1, ier, 0, 0, 0.0d0, 0.0d0 )
istate = -8
return
c compute imxer if relevant. -------------------------------------------
570 big = 0.0d0
imxer = 1
do 575 i = 1,n
size = dabs(rwork(i+lacor-1)*rwork(i+lewt-1))
if (big .ge. size) go to 575
big = size
imxer = i
575 continue
iwork(16) = imxer
c compute residual if relevant. ----------------------------------------
580 lyd0 = lyh + nyh
do 585 i = 1, n
rwork(i+lsavr-1) = rwork(i+lyd0-1)/h
585 y(i) = rwork(i+lyh-1)
ires = 1
call res ( neq, tn, y, rwork(lsavr), ydoti, ires )
nre = nre + 1
if ( ires .le. 1 ) go to 595
call xerrwx(50hlsoibt-- residual routine set its flag ires ,
1 50, 210, 1, 0, 0, 0, 0, 0.0d0, 0.0d0 )
call xerrwx(50h to (i1) when called for final output. ,
1 50, 210, 1, 1, ires, 0, 0, 0.0d0, 0.0d0 )
go to 595
c set y vector, t, illin, and optional outputs. ------------------------
590 do 592 i = 1,n
592 y(i) = rwork(i+lyh-1)
595 t = tn
illin = 0
rwork(11) = hu
rwork(12) = h
rwork(13) = tn
iwork(11) = nst
iwork(12) = nre
iwork(13) = nje
iwork(14) = nqu
iwork(15) = nq
return
c-----------------------------------------------------------------------
c block i.
c the following block handles all error returns due to illegal input
c (istate = -3), as detected before calling the core integrator.
c first the error message routine is called. then if there have been
c 5 consecutive such returns just before this call to the solver,
c the run is halted.
c-----------------------------------------------------------------------
601 call xerrwx(30hlsoibt-- istate (=i1) illegal ,
1 30, 1, 1, 1, istate, 0, 0, 0.0d0, 0.0d0)
go to 700
602 call xerrwx(30hlsoibt-- itask (=i1) illegal ,
1 30, 2, 1, 1, itask, 0, 0, 0.0d0, 0.0d0)
go to 700
603 call xerrwx(50hlsoibt-- istate .gt. 1 but lsoibt not initialized ,
1 50, 3, 1, 0, 0, 0, 0, 0.0d0, 0.0d0)
go to 700
604 call xerrwx(30hlsoibt-- neq (=i1) .lt. 1 ,
1 30, 4, 1, 1, neq(1), 0, 0, 0.0d0, 0.0d0)
go to 700
605 call xerrwx(50hlsoibt-- istate = 3 and neq increased (i1 to i2) ,
1 50, 5, 1, 2, n, neq(1), 0, 0.0d0, 0.0d0)
go to 700
606 call xerrwx(30hlsoibt-- itol (=i1) illegal ,
1 30, 6, 1, 1, itol, 0, 0, 0.0d0, 0.0d0)
go to 700
607 call xerrwx(30hlsoibt-- iopt (=i1) illegal ,
1 30, 7, 1, 1, iopt, 0, 0, 0.0d0, 0.0d0)
go to 700
608 call xerrwx(30hlsoibt-- mf (=i1) illegal ,
1 30, 8, 1, 1, mf, 0, 0, 0.0d0, 0.0d0)
go to 700
609 call xerrwx(40hlsoibt-- mb (=i1) or nb (=i2) illegal ,
1 50, 9, 1, 2, mb, nb, 0, 0.0d0, 0.0d0)
go to 700
610 call xerrwx(40hlsoibt-- nb(=i1) illegal.. .lt. 4 ,
1 50, 10, 1, 1, nb, 0, 0, 0.0d0, 0.0d0)
go to 700
611 call xerrwx(30hlsoibt-- maxord (=i1) .lt. 0 ,
1 30, 11, 1, 1, maxord, 0, 0, 0.0d0, 0.0d0)
go to 700
612 call xerrwx(30hlsoibt-- mxstep (=i1) .lt. 0 ,
1 30, 12, 1, 1, mxstep, 0, 0, 0.0d0, 0.0d0)
go to 700
613 call xerrwx(30hlsoibt-- mxhnil (=i1) .lt. 0 ,
1 30, 13, 1, 1, mxhnil, 0, 0, 0.0d0, 0.0d0)
go to 700
614 call xerrwx(40hlsoibt-- tout (=r1) behind t (=r2) ,
1 40, 14, 1, 0, 0, 0, 2, tout, t)
call xerrwx(50h integration direction is given by h0 (=r1) ,
1 50, 14, 1, 0, 0, 0, 1, h0, 0.0d0)
go to 700
615 call xerrwx(30hlsoibt-- hmax (=r1) .lt. 0.0 ,
1 30, 15, 1, 0, 0, 0, 1, hmax, 0.0d0)
go to 700
616 call xerrwx(30hlsoibt-- hmin (=r1) .lt. 0.0 ,
1 30, 16, 1, 0, 0, 0, 1, hmin, 0.0d0)
go to 700
617 call xerrwx(
1 60hlsoibt-- rwork length needed, lenrw (=i1), exceeds lrw (=i2),
1 60, 17, 1, 2, lenrw, lrw, 0, 0.0d0, 0.0d0)
go to 700
618 call xerrwx(
1 60hlsoibt-- iwork length needed, leniw (=i1), exceeds liw (=i2),
1 60, 18, 1, 2, leniw, liw, 0, 0.0d0, 0.0d0)
go to 700
619 call xerrwx(40hlsoibt-- rtol(=i1) is r1 .lt. 0.0 ,
1 40, 19, 1, 1, i, 0, 1, rtoli, 0.0d0)
go to 700
620 call xerrwx(40hlsoibt-- atol(=i1) is r1 .lt. 0.0 ,
1 40, 20, 1, 1, i, 0, 1, atoli, 0.0d0)
go to 700
621 ewti = rwork(lewt+i-1)
call xerrwx(40hlsoibt-- ewt(=i1) is r1 .le. 0.0 ,
1 40, 21, 1, 1, i, 0, 1, ewti, 0.0d0)
go to 700
622 call xerrwx(
1 60hlsoibt-- tout (=r1) too close to t(=r2) to start integration,
1 60, 22, 1, 0, 0, 0, 2, tout, t)
go to 700
623 call xerrwx(
1 60hlsoibt-- itask = i1 and tout (=r1) behind tcur - hu (= r2) ,
1 60, 23, 1, 1, itask, 0, 2, tout, tp)
go to 700
624 call xerrwx(
1 60hlsoibt-- itask = 4 or 5 and tcrit (=r1) behind tcur (=r2) ,
1 60, 24, 1, 0, 0, 0, 2, tcrit, tn)
go to 700
625 call xerrwx(
1 60hlsoibt-- itask = 4 or 5 and tcrit (=r1) behind tout (=r2) ,
1 60, 25, 1, 0, 0, 0, 2, tcrit, tout)
go to 700
626 call xerrwx(50hlsoibt-- at start of problem, too much accuracy ,
1 50, 26, 1, 0, 0, 0, 0, 0.0d0, 0.0d0)
call xerrwx(
1 60h requested for precision of machine.. see tolsf (=r1) ,
1 60, 26, 1, 0, 0, 0, 1, tolsf, 0.0d0)
rwork(14) = tolsf
go to 700
627 call xerrwx(50hlsoibt-- trouble from intdy. itask = i1, tout = r1,
1 50, 27, 1, 1, itask, 0, 1, tout, 0.0d0)
c
700 if (illin .eq. 5) go to 710
illin = illin + 1
istate = -3
return
710 call xerrwx(50hlsoibt-- repeated occurrences of illegal input ,
1 50, 302, 1, 0, 0, 0, 0, 0.0d0, 0.0d0)
c
800 call xerrwx(50hlsoibt-- run aborted.. apparent infinite loop ,
1 50, 303, 2, 0, 0, 0, 0, 0.0d0, 0.0d0)
return
c----------------------- end of subroutine lsoibt ----------------------
end
block data
c-----------------------------------------------------------------------
c this data subprogram loads variables into the internal common
c blocks used by lsode and its variants. the variables are
c defined as follows..
c illin = counter for the number of consecutive times the package
c was called with illegal input. the run is stopped when
c illin reaches 5.
c ntrep = counter for the number of consecutive times the package
c was called with istate = 1 and tout = t. the run is
c stopped when ntrep reaches 5.
c mesflg = flag to control printing of error messages. 1 means print,
c 0 means no printing.
c lunit = default value of logical unit number for printing of error
c messages.
c-----------------------------------------------------------------------
integer illin, iduma, ntrep, idumb, iowns, icomm, mesflg, lunit
double precision rownd, rowns, rcomm
common /ls0001/ rownd, rowns(209), rcomm(9),
1 illin, iduma(10), ntrep, idumb(2), iowns(6), icomm(19)
common /eh0001/ mesflg, lunit
data illin/0/, ntrep/0/
data mesflg/1/, lunit/6/
c
c----------------------- end of block data -----------------------------
end