Indexed text attachment
verify-topology-learning.py
Source for Algebraic and Differential Topology in Machine Learning and AI: Obstructions, Invariants, and Counts
View paper · Download original file
Lines 201–300 of 1604. Source text is displayed literally.
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)241 k2 = F([a + 0.5 * h * b for a, b in zip(y, k1)])242 k3 = F([a + 0.5 * h * b for a, b in zip(y, k2)])243 k4 = F([a + h * b for a, b in zip(y, k3)])244 return [a + h * (p + 2 * q + 2 * r + s) / 6 for a, p, q, r, s in zip(y, k1, k2, k3, k4)]245 246 247def d1(f, x, h=1e-4):248 return (f(x - 2 * h) - 8 * f(x - h) + 8 * f(x + h) - f(x + 2 * h)) / (12 * h)249 250 251def d2(f, x, h=1e-3):252 return (-f(x - 2 * h) + 16 * f(x - h) - 30 * f(x) + 16 * f(x + h) - f(x + 2 * h)) / (12 * h * h)253 254 255def d3(f, x, h=2e-3):256 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)257 258 259def bisect(f, a, b, it=200):260 fa = f(a)261 for _ in range(it):262 m = 0.5 * (a + b)263 fm = f(m)264 if (fa < 0) == (fm < 0):265 a, fa = m, fm266 else:267 b = m268 return 0.5 * (a + b)269 270 271# ---------- polynomials in several variables: dict {exponent tuple: coefficient} ----------272def padd(p, q, c=1):273 r = dict(p)274 for k, v in q.items():275 r[k] = r.get(k, 0) + c * v276 if r[k] == 0:277 del r[k]278 return r279 280 281def pmul(p, q):282 r = {}283 for k1, v1 in p.items():284 for k2, v2 in q.items():285 k = tuple(a + b for a, b in zip(k1, k2))286 r[k] = r.get(k, 0) + v1 * v2287 return {k: v for k, v in r.items() if v != 0}288 289 290def pdiff(p, i):291 r = {}292 for k, v in p.items():293 if k[i]:294 kk = k[:i] + (k[i] - 1,) + k[i + 1:]295 r[kk] = r.get(kk, 0) + v * k[i]296 return {k: v for k, v in r.items() if v != 0}297 298 299def pvar(i, n):300 return {tuple(1 if j == i else 0 for j in range(n)): Fr(1)}