-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathNode2.py
More file actions
213 lines (177 loc) · 6.06 KB
/
Node2.py
File metadata and controls
213 lines (177 loc) · 6.06 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
import numpy as np
import matplotlib.pyplot as plt
from utilities import *
from scipy import sparse
class Nodes:
def __init__(self,space):
self.dims = np.array([k for k in space])
self.lendims = len(self.dims)
self.lennodes = len(space[self.dims[0]])
self.idims = dict(zip(self.dims,range(self.lendims)))
self.space = np.zeros((self.lendims,self.lennodes))
for i,k in enumerate(self.dims):
self.space[i] = space[k]
def add_labels(self,labs,labnames):
'''labs: labels for nodes
labnames: dictionary containing meanings of labels
'''
self.labels = labs
self.labnames = labnames
def size(self):
''' Returns number of nodes in system'''
return self.lennodes
#return len(self.space[self.dims[0]])
def get_dim(self,name):
return self.space[self.idims[name]]
def add_dims(self,dim):
'BAD! WIP'
for k in dim.keys():
self.space[k] = dim[k]
def get_node(self,i):
return SubNode(i,self)
def get_neighbors_x(self,i,dims,N):
mag = np.zeros(self.size())
nod = self.get_node(i)
diffsx = self.get_dim('x') - nod.get_dim('x')
diffsy = self.get_dim('y') - nod.get_dim('y')
criterion = (np.abs(diffsx)+1)*np.arctan(0.1 + np.abs(diffsy))
return SubNode(np.argsort(criterion)[:N],self)
def get_neighbors_y(self,i,N):
mag = np.zeros(self.size())
nod = self.get_node(i)
diffsx = self.get_dim('x') - nod.get_dim('x')
diffsy = self.get_dim('y') - nod.get_dim('y')
criterion = (np.abs(diffsy)+1)*np.arctan(0.1 + np.abs(diffsx))
return SubNode(np.argsort(criterion)[:N],self)
def get_neighbors(self,dim,i,N):
nod = self.get_node(i)
diffvariant = self.get_dim(dim) - nod.get_dim(dim)
criterion = (np.abs(diffvariant)+1)
invariantdims = [k for k in self.dims if k!=dim]
for idim in invariantdims:
dif = self.get_dim(idim) - nod.get_dim(idim)
criterion = criterion*np.arctan(0.1 + np.abs(dif))
return SubNode(np.argsort(criterion)[:N],self)
def get_label_ids(self,labelname):
ind = self.labnames[labelname]
return self.labels == ind
def plot(self,dim1,dim2,*args,**kwargs):
for l in set(self.labels):
w = (self.labels == l)
plt.plot(self.get_dim(dim1)[w],self.get_dim(dim2)[w],'o',*args,**kwargs)
plt.legend([l for l in self.labnames])
# def diff_x(j,nods,D,h):
# N = n_combos(3,D+h)
# n = nods
# #clos = n.get_neighbors_x(j,['x','y'],N)
# clos = n.get_neighbors('x',j,N)
# nod = n.get_node(j)
# diffsx = clos.get_dim('x') - nod.get_dim('x')
# diffsy = clos.get_dim('y') - nod.get_dim('y')
# A = np.zeros((N,N))
# for i in range(N):
# A[:,i] = make_combos([diffsx[i],diffsy[i]],D+h)
# thelist = make_combos2('xy',D+h)
# b = np.zeros(int(N))
# b[thelist.index('x'*D)] = factorial(D)
# soln = svdsolve(A,b)
# return clos.i,soln
def diff_gen(j,nods,D,h,dim):
N = n_combos(3,D+h)
n = nods
#clos = n.get_neighbors_x(j,['x','y'],N)
clos = n.get_neighbors(dim,j,N)
nod = n.get_node(j)
diffsx = clos.get_dim('x') - nod.get_dim('x')
diffsy = clos.get_dim('y') - nod.get_dim('y')
A = np.zeros((N,N))
for i in range(N):
A[:,i] = make_combos([diffsx[i],diffsy[i]],D+h)
thelist = make_combos2('xy',D+h)
b = np.zeros(int(N))
b[thelist.index(dim*D)] = factorial(D)
soln = svdsolve(A,b)
return clos.i,soln
def diff_gen_1D(j,nods,D,h,dim):
N = n_combos(3,D+h)
n = nods
#clos = n.get_neighbors_x(j,['x','y'],N)
clos = n.get_neighbors(dim,j,N)
nod = n.get_node(j)
diffsx = clos.get_dim('x') - nod.get_dim('x')
diffsy = clos.get_dim('y') - nod.get_dim('y')
A = np.zeros((N,N))
for i in range(N):
A[:,i] = make_combos([diffsx[i],diffsy[i]],D+h)
thelist = make_combos2('xy',D+h)
b = np.zeros(int(N))
b[thelist.index(dim*D)] = factorial(D)
soln = svdsolve(A,b)
return clos.i,soln
# def diff_y(j,nods,D,h):
# N = n_combos(3,D+h)
# n = nods
# clos = n.get_neighbors_y(j,N)
# nod = n.get_node(j)
# diffsx = clos.get_dim('x') - nod.get_dim('x')
# diffsy = clos.get_dim('y') - nod.get_dim('y')
# A = np.zeros((N,N))
# for i in range(N):
# A[:,i] = make_combos([diffsx[i],diffsy[i]],D+h)
# thelist = make_combos2('xy',D+h)
# b = np.zeros(int(N))
# b[thelist.index('y'*D)] = factorial(D)
# soln = svdsolve(A,b)
# return clos.i,soln
def make_stiffness(nodes,D,h,dim,labelname = None):
n = nodes
M = n.lennodes
A = np.zeros((M,M))
#print(A.shape)
#A = sparse.csr_matrix((M,M))
#print(A.shape)
if D == 0:
#return np.eye(M)
if labelname:
ind = n.labnames[labelname]
w = np.where(n.labels == ind)[0]
for i in w:
A[i][i] = 1.
return A
else:
return np.eye(M)
#A = np.zeros((M,M))
if not labelname:
for i in range(0,n.lennodes):
ids, soln = diff_gen(i,n,D,h,dim)
A[i][ids] = soln
else:
ind = n.labnames[labelname]
w = np.where(n.labels == ind)[0]
for i in w:
ids, soln = diff_gen(i,n,D,h,dim)
A[i][ids] = soln
return A
# def make_stiffness(nodes,D,h,dim,labelname = None):
# n = nodes
# M = n.lennodes
# if D == 0:
# return np.eye(M)
# A = np.zeros((M,M))
# if not labelname:
# for i in range(0,n.lennodes):
# ids, soln = diff_gen(i,n,D,h,dim)
# A[i][ids] = soln
# else:
# ind = n.labnames[labelname]
# w = np.where(n.labels == ind)[0]
# for i in w:
# ids, soln = diff_gen(i,n,D,h,dim)
# A[i][ids] = soln
# return A
class SubNode(Nodes):
def __init__(self,i,refspace):
self.refspace = refspace
self.i = i
def get_dim(self,name):
return self.refspace.get_dim(name)[self.i]