Indexed text attachment
verify-pde.py
Source for Partial Differential Equations in Higher Categories
View paper · Download original file
Lines 220–319 of 1640. Source text is displayed literally.
220 if bc == 'N':221 L[0][0] = L[n - 1][n - 1] = 1.0222 if bc == 'P':223 L[0][n - 1] += -1.0224 L[n - 1][0] += -1.0225 return L226 227 228# ---------- calculus ----------229def simpson(f, a, b, n=2000):230 n += n % 2231 h = (b - a) / n232 s = f(a) + f(b)233 for i in range(1, n):234 s += (4 if i % 2 else 2) * f(a + i * h)235 return s * h / 3236 237 238def rk4(F, y, h):239 k1 = F(y)240 k2 = F([a + 0.5 * h * b for a, b in zip(y, k1)])241 k3 = F([a + 0.5 * h * b for a, b in zip(y, k2)])242 k4 = F([a + h * b for a, b in zip(y, k3)])243 return [a + h * (p + 2 * q + 2 * r + s) / 6 for a, p, q, r, s in zip(y, k1, k2, k3, k4)]244 245 246def d1(f, x, h=1e-4):247 return (f(x - 2 * h) - 8 * f(x - h) + 8 * f(x + h) - f(x + 2 * h)) / (12 * h)248 249 250def d2(f, x, h=1e-3):251 return (-f(x - 2 * h) + 16 * f(x - h) - 30 * f(x) + 16 * f(x + h) - f(x + 2 * h)) / (12 * h * h)252 253 254def d3(f, x, h=2e-3):255 return (f(x - 3 * h) - 8 * f(x - 2 * h) + 13 * f(x - h) - 13 * f(x + h) + 8 * f(x + 2 * h) - f(x + 3 * h)) / (8 * h ** 3)256 257 258def bisect(f, a, b, it=200):259 fa = f(a)260 for _ in range(it):261 m = 0.5 * (a + b)262 fm = f(m)263 if (fa < 0) == (fm < 0):264 a, fa = m, fm265 else:266 b = m267 return 0.5 * (a + b)268 269 270# ---------- polynomials in several variables: dict {exponent tuple: coefficient} ----------271def padd(p, q, c=1):272 r = dict(p)273 for k, v in q.items():274 r[k] = r.get(k, 0) + c * v275 if r[k] == 0:276 del r[k]277 return r278 279 280def pmul(p, q):281 r = {}282 for k1, v1 in p.items():283 for k2, v2 in q.items():284 k = tuple(a + b for a, b in zip(k1, k2))285 r[k] = r.get(k, 0) + v1 * v2286 return {k: v for k, v in r.items() if v != 0}287 288 289def pdiff(p, i):290 r = {}291 for k, v in p.items():292 if k[i]:293 kk = k[:i] + (k[i] - 1,) + k[i + 1:]294 r[kk] = r.get(kk, 0) + v * k[i]295 return {k: v for k, v in r.items() if v != 0}296 297 298def pvar(i, n):299 return {tuple(1 if j == i else 0 for j in range(n)): Fr(1)}300 301 302def pscale(p, c):303 return {k: v * c for k, v in p.items() if v * c != 0}304 305 306def peval(p, x):307 return sum(v * math.prod(xi ** e for xi, e in zip(x, k)) for k, v in p.items())308 309 310def plap(p, sig=None):311 n = len(next(iter(p))) if p else 0312 sig = sig or [1] * n313 r = {}314 for i in range(n):315 r = padd(r, pdiff(pdiff(p, i), i), sig[i])316 return r317 318 319def monomials(n, k):