-
Notifications
You must be signed in to change notification settings - Fork 458
Expand file tree
/
Copy pathmateqn_test.py
More file actions
306 lines (263 loc) · 11.4 KB
/
Copy pathmateqn_test.py
File metadata and controls
306 lines (263 loc) · 11.4 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
#!/usr/bin/env python
from __future__ import print_function
#
# mateqn_test.py - test wuit for matrix equation solvers
#
#! Currently uses numpy.testing framework; will dump you out of unittest
#! if an error occurs. Should figure out the right way to fix this.
""" Test cases for lyap, dlyap, care and dare functions in the file
pyctrl_lin_alg.py. """
"""Copyright (c) 2011, All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
3. Neither the name of the project author nor the names of its
contributors may be used to endorse or promote products derived
from this software without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL CALTECH
OR THE CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF
USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
SUCH DAMAGE.
Author: Bjorn Olofsson
"""
import unittest
from numpy import array
from numpy.testing import assert_array_almost_equal, assert_array_less, \
assert_raises
# need scipy version of eigvals for generalized eigenvalue problem
from scipy.linalg import eigvals, solve
from scipy import zeros,dot
from control.mateqn import lyap,dlyap,care,dare
from control.exception import slycot_check, ControlArgument
@unittest.skipIf(not slycot_check(), "slycot not installed")
class TestMatrixEquations(unittest.TestCase):
"""These are tests for the matrix equation solvers in mateqn.py"""
def test_lyap(self):
A = array([[-1, 1],[-1, 0]])
Q = array([[1,0],[0,1]])
X = lyap(A,Q)
# print("The solution obtained is ", X)
assert_array_almost_equal(A.dot(X) + X.dot(A.T) + Q, zeros((2,2)))
A = array([[1, 2],[-3, -4]])
Q = array([[3, 1],[1, 1]])
X = lyap(A,Q)
# print("The solution obtained is ", X)
assert_array_almost_equal(A.dot(X) + X.dot(A.T) + Q, zeros((2,2)))
def test_lyap_sylvester(self):
A = 5
B = array([[4, 3], [4, 3]])
C = array([2, 1])
X = lyap(A,B,C)
# print("The solution obtained is ", X)
assert_array_almost_equal(A * X + X.dot(B) + C, zeros((1,2)))
A = array([[2,1],[1,2]])
B = array([[1,2],[0.5,0.1]])
C = array([[1,0],[0,1]])
X = lyap(A,B,C)
# print("The solution obtained is ", X)
assert_array_almost_equal(A.dot(X) + X.dot(B) + C, zeros((2,2)))
def test_lyap_g(self):
A = array([[-1, 2],[-3, -4]])
Q = array([[3, 1],[1, 1]])
E = array([[1,2],[2,1]])
X = lyap(A,Q,None,E)
# print("The solution obtained is ", X)
assert_array_almost_equal(A.dot(X).dot(E.T) + E.dot(X).dot(A.T) + Q, zeros((2,2)))
def test_dlyap(self):
A = array([[-0.6, 0],[-0.1, -0.4]])
Q = array([[1,0],[0,1]])
X = dlyap(A,Q)
# print("The solution obtained is ", X)
assert_array_almost_equal(A.dot(X).dot(A.T) - X + Q, zeros((2,2)))
A = array([[-0.6, 0],[-0.1, -0.4]])
Q = array([[3, 1],[1, 1]])
X = dlyap(A,Q)
# print("The solution obtained is ", X)
assert_array_almost_equal(A.dot(X).dot(A.T) - X + Q, zeros((2,2)))
def test_dlyap_g(self):
A = array([[-0.6, 0],[-0.1, -0.4]])
Q = array([[3, 1],[1, 1]])
E = array([[1, 1],[2, 1]])
X = dlyap(A,Q,None,E)
# print("The solution obtained is ", X)
assert_array_almost_equal(A.dot(X).dot(A.T) - E.dot(X).dot(E.T) + Q, zeros((2,2)))
def test_dlyap_sylvester(self):
A = 5
B = array([[4, 3], [4, 3]])
C = array([2, 1])
X = dlyap(A,B,C)
# print("The solution obtained is ", X)
assert_array_almost_equal(A * X.dot(B.T) - X + C, zeros((1,2)))
A = array([[2,1],[1,2]])
B = array([[1,2],[0.5,0.1]])
C = array([[1,0],[0,1]])
X = dlyap(A,B,C)
# print("The solution obtained is ", X)
assert_array_almost_equal(A.dot(X).dot(B.T) - X + C, zeros((2,2)))
def test_care(self):
A = array([[-2, -1],[-1, -1]])
Q = array([[0, 0],[0, 1]])
B = array([[1, 0],[0, 4]])
X,L,G = care(A,B,Q)
# print("The solution obtained is", X)
assert_array_almost_equal(A.T.dot(X) + X.dot(A) - X.dot(B).dot(B.T).dot(X) + Q,
zeros((2,2)))
assert_array_almost_equal(B.T.dot(X), G)
def test_care_g(self):
A = array([[-2, -1],[-1, -1]])
Q = array([[0, 0],[0, 1]])
B = array([[1, 0],[0, 4]])
R = array([[2, 0],[0, 1]])
S = array([[0, 0],[0, 0]])
E = array([[2, 1],[1, 2]])
X,L,G = care(A,B,Q,R,S,E)
# print("The solution obtained is", X)
Gref = solve(R, B.T.dot(X).dot(E) + S.T)
assert_array_almost_equal(Gref, G)
assert_array_almost_equal(
A.T.dot(X).dot(E) + E.T.dot(X).dot(A)
- (E.T.dot(X).dot(B) + S).dot(Gref) + Q,
zeros((2,2)))
A = array([[-2, -1],[-1, -1]])
Q = array([[0, 0],[0, 1]])
B = array([[1],[0]])
R = 1
S = array([[1],[0]])
E = array([[2, 1],[1, 2]])
X,L,G = care(A,B,Q,R,S,E)
# print("The solution obtained is", X)
Gref = 1/R * (B.T.dot(X).dot(E) + S.T)
assert_array_almost_equal(
A.T.dot(X).dot(E) + E.T.dot(X).dot(A)
- (E.T.dot(X).dot(B) + S).dot(Gref) + Q ,
zeros((2,2)))
assert_array_almost_equal(Gref , G)
def test_dare(self):
A = array([[-0.6, 0],[-0.1, -0.4]])
Q = array([[2, 1],[1, 0]])
B = array([[2, 1],[0, 1]])
R = array([[1, 0],[0, 1]])
X,L,G = dare(A,B,Q,R)
# print("The solution obtained is", X)
Gref = solve(B.T.dot(X).dot(B) + R, B.T.dot(X).dot(A))
assert_array_almost_equal(Gref, G)
assert_array_almost_equal(
A.T.dot(X).dot(A) - X -
A.T.dot(X).dot(B).dot(Gref) + Q,
zeros((2,2)))
# check for stable closed loop
lam = eigvals(A - B.dot(G))
assert_array_less(abs(lam), 1.0)
A = array([[1, 0],[-1, 1]])
Q = array([[0, 1],[1, 1]])
B = array([[1],[0]])
R = 2
X,L,G = dare(A,B,Q,R)
# print("The solution obtained is", X)
assert_array_almost_equal(
A.T.dot(X).dot(A) - X -
A.T.dot(X).dot(B) * solve(B.T.dot(X).dot(B) + R, B.T.dot(X).dot(A)) + Q, zeros((2,2)))
assert_array_almost_equal(B.T.dot(X).dot(A) / (B.T.dot(X).dot(B) + R), G)
# check for stable closed loop
lam = eigvals(A - B.dot(G))
assert_array_less(abs(lam), 1.0)
def test_dare_g(self):
A = array([[-0.6, 0],[-0.1, -0.4]])
Q = array([[2, 1],[1, 3]])
B = array([[1, 5],[2, 4]])
R = array([[1, 0],[0, 1]])
S = array([[1, 0],[2, 0]])
E = array([[2, 1],[1, 2]])
X,L,G = dare(A,B,Q,R,S,E)
# print("The solution obtained is", X)
Gref = solve(B.T.dot(X).dot(B) + R, B.T.dot(X).dot(A) + S.T)
assert_array_almost_equal(Gref,G)
assert_array_almost_equal(
A.T.dot(X).dot(A) - E.T.dot(X).dot(E)
- (A.T.dot(X).dot(B) + S).dot(Gref) + Q,
zeros((2,2)) )
# check for stable closed loop
lam = eigvals(A - B.dot(G), E)
assert_array_less(abs(lam), 1.0)
A = array([[-0.6, 0],[-0.1, -0.4]])
Q = array([[2, 1],[1, 3]])
B = array([[1],[2]])
R = 1
S = array([[1],[2]])
E = array([[2, 1],[1, 2]])
X,L,G = dare(A,B,Q,R,S,E)
# print("The solution obtained is", X)
assert_array_almost_equal(
A.T.dot(X).dot(A) - E.T.dot(X).dot(E) -
(A.T.dot(X).dot(B) + S).dot(solve(B.T.dot(X).dot(B) + R, B.T.dot(X).dot(A) + S.T)) + Q,
zeros((2,2)) )
assert_array_almost_equal((B.T.dot(X).dot(A) + S.T) / (B.T.dot(X).dot(B) + R), G)
# check for stable closed loop
lam = eigvals(A - B.dot(G), E)
assert_array_less(abs(lam), 1.0)
def test_raise(self):
""" Test exception raise for invalid inputs """
# correct shapes and forms
A = array([[1, 0], [-1, -1]])
Q = array([[2, 1], [1, 2]])
C = array([[1, 0], [0, 1]])
E = array([[2, 1], [1, 2]])
# these fail
Afq = array([[1, 0, 0], [-1, -1, 0]])
Qfq = array([[2, 1, 0], [1, 2, 0]])
Qfs = array([[2, 1], [-1, 2]])
Cfd = array([[1, 0, 0], [0, 1, 0]])
Efq = array([[2, 1, 0], [1, 2, 0]])
for cdlyap in [lyap, dlyap]:
assert_raises(ControlArgument, cdlyap, Afq, Q)
assert_raises(ControlArgument, cdlyap, A, Qfq)
assert_raises(ControlArgument, cdlyap, A, Qfs)
assert_raises(ControlArgument, cdlyap, Afq, Q, C)
assert_raises(ControlArgument, cdlyap, A, Qfq, C)
assert_raises(ControlArgument, cdlyap, A, Q, Cfd)
assert_raises(ControlArgument, cdlyap, A, Qfq, None, E)
assert_raises(ControlArgument, cdlyap, A, Q, None, Efq)
assert_raises(ControlArgument, cdlyap, A, Qfs, None, E)
assert_raises(ControlArgument, cdlyap, A, Q, C, E)
B = array([[1, 0], [0, 1]])
Bf = array([[1, 0], [0, 1], [1, 1]])
R = Q
Rfs = Qfs
Rfq = Qfq
S = array([[0, 0], [0, 0]])
Sf = array([[0, 0, 0], [0, 0, 0]])
E = array([[2, 1], [1, 2]])
Ef = array([[2, 1], [1, 2], [1, 2]])
assert_raises(ControlArgument, care, Afq, B, Q)
assert_raises(ControlArgument, care, A, B, Qfq)
assert_raises(ControlArgument, care, A, Bf, Q)
assert_raises(ControlArgument, care, 1, B, 1)
assert_raises(ControlArgument, care, A, B, Qfs)
assert_raises(ValueError, dare, A, B, Q, Rfs)
for cdare in [care, dare]:
assert_raises(ControlArgument, cdare, Afq, B, Q, R, S, E)
assert_raises(ControlArgument, cdare, A, B, Qfq, R, S, E)
assert_raises(ControlArgument, cdare, A, Bf, Q, R, S, E)
assert_raises(ControlArgument, cdare, A, B, Q, R, S, Ef)
assert_raises(ControlArgument, cdare, A, B, Q, Rfq, S, E)
assert_raises(ControlArgument, cdare, A, B, Q, R, Sf, E)
assert_raises(ControlArgument, cdare, A, B, Qfs, R, S, E)
assert_raises(ControlArgument, cdare, A, B, Q, Rfs, S, E)
assert_raises(ControlArgument, cdare, A, B, Q, R, S)
def suite():
return unittest.TestLoader().loadTestsFromTestCase(TestMatrixEquations)
if __name__ == "__main__":
unittest.main()