-
Notifications
You must be signed in to change notification settings - Fork 2
Expand file tree
/
Copy pathStructure.py
More file actions
332 lines (317 loc) · 8.82 KB
/
Copy pathStructure.py
File metadata and controls
332 lines (317 loc) · 8.82 KB
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
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
#!/usr/bin/env python2
# -*- coding: utf-8 -*-
"""
Created on Wed Dec 14 14:09:08 2016
@author: root
"""
from __future__ import division
import copy
import math
from itertools import cycle as repeat
def add_vec(x,y,w=1):
if not isinstance(x,list) :
x_=repeat(x)
else:
x_=x
do=zip(x_,y)
ret=[i[0]+w*i[1] for i in do]
return ret
def dot_vec(x,y):
x_=copy.deepcopy(x)
if type(x)!=list:
x_=[x_]
elif len(x)==0 or len(y)==0: return [0]
x_=repeat(x_)
do=zip(x_,y)
ret=[i[0]*i[1] for i in do]
return ret
def argabsmax(x):
max=x[0]
arg=0
for ind,i in enumerate(x[0:]):
if abs(max)<abs(i):
max=i
arg=ind
return arg
def absmax(x):
max=x[0]
for ind,i in enumerate(x[0:]):
if abs(max)<abs(i):
max=i
return max
def argabsmin(x):
min=x[0]
arg=0
for ind,i in enumerate(x[0:]):
if abs(min)>abs(i):
min=i
arg=ind
return arg
def absmin(x):
min=x[0]
for ind,i in enumerate(x[0:]):
if abs(min)<abs(i):
min=i
return min
def jacobi_sign(x):
if x>=0:
ret=1
else :
ret=-1
return ret
def UnitMat_rev(body,**kw):
a=kw['a']
b=kw['b']
body[a],body[b]=body[b],body[a]
def UnitMat_add(body,**kw):
a=kw['a']
b=kw['b']
w=kw['w']
body[a]=add_vec(body[a],body[b],w)
def UnitMat_dot(body,**kw):
a=kw['a']
w=kw['w']
body[a]=[w*i for i in body[a]]
def calculate_givensSy_cos_sin(body,i,j):
a=body[i][i]
b=body[j][j]
ab=body[j][i]
A=a-b
if ab==0:
d='inf'
else:
d=A/2/ab
if d=='inf':
c=0;s=1
else:
tg=jacobi_sign(d)/( abs(d)+math.sqrt(d**2 + 1) )
c=1/math.sqrt(1+ tg**2)
s=tg/math.sqrt(1+ tg**2)
return c,s
def calculate_givensQR_cos_sin(body,i,j):
a=body[i][i]
b=body[j][i]
if abs(b)>=abs(a):
tg=a/b
s=1/math.sqrt(1+ tg**2)
c=tg/math.sqrt(1+ tg**2)
else:
tg=b/a
c=1/math.sqrt(1+ tg**2)
s=tg/math.sqrt(1+ tg**2)
return c,s
def cg_qr(*tup):
return calculate_givensQR_cos_sin(*tup)
def Givens(body,**kw):
a=kw['a']
b=kw['b']
c=kw['c']
s=kw['s']
if c==0:
kw0={'a':a,'b':b}
UnitMat_rev(body,**kw0)
else:
kw1={'a':a,'w':1/c}
kw2={'a':b,'w':c}
kw3={'a':a,'b':b,'w':c*s}
kw4={'a':b,'b':a,'w':-s/c}
UnitMat_add(body,**kw4)
UnitMat_add(body,**kw3)
UnitMat_dot(body,**kw2)
UnitMat_dot(body,**kw1)
if c==0:
def f(A):
UnitMat_rev(A,**kw0)
else:
def f(A):
UnitMat_add(A,**kw4)
UnitMat_add(A,**kw3)
UnitMat_dot(A,**kw2)
UnitMat_dot(A,**kw1)
return f
UnitMethod={'rev':UnitMat_rev,
'add':UnitMat_add,
'dot':UnitMat_dot,
'givens':Givens
}
class functionStack:
def __init__(self):
self.stack=[]
def getin(self,func_item):
self.stack.append(func_item)
def getout(self):
return self.stack.pop()
def pullout(self,mat):
self.stack.reverse()
n=len(self.stack)
while n:
self.getout()(mat)
n-=1
return mat
class UnitMatrix:
def __init__(self):
self.stack=[]
def getin(self,method,**kw):
self.stack.append((kw,method))
def func(self):
kw,method=self.stack.pop()
return lambda A:UnitMethod[method](body=A,**kw)
class matrix:
def __init__(self,lists,eye=True):
if type(lists)==list and type(lists[0])!=str:
if type(lists[0])!=list:
lists=[lists]
self.data=copy.deepcopy(lists)
self.size=(len(lists),len(lists[0]))
elif type(lists)==tuple:
m=lists[0];n=lists[1]
self.size=(m,n)
if eye==True:
self.data=[[1*(i==j) for j in xrange(n)]for i in xrange(m)]
else:
self.data=[[0 for j in xrange(n)]for i in xrange(m)]
elif type(lists)==int:
n=lists
self.size=(n,n)
if eye==True:
self.data=[[1*(i==j) for j in xrange(n)]for i in xrange(n)]
else:
self.data=[[0 for j in xrange(n)]for i in xrange(n)]
else:
self=self.__init__(lists.data)
def __setitem__(self,i,x):
self.data[i]=x
def c(self,index1,index2,mat=False):
data=self.data
if type(data)==type(None):
print('error: not initialized.\n')
if type(index2)!=list:
index2=[index2]
if type(index1)!=list:
index1=[index1]
mat=[[data[i][j] for j in index2] for i in index1]
ret=[]
for i in mat:
ret+=i
return ret
def disp(self,dig=5):
strs='%.rf'.replace('r',str(dig))
data=self.data
for i in data:
for j in i:
print strs % (j),
print
def __getitem__(self,I):
if type(I) in [slice,int]:
ret=self.data[I]
return ret
def T(self,retdata=False):
data=self.data
size=self.size
datap=[[data[j][i] for j in xrange(size[0])] for i in xrange(size[1])]
if retdata:
return datap
else:
return matrix(datap)
def __rmul__(self,x):
try:
data=copy.deepcopy(self.data)
data=[[j*x for j in i]for i in data]
return matrix(data)
except:
return 0
def __mul__(self,x):
if isinstance(x,matrix):
data2=x.T().data
data1=self.data
mat=[[sum(dot_vec(i,j)) for j in data2 ]for i in data1]
else:
print 233
mat=[[j*x for j in i]for i in self.data]
print mat
mat=matrix(mat)
return matrix(mat)
def __add__(self,x):
if not isinstance(x,matrix):
try:
data=copy.deepcopy(self.data)
data=[[j+x for j in i]for i in data]
return matrix(data)
except:
print 'Error'
return ValueError
size=x.size
try:
data1=x.data
data2=self.data
mat=[[data1[i][j]+data2[i][j] for j in xrange(size[1])] for i in xrange(size[0])]
except:
print('error: unexpected size of matrix!\n')
return matrix(mat)
def __sub__(self,x):
size=x.size
data1=x.data
data2=self.data
mat=[[data2[i][j]-data1[i][j] for j in xrange(size[1])] for i in xrange(size[0])]
#print('error: unexpected size of matrix!\n')
return matrix(mat)
def __neg__(self):
data=self.data
ret=[[-j for j in i]for i in data]
return matrix(ret)
def inv(self,overall=False,mat=False):
size=self.size
data=copy.deepcopy(self.data)
row_arg=range(size[0])
if size[0]!=size[1]:
print('error\n')
return ValueError
inverse=matrix((size)).data
size=size[0]
for i in row_arg[:-1]:
vec=matrix(data).c(range(i,size),i)
max_index=i+argabsmax(vec)
data[max_index],data[i]=data[i],data[max_index]
inverse[max_index],inverse[i]=inverse[i],inverse[max_index]
for index in range(i+1,size):
param=data[index][i]/data[i][i]
data[index]=add_vec(data[index],data[i],-param)
inverse[index]=add_vec(inverse[index],inverse[i],-param)
row_arg.reverse()
for i in row_arg[:-1]:
for index in range(0,i):
param=data[index][i]/data[i][i]
data[index]=add_vec(data[index],data[i],-param)
inverse[index]=add_vec(inverse[index],inverse[i],-param)
for i in row_arg:
inverse[i]=dot_vec(1/data[i][i],inverse[i])
data[i]=dot_vec(1/data[i][i],data[i])
if mat==False:
return inverse
elif mat==True:
return matrix(inverse)
def hstack(mat1,mat2,retdata=False):
import copy
if mat1.size[0]!=mat2.size[0]:
return ValueError
n=mat1.size[0]
this=copy.deepcopy(mat1.data)
del copy
for i in range(n):
this[i]+=mat2[i]
if retdata:
return this
return matrix(this)
def vstack(mat1,mat2,retdata=False):
import copy
if mat1.size[1]!=mat2.size[1]:
return ValueError
this=copy.deepcopy(mat1.data+mat2.data)
del copy
if retdata:
return this
return matrix(this)
def diag(li,n=None):
if not n:
n=len(li)
return [[0 if i!=j else li[i] for j in range(n)] for i in range(n)]