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 141–240 of 1244. Source text is displayed literally.
141 a = [list(r) for r in A]142 v = eye(n)143 for _ in range(sweeps):144 off = sum(a[i][j] ** 2 for i in range(n) for j in range(i + 1, n))145 if off < 1e-22:146 break147 for p in range(n - 1):148 for q in range(p + 1, n):149 if abs(a[p][q]) < 1e-300:150 continue151 th = (a[q][q] - a[p][p]) / (2 * a[p][q])152 t = (1 if th >= 0 else -1) / (abs(th) + math.sqrt(th * th + 1))153 c = 1 / math.sqrt(t * t + 1)154 s = t * c155 for k in range(n):156 akp, akq = a[k][p], a[k][q]157 a[k][p], a[k][q] = c * akp - s * akq, s * akp + c * akq158 for k in range(n):159 apk, aqk = a[p][k], a[q][k]160 a[p][k], a[q][k] = c * apk - s * aqk, s * apk + c * aqk161 for k in range(n):162 vkp, vkq = v[k][p], v[k][q]163 v[k][p], v[k][q] = c * vkp - s * vkq, s * vkp + c * vkq164 order = sorted(range(n), key=lambda i: a[i][i])165 return [a[i][i] for i in order], [[v[k][i] for k in range(n)] for i in order]166 167 168def tri_eigs(d, e, k):169 """the k smallest eigenvalues of the symmetric tridiagonal matrix (diagonal d, off-diagonal e) by Sturm bisection"""170 n = len(d)171 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))172 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))173 174 def count(x):175 c, q = 0, 1.0176 for i in range(n):177 q = d[i] - x - ((e[i - 1] ** 2) / q if i else 0.0)178 if q == 0:179 q = 1e-300180 if q < 0:181 c += 1182 return c183 out = []184 for j in range(k):185 a, b = lo, hi186 for _ in range(200):187 m = 0.5 * (a + b)188 if count(m) > j:189 b = m190 else:191 a = m192 if b - a < 1e-13 * (1 + abs(a)):193 break194 out.append(0.5 * (a + b))195 return out196 197 198def kron_sum(A, B):199 n, m = len(A), len(B)200 K = [[0.0] * (n * m) for _ in range(n * m)]201 for i in range(n):202 for j in range(n):203 for k in range(m):204 K[i * m + k][j * m + k] += A[i][j]205 for i in range(n):206 for k in range(m):207 for l in range(m):208 K[i * m + k][i * m + l] += B[k][l]209 return K210 211 212def lap1(n, bc='D'):213 """n x n matrix of -d^2/dx^2 with unit spacing: Dirichlet, Neumann (reflecting) or periodic"""214 L = [[0.0] * n for _ in range(n)]215 for i in range(n):216 L[i][i] = 2.0217 if i:218 L[i][i - 1] = -1.0219 if i < n - 1:220 L[i][i + 1] = -1.0221 if bc == 'N':222 L[0][0] = L[n - 1][n - 1] = 1.0223 if bc == 'P':224 L[0][n - 1] += -1.0225 L[n - 1][0] += -1.0226 return L227 228 229# ---------- calculus ----------230def simpson(f, a, b, n=2000):231 n += n % 2232 h = (b - a) / n233 s = f(a) + f(b)234 for i in range(1, n):235 s += (4 if i % 2 else 2) * f(a + i * h)236 return s * h / 3237 238 239def rk4(F, y, h):240 k1 = F(y)