2
* (n, r, c, il, jl, ijl, l, d, iu, ju, iju, u, z, b, tmp)
5
c*** numeric solution of the transpose of a sparse nonsymmetric system
6
c of linear equations given lu-factorization (compressed pointer
10
c input variables.. n, r, c, il, jl, ijl, l, d, iu, ju, iju, u, b
11
c output variables.. z
13
c parameters used internally..
14
c fia - tmp - temporary vector which gets result of solving ut y = b
17
c internal variables..
18
c jmin, jmax - indices of the first and last positions in a row of
21
integer r(1), c(1), il(1), jl(1), ijl(1), iu(1), ju(1), iju(1)
22
double precision l(1), d(1), u(1), b(1), z(1), tmp(1), tmpk,sum
24
c ****** set tmp to reordered b *************************************
27
c ****** solve ut y = b by forward substitution *******************
32
if (jmin .gt. jmax) go to 3
35
2 tmp(ju(mu+j)) = tmp(ju(mu+j)) + tmpk * u(j)
37
c ****** solve lt x = y by back substitution **********************
43
if (jmin .gt. jmax) go to 5
46
4 sum = sum + l(j) * tmp(jl(ml+j))
47
5 tmp(k) = -sum * d(k)