Indexed text attachment
verify-pde.py
Source for Partial Differential Equations in Higher Categories
View paper · Download original file
Lines 80–179 of 1640. Source text is displayed literally.
80def inv(A):81 n = len(A)82 cols = [solve(A, [1.0 if i == j else 0.0 for i in range(n)]) for j in range(n)]83 return tr(cols)84 85 86def rank_exact(rows):87 M = [[Fr(v) for v in r] for r in rows]88 rk, ncol = 0, (len(M[0]) if M else 0)89 for c in range(ncol):90 p = next((r for r in range(rk, len(M)) if M[r][c] != 0), None)91 if p is None:92 continue93 M[rk], M[p] = M[p], M[rk]94 for r in range(rk + 1, len(M)):95 if M[r][c] != 0:96 f = M[r][c] / M[rk][c]97 M[r] = [a - f * b for a, b in zip(M[r], M[rk])]98 rk += 199 if rk == len(M):100 break101 return rk102 103 104def inertia(A):105 """signature (positive, negative, zero) of a rational symmetric matrix by exact congruence"""106 n = len(A)107 M = [[Fr(v) for v in r] for r in A]108 pos = neg = zero = 0109 for k in range(n):110 if M[k][k] == 0:111 j = next((j for j in range(k + 1, n) if M[j][j] != 0), None)112 if j is not None:113 M[k], M[j] = M[j], M[k]114 for r in M:115 r[k], r[j] = r[j], r[k]116 else:117 j = next((j for j in range(k + 1, n) if M[k][j] != 0), None)118 if j is None:119 zero += 1120 continue121 for c in range(n):122 M[k][c] += M[j][c]123 for r in range(n):124 M[r][k] += M[r][j]125 d = M[k][k]126 pos, neg = pos + (d > 0), neg + (d < 0)127 for i in range(k + 1, n):128 f = M[i][k] / d129 if f:130 for c in range(n):131 M[i][c] -= f * M[k][c]132 for r in range(n):133 M[r][i] -= f * M[r][k]134 return pos, neg, zero135 136 137def jacobi_eig(A, sweeps=60):138 """eigenvalues (ascending) and orthonormal eigenvectors (rows) of a real symmetric matrix"""139 n = len(A)140 a = [list(r) for r in A]141 v = eye(n)142 for _ in range(sweeps):143 off = sum(a[i][j] ** 2 for i in range(n) for j in range(i + 1, n))144 if off < 1e-22:145 break146 for p in range(n - 1):147 for q in range(p + 1, n):148 if abs(a[p][q]) < 1e-300:149 continue150 th = (a[q][q] - a[p][p]) / (2 * a[p][q])151 t = (1 if th >= 0 else -1) / (abs(th) + math.sqrt(th * th + 1))152 c = 1 / math.sqrt(t * t + 1)153 s = t * c154 for k in range(n):155 akp, akq = a[k][p], a[k][q]156 a[k][p], a[k][q] = c * akp - s * akq, s * akp + c * akq157 for k in range(n):158 apk, aqk = a[p][k], a[q][k]159 a[p][k], a[q][k] = c * apk - s * aqk, s * apk + c * aqk160 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: