1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
|
subroutine wspis(ma,na,ar,ai,nela,inda,i,ni,j,nj,
$ mb,nb,br,bi,mr,nr,rr,ri,nelr,indr,ierr,ita,itb)
c extract a submatrix from a sparse matrix
c!
integer inda(*),indr(*),i(*),j(*)
integer mb,nb
integer ma,na,ni,nj,mr,nr,nela,nelr,ierr
double precision ar(nela),ai(nela),rr(*),ri(*),br(mb,*),bi(mb,*)
double precision t
logical allrow,allcol
integer findl
external findl
c
nelmx=nelr
ierr=0
mr=ni
nr=nj
allrow=ni.lt.0
allcol=nj.lt.0
if(allrow) then
mr=ma
ni=mr
else
mi=0
do 01 kk=1,ni
mi=max(mi,i(kk))
01 continue
mr=max(ma,mi)
endif
if(allcol) then
nr=na
nj=na
else
mj=0
do 02 kk=1,nj
mj=max(mj,j(kk))
02 continue
nr=max(na,mj)
endif
if (allrow.and.allcol) then
c a(:,:)=b
if(mb*nb.gt.nelmx) then
ierr=1
return
endif
call iset(mb,nb,indr,1)
jr=1
if(mb*nb.ne.0) then
do 04 l=1,mb
do 03 k=1,nb
indr(mb+jr)=k
rr(jr)=br(l,k)
if(itb.ne.0) then
ri(jr)=bi(l,k)
else
ri(jr)=0.0d0
endif
jr=jr+1
03 continue
04 continue
endif
nelr=mb*nb
return
elseif(allcol) then
c a(i,:)=b
jr=1
ja=1
do 20 l=1,mr
indr(l)=0
ii=findl(l,i,ni)
if(ii.eq.0) then
c this line is not modified
if(l.le.ma) then
indr(l)=inda(l)
call icopy(indr(l),inda(ma+ja),1,indr(mr+jr),1)
call dcopy(indr(l),ar(ja),1,rr(jr),1)
if(ita.ne.0) then
call dcopy(indr(l),ai(ja),1,ri(jr),1)
else
call dset(indr(l),0.0d0,ri(jr),1)
endif
jr=jr+indr(l)
ja=ja+indr(l)
else
indr(l)=0
endif
else
c all this line is replaced by corresponding b line
indr(l)=nb
if(nb.gt.0) then
if(jr+nb.gt.nelmx) then
ierr=1
return
endif
if(itb.eq.0) then
do 18 k1=1,nb
if(br(ii,k1).ne.0.0d0) then
indr(mr+jr)=k1
rr(jr)=br(ii,k1)
ri(jr)=0.0d0
jr=jr+1
endif
18 continue
else
do 19 k1=1,nb
if(abs(br(ii,k1))+abs(bi(ii,k1)).ne.0.0d0) then
indr(mr+jr)=k1
rr(jr)=br(ii,k1)
ri(jr)=bi(ii,k1)
jr=jr+1
endif
19 continue
endif
endif
if(l.le.ma) then
ja=ja+inda(l)
endif
endif
20 continue
nelr=jr-1
elseif(allrow) then
c a(:,j)=b
jr=1
ja=0
do 35 l=1,ma
ja1=1
nal=inda(l)
indr(l)=0
do 31 k=1,nr
jj=findl(k,j,nj)
if(jj.eq.0) then
c the a(l,k) element is not modified insert it in r if non zero
if(ja1.le.nal.and.inda(ma+ja+ja1).eq.k) then
c * a(l,k) element is non zero
rr(jr)=ar(ja+ja1)
if(ita.ne.0) then
ri(jr)=ai(ja+ja1)
else
ri(jr)=0.0d0
endif
indr(l)=indr(l)+1
indr(mr+jr)=k
jr=jr+1
ja1=ja1+1
endif
else
c the a(l,k) element is replaced by b(l,jj) element
if(nb.gt.0) then
if(itb.eq.0) then
if(br(l,jj).ne.0.0d0) then
if(jr+1.gt.nelmx) then
ierr=1
return
endif
rr(jr)=br(l,jj)
ri(jr)=0.0d0
indr(l)=indr(l)+1
indr(mr+jr)=k
jr=jr+1
endif
else
if(abs(br(l,jj))+abs(bi(l,jj)).ne.0.0d0) then
if(jr+1.gt.nelmx) then
ierr=1
return
endif
rr(jr)=br(l,jj)
ri(jr)=bi(l,jj)
indr(l)=indr(l)+1
indr(mr+jr)=k
jr=jr+1
endif
endif
endif
endif
if(ja1.le.nal.and.inda(ma+ja+ja1).eq.k) ja1=ja1+1
31 continue
ja=ja+nal
35 continue
nelr=jr-1
return
else
c a(i,j)=b
jr=1
ja=0
do 45 l=1,mr
ja1=1
if(l.le.ma) then
nal=inda(l)
else
nal=0
endif
indr(l)=0
ii=findl(l,i,ni)
if(ii.eq.0) then
c * the a(l,:) is not modified
if(l.le.ma) then
indr(l)=inda(l)
call icopy(indr(l),inda(ma+ja+ja1),1,indr(mr+jr),1)
call dcopy(indr(l),ar(ja+ja1),1,rr(jr),1)
if(ita.ne.0) then
call dcopy(indr(l),ai(ja+ja1),1,ri(jr),1)
else
call dset(indr(l),0.0d0,ri(jr),1)
endif
jr=jr+indr(l)
ja1=ja1+indr(l)
else
indr(l)=0
endif
else
do 42 k=1,nr
jj=findl(k,j,nj)
if(jj.eq.0) then
c * insert a(l,k) element in r if non zero
if(ja1.le.nal.and.inda(ma+ja+ja1).eq.k) then
c * a(l,k) element is non zero
rr(jr)=ar(ja+ja1)
if(ita.ne.0) then
ri(jr)=ai(ja+ja1)
else
ri(jr)=0.0d0
endif
indr(l)=indr(l)+1
indr(mr+jr)=k
jr=jr+1
ja1=ja1+1
endif
else
c * replace a(l,k) element by b(ii,jj) element if non zero
if(nb.gt.0) then
if(itb.eq.0) then
if(br(ii,jj).ne.0.0d0) then
if(jr+1.gt.nelmx) then
ierr=1
return
endif
rr(jr)=br(ii,jj)
ri(jr)=0.0d0
indr(l)=indr(l)+1
indr(mr+jr)=k
jr=jr+1
endif
else
t=abs(br(ii,jj))+abs(bi(ii,jj))
if(t.ne.0.0d0) then
if(jr+1.gt.nelmx) then
ierr=1
return
endif
rr(jr)=br(ii,jj)
ri(jr)=bi(ii,jj)
indr(l)=indr(l)+1
indr(mr+jr)=k
jr=jr+1
endif
endif
endif
if(ja1.le.nal.and.inda(ma+ja+ja1).eq.k) ja1=ja1+1
endif
42 continue
endif
ja=ja+nal
45 continue
nelr=jr-1
endif
end
|
