-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathnumdiff.py
More file actions
43 lines (34 loc) · 1.05 KB
/
numdiff.py
File metadata and controls
43 lines (34 loc) · 1.05 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
import numpy as np
def vecCanonical(n, i):
e = np.zeros(n)
e[i] = 1
return e
def D1(f, x, absStep=1e-2, relStep=1e-2):
L = []
dx = np.minimum(absStep, np.abs(x) * relStep)
for i, dxi in enumerate(dx):
ei = vecCanonical(len(x), i)
fp = f(x + dxi * ei)
fn = f(x - dxi * ei)
L.append((fp - fn) / (2 * dxi))
L = np.array(L)
return L
def D2(f, x, absStep=1e-2, relStep=1e-2):
L = []
dx = np.minimum(np.abs(x) * relStep, absStep)
for i, dxi in enumerate(dx):
ei = vecCanonical(len(x), i)
for j, dxj in enumerate(dx):
if j < i: continue
ej = vecCanonical(len(x), j)
fpp = f(x + dxi * ei + dxj * ej)
fpn = f(x + dxi * ei - dxj * ej)
fnp = f(x - dxi * ei + dxj * ej)
fnn = f(x - dxi * ei - dxj * ej)
L.append((fpp - fpn - fnp + fnn) / (4 * dxi * dxj))
iu = np.triu_indices(len(x))
H = np.zeros(2 * [len(x)])
H[iu] = L
il = np.tril_indices(len(x), -1)
H[il] = H.T[il]
return H