Independent scholarship · Open accessThe monthly digest

Indexed text attachment

verify-pde-learning.py

Source for Partial Differential Equations in Machine Learning and AI: Naturality, Well-Posedness, and Spectral Rates

View paper · Download original file

Lines 301–400 of 1244. Source text is displayed literally.

301 302 303def pscale(p, c):304    return {k: v * c for k, v in p.items() if v * c != 0}305 306 307def peval(p, x):308    return sum(v * math.prod(xi ** e for xi, e in zip(x, k)) for k, v in p.items())309 310 311def plap(p, sig=None):312    n = len(next(iter(p))) if p else 0313    sig = sig or [1] * n314    r = {}315    for i in range(n):316        r = padd(r, pdiff(pdiff(p, i), i), sig[i])317    return r318 319 320def monomials(n, k):321    return [e for e in itertools.product(range(k + 1), repeat=n) if sum(e) == k]322 323 324def kernel_dim(op, n, k):325    """dimension of the kernel of a linear operator on homogeneous polynomials of degree k in n variables"""326    src = monomials(n, k)327    imgs = [op({m: Fr(1)}) for m in src]328    tgt = sorted({key for im in imgs for key in im})329    if not tgt:330        return len(src)331    return len(src) - rank_exact([[im.get(t, 0) for t in tgt] for im in imgs])332 333 334# ---------- special functions ----------335def besselj(n, x, m=400):336    return sum(math.cos(n * (PI * (j + 0.5) / m) - x * math.sin(PI * (j + 0.5) / m)) for j in range(m)) / m337 338 339def legendre(l):340    """coefficients (Fractions, ascending powers) of the Legendre polynomial P_l"""341    p0, p1 = [Fr(1)], [Fr(0), Fr(1)]342    if l == 0:343        return p0344    for k in range(1, l):345        nxt = [Fr(0)] * (k + 2)346        for i, c in enumerate(p1):347            nxt[i + 1] += Fr(2 * k + 1, k + 1) * c348        for i, c in enumerate(p0):349            nxt[i] -= Fr(k, k + 1) * c350        p0, p1 = p1, nxt351    return p1352 353 354def heat(x, t, k=1.0):355    return math.exp(-x * x / (4 * k * t)) / math.sqrt(4 * PI * k * t)356 357 358def charpoly_int(A):359    n = len(A)360    M = [[int(i == j) for j in range(n)] for i in range(n)]361    cs = [1]362    for k in range(1, n + 1):363        AM = [[sum(A[i][l] * M[l][j] for l in range(n)) for j in range(n)] for i in range(n)]364        c = -sum(AM[i][i] for i in range(n)) // k365        cs.append(c)366        M = [[AM[i][j] + (c if i == j else 0) for j in range(n)] for i in range(n)]367    return tuple(cs)368 369 370# ######################## CHECKS FOR THE PAPER ########################371def rk4t(F, y, t, h):372    k1 = F(t, y)373    k2 = F(t + 0.5 * h, [a + 0.5 * h * b for a, b in zip(y, k1)])374    k3 = F(t + 0.5 * h, [a + 0.5 * h * b for a, b in zip(y, k2)])375    k4 = F(t + h, [a + h * b for a, b in zip(y, k3)])376    return [a + h * (p + 2 * q + 2 * r + s) / 6 for a, p, q, r, s in zip(y, k1, k2, k3, k4)]377 378 379def flow(F, y, t0, t1, steps):380    h = (t1 - t0) / steps381    t = t0382    for _ in range(steps):383        y = rk4t(F, y, t, h)384        t += h385    return y386 387 388def norm(x):389    return math.sqrt(sum(a * a for a in x))390 391 392def gauss(x, m, v):393    return math.exp(-(x - m) ** 2 / (2 * v)) / math.sqrt(2 * PI * v)394 395 396def Phi(z):397    return 0.5 * (1 + math.erf(z / math.sqrt(2)))398 399 400sec('1. Padding is a boundary condition')