-
Notifications
You must be signed in to change notification settings - Fork 4
/
test_jabr.py
203 lines (170 loc) · 7.17 KB
/
test_jabr.py
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
import pytest
from jabr import *
from loadcase import load_case, z2y
from numpy.testing import assert_almost_equal, assert_allclose
from scipy.sparse import coo_matrix
from numpy import array, pi
CASE_DIRECTORY = '/Users/srharnett/Dropbox/power/jabr-power-flow/cases/'
@pytest.fixture
def case5():
c = CASE_DIRECTORY + 'case5_renumber_tree.m'
return load_case(c)
@pytest.fixture
def case5q():
c = CASE_DIRECTORY + 'case5_with_q.m'
return load_case(c)
@pytest.fixture
def case9():
c = CASE_DIRECTORY + 'case9_tree.m'
return load_case(c)
@pytest.fixture
def case14():
c = CASE_DIRECTORY + 'case14_tree.m'
return load_case(c)
@pytest.fixture
def case118():
c = CASE_DIRECTORY + 'case118_v2.m'
return load_case(c)
# TODO move these to test_loadcase
def test_z2y_simple():
r, x = 0, 1
assert z2y(r, x) == (0, -1)
def test_z2y_normal():
r, x = .02, .2
g, b = z2y(r, x)
ghat, bhat = 0.495049504950495, -4.9504950495049505
assert_almost_equal(g, ghat)
assert_almost_equal(b, bhat)
def test_build_U_matrices(case5):
G, B = case5.G, case5.B
r, x = .01, .1
g, b = z2y(r, x)
S2 = 2**.5
Ureal = dok_matrix(
[[0., g*S2, 0, 0, 0],
[0., 0, g*S2, 0, 0],
[0., 0, 0, 3*g*S2, 0],
[0., 0, 0, 0, g*S2]])
Ureac = dok_matrix(
[[0., -b*S2, 0, 0, 0],
[0., 0, -b*S2, 0, 0],
[0., 0, 0, -3*b*S2, 0],
[0., 0, 0, 0, -b*S2]])
Ureal_hat, Ureac_hat = build_U_matrices(G, B)
assert_almost_equal(Ureal_hat.todense(), Ureal.todense())
assert_almost_equal(Ureac_hat.todense(), Ureac.todense())
def test_build_R_matrices(case5):
G, B, branch_map = case5.G, case5.B, case5.branch_map
r, x = .01, .1
g, b = z2y(r, x)
Rreal = dok_matrix(
[[0, 0, -g, 0],
[-g, 0, 0, 0],
[0, -g, -g, -g],
[0, 0, 0, -g]])
Rreac = dok_matrix(
[[0, 0, b, 0],
[b, 0, 0, 0],
[0, b, b, b],
[0, 0, 0, b]])
Rreal_hat, Rreac_hat = build_R_matrices(G, B, branch_map)
assert_almost_equal(Rreal_hat.todense(), Rreal.todense())
assert_almost_equal(Rreac_hat.todense(), Rreac.todense())
def test_build_I_matrices(case5):
G, B, branch_map = case5.G, case5.B, case5.branch_map
r, x = .01, .1
g, b = z2y(r, x)
Ireal = dok_matrix(
[[0, 0, -b, 0],
[b, 0, 0, 0],
[0, b, b, -b],
[0, 0, 0, b]])
Ireac = dok_matrix(
[[0, 0, -g, 0],
[g, 0, 0, 0],
[0, g, g, -g],
[0, 0, 0, g]])
Ireal_hat, Ireac_hat = build_I_matrices(G, B, branch_map)
assert_almost_equal(Ireal_hat.todense(), Ireal.todense())
assert_almost_equal(Ireac_hat.todense(), Ireac.todense())
def test_build_contraint_matrix(case5):
G, B, branch_map = case5.G, case5.B, case5.branch_map
r, x = .01, .1
g, b = z2y(r, x)
S2 = 2**.5
Areal = coo_matrix(
[[0., g*S2, 0, 0, 0, 0, 0, -g, 0, 0, 0, -b, 0],
[0., 0, g*S2, 0, 0, -g, 0, 0, 0, b, 0, 0, 0],
[0., 0, 0, 3*g*S2, 0, 0, -g, -g, -g, 0, b, b, -b],
[0., 0, 0, 0, g*S2, 0, 0, 0, -g, 0, 0, 0, b]])
Areac = coo_matrix(
[[0., -b*S2, 0, 0, 0, 0, 0, b, 0, 0, 0, -g, 0],
[0., 0, -b*S2, 0, 0, b, 0, 0, 0, g, 0, 0, 0],
[0., 0, 0, -3*b*S2, 0, 0, b, b, b, 0, g, g, -g],
[0., 0, 0, 0, -b*S2, 0, 0, 0, b, 0, 0, 0, g]])
Areal_hat, Areac_hat = build_constraint_matrix(G, B, branch_map)
assert_almost_equal(Areal_hat.todense(), Areal.todense())
assert_almost_equal(Areac_hat.todense(), Areac.todense())
def test_full_case5(case5):
V = {5: 1, 1: 0.85332805, 2: 0.98467413, 3: 0.87294854, 4: 0.85332805}
u, R, I = build_gurobi_model(case5)
Vhat, theta = recover_original_variables(u, I)
i2e = case5.i2e
# TODO make a vectorized version of this
for bus, v in enumerate(Vhat):
assert_almost_equal(V[i2e[bus]], v, decimal=4)
def test_full_case5q(case5q):
V = {5: 1, 1: 0.79806, 2: 0.97430, 3: 0.82022, 4: 0.78499}
u, R, I = build_gurobi_model(case5q)
Vhat, theta = recover_original_variables(u, I)
i2e = case5q.i2e
# TODO make a vectorized version of this
for bus, v in enumerate(Vhat):
assert_almost_equal(V[i2e[bus]], v, decimal=4)
def test_full_case9(case9):
V = [0, 1, 1, 1, 0.95627, 0.93106, 0.98732, 0.91403, 0.95389, 0.90988]
u, R, I = build_gurobi_model(case9)
Vhat, theta = recover_original_variables(u, I)
i2e = case9.i2e
# TODO make a vectorized version of this
for bus, v in enumerate(Vhat):
assert_almost_equal(V[i2e[bus]], v, decimal=4)
def test_full_case14(case14):
V = [0, 1.06000, 1.04500, 1.01000, 0.98737, 0.99732, 1.07000, 1.00938,
1.09000, 0.97570, 0.96766, 1.06350, 1.05898, 1.05428, 0.94052]
theta = [0.00000, -2.46611, -12.99258, -21.40732, -18.82987, -23.50133,
-27.88832, -27.88832, -31.33324, -31.68280, -23.76577, -24.19095,
-24.19971, -33.45227]
u, R, I = build_gurobi_model(case14)
Vhat, theta_hat = recover_original_variables(u, I)
matpower_theta_hat = {case14.i2e[i]: 180/pi*t for i, t in enumerate(theta_hat)}
matpower_theta_hat = array([x[1] for x in sorted(matpower_theta_hat.items())])
i2e = case14.i2e
# TODO make a vectorized version of this
for bus, v in enumerate(Vhat):
assert_almost_equal(V[i2e[bus]], v, decimal=4)
assert_almost_equal(theta, matpower_theta_hat, decimal=4)
def test_full_case118(case118):
V = [0, 0.95500, 0.98047, 0.96243, 0.99800, 1.00316, 0.99000, 0.98869,
1.01500, 1.02304, 1.05000, 0.98107, 0.99000, 0.96077, 0.98618, 0.97000,
0.95675, 0.98835, 0.97300, 0.96200, 0.91971, 0.92620, 0.94582, 0.99291,
0.99200, 1.05000, 1.01500, 0.96800, 0.94859, 0.93822, 0.96681, 0.96700,
0.96300, 0.96438, 0.98400, 0.97959, 0.98000, 0.98799, 0.94192, 0.96662,
0.97000, 0.95377, 0.98500, 0.88745, 0.92024, 0.94488, 1.00500, 1.00206,
1.01598, 1.02500, 1.01178, 0.97702, 0.97017, 0.93377, 0.95500, 0.95200,
0.95400, 1.00199, 0.97162, 0.98500, 0.99246, 0.99500, 0.99800, 0.96269,
0.97828, 1.00500, 1.05000, 1.03678, 0.99932, 1.03500, 0.98400, 0.98626,
0.98000, 0.99100, 0.95800, 0.95473, 0.94300, 1.00600, 1.00008, 1.01148,
1.04000, 0.98881, 0.96363, 0.96244, 0.97699, 0.98500, 0.98392, 1.01500,
0.99053, 1.00500, 0.98500, 0.98000, 0.99000, 0.98075, 0.96795, 0.94780,
0.99708, 1.02909, 1.02309, 1.01000, 1.01700, 0.95209, 0.97567, 1.01000,
0.97100, 0.96500, 0.94646, 0.95200, 0.95931, 0.95753, 0.97300, 0.98000,
0.97500, 0.99300, 0.95995, 0.95870, 1.00500, 0.97135, 0.94188]
u, R, I = build_gurobi_model(case118)
Vhat, theta = recover_original_variables(u, I)
Vhat_e = [0]*(len(Vhat)+1) # external numbering
i2e = case118.i2e
# TODO make a vectorized version of this
for bus, v in enumerate(Vhat):
Vhat_e[i2e[bus]] = v
assert_allclose(V, Vhat_e, rtol=4e-2)