Independent scholarship · Open accessThe monthly digest

Indexed text attachment

verify-pde.py

Source for Partial Differential Equations in Higher Categories

View paper · Download original file

Lines 160–259 of 1640. Source text is displayed literally.

160                for k in range(n):161                    vkp, vkq = v[k][p], v[k][q]162                    v[k][p], v[k][q] = c * vkp - s * vkq, s * vkp + c * vkq163    order = sorted(range(n), key=lambda i: a[i][i])164    return [a[i][i] for i in order], [[v[k][i] for k in range(n)] for i in order]165 166 167def tri_eigs(d, e, k):168    """the k smallest eigenvalues of the symmetric tridiagonal matrix (diagonal d, off-diagonal e) by Sturm bisection"""169    n = len(d)170    lo = min(d[i] - (abs(e[i - 1]) if i else 0) - (abs(e[i]) if i < n - 1 else 0) for i in range(n))171    hi = max(d[i] + (abs(e[i - 1]) if i else 0) + (abs(e[i]) if i < n - 1 else 0) for i in range(n))172 173    def count(x):174        c, q = 0, 1.0175        for i in range(n):176            q = d[i] - x - ((e[i - 1] ** 2) / q if i else 0.0)177            if q == 0:178                q = 1e-300179            if q < 0:180                c += 1181        return c182    out = []183    for j in range(k):184        a, b = lo, hi185        for _ in range(200):186            m = 0.5 * (a + b)187            if count(m) > j:188                b = m189            else:190                a = m191            if b - a < 1e-13 * (1 + abs(a)):192                break193        out.append(0.5 * (a + b))194    return out195 196 197def kron_sum(A, B):198    n, m = len(A), len(B)199    K = [[0.0] * (n * m) for _ in range(n * m)]200    for i in range(n):201        for j in range(n):202            for k in range(m):203                K[i * m + k][j * m + k] += A[i][j]204    for i in range(n):205        for k in range(m):206            for l in range(m):207                K[i * m + k][i * m + l] += B[k][l]208    return K209 210 211def lap1(n, bc='D'):212    """n x n matrix of -d^2/dx^2 with unit spacing: Dirichlet, Neumann (reflecting) or periodic"""213    L = [[0.0] * n for _ in range(n)]214    for i in range(n):215        L[i][i] = 2.0216        if i:217            L[i][i - 1] = -1.0218        if i < n - 1:219            L[i][i + 1] = -1.0220    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)