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
|
subroutine wspisp(ma,na,ar,ai,nela,inda,i,ni,j,nj,
c Copyright INRIA
$ mb,nb,br,bi,nelb,indb,mr,nr,rr,ri,nelr,indr,ptrb,
$ ierr,ita,itb)
c extract a submatrix from a sparse matrix
c!
integer inda(*),indr(*),i(*),j(*),ptrb(*)
integer indb(*),mb,nb,nelb
integer ma,na,ni,nj,mr,nr,nela,nelr,ierr
double precision ar(nela),ai(nela),rr(*),ri(*),br(nelb),bi(nelb)
logical allrow,allcol
integer findl
external findl
c
mr=ni
nr=nj
ierr=0
nelmx=nelr
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
call icopy(mb+nelb,indb,1,indr,1)
call unsfdcopy(nelb,br,1,rr,1)
if(itb.ne.0) then
call unsfdcopy(nelb,bi,1,ri,1)
else
call dset(nelb,0.0d0,ri,1)
endif
nelr=nelb
return
elseif(allcol) then
c a(i,:)=b
jr=1
jb=1
ja=1
call sz2ptr(indb,mb,ptrb)
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)
if(jr+indr(l).gt.nelmx) then
ierr=1
return
endif
call unsfdcopy(indr(l),ar(ja),1,rr(jr),1)
if(ita.ne.0) then
call unsfdcopy(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
jb=ptrb(ii)
indr(l)=indb(ii)
if(jr+indr(l).gt.nelmx) then
ierr=1
return
endif
call icopy(indr(l),indb(mb+jb),1,indr(mr+jr),1)
call unsfdcopy(indr(l),br(jb),1,rr(jr),1)
if(itb.ne.0) then
call unsfdcopy(indr(l),bi(jb),1,ri(jr),1)
else
call dset(indr(l),0.0d0,ri(jr),1)
endif
jr=jr+indr(l)
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
jb=0
do 35 l=1,ma
ja1=1
nbl=indb(l)
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
if(jr+1.gt.nelmx) then
ierr=1
return
endif
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 non zero
jb1=findl(jj,indb(mb+jb+1),nbl)
if(jb1.ne.0) then
c * b(l,jj) element if non zero
if(jr+1.gt.nelmx) then
ierr=1
return
endif
rr(jr)=br(jb+jb1)
if(itb.ne.0) then
ri(jr)=bi(jb+jb1)
else
ri(jr)=0.0d0
endif
indr(l)=indr(l)+1
indr(mr+jr)=k
jr=jr+1
endif
if(ja1.le.nal.and.inda(ma+ja+ja1).eq.k) ja1=ja1+1
endif
31 continue
ja=ja+nal
jb=jb+nbl
35 continue
nelr=jr-1
return
else
c a(i,j)=b
jr=1
ja=0
call sz2ptr(indb,mb,ptrb)
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 unsfdcopy(indr(l),ar(ja+ja1),1,rr(jr),1)
if(ita.ne.0) then
call unsfdcopy(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
jb=ptrb(ii)-1
jb1=1
nbl=indb(ii)
do 42 k=1,nr
jj=findl(k,j,nj)
if(jj.eq.0) then
c * insert a(l,k) element insert 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
if(jr+1.gt.nelmx) then
ierr=1
return
endif
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
jb1=findl(jj,indb(mb+jb+1),nbl)
if(jb1.ne.0) then
c * b(l,jj) element if non zero
if(jr+1.gt.nelmx) then
ierr=1
return
endif
rr(jr)=br(jb+jb1)
if(itb.ne.0) then
ri(jr)=bi(jb+jb1)
else
ri(jr)=0.0d0
endif
indr(l)=indr(l)+1
indr(mr+jr)=k
jr=jr+1
endif
if(ja1.le.nal.and.inda(ma+ja+ja1).eq.k) ja1=ja1+1
endif
42 continue
endif
c bug fixed by Ramine
c ja=ja+na
ja=ja+nal
45 continue
nelr=jr-1
endif
end
|
