Chris@87
|
1 """Tests for laguerre module.
|
Chris@87
|
2
|
Chris@87
|
3 """
|
Chris@87
|
4 from __future__ import division, absolute_import, print_function
|
Chris@87
|
5
|
Chris@87
|
6 import numpy as np
|
Chris@87
|
7 import numpy.polynomial.laguerre as lag
|
Chris@87
|
8 from numpy.polynomial.polynomial import polyval
|
Chris@87
|
9 from numpy.testing import (
|
Chris@87
|
10 TestCase, assert_almost_equal, assert_raises,
|
Chris@87
|
11 assert_equal, assert_, run_module_suite)
|
Chris@87
|
12
|
Chris@87
|
13 L0 = np.array([1])/1
|
Chris@87
|
14 L1 = np.array([1, -1])/1
|
Chris@87
|
15 L2 = np.array([2, -4, 1])/2
|
Chris@87
|
16 L3 = np.array([6, -18, 9, -1])/6
|
Chris@87
|
17 L4 = np.array([24, -96, 72, -16, 1])/24
|
Chris@87
|
18 L5 = np.array([120, -600, 600, -200, 25, -1])/120
|
Chris@87
|
19 L6 = np.array([720, -4320, 5400, -2400, 450, -36, 1])/720
|
Chris@87
|
20
|
Chris@87
|
21 Llist = [L0, L1, L2, L3, L4, L5, L6]
|
Chris@87
|
22
|
Chris@87
|
23
|
Chris@87
|
24 def trim(x):
|
Chris@87
|
25 return lag.lagtrim(x, tol=1e-6)
|
Chris@87
|
26
|
Chris@87
|
27
|
Chris@87
|
28 class TestConstants(TestCase):
|
Chris@87
|
29
|
Chris@87
|
30 def test_lagdomain(self):
|
Chris@87
|
31 assert_equal(lag.lagdomain, [0, 1])
|
Chris@87
|
32
|
Chris@87
|
33 def test_lagzero(self):
|
Chris@87
|
34 assert_equal(lag.lagzero, [0])
|
Chris@87
|
35
|
Chris@87
|
36 def test_lagone(self):
|
Chris@87
|
37 assert_equal(lag.lagone, [1])
|
Chris@87
|
38
|
Chris@87
|
39 def test_lagx(self):
|
Chris@87
|
40 assert_equal(lag.lagx, [1, -1])
|
Chris@87
|
41
|
Chris@87
|
42
|
Chris@87
|
43 class TestArithmetic(TestCase):
|
Chris@87
|
44 x = np.linspace(-3, 3, 100)
|
Chris@87
|
45
|
Chris@87
|
46 def test_lagadd(self):
|
Chris@87
|
47 for i in range(5):
|
Chris@87
|
48 for j in range(5):
|
Chris@87
|
49 msg = "At i=%d, j=%d" % (i, j)
|
Chris@87
|
50 tgt = np.zeros(max(i, j) + 1)
|
Chris@87
|
51 tgt[i] += 1
|
Chris@87
|
52 tgt[j] += 1
|
Chris@87
|
53 res = lag.lagadd([0]*i + [1], [0]*j + [1])
|
Chris@87
|
54 assert_equal(trim(res), trim(tgt), err_msg=msg)
|
Chris@87
|
55
|
Chris@87
|
56 def test_lagsub(self):
|
Chris@87
|
57 for i in range(5):
|
Chris@87
|
58 for j in range(5):
|
Chris@87
|
59 msg = "At i=%d, j=%d" % (i, j)
|
Chris@87
|
60 tgt = np.zeros(max(i, j) + 1)
|
Chris@87
|
61 tgt[i] += 1
|
Chris@87
|
62 tgt[j] -= 1
|
Chris@87
|
63 res = lag.lagsub([0]*i + [1], [0]*j + [1])
|
Chris@87
|
64 assert_equal(trim(res), trim(tgt), err_msg=msg)
|
Chris@87
|
65
|
Chris@87
|
66 def test_lagmulx(self):
|
Chris@87
|
67 assert_equal(lag.lagmulx([0]), [0])
|
Chris@87
|
68 assert_equal(lag.lagmulx([1]), [1, -1])
|
Chris@87
|
69 for i in range(1, 5):
|
Chris@87
|
70 ser = [0]*i + [1]
|
Chris@87
|
71 tgt = [0]*(i - 1) + [-i, 2*i + 1, -(i + 1)]
|
Chris@87
|
72 assert_almost_equal(lag.lagmulx(ser), tgt)
|
Chris@87
|
73
|
Chris@87
|
74 def test_lagmul(self):
|
Chris@87
|
75 # check values of result
|
Chris@87
|
76 for i in range(5):
|
Chris@87
|
77 pol1 = [0]*i + [1]
|
Chris@87
|
78 val1 = lag.lagval(self.x, pol1)
|
Chris@87
|
79 for j in range(5):
|
Chris@87
|
80 msg = "At i=%d, j=%d" % (i, j)
|
Chris@87
|
81 pol2 = [0]*j + [1]
|
Chris@87
|
82 val2 = lag.lagval(self.x, pol2)
|
Chris@87
|
83 pol3 = lag.lagmul(pol1, pol2)
|
Chris@87
|
84 val3 = lag.lagval(self.x, pol3)
|
Chris@87
|
85 assert_(len(pol3) == i + j + 1, msg)
|
Chris@87
|
86 assert_almost_equal(val3, val1*val2, err_msg=msg)
|
Chris@87
|
87
|
Chris@87
|
88 def test_lagdiv(self):
|
Chris@87
|
89 for i in range(5):
|
Chris@87
|
90 for j in range(5):
|
Chris@87
|
91 msg = "At i=%d, j=%d" % (i, j)
|
Chris@87
|
92 ci = [0]*i + [1]
|
Chris@87
|
93 cj = [0]*j + [1]
|
Chris@87
|
94 tgt = lag.lagadd(ci, cj)
|
Chris@87
|
95 quo, rem = lag.lagdiv(tgt, ci)
|
Chris@87
|
96 res = lag.lagadd(lag.lagmul(quo, ci), rem)
|
Chris@87
|
97 assert_almost_equal(trim(res), trim(tgt), err_msg=msg)
|
Chris@87
|
98
|
Chris@87
|
99
|
Chris@87
|
100 class TestEvaluation(TestCase):
|
Chris@87
|
101 # coefficients of 1 + 2*x + 3*x**2
|
Chris@87
|
102 c1d = np.array([9., -14., 6.])
|
Chris@87
|
103 c2d = np.einsum('i,j->ij', c1d, c1d)
|
Chris@87
|
104 c3d = np.einsum('i,j,k->ijk', c1d, c1d, c1d)
|
Chris@87
|
105
|
Chris@87
|
106 # some random values in [-1, 1)
|
Chris@87
|
107 x = np.random.random((3, 5))*2 - 1
|
Chris@87
|
108 y = polyval(x, [1., 2., 3.])
|
Chris@87
|
109
|
Chris@87
|
110 def test_lagval(self):
|
Chris@87
|
111 #check empty input
|
Chris@87
|
112 assert_equal(lag.lagval([], [1]).size, 0)
|
Chris@87
|
113
|
Chris@87
|
114 #check normal input)
|
Chris@87
|
115 x = np.linspace(-1, 1)
|
Chris@87
|
116 y = [polyval(x, c) for c in Llist]
|
Chris@87
|
117 for i in range(7):
|
Chris@87
|
118 msg = "At i=%d" % i
|
Chris@87
|
119 tgt = y[i]
|
Chris@87
|
120 res = lag.lagval(x, [0]*i + [1])
|
Chris@87
|
121 assert_almost_equal(res, tgt, err_msg=msg)
|
Chris@87
|
122
|
Chris@87
|
123 #check that shape is preserved
|
Chris@87
|
124 for i in range(3):
|
Chris@87
|
125 dims = [2]*i
|
Chris@87
|
126 x = np.zeros(dims)
|
Chris@87
|
127 assert_equal(lag.lagval(x, [1]).shape, dims)
|
Chris@87
|
128 assert_equal(lag.lagval(x, [1, 0]).shape, dims)
|
Chris@87
|
129 assert_equal(lag.lagval(x, [1, 0, 0]).shape, dims)
|
Chris@87
|
130
|
Chris@87
|
131 def test_lagval2d(self):
|
Chris@87
|
132 x1, x2, x3 = self.x
|
Chris@87
|
133 y1, y2, y3 = self.y
|
Chris@87
|
134
|
Chris@87
|
135 #test exceptions
|
Chris@87
|
136 assert_raises(ValueError, lag.lagval2d, x1, x2[:2], self.c2d)
|
Chris@87
|
137
|
Chris@87
|
138 #test values
|
Chris@87
|
139 tgt = y1*y2
|
Chris@87
|
140 res = lag.lagval2d(x1, x2, self.c2d)
|
Chris@87
|
141 assert_almost_equal(res, tgt)
|
Chris@87
|
142
|
Chris@87
|
143 #test shape
|
Chris@87
|
144 z = np.ones((2, 3))
|
Chris@87
|
145 res = lag.lagval2d(z, z, self.c2d)
|
Chris@87
|
146 assert_(res.shape == (2, 3))
|
Chris@87
|
147
|
Chris@87
|
148 def test_lagval3d(self):
|
Chris@87
|
149 x1, x2, x3 = self.x
|
Chris@87
|
150 y1, y2, y3 = self.y
|
Chris@87
|
151
|
Chris@87
|
152 #test exceptions
|
Chris@87
|
153 assert_raises(ValueError, lag.lagval3d, x1, x2, x3[:2], self.c3d)
|
Chris@87
|
154
|
Chris@87
|
155 #test values
|
Chris@87
|
156 tgt = y1*y2*y3
|
Chris@87
|
157 res = lag.lagval3d(x1, x2, x3, self.c3d)
|
Chris@87
|
158 assert_almost_equal(res, tgt)
|
Chris@87
|
159
|
Chris@87
|
160 #test shape
|
Chris@87
|
161 z = np.ones((2, 3))
|
Chris@87
|
162 res = lag.lagval3d(z, z, z, self.c3d)
|
Chris@87
|
163 assert_(res.shape == (2, 3))
|
Chris@87
|
164
|
Chris@87
|
165 def test_laggrid2d(self):
|
Chris@87
|
166 x1, x2, x3 = self.x
|
Chris@87
|
167 y1, y2, y3 = self.y
|
Chris@87
|
168
|
Chris@87
|
169 #test values
|
Chris@87
|
170 tgt = np.einsum('i,j->ij', y1, y2)
|
Chris@87
|
171 res = lag.laggrid2d(x1, x2, self.c2d)
|
Chris@87
|
172 assert_almost_equal(res, tgt)
|
Chris@87
|
173
|
Chris@87
|
174 #test shape
|
Chris@87
|
175 z = np.ones((2, 3))
|
Chris@87
|
176 res = lag.laggrid2d(z, z, self.c2d)
|
Chris@87
|
177 assert_(res.shape == (2, 3)*2)
|
Chris@87
|
178
|
Chris@87
|
179 def test_laggrid3d(self):
|
Chris@87
|
180 x1, x2, x3 = self.x
|
Chris@87
|
181 y1, y2, y3 = self.y
|
Chris@87
|
182
|
Chris@87
|
183 #test values
|
Chris@87
|
184 tgt = np.einsum('i,j,k->ijk', y1, y2, y3)
|
Chris@87
|
185 res = lag.laggrid3d(x1, x2, x3, self.c3d)
|
Chris@87
|
186 assert_almost_equal(res, tgt)
|
Chris@87
|
187
|
Chris@87
|
188 #test shape
|
Chris@87
|
189 z = np.ones((2, 3))
|
Chris@87
|
190 res = lag.laggrid3d(z, z, z, self.c3d)
|
Chris@87
|
191 assert_(res.shape == (2, 3)*3)
|
Chris@87
|
192
|
Chris@87
|
193
|
Chris@87
|
194 class TestIntegral(TestCase):
|
Chris@87
|
195
|
Chris@87
|
196 def test_lagint(self):
|
Chris@87
|
197 # check exceptions
|
Chris@87
|
198 assert_raises(ValueError, lag.lagint, [0], .5)
|
Chris@87
|
199 assert_raises(ValueError, lag.lagint, [0], -1)
|
Chris@87
|
200 assert_raises(ValueError, lag.lagint, [0], 1, [0, 0])
|
Chris@87
|
201
|
Chris@87
|
202 # test integration of zero polynomial
|
Chris@87
|
203 for i in range(2, 5):
|
Chris@87
|
204 k = [0]*(i - 2) + [1]
|
Chris@87
|
205 res = lag.lagint([0], m=i, k=k)
|
Chris@87
|
206 assert_almost_equal(res, [1, -1])
|
Chris@87
|
207
|
Chris@87
|
208 # check single integration with integration constant
|
Chris@87
|
209 for i in range(5):
|
Chris@87
|
210 scl = i + 1
|
Chris@87
|
211 pol = [0]*i + [1]
|
Chris@87
|
212 tgt = [i] + [0]*i + [1/scl]
|
Chris@87
|
213 lagpol = lag.poly2lag(pol)
|
Chris@87
|
214 lagint = lag.lagint(lagpol, m=1, k=[i])
|
Chris@87
|
215 res = lag.lag2poly(lagint)
|
Chris@87
|
216 assert_almost_equal(trim(res), trim(tgt))
|
Chris@87
|
217
|
Chris@87
|
218 # check single integration with integration constant and lbnd
|
Chris@87
|
219 for i in range(5):
|
Chris@87
|
220 scl = i + 1
|
Chris@87
|
221 pol = [0]*i + [1]
|
Chris@87
|
222 lagpol = lag.poly2lag(pol)
|
Chris@87
|
223 lagint = lag.lagint(lagpol, m=1, k=[i], lbnd=-1)
|
Chris@87
|
224 assert_almost_equal(lag.lagval(-1, lagint), i)
|
Chris@87
|
225
|
Chris@87
|
226 # check single integration with integration constant and scaling
|
Chris@87
|
227 for i in range(5):
|
Chris@87
|
228 scl = i + 1
|
Chris@87
|
229 pol = [0]*i + [1]
|
Chris@87
|
230 tgt = [i] + [0]*i + [2/scl]
|
Chris@87
|
231 lagpol = lag.poly2lag(pol)
|
Chris@87
|
232 lagint = lag.lagint(lagpol, m=1, k=[i], scl=2)
|
Chris@87
|
233 res = lag.lag2poly(lagint)
|
Chris@87
|
234 assert_almost_equal(trim(res), trim(tgt))
|
Chris@87
|
235
|
Chris@87
|
236 # check multiple integrations with default k
|
Chris@87
|
237 for i in range(5):
|
Chris@87
|
238 for j in range(2, 5):
|
Chris@87
|
239 pol = [0]*i + [1]
|
Chris@87
|
240 tgt = pol[:]
|
Chris@87
|
241 for k in range(j):
|
Chris@87
|
242 tgt = lag.lagint(tgt, m=1)
|
Chris@87
|
243 res = lag.lagint(pol, m=j)
|
Chris@87
|
244 assert_almost_equal(trim(res), trim(tgt))
|
Chris@87
|
245
|
Chris@87
|
246 # check multiple integrations with defined k
|
Chris@87
|
247 for i in range(5):
|
Chris@87
|
248 for j in range(2, 5):
|
Chris@87
|
249 pol = [0]*i + [1]
|
Chris@87
|
250 tgt = pol[:]
|
Chris@87
|
251 for k in range(j):
|
Chris@87
|
252 tgt = lag.lagint(tgt, m=1, k=[k])
|
Chris@87
|
253 res = lag.lagint(pol, m=j, k=list(range(j)))
|
Chris@87
|
254 assert_almost_equal(trim(res), trim(tgt))
|
Chris@87
|
255
|
Chris@87
|
256 # check multiple integrations with lbnd
|
Chris@87
|
257 for i in range(5):
|
Chris@87
|
258 for j in range(2, 5):
|
Chris@87
|
259 pol = [0]*i + [1]
|
Chris@87
|
260 tgt = pol[:]
|
Chris@87
|
261 for k in range(j):
|
Chris@87
|
262 tgt = lag.lagint(tgt, m=1, k=[k], lbnd=-1)
|
Chris@87
|
263 res = lag.lagint(pol, m=j, k=list(range(j)), lbnd=-1)
|
Chris@87
|
264 assert_almost_equal(trim(res), trim(tgt))
|
Chris@87
|
265
|
Chris@87
|
266 # check multiple integrations with scaling
|
Chris@87
|
267 for i in range(5):
|
Chris@87
|
268 for j in range(2, 5):
|
Chris@87
|
269 pol = [0]*i + [1]
|
Chris@87
|
270 tgt = pol[:]
|
Chris@87
|
271 for k in range(j):
|
Chris@87
|
272 tgt = lag.lagint(tgt, m=1, k=[k], scl=2)
|
Chris@87
|
273 res = lag.lagint(pol, m=j, k=list(range(j)), scl=2)
|
Chris@87
|
274 assert_almost_equal(trim(res), trim(tgt))
|
Chris@87
|
275
|
Chris@87
|
276 def test_lagint_axis(self):
|
Chris@87
|
277 # check that axis keyword works
|
Chris@87
|
278 c2d = np.random.random((3, 4))
|
Chris@87
|
279
|
Chris@87
|
280 tgt = np.vstack([lag.lagint(c) for c in c2d.T]).T
|
Chris@87
|
281 res = lag.lagint(c2d, axis=0)
|
Chris@87
|
282 assert_almost_equal(res, tgt)
|
Chris@87
|
283
|
Chris@87
|
284 tgt = np.vstack([lag.lagint(c) for c in c2d])
|
Chris@87
|
285 res = lag.lagint(c2d, axis=1)
|
Chris@87
|
286 assert_almost_equal(res, tgt)
|
Chris@87
|
287
|
Chris@87
|
288 tgt = np.vstack([lag.lagint(c, k=3) for c in c2d])
|
Chris@87
|
289 res = lag.lagint(c2d, k=3, axis=1)
|
Chris@87
|
290 assert_almost_equal(res, tgt)
|
Chris@87
|
291
|
Chris@87
|
292
|
Chris@87
|
293 class TestDerivative(TestCase):
|
Chris@87
|
294
|
Chris@87
|
295 def test_lagder(self):
|
Chris@87
|
296 # check exceptions
|
Chris@87
|
297 assert_raises(ValueError, lag.lagder, [0], .5)
|
Chris@87
|
298 assert_raises(ValueError, lag.lagder, [0], -1)
|
Chris@87
|
299
|
Chris@87
|
300 # check that zeroth deriviative does nothing
|
Chris@87
|
301 for i in range(5):
|
Chris@87
|
302 tgt = [0]*i + [1]
|
Chris@87
|
303 res = lag.lagder(tgt, m=0)
|
Chris@87
|
304 assert_equal(trim(res), trim(tgt))
|
Chris@87
|
305
|
Chris@87
|
306 # check that derivation is the inverse of integration
|
Chris@87
|
307 for i in range(5):
|
Chris@87
|
308 for j in range(2, 5):
|
Chris@87
|
309 tgt = [0]*i + [1]
|
Chris@87
|
310 res = lag.lagder(lag.lagint(tgt, m=j), m=j)
|
Chris@87
|
311 assert_almost_equal(trim(res), trim(tgt))
|
Chris@87
|
312
|
Chris@87
|
313 # check derivation with scaling
|
Chris@87
|
314 for i in range(5):
|
Chris@87
|
315 for j in range(2, 5):
|
Chris@87
|
316 tgt = [0]*i + [1]
|
Chris@87
|
317 res = lag.lagder(lag.lagint(tgt, m=j, scl=2), m=j, scl=.5)
|
Chris@87
|
318 assert_almost_equal(trim(res), trim(tgt))
|
Chris@87
|
319
|
Chris@87
|
320 def test_lagder_axis(self):
|
Chris@87
|
321 # check that axis keyword works
|
Chris@87
|
322 c2d = np.random.random((3, 4))
|
Chris@87
|
323
|
Chris@87
|
324 tgt = np.vstack([lag.lagder(c) for c in c2d.T]).T
|
Chris@87
|
325 res = lag.lagder(c2d, axis=0)
|
Chris@87
|
326 assert_almost_equal(res, tgt)
|
Chris@87
|
327
|
Chris@87
|
328 tgt = np.vstack([lag.lagder(c) for c in c2d])
|
Chris@87
|
329 res = lag.lagder(c2d, axis=1)
|
Chris@87
|
330 assert_almost_equal(res, tgt)
|
Chris@87
|
331
|
Chris@87
|
332
|
Chris@87
|
333 class TestVander(TestCase):
|
Chris@87
|
334 # some random values in [-1, 1)
|
Chris@87
|
335 x = np.random.random((3, 5))*2 - 1
|
Chris@87
|
336
|
Chris@87
|
337 def test_lagvander(self):
|
Chris@87
|
338 # check for 1d x
|
Chris@87
|
339 x = np.arange(3)
|
Chris@87
|
340 v = lag.lagvander(x, 3)
|
Chris@87
|
341 assert_(v.shape == (3, 4))
|
Chris@87
|
342 for i in range(4):
|
Chris@87
|
343 coef = [0]*i + [1]
|
Chris@87
|
344 assert_almost_equal(v[..., i], lag.lagval(x, coef))
|
Chris@87
|
345
|
Chris@87
|
346 # check for 2d x
|
Chris@87
|
347 x = np.array([[1, 2], [3, 4], [5, 6]])
|
Chris@87
|
348 v = lag.lagvander(x, 3)
|
Chris@87
|
349 assert_(v.shape == (3, 2, 4))
|
Chris@87
|
350 for i in range(4):
|
Chris@87
|
351 coef = [0]*i + [1]
|
Chris@87
|
352 assert_almost_equal(v[..., i], lag.lagval(x, coef))
|
Chris@87
|
353
|
Chris@87
|
354 def test_lagvander2d(self):
|
Chris@87
|
355 # also tests lagval2d for non-square coefficient array
|
Chris@87
|
356 x1, x2, x3 = self.x
|
Chris@87
|
357 c = np.random.random((2, 3))
|
Chris@87
|
358 van = lag.lagvander2d(x1, x2, [1, 2])
|
Chris@87
|
359 tgt = lag.lagval2d(x1, x2, c)
|
Chris@87
|
360 res = np.dot(van, c.flat)
|
Chris@87
|
361 assert_almost_equal(res, tgt)
|
Chris@87
|
362
|
Chris@87
|
363 # check shape
|
Chris@87
|
364 van = lag.lagvander2d([x1], [x2], [1, 2])
|
Chris@87
|
365 assert_(van.shape == (1, 5, 6))
|
Chris@87
|
366
|
Chris@87
|
367 def test_lagvander3d(self):
|
Chris@87
|
368 # also tests lagval3d for non-square coefficient array
|
Chris@87
|
369 x1, x2, x3 = self.x
|
Chris@87
|
370 c = np.random.random((2, 3, 4))
|
Chris@87
|
371 van = lag.lagvander3d(x1, x2, x3, [1, 2, 3])
|
Chris@87
|
372 tgt = lag.lagval3d(x1, x2, x3, c)
|
Chris@87
|
373 res = np.dot(van, c.flat)
|
Chris@87
|
374 assert_almost_equal(res, tgt)
|
Chris@87
|
375
|
Chris@87
|
376 # check shape
|
Chris@87
|
377 van = lag.lagvander3d([x1], [x2], [x3], [1, 2, 3])
|
Chris@87
|
378 assert_(van.shape == (1, 5, 24))
|
Chris@87
|
379
|
Chris@87
|
380
|
Chris@87
|
381 class TestFitting(TestCase):
|
Chris@87
|
382
|
Chris@87
|
383 def test_lagfit(self):
|
Chris@87
|
384 def f(x):
|
Chris@87
|
385 return x*(x - 1)*(x - 2)
|
Chris@87
|
386
|
Chris@87
|
387 # Test exceptions
|
Chris@87
|
388 assert_raises(ValueError, lag.lagfit, [1], [1], -1)
|
Chris@87
|
389 assert_raises(TypeError, lag.lagfit, [[1]], [1], 0)
|
Chris@87
|
390 assert_raises(TypeError, lag.lagfit, [], [1], 0)
|
Chris@87
|
391 assert_raises(TypeError, lag.lagfit, [1], [[[1]]], 0)
|
Chris@87
|
392 assert_raises(TypeError, lag.lagfit, [1, 2], [1], 0)
|
Chris@87
|
393 assert_raises(TypeError, lag.lagfit, [1], [1, 2], 0)
|
Chris@87
|
394 assert_raises(TypeError, lag.lagfit, [1], [1], 0, w=[[1]])
|
Chris@87
|
395 assert_raises(TypeError, lag.lagfit, [1], [1], 0, w=[1, 1])
|
Chris@87
|
396
|
Chris@87
|
397 # Test fit
|
Chris@87
|
398 x = np.linspace(0, 2)
|
Chris@87
|
399 y = f(x)
|
Chris@87
|
400 #
|
Chris@87
|
401 coef3 = lag.lagfit(x, y, 3)
|
Chris@87
|
402 assert_equal(len(coef3), 4)
|
Chris@87
|
403 assert_almost_equal(lag.lagval(x, coef3), y)
|
Chris@87
|
404 #
|
Chris@87
|
405 coef4 = lag.lagfit(x, y, 4)
|
Chris@87
|
406 assert_equal(len(coef4), 5)
|
Chris@87
|
407 assert_almost_equal(lag.lagval(x, coef4), y)
|
Chris@87
|
408 #
|
Chris@87
|
409 coef2d = lag.lagfit(x, np.array([y, y]).T, 3)
|
Chris@87
|
410 assert_almost_equal(coef2d, np.array([coef3, coef3]).T)
|
Chris@87
|
411 # test weighting
|
Chris@87
|
412 w = np.zeros_like(x)
|
Chris@87
|
413 yw = y.copy()
|
Chris@87
|
414 w[1::2] = 1
|
Chris@87
|
415 y[0::2] = 0
|
Chris@87
|
416 wcoef3 = lag.lagfit(x, yw, 3, w=w)
|
Chris@87
|
417 assert_almost_equal(wcoef3, coef3)
|
Chris@87
|
418 #
|
Chris@87
|
419 wcoef2d = lag.lagfit(x, np.array([yw, yw]).T, 3, w=w)
|
Chris@87
|
420 assert_almost_equal(wcoef2d, np.array([coef3, coef3]).T)
|
Chris@87
|
421 # test scaling with complex values x points whose square
|
Chris@87
|
422 # is zero when summed.
|
Chris@87
|
423 x = [1, 1j, -1, -1j]
|
Chris@87
|
424 assert_almost_equal(lag.lagfit(x, x, 1), [1, -1])
|
Chris@87
|
425
|
Chris@87
|
426
|
Chris@87
|
427 class TestCompanion(TestCase):
|
Chris@87
|
428
|
Chris@87
|
429 def test_raises(self):
|
Chris@87
|
430 assert_raises(ValueError, lag.lagcompanion, [])
|
Chris@87
|
431 assert_raises(ValueError, lag.lagcompanion, [1])
|
Chris@87
|
432
|
Chris@87
|
433 def test_dimensions(self):
|
Chris@87
|
434 for i in range(1, 5):
|
Chris@87
|
435 coef = [0]*i + [1]
|
Chris@87
|
436 assert_(lag.lagcompanion(coef).shape == (i, i))
|
Chris@87
|
437
|
Chris@87
|
438 def test_linear_root(self):
|
Chris@87
|
439 assert_(lag.lagcompanion([1, 2])[0, 0] == 1.5)
|
Chris@87
|
440
|
Chris@87
|
441
|
Chris@87
|
442 class TestGauss(TestCase):
|
Chris@87
|
443
|
Chris@87
|
444 def test_100(self):
|
Chris@87
|
445 x, w = lag.laggauss(100)
|
Chris@87
|
446
|
Chris@87
|
447 # test orthogonality. Note that the results need to be normalized,
|
Chris@87
|
448 # otherwise the huge values that can arise from fast growing
|
Chris@87
|
449 # functions like Laguerre can be very confusing.
|
Chris@87
|
450 v = lag.lagvander(x, 99)
|
Chris@87
|
451 vv = np.dot(v.T * w, v)
|
Chris@87
|
452 vd = 1/np.sqrt(vv.diagonal())
|
Chris@87
|
453 vv = vd[:, None] * vv * vd
|
Chris@87
|
454 assert_almost_equal(vv, np.eye(100))
|
Chris@87
|
455
|
Chris@87
|
456 # check that the integral of 1 is correct
|
Chris@87
|
457 tgt = 1.0
|
Chris@87
|
458 assert_almost_equal(w.sum(), tgt)
|
Chris@87
|
459
|
Chris@87
|
460
|
Chris@87
|
461 class TestMisc(TestCase):
|
Chris@87
|
462
|
Chris@87
|
463 def test_lagfromroots(self):
|
Chris@87
|
464 res = lag.lagfromroots([])
|
Chris@87
|
465 assert_almost_equal(trim(res), [1])
|
Chris@87
|
466 for i in range(1, 5):
|
Chris@87
|
467 roots = np.cos(np.linspace(-np.pi, 0, 2*i + 1)[1::2])
|
Chris@87
|
468 pol = lag.lagfromroots(roots)
|
Chris@87
|
469 res = lag.lagval(roots, pol)
|
Chris@87
|
470 tgt = 0
|
Chris@87
|
471 assert_(len(pol) == i + 1)
|
Chris@87
|
472 assert_almost_equal(lag.lag2poly(pol)[-1], 1)
|
Chris@87
|
473 assert_almost_equal(res, tgt)
|
Chris@87
|
474
|
Chris@87
|
475 def test_lagroots(self):
|
Chris@87
|
476 assert_almost_equal(lag.lagroots([1]), [])
|
Chris@87
|
477 assert_almost_equal(lag.lagroots([0, 1]), [1])
|
Chris@87
|
478 for i in range(2, 5):
|
Chris@87
|
479 tgt = np.linspace(0, 3, i)
|
Chris@87
|
480 res = lag.lagroots(lag.lagfromroots(tgt))
|
Chris@87
|
481 assert_almost_equal(trim(res), trim(tgt))
|
Chris@87
|
482
|
Chris@87
|
483 def test_lagtrim(self):
|
Chris@87
|
484 coef = [2, -1, 1, 0]
|
Chris@87
|
485
|
Chris@87
|
486 # Test exceptions
|
Chris@87
|
487 assert_raises(ValueError, lag.lagtrim, coef, -1)
|
Chris@87
|
488
|
Chris@87
|
489 # Test results
|
Chris@87
|
490 assert_equal(lag.lagtrim(coef), coef[:-1])
|
Chris@87
|
491 assert_equal(lag.lagtrim(coef, 1), coef[:-3])
|
Chris@87
|
492 assert_equal(lag.lagtrim(coef, 2), [0])
|
Chris@87
|
493
|
Chris@87
|
494 def test_lagline(self):
|
Chris@87
|
495 assert_equal(lag.lagline(3, 4), [7, -4])
|
Chris@87
|
496
|
Chris@87
|
497 def test_lag2poly(self):
|
Chris@87
|
498 for i in range(7):
|
Chris@87
|
499 assert_almost_equal(lag.lag2poly([0]*i + [1]), Llist[i])
|
Chris@87
|
500
|
Chris@87
|
501 def test_poly2lag(self):
|
Chris@87
|
502 for i in range(7):
|
Chris@87
|
503 assert_almost_equal(lag.poly2lag(Llist[i]), [0]*i + [1])
|
Chris@87
|
504
|
Chris@87
|
505 def test_weight(self):
|
Chris@87
|
506 x = np.linspace(0, 10, 11)
|
Chris@87
|
507 tgt = np.exp(-x)
|
Chris@87
|
508 res = lag.lagweight(x)
|
Chris@87
|
509 assert_almost_equal(res, tgt)
|
Chris@87
|
510
|
Chris@87
|
511
|
Chris@87
|
512 if __name__ == "__main__":
|
Chris@87
|
513 run_module_suite()
|