-
Notifications
You must be signed in to change notification settings - Fork 256
Expand file tree
/
Copy pathtest_differentiable.py
More file actions
167 lines (133 loc) · 5.76 KB
/
Copy pathtest_differentiable.py
File metadata and controls
167 lines (133 loc) · 5.76 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
from itertools import product
import numpy as np
import pytest
import sympy
from devito import NODE, Differentiable, Function, Grid
from devito.finite_differences.differentiable import (
Add, Mul, Pow, SafeInv, diffify, interp_for_fd
)
def test_differentiable():
a = Function(name="a", grid=Grid((10, 10)))
e = Function(name="e", grid=Grid((10, 10)))
assert isinstance(1.2 * a.dx, Mul)
assert isinstance(e + a, Add)
assert isinstance(e * a, Mul)
assert isinstance(a * a, Pow)
assert isinstance(1 / (a * a), Pow)
assert (a + e*a).dtype == a.dtype
addition = a + 1.2 * a.dx
assert isinstance(addition, Add)
assert all(isinstance(a, Differentiable) for a in addition.args)
assert addition.dtype == a.dtype
addition2 = a + e * a.dx
assert isinstance(addition2, Add)
assert all(isinstance(a, Differentiable) for a in addition2.args)
assert addition2.dtype == a.dtype
def test_diffify():
a = Function(name="a", grid=Grid((10, 10)))
e = Function(name="e", grid=Grid((10, 10)))
assert isinstance(diffify(sympy.Mul(*[1.2, a.dx])), Mul)
assert isinstance(diffify(sympy.Add(*[a, e])), Add)
assert isinstance(diffify(sympy.Mul(*[e, a])), Mul)
assert isinstance(diffify(sympy.Mul(*[a, a])), Pow)
assert isinstance(diffify(sympy.Pow(*[a*a, -1])), Pow)
addition = diffify(sympy.Add(*[a, sympy.Mul(*[1.2, a.dx])]))
assert isinstance(addition, Add)
assert all(isinstance(a, Differentiable) for a in addition.args)
addition2 = diffify(sympy.Add(*[a, sympy.Mul(*[e, a.dx])]))
assert isinstance(addition2, Add)
assert all(isinstance(a, Differentiable) for a in addition2.args)
def test_shift():
a = Function(name="a", grid=Grid((10, 10)))
x = a.dimensions[0]
assert a.shift(x, x.spacing) == a._subs(x, x + x.spacing)
assert a.shift(x, x.spacing).shift(x, -x.spacing) == a
assert a.shift(x, x.spacing).shift(x, x.spacing) == a.shift(x, 2*x.spacing)
assert a.dx.evaluate.shift(x, x.spacing) == a.shift(x, x.spacing).dx.evaluate
assert a.shift(x, .5 * x.spacing)._grid_map == {x: x + .5 * x.spacing, 'subs': {}}
def test_interp():
grid = Grid((10, 10))
x = grid.dimensions[0]
a = Function(name="a", grid=grid, staggered=NODE)
sa = Function(name="as", grid=grid, staggered=x)
def sp_diff(a, b):
a = getattr(a, 'evaluate', a)
b = getattr(b, 'evaluate', b)
return sympy.simplify(a - b) == 0
# Base case, no interp
assert interp_for_fd(a, {}) == a
assert interp_for_fd(a, {x: x}) == a
assert interp_for_fd(sa, {}) == sa
assert interp_for_fd(sa, {x: x + x.spacing/2}) == sa
# Base case, interp
assert sp_diff(interp_for_fd(a, {x: x + x.spacing/2}),
.5*a + .5*a.shift(x, x.spacing))
assert sp_diff(interp_for_fd(sa, {x: x}),
.5*sa + .5*sa.shift(x, -x.spacing))
# Mul case, split interp
assert sp_diff(interp_for_fd(a*sa, {x: x + x.spacing/2}),
sa * interp_for_fd(a, {x: x + x.spacing/2}))
assert sp_diff(interp_for_fd(a*sa, {x: x}),
a * interp_for_fd(sa, {x: x}))
# Add case, split interp
assert sp_diff(interp_for_fd(a + sa, {x: x + x.spacing/2}),
sa + interp_for_fd(a, {x: x + x.spacing/2}))
assert sp_diff(interp_for_fd(a + sa, {x: x}),
a + interp_for_fd(sa, {x: x}))
@pytest.mark.parametrize('ndim', [1, 2, 3])
@pytest.mark.parametrize('io', [None, 2, 4])
def test_avg_mode(ndim, io):
grid = Grid([11]*ndim)
v = Function(name='v', grid=grid, staggered=grid.dimensions, space_order=4)
kw = {'space_order': 4}
if io is not None:
kw['interp_order'] = io
else:
io = 2 # Default value
with pytest.raises(ValueError):
# interp_order > space_order
Function(name="a", grid=grid, interp_order=8, space_order=4)
with pytest.raises(TypeError):
# interp_order not int
Function(name="a", grid=grid, interp_order=2.5, space_order=4)
a0 = Function(name="a0", grid=grid, **kw)
a = Function(name="a", grid=grid, **kw)
b = Function(name="b", grid=grid, avg_mode='safe_harmonic', **kw)
a0_avg = a0._eval_at(v)
a_avg = a._eval_at(v).evaluate.simplify()
b_avg = b._eval_at(v).evaluate.simplify()
assert a0_avg == a0.subs(v.indices_ref.getters)
# Indices around the point at the center of a cell
idx = list(range(-io//2 + 1, io//2 + 1))
all_shift = tuple(product(*[idx for _ in range(ndim)]))
coeffs = {2: [0.5, 0.5], 4: [-1/16, 9/16, 9/16, -1/16]}[io]
vars = ['i', 'j', 'k'][:ndim]
rule = ','.join(vars) + '->' + ''.join(vars)
ndcoeffs = np.einsum(rule, *([coeffs]*ndim))
args = [
{d: d + i * d.spacing for d, i in zip(grid.dimensions, s, strict=True)}
for s in all_shift
]
# Default is arithmetic average
expected = sum(
c * a.subs(arg) for c, arg in zip(ndcoeffs.flatten(), args, strict=True)
)
assert sympy.simplify(a_avg - expected) == 0
# Harmonic average, h(a[.5]) = 1/(.5/a[0] + .5/a[1])
expected = (sum(c * SafeInv(b.subs(arg), b.subs(arg))
for c, arg in zip(ndcoeffs.flatten(), args, strict=True)))
assert sympy.simplify(b_avg.args[0] - expected) == 0
assert isinstance(b_avg, SafeInv)
assert b_avg.base == b
def test_no_interp():
grid = Grid((10, 10))
x = grid.dimensions[0]
a = Function(name="a", grid=grid, staggered=NODE, interp_order=0)
sa = Function(name="as", grid=grid, staggered=x)
assert a._eval_at(sa) == a
assert sa._eval_at(a) == sa._subs(x, x - x.spacing/2)
assert (a*sa)._eval_at(sa) == a*sa
assert (a + sa)._eval_at(sa) == a + sa
a_shift = a._subs(x, x + x.spacing / 2)
# Should just do nearest grid point, so shift back to original
assert a_shift.evaluate == a