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 61–160 of 1244. Source text is displayed literally.

61 62def solve(A, b):63    n = len(A)64    M = [list(A[i]) + [b[i]] for i in range(n)]65    for c in range(n):66        p = max(range(c, n), key=lambda r: abs(M[r][c]))67        M[c], M[p] = M[p], M[c]68        piv = M[c][c]69        for r in range(c + 1, n):70            f = M[r][c] / piv71            if f:72                Mr, Mc = M[r], M[c]73                for k in range(c, n + 1):74                    Mr[k] -= f * Mc[k]75    x = [0.0] * n76    for i in range(n - 1, -1, -1):77        x[i] = (M[i][n] - sum(M[i][k] * x[k] for k in range(i + 1, n))) / M[i][i]78    return x79 80 81def inv(A):82    n = len(A)83    cols = [solve(A, [1.0 if i == j else 0.0 for i in range(n)]) for j in range(n)]84    return tr(cols)85 86 87def rank_exact(rows):88    M = [[Fr(v) for v in r] for r in rows]89    rk, ncol = 0, (len(M[0]) if M else 0)90    for c in range(ncol):91        p = next((r for r in range(rk, len(M)) if M[r][c] != 0), None)92        if p is None:93            continue94        M[rk], M[p] = M[p], M[rk]95        for r in range(rk + 1, len(M)):96            if M[r][c] != 0:97                f = M[r][c] / M[rk][c]98                M[r] = [a - f * b for a, b in zip(M[r], M[rk])]99        rk += 1100        if rk == len(M):101            break102    return rk103 104 105def inertia(A):106    """signature (positive, negative, zero) of a rational symmetric matrix by exact congruence"""107    n = len(A)108    M = [[Fr(v) for v in r] for r in A]109    pos = neg = zero = 0110    for k in range(n):111        if M[k][k] == 0:112            j = next((j for j in range(k + 1, n) if M[j][j] != 0), None)113            if j is not None:114                M[k], M[j] = M[j], M[k]115                for r in M:116                    r[k], r[j] = r[j], r[k]117            else:118                j = next((j for j in range(k + 1, n) if M[k][j] != 0), None)119                if j is None:120                    zero += 1121                    continue122                for c in range(n):123                    M[k][c] += M[j][c]124                for r in range(n):125                    M[r][k] += M[r][j]126        d = M[k][k]127        pos, neg = pos + (d > 0), neg + (d < 0)128        for i in range(k + 1, n):129            f = M[i][k] / d130            if f:131                for c in range(n):132                    M[i][c] -= f * M[k][c]133                for r in range(n):134                    M[r][i] -= f * M[r][k]135    return pos, neg, zero136 137 138def jacobi_eig(A, sweeps=60):139    """eigenvalues (ascending) and orthonormal eigenvectors (rows) of a real symmetric matrix"""140    n = len(A)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 * aqk