/
test_interpolation.py
558 lines (435 loc) · 18.8 KB
/
test_interpolation.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
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
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
from math import sin, floor
import numpy as np
import pytest
from devito import (Grid, Operator, Dimension, SparseFunction, SparseTimeFunction,
Function, TimeFunction,
PrecomputedSparseFunction, PrecomputedSparseTimeFunction,
MatrixSparseTimeFunction)
from devito.symbolics import FLOAT
from examples.seismic import (demo_model, TimeAxis, RickerSource, Receiver,
AcquisitionGeometry)
from examples.seismic.acoustic import AcousticWaveSolver
import scipy.sparse
def unit_box(name='a', shape=(11, 11), grid=None):
"""Create a field with value 0. to 1. in each dimension"""
grid = grid or Grid(shape=shape)
a = Function(name=name, grid=grid)
dims = tuple([np.linspace(0., 1., d) for d in shape])
a.data[:] = np.meshgrid(*dims)[1]
return a
def unit_box_time(name='a', shape=(11, 11)):
"""Create a field with value 0. to 1. in each dimension"""
grid = Grid(shape=shape)
a = TimeFunction(name=name, grid=grid, time_order=1)
dims = tuple([np.linspace(0., 1., d) for d in shape])
a.data[0, :] = np.meshgrid(*dims)[1]
a.data[1, :] = np.meshgrid(*dims)[1]
return a
def points(grid, ranges, npoints, name='points'):
"""Create a set of sparse points from a set of coordinate
ranges for each spatial dimension.
"""
points = SparseFunction(name=name, grid=grid, npoint=npoints)
for i, r in enumerate(ranges):
points.coordinates.data[:, i] = np.linspace(r[0], r[1], npoints)
return points
def time_points(grid, ranges, npoints, name='points', nt=10):
"""Create a set of sparse points from a set of coordinate
ranges for each spatial dimension.
"""
points = SparseTimeFunction(name=name, grid=grid, npoint=npoints, nt=nt)
for i, r in enumerate(ranges):
points.coordinates.data[:, i] = np.linspace(r[0], r[1], npoints)
return points
def a(shape=(11, 11)):
grid = Grid(shape=shape)
a = Function(name='a', grid=grid)
xarr = np.linspace(0., 1., shape[0])
yarr = np.linspace(0., 1., shape[1])
a.data[:] = np.meshgrid(xarr, yarr)[1]
return a
def at(shape=(11, 11)):
grid = Grid(shape=shape)
a = TimeFunction(name='a', grid=grid)
xarr = np.linspace(0., 1., shape[0])
yarr = np.linspace(0., 1., shape[1])
a.data[:] = np.meshgrid(xarr, yarr)[1]
return a
def custom_points(grid, ranges, npoints, name='points'):
"""Create a set of sparse points from a set of coordinate
ranges for each spatial dimension.
"""
scale = Dimension(name="scale")
dim = Dimension(name="dim")
points = SparseFunction(name=name, grid=grid, dimensions=(scale, dim),
shape=(3, npoints), npoint=npoints)
for i, r in enumerate(ranges):
points.coordinates.data[:, i] = np.linspace(r[0], r[1], npoints)
return points
def precompute_linear_interpolation(points, grid, origin):
""" Sample precompute function that, given point and grid information
precomputes gridpoints and interpolation coefficients according to a linear
scheme to be used in PrecomputedSparseFunction.
"""
gridpoints = [tuple(floor((point[i]-origin[i])/grid.spacing[i])
for i in range(len(point))) for point in points]
interpolation_coeffs = np.zeros((len(points), 2, 2))
for i, point in enumerate(points):
for d in range(grid.dim):
interpolation_coeffs[i, d, 0] = ((gridpoints[i][d] + 1)*grid.spacing[d] -
point[d])/grid.spacing[d]
interpolation_coeffs[i, d, 1] = (point[d]-gridpoints[i][d]*grid.spacing[d])\
/ grid.spacing[d]
return gridpoints, interpolation_coeffs
def test_precomputed_interpolation():
""" Test interpolation with PrecomputedSparseFunction which accepts
precomputed values for interpolation coefficients
"""
shape = (101, 101)
points = [(.05, .9), (.01, .8), (0.07, 0.84)]
origin = (0, 0)
grid = Grid(shape=shape, origin=origin)
r = 2 # Constant for linear interpolation
# because we interpolate across 2 neighbouring points in each dimension
def init(data):
for i in range(data.shape[0]):
for j in range(data.shape[1]):
data[i, j] = sin(grid.spacing[0]*i) + sin(grid.spacing[1]*j)
return data
m = Function(name='m', grid=grid, initializer=init, space_order=0)
gridpoints, interpolation_coeffs = precompute_linear_interpolation(points,
grid, origin)
sf = PrecomputedSparseFunction(name='s', grid=grid, r=r, npoint=len(points),
gridpoints=gridpoints,
interpolation_coeffs=interpolation_coeffs)
eqn = sf.interpolate(m)
op = Operator(eqn)
op()
expected_values = [sin(point[0]) + sin(point[1]) for point in points]
assert(all(np.isclose(sf.data, expected_values, rtol=1e-6)))
def test_precomputed_interpolation_time():
""" Test interpolation with PrecomputedSparseFunction which accepts
precomputed values for interpolation coefficients, but this time
with a TimeFunction
"""
shape = (101, 101)
points = [(.05, .9), (.01, .8), (0.07, 0.84)]
origin = (0, 0)
grid = Grid(shape=shape, origin=origin)
r = 2 # Constant for linear interpolation
# because we interpolate across 2 neighbouring points in each dimension
u = TimeFunction(name='u', grid=grid, space_order=0, save=5)
for it in range(5):
u.data[it, :] = it
gridpoints, interpolation_coeffs = precompute_linear_interpolation(points,
grid, origin)
sf = PrecomputedSparseTimeFunction(name='s', grid=grid, r=r, npoint=len(points),
nt=5, gridpoints=gridpoints,
interpolation_coeffs=interpolation_coeffs)
assert sf.data.shape == (5, 3)
eqn = sf.interpolate(u)
op = Operator(eqn)
op(time_m=0, time_M=4)
for it in range(5):
assert np.allclose(sf.data[it, :], it)
@pytest.mark.parametrize('shape, coords', [
((11, 11), [(.05, .9), (.01, .8)]),
((11, 11, 11), [(.05, .9), (.01, .8), (0.07, 0.84)])
])
def test_interpolate(shape, coords, npoints=20):
"""Test generic point interpolation testing the x-coordinate of an
abitrary set of points going across the grid.
"""
a = unit_box(shape=shape)
p = points(a.grid, coords, npoints=npoints)
xcoords = p.coordinates.data[:, 0]
expr = p.interpolate(a)
Operator(expr)(a=a)
assert np.allclose(p.data[:], xcoords, rtol=1e-6)
@pytest.mark.parametrize('shape, coords', [
((11, 11), [(.05, .9), (.01, .8)]),
((11, 11, 11), [(.05, .9), (.01, .8), (0.07, 0.84)])
])
def test_interpolate_cumm(shape, coords, npoints=20):
"""Test generic point interpolation testing the x-coordinate of an
abitrary set of points going across the grid.
"""
a = unit_box(shape=shape)
p = points(a.grid, coords, npoints=npoints)
xcoords = p.coordinates.data[:, 0]
p.data[:] = 1.
expr = p.interpolate(a, increment=True)
Operator(expr)(a=a)
assert np.allclose(p.data[:], xcoords + 1., rtol=1e-6)
@pytest.mark.parametrize('shape, coords', [
((11, 11), [(.05, .9), (.01, .8)]),
((11, 11, 11), [(.05, .9), (.01, .8), (0.07, 0.84)])
])
def test_interpolate_time_shift(shape, coords, npoints=20):
"""Test generic point interpolation testing the x-coordinate of an
abitrary set of points going across the grid.
This test verifies the optional time shifting for SparseTimeFunctions
"""
a = unit_box_time(shape=shape)
p = time_points(a.grid, coords, npoints=npoints, nt=10)
xcoords = p.coordinates.data[:, 0]
p.data[:] = 1.
expr = p.interpolate(a, u_t=a.indices[0]+1)
Operator(expr)(a=a)
assert np.allclose(p.data[0, :], xcoords, rtol=1e-6)
p.data[:] = 1.
expr = p.interpolate(a, p_t=p.indices[0]+1)
Operator(expr)(a=a)
assert np.allclose(p.data[1, :], xcoords, rtol=1e-6)
p.data[:] = 1.
expr = p.interpolate(a, u_t=a.indices[0]+1,
p_t=p.indices[0]+1)
Operator(expr)(a=a)
assert np.allclose(p.data[1, :], xcoords, rtol=1e-6)
@pytest.mark.parametrize('shape, coords', [
((11, 11), [(.05, .9), (.01, .8)]),
((11, 11, 11), [(.05, .9), (.01, .8), (0.07, 0.84)])
])
def test_interpolate_array(shape, coords, npoints=20):
"""Test generic point interpolation testing the x-coordinate of an
abitrary set of points going across the grid.
"""
a = unit_box(shape=shape)
p = points(a.grid, coords, npoints=npoints)
xcoords = p.coordinates.data[:, 0]
expr = p.interpolate(a)
Operator(expr)(a=a, points=p.data[:])
assert np.allclose(p.data[:], xcoords, rtol=1e-6)
@pytest.mark.parametrize('shape, coords', [
((11, 11), [(.05, .9), (.01, .8)]),
((11, 11, 11), [(.05, .9), (.01, .8), (0.07, 0.84)])
])
def test_interpolate_custom(shape, coords, npoints=20):
"""Test generic point interpolation testing the x-coordinate of an
abitrary set of points going across the grid.
"""
a = unit_box(shape=shape)
p = custom_points(a.grid, coords, npoints=npoints)
xcoords = p.coordinates.data[:, 0]
p.data[:] = 1.
expr = p.interpolate(a * p.indices[0])
Operator(expr)(a=a)
assert np.allclose(p.data[0, :], 0.0 * xcoords, rtol=1e-6)
assert np.allclose(p.data[1, :], 1.0 * xcoords, rtol=1e-6)
assert np.allclose(p.data[2, :], 2.0 * xcoords, rtol=1e-6)
def test_interpolation_dx():
"""
Test interpolation of a SparseFunction from a Derivative of
a Function.
"""
u = unit_box(shape=(11, 11))
sf1 = SparseFunction(name='s', grid=u.grid, npoint=1)
sf1.coordinates.data[0, :] = (0.5, 0.5)
op = Operator(sf1.interpolate(u.dx))
assert sf1.data.shape == (1,)
u.data[:] = 0.0
u.data[5, 5] = 4.0
u.data[4, 5] = 2.0
u.data[6, 5] = 2.0
op.apply()
# Exactly in the middle of 4 points, only 1 nonzero is 4
assert sf1.data[0] == pytest.approx(-20.0)
@pytest.mark.parametrize('shape, coords', [
((11, 11), [(.05, .9), (.01, .8)]),
((11, 11, 11), [(.05, .9), (.01, .8), (0.07, 0.84)])
])
def test_interpolate_indexed(shape, coords, npoints=20):
"""Test generic point interpolation testing the x-coordinate of an
abitrary set of points going across the grid. Unlike other tests,
here we interpolate an expression built using the indexed notation.
"""
a = unit_box(shape=shape)
p = custom_points(a.grid, coords, npoints=npoints)
xcoords = p.coordinates.data[:, 0]
p.data[:] = 1.
expr = p.interpolate(a[a.grid.dimensions] * p.indices[0])
Operator(expr)(a=a)
assert np.allclose(p.data[0, :], 0.0 * xcoords, rtol=1e-6)
assert np.allclose(p.data[1, :], 1.0 * xcoords, rtol=1e-6)
assert np.allclose(p.data[2, :], 2.0 * xcoords, rtol=1e-6)
@pytest.mark.parametrize('shape, coords, result', [
((11, 11), [(.05, .95), (.45, .45)], 1.),
((11, 11, 11), [(.05, .95), (.45, .45), (.45, .45)], 0.5)
])
def test_inject(shape, coords, result, npoints=19):
"""Test point injection with a set of points forming a line
through the middle of the grid.
"""
a = unit_box(shape=shape)
a.data[:] = 0.
p = points(a.grid, ranges=coords, npoints=npoints)
expr = p.inject(a, FLOAT(1.))
Operator(expr)(a=a)
indices = [slice(4, 6, 1) for _ in coords]
indices[0] = slice(1, -1, 1)
assert np.allclose(a.data[indices], result, rtol=1.e-5)
@pytest.mark.parametrize('shape, coords, result', [
((11, 11), [(.05, .95), (.45, .45)], 1.),
((11, 11, 11), [(.05, .95), (.45, .45), (.45, .45)], 0.5)
])
def test_inject_time_shift(shape, coords, result, npoints=19):
"""Test generic point injection testing the x-coordinate of an
abitrary set of points going across the grid.
This test verifies the optional time shifting for SparseTimeFunctions
"""
a = unit_box_time(shape=shape)
a.data[:] = 0.
p = time_points(a.grid, ranges=coords, npoints=npoints)
expr = p.inject(a, FLOAT(1.), u_t=a.indices[0]+1)
Operator(expr)(a=a, time=1)
indices = [slice(1, 1, 1)] + [slice(4, 6, 1) for _ in coords]
indices[1] = slice(1, -1, 1)
assert np.allclose(a.data[indices], result, rtol=1.e-5)
a.data[:] = 0.
expr = p.inject(a, FLOAT(1.), p_t=p.indices[0]+1)
Operator(expr)(a=a, time=1)
indices = [slice(0, 0, 1)] + [slice(4, 6, 1) for _ in coords]
indices[1] = slice(1, -1, 1)
assert np.allclose(a.data[indices], result, rtol=1.e-5)
a.data[:] = 0.
expr = p.inject(a, FLOAT(1.), u_t=a.indices[0]+1, p_t=p.indices[0]+1)
Operator(expr)(a=a, time=1)
indices = [slice(1, 1, 1)] + [slice(4, 6, 1) for _ in coords]
indices[1] = slice(1, -1, 1)
assert np.allclose(a.data[indices], result, rtol=1.e-5)
@pytest.mark.parametrize('shape, coords, result', [
((11, 11), [(.05, .95), (.45, .45)], 1.),
((11, 11, 11), [(.05, .95), (.45, .45), (.45, .45)], 0.5)
])
def test_inject_array(shape, coords, result, npoints=19):
"""Test point injection with a set of points forming a line
through the middle of the grid.
"""
a = unit_box(shape=shape)
a.data[:] = 0.
p = points(a.grid, ranges=coords, npoints=npoints)
p2 = points(a.grid, ranges=coords, npoints=npoints, name='p2')
p2.data[:] = 1.
expr = p.inject(a, p)
Operator(expr)(a=a, points=p2.data[:])
indices = [slice(4, 6, 1) for _ in coords]
indices[0] = slice(1, -1, 1)
assert np.allclose(a.data[indices], result, rtol=1.e-5)
@pytest.mark.parametrize('shape, coords, result', [
((11, 11), [(.05, .95), (.45, .45)], 1.),
((11, 11, 11), [(.05, .95), (.45, .45), (.45, .45)], 0.5)
])
def test_inject_from_field(shape, coords, result, npoints=19):
"""Test point injection from a second field along a line
through the middle of the grid.
"""
a = unit_box(shape=shape)
a.data[:] = 0.
b = Function(name='b', grid=a.grid)
b.data[:] = 1.
p = points(a.grid, ranges=coords, npoints=npoints)
expr = p.inject(field=a, expr=b)
Operator(expr)(a=a, b=b)
indices = [slice(4, 6, 1) for _ in coords]
indices[0] = slice(1, -1, 1)
assert np.allclose(a.data[indices], result, rtol=1.e-5)
@pytest.mark.parametrize('shape', [(50, 50, 50)])
def test_position(shape):
t0 = 0.0 # Start time
tn = 500. # Final time
nrec = 130 # Number of receivers
# Create model from preset
model = demo_model('constant-isotropic', spacing=[15. for _ in shape],
shape=shape, nbl=10)
# Derive timestepping from model spacing
dt = model.critical_dt
time_range = TimeAxis(start=t0, stop=tn, step=dt)
# Source and receiver geometries
src_coordinates = np.empty((1, len(shape)))
src_coordinates[0, :] = np.array(model.domain_size) * .5
src_coordinates[0, -1] = 30.
rec_coordinates = np.empty((nrec, len(shape)))
rec_coordinates[:, 0] = np.linspace(0., model.domain_size[0], num=nrec)
rec_coordinates[:, 1:] = src_coordinates[0, 1:]
geometry = AcquisitionGeometry(model, rec_coordinates, src_coordinates,
t0=t0, tn=tn, src_type='Ricker', f0=0.010)
# Create solver object to provide relevant operators
solver = AcousticWaveSolver(model, geometry, time_order=2, space_order=4)
rec, u, _ = solver.forward(save=False)
# Define source geometry (center of domain, just below surface) with 100. origin
src = RickerSource(name='src', grid=model.grid, f0=0.01, time_range=time_range)
src.coordinates.data[0, :] = np.array(model.domain_size) * .5 + 100.
src.coordinates.data[0, -1] = 130.
# Define receiver geometry (same as source, but spread across x)
rec2 = Receiver(name='rec', grid=model.grid, time_range=time_range, npoint=nrec)
rec2.coordinates.data[:, 0] = np.linspace(100., 100. + model.domain_size[0],
num=nrec)
rec2.coordinates.data[:, 1:] = src.coordinates.data[0, 1:]
ox_g, oy_g, oz_g = tuple(o + 100. for o in model.grid.origin)
rec1, u1, _ = solver.forward(save=False, src=src, rec=rec2,
o_x=ox_g, o_y=oy_g, o_z=oz_g)
assert(np.allclose(rec.data, rec1.data, atol=1e-5))
def test_edge_sparse():
"""
Test that interpolation uses the correct point for the edge case
where the sparse point is at the origin with non rational grid spacing.
Due to round up error the interpolation would use the halo point instead of
the point (0, 0) without the factorizaion of the expressions.
"""
grid = Grid(shape=(16, 16), extent=(225., 225.), origin=(25., 35.))
u = unit_box(shape=(16, 16), grid=grid)
u._data_with_outhalo[:u.space_order, :] = -1
u._data_with_outhalo[:, :u.space_order] = -1
sf1 = SparseFunction(name='s', grid=u.grid, npoint=1)
sf1.coordinates.data[0, :] = (25.0, 35.0)
expr = sf1.interpolate(u)
subs = {d.spacing: v for d, v in zip(u.grid.dimensions, u.grid.spacing)}
op = Operator(expr, subs=subs)
op()
assert sf1.data[0] == 0
def test_msf_interpolate():
""" Test interpolation with MatrixSparseTimeFunction which accepts
precomputed values for interpolation coefficients, but this time
with a TimeFunction
"""
shape = (101, 101)
points = [(.05, .9), (.01, .8), (0.07, 0.84)]
origin = (0, 0)
grid = Grid(shape=shape, origin=origin)
r = 2 # Constant for linear interpolation
# because we interpolate across 2 neighbouring points in each dimension
u = TimeFunction(name='u', grid=grid, space_order=0, save=5)
for it in range(5):
u.data[it, :] = it
gridpoints, interpolation_coeffs = precompute_linear_interpolation(points,
grid, origin)
matrix = scipy.sparse.eye(len(points))
sf = MatrixSparseTimeFunction(
name='s', grid=grid, r=r, matrix=matrix, nt=5
)
sf.gridpoints.data[:] = gridpoints
sf.coefficients_x.data[:] = interpolation_coeffs[:, 0, :]
sf.coefficients_y.data[:] = interpolation_coeffs[:, 0, :]
assert sf.data.shape == (5, 3)
eqn = sf.interpolate(u)
op = Operator(eqn)
print(op)
sf.manual_scatter()
op(time_m=0, time_M=4)
sf.manual_gather()
for it in range(5):
assert np.allclose(sf.data[it, :], it)
# Now test injection
u.data[:] = 0
eqn_inject = sf.inject(field=u, expr=sf)
op2 = Operator(eqn_inject)
print(op2)
op2(time_m=0, time_M=4)
# There should be 4 points touched for each source point
# (5, 90), (1, 80), (7, 84) and x+1, y+1 for each
nzt, nzx, nzy = np.nonzero(u.data)
assert np.all(np.unique(nzx) == np.array([1, 2, 5, 6, 7, 8]))
assert np.all(np.unique(nzy) == np.array([80, 81, 84, 85, 90, 91]))
assert np.all(np.unique(nzt) == np.array([1, 2, 3, 4]))
# 12 points x 4 timesteps
assert nzt.size == 48