@danielsimonjr/mathts-matrix 0.1.10 → 0.1.11

package/dist/{chunk-HT4ZF3LN.js → chunk-JRSQE7LB.js}

@@ -130,201 +130,6 @@ function applyHouseholderRight(A, v, beta, startRow, startCol) {
 }
 
 // src/operations/eig.ts
-var DEFAULT_MAX_ITERATIONS = 1e3;
-var DEFAULT_TOLERANCE = 1e-12;
-function hessenberg(A) {
-  const n = A.length;
-  const H = cloneMatrix(A);
-  const Q = eye(n);
-  for (let k = 0; k < n - 2; k++) {
-    const x = [];
-    for (let i = k + 1; i < n; i++) {
-      x.push(H[i][k]);
-    }
-    const { v, beta } = householder(x);
-    if (beta !== 0) {
-      applyHouseholderLeft(H, v, beta, k + 1, k);
-      applyHouseholderRight(H, v, beta, 0, k + 1);
-      applyHouseholderRight(Q, v, beta, 0, k + 1);
-    }
-  }
-  for (let i = 0; i < n; i++) {
-    for (let j = 0; j < i - 1; j++) {
-      H[i][j] = 0;
-    }
-  }
-  return { H, Q };
-}
-function givens(a, b) {
-  if (b === 0) {
-    return { c: 1, s: 0 };
-  } else if (Math.abs(b) > Math.abs(a)) {
-    const t = -a / b;
-    const s = 1 / Math.sqrt(1 + t * t);
-    return { c: s * t, s };
-  } else {
-    const t = -b / a;
-    const c = 1 / Math.sqrt(1 + t * t);
-    return { c, s: c * t };
-  }
-}
-function applyGivensLeft(A, c, s, i, k, startCol) {
-  const n = A[0].length;
-  for (let j = startCol; j < n; j++) {
-    const temp = c * A[i][j] - s * A[k][j];
-    A[k][j] = s * A[i][j] + c * A[k][j];
-    A[i][j] = temp;
-  }
-}
-function applyGivensRight(A, c, s, i, k, startRow) {
-  const m = A.length;
-  for (let j = startRow; j < m; j++) {
-    const temp = c * A[j][i] - s * A[j][k];
-    A[j][k] = s * A[j][i] + c * A[j][k];
-    A[j][i] = temp;
-  }
-}
-function qrStep(H, Q, start, end) {
-  const n = end - start + 1;
-  if (n < 2) return;
-  const a = H[end - 1][end - 1];
-  const b = H[end - 1][end];
-  const c = H[end][end - 1];
-  const d = H[end][end];
-  const trace = a + d;
-  const det = a * d - b * c;
-  const disc = trace * trace - 4 * det;
-  let shift;
-  if (disc >= 0) {
-    const sqrtDisc = Math.sqrt(disc);
-    const e1 = (trace + sqrtDisc) / 2;
-    const e2 = (trace - sqrtDisc) / 2;
-    shift = Math.abs(e1 - d) < Math.abs(e2 - d) ? e1 : e2;
-  } else {
-    shift = d;
-  }
-  let x = H[start][start] - shift;
-  let y = H[start + 1][start];
-  for (let k = start; k < end; k++) {
-    const { c: c2, s } = givens(x, y);
-    applyGivensLeft(H, c2, s, k, k + 1, Math.max(0, k - 1));
-    applyGivensRight(H, c2, s, k, k + 1, 0);
-    applyGivensRight(Q, c2, s, k, k + 1, 0);
-    if (k < end - 1) {
-      x = H[k + 1][k];
-      y = H[k + 2][k];
-    }
-  }
-}
-function extractEigenvalues(H, tolerance) {
-  const n = H.length;
-  const eigenvalues = [];
-  let i = 0;
-  while (i < n) {
-    if (i === n - 1 || Math.abs(H[i + 1][i]) <= tolerance) {
-      eigenvalues.push({ re: H[i][i], im: 0 });
-      i++;
-    } else {
-      const a = H[i][i];
-      const b = H[i][i + 1];
-      const c = H[i + 1][i];
-      const d = H[i + 1][i + 1];
-      const trace = a + d;
-      const det = a * d - b * c;
-      const disc = trace * trace - 4 * det;
-      if (disc >= 0) {
-        const sqrtDisc = Math.sqrt(disc);
-        eigenvalues.push({ re: (trace + sqrtDisc) / 2, im: 0 });
-        eigenvalues.push({ re: (trace - sqrtDisc) / 2, im: 0 });
-      } else {
-        const realPart = trace / 2;
-        const imagPart = Math.sqrt(-disc) / 2;
-        eigenvalues.push({ re: realPart, im: imagPart });
-        eigenvalues.push({ re: realPart, im: -imagPart });
-      }
-      i += 2;
-    }
-  }
-  return eigenvalues;
-}
-function inverseIteration(A, eigenvalue, tolerance, maxIterations) {
-  const n = A.length;
-  if (eigenvalue.im !== 0) {
-    return new Array(n).fill(0);
-  }
-  const lambda = eigenvalue.re;
-  const shifted = cloneMatrix(A);
-  for (let i = 0; i < n; i++) {
-    shifted[i][i] -= lambda;
-  }
-  for (let i = 0; i < n; i++) {
-    shifted[i][i] += tolerance * 1e3;
-  }
-  const LU = cloneMatrix(shifted);
-  const perm = Array.from({ length: n }, (_, i) => i);
-  for (let k = 0; k < n; k++) {
-    let maxVal = Math.abs(LU[k][k]);
-    let maxIdx = k;
-    for (let i = k + 1; i < n; i++) {
-      if (Math.abs(LU[i][k]) > maxVal) {
-        maxVal = Math.abs(LU[i][k]);
-        maxIdx = i;
-      }
-    }
-    if (maxIdx !== k) {
-      [LU[k], LU[maxIdx]] = [LU[maxIdx], LU[k]];
-      [perm[k], perm[maxIdx]] = [perm[maxIdx], perm[k]];
-    }
-    if (Math.abs(LU[k][k]) < tolerance) {
-      LU[k][k] = tolerance;
-    }
-    for (let i = k + 1; i < n; i++) {
-      LU[i][k] /= LU[k][k];
-      for (let j = k + 1; j < n; j++) {
-        LU[i][j] -= LU[i][k] * LU[k][j];
-      }
-    }
-  }
-  const v = new Array(n).fill(1);
-  let prevNorm = 0;
-  for (let iter = 0; iter < maxIterations; iter++) {
-    const y = new Array(n).fill(0);
-    const b = new Array(n);
-    for (let i = 0; i < n; i++) {
-      b[i] = v[perm[i]];
-    }
-    for (let i = 0; i < n; i++) {
-      y[i] = b[i];
-      for (let j = 0; j < i; j++) {
-        y[i] -= LU[i][j] * y[j];
-      }
-    }
-    const x = new Array(n).fill(0);
-    for (let i = n - 1; i >= 0; i--) {
-      x[i] = y[i];
-      for (let j = i + 1; j < n; j++) {
-        x[i] -= LU[i][j] * x[j];
-      }
-      x[i] /= LU[i][i];
-    }
-    let norm = 0;
-    for (let i = 0; i < n; i++) {
-      norm += x[i] * x[i];
-    }
-    norm = Math.sqrt(norm);
-    if (norm < tolerance) {
-      return x;
-    }
-    for (let i = 0; i < n; i++) {
-      v[i] = x[i] / norm;
-    }
-    if (Math.abs(norm - prevNorm) < tolerance * norm) {
-      break;
-    }
-    prevNorm = norm;
-  }
-  return v;
-}
 var EIG_GEN_EPS = 2220446049250313e-31;
 function cdiv(xr, xi, yr, yi) {
   let rr;
@@ -723,11 +528,7 @@ function eigGeneral(A, computeVectors, symmetric) {
   return { values, vectors, isSymmetric: symmetric };
 }
 function eig(matrix, options = {}) {
-  const {
-    maxIterations = DEFAULT_MAX_ITERATIONS,
-    tolerance = DEFAULT_TOLERANCE,
-    computeVectors = true
-  } = options;
+  const { computeVectors = true } = options;
   let A;
   if (matrix instanceof Float64Array) {
     const n2 = Math.sqrt(matrix.length);
@@ -755,87 +556,7 @@ function eig(matrix, options = {}) {
       isSymmetric: symmetric
     };
   }
-  if (!symmetric) {
-    return eigGeneral(A, computeVectors, symmetric);
-  }
-  if (n === 2) {
-    const a = A[0][0], b = A[0][1], c = A[1][0], d = A[1][1];
-    const trace = a + d;
-    const det = a * d - b * c;
-    const disc = trace * trace - 4 * det;
-    let values2;
-    let vectors2;
-    if (disc >= 0) {
-      const sqrtDisc = Math.sqrt(disc);
-      const e1 = (trace + sqrtDisc) / 2;
-      const e2 = (trace - sqrtDisc) / 2;
-      values2 = [
-        { re: e1, im: 0 },
-        { re: e2, im: 0 }
-      ];
-      if (computeVectors) {
-        vectors2 = [];
-        for (const e of [e1, e2]) {
-          if (Math.abs(b) > tolerance) {
-            const v = [b, e - a];
-            const norm = Math.sqrt(v[0] * v[0] + v[1] * v[1]);
-            vectors2.push([v[0] / norm, v[1] / norm]);
-          } else if (Math.abs(c) > tolerance) {
-            const v = [e - d, c];
-            const norm = Math.sqrt(v[0] * v[0] + v[1] * v[1]);
-            vectors2.push([v[0] / norm, v[1] / norm]);
-          } else {
-            vectors2.push(e === a ? [1, 0] : [0, 1]);
-          }
-        }
-      } else {
-        vectors2 = eye(2);
-      }
-    } else {
-      const realPart = trace / 2;
-      const imagPart = Math.sqrt(-disc) / 2;
-      values2 = [
-        { re: realPart, im: imagPart },
-        { re: realPart, im: -imagPart }
-      ];
-      vectors2 = eye(2);
-    }
-    return { values: values2, vectors: vectors2, isSymmetric: symmetric };
-  }
-  const { H, Q } = hessenberg(A);
-  let end = n - 1;
-  let iter = 0;
-  while (end > 0 && iter < maxIterations) {
-    let start = end;
-    while (start > 0) {
-      const scale = Math.abs(H[start - 1][start - 1]) + Math.abs(H[start][start]);
-      if (Math.abs(H[start][start - 1]) <= tolerance * scale) {
-        H[start][start - 1] = 0;
-        break;
-      }
-      start--;
-    }
-    if (start === end) {
-      end--;
-    } else if (start === end - 1) {
-      end -= 2;
-    } else {
-      qrStep(H, Q, start, end);
-    }
-    iter++;
-  }
-  const values = extractEigenvalues(H, tolerance);
-  let vectors;
-  if (computeVectors) {
-    vectors = [];
-    for (const eigenvalue of values) {
-      const v = inverseIteration(A, eigenvalue, tolerance, 100);
-      vectors.push(v);
-    }
-  } else {
-    vectors = eye(n);
-  }
-  return { values, vectors, isSymmetric: symmetric };
+  return eigGeneral(A, computeVectors, symmetric);
 }
 function eigvals(matrix, options) {
   return eig(matrix, { ...options, computeVectors: false }).values;

package/dist/{eig-G72TLEBA.js → eig-PIFFHFJF.js}

@@ -2,7 +2,7 @@ import {
   eig,
   eigvals,
   powerIteration
-} from "./chunk-HT4ZF3LN.js";
+} from "./chunk-JRSQE7LB.js";
 import "./chunk-4VMDO6W2.js";
 export {
   eig,

package/dist/index.js

@@ -15,7 +15,7 @@ import {
   normInf,
   powerIteration,
   transpose
-} from "./chunk-HT4ZF3LN.js";
+} from "./chunk-JRSQE7LB.js";
 import {
   __esm,
   __export,
@@ -6376,7 +6376,7 @@ async function spectralRadiusWasm(matrix2, options) {
     }
   }
   if (!module || n < WASM_EIG_THRESHOLD || typeof module.matrix_spectral_radius !== "function") {
-    const { powerIteration: powerIteration2 } = await import("./eig-G72TLEBA.js");
+    const { powerIteration: powerIteration2 } = await import("./eig-PIFFHFJF.js");
     const result = powerIteration2(matrix2, options);
     return Math.abs(result.value);
   }
@@ -6385,7 +6385,7 @@ async function spectralRadiusWasm(matrix2, options) {
   try {
     return module.matrix_spectral_radius(matrixAlloc.ptr, n);
   } catch {
-    const { powerIteration: powerIteration2 } = await import("./eig-G72TLEBA.js");
+    const { powerIteration: powerIteration2 } = await import("./eig-PIFFHFJF.js");
     const result = powerIteration2(matrix2, options);
     return Math.abs(result.value);
   } finally {

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@danielsimonjr/mathts-matrix",
-  "version": "0.1.10",
+  "version": "0.1.11",
   "description": "Matrix operations for MathTS with WASM/WebGPU backend support",
   "author": "Daniel Simon Jr.",
   "license": "MIT",
@@ -32,7 +32,7 @@
     "build:prod": "tsup src/index.ts --format esm --dts --clean --minify --treeshake && node scripts/copy-wasm.mjs"
   },
   "dependencies": {
-    "@danielsimonjr/mathts-core": "^0.1.4",
+    "@danielsimonjr/mathts-core": "^0.2.0",
     "@danielsimonjr/mathts-parallel": "^0.3.0"
   },
   "devDependencies": {