This routine manages the solution of the linear system arising from a chord iteration. It is called if MITER .ne. 0.
If MITER is 1 or 2, it calls CDRV to accomplish this.
If MITER = 3 it updates the coefficient H*EL0 in the diagonal matrix, and then computes the solution. communication with DSOLSS uses the following variables:
real work space containing the inverse diagonal matrix if MITER = 3 and the LU decomposition of the matrix otherwise. Storage of matrix elements starts at WK(3). WK also contains the following matrix-related data:
WK(1) = SQRT(UROUND) (not used here),
WK(2) = HL0, the previous value of H*EL0, used if MITER = 3.
integer work space for matrix-related data, assumed to be equivalenced to WK. In addition, WK(IPRSP) and IWK(IPISP) are assumed to have identical locations.
the right-hand side vector on input, and the solution vector on output, of length N.
vector of work space of length N, not used in this version.
output flag (in Common).
IERSL = 0 if no trouble occurred.
IERSL = -1 if CDRV returned an error flag (MITER = 1 or 2).
This should never occur and is considered fatal.
IERSL = 1 if a singular matrix arose with MITER = 3.
Type | Intent | Optional | Attributes | Name | ||
---|---|---|---|---|---|---|
real(kind=dp), | intent(inout) | :: | Wk(*) | |||
integer | :: | Iwk(*) | ||||
real(kind=dp), | intent(inout) | :: | X(*) | |||
real(kind=dp) | :: | Tem(*) |