diff-grok 1.0.10 → 1.1.0

package/src/solver-tools/lsoda/blas.ts

@@ -0,0 +1,267 @@
+// BLAS linear algebra routines
+// All arrays are 1-indexed (element [0] unused), matching the C/Fortran convention.
+
+/**
+ * Compute dy = da * dx + dy
+ * Arrays are 1-indexed with stride incx/incy.
+ */
+export function daxpy(
+  n: number, da: number, dx: Float64Array, incx: number,
+  dy: Float64Array, incy: number,
+): void {
+  if (n < 0 || da === 0.) return;
+
+  if (incx !== incy || incx < 1) {
+    let ix = 1;
+    let iy = 1;
+    if (incx < 0) ix = (-n + 1) * incx + 1;
+    if (incy < 0) iy = (-n + 1) * incy + 1;
+    for (let i = 1; i <= n; i++) {
+      dy[iy] = dy[iy] + da * dx[ix];
+      ix += incx;
+      iy += incy;
+    }
+    return;
+  }
+
+  if (incx === 1) {
+    const m = n % 4;
+    if (m !== 0) {
+      for (let i = 1; i <= m; i++)
+        dy[i] = dy[i] + da * dx[i];
+      if (n < 4) return;
+    }
+    for (let i = m + 1; i <= n; i += 4) {
+      dy[i] = dy[i] + da * dx[i];
+      dy[i + 1] = dy[i + 1] + da * dx[i + 1];
+      dy[i + 2] = dy[i + 2] + da * dx[i + 2];
+      dy[i + 3] = dy[i + 3] + da * dx[i + 3];
+    }
+    return;
+  }
+
+  for (let i = 1; i <= n * incx; i += incx)
+    dy[i] = da * dx[i] + dy[i];
+}
+
+/**
+ * Compute dot product dx . dy
+ * Arrays are 1-indexed with stride incx/incy.
+ */
+export function ddot(
+  n: number, dx: Float64Array, incx: number,
+  dy: Float64Array, incy: number,
+): number {
+  let dotprod = 0.;
+  if (n <= 0) return dotprod;
+
+  if (incx !== incy || incx < 1) {
+    let ix = 1;
+    let iy = 1;
+    if (incx < 0) ix = (-n + 1) * incx + 1;
+    if (incy < 0) iy = (-n + 1) * incy + 1;
+    for (let i = 1; i <= n; i++) {
+      dotprod += dx[ix] * dy[iy];
+      ix += incx;
+      iy += incy;
+    }
+    return dotprod;
+  }
+
+  if (incx === 1) {
+    for (let i = 1; i <= n; i++)
+      dotprod += dx[i] * dy[i];
+    return dotprod;
+  }
+
+  for (let i = 1; i <= n * incx; i += incx)
+    dotprod += dx[i] * dy[i];
+  return dotprod;
+}
+
+/**
+ * Scale vector: dx = da * dx
+ * Array is 1-indexed with stride incx.
+ */
+export function dscal(n: number, da: number, dx: Float64Array, incx: number): void {
+  if (n <= 0) return;
+
+  if (incx !== 1) {
+    for (let i = 1; i <= n * incx; i += incx)
+      dx[i] = da * dx[i];
+    return;
+  }
+
+  const m = n % 5;
+  if (m !== 0) {
+    for (let i = 1; i <= m; i++)
+      dx[i] = da * dx[i];
+    if (n < 5) return;
+  }
+  for (let i = m + 1; i <= n; i += 5) {
+    dx[i] = da * dx[i];
+    dx[i + 1] = da * dx[i + 1];
+    dx[i + 2] = da * dx[i + 2];
+    dx[i + 3] = da * dx[i + 3];
+    dx[i + 4] = da * dx[i + 4];
+  }
+}
+
+/**
+ * Find index of element with maximum absolute value.
+ * Array is 1-indexed. Returns 1-based index (0 if n <= 0).
+ */
+export function idamax(n: number, dx: Float64Array, incx: number): number {
+  let xindex = 0;
+  if (n <= 0) return xindex;
+  xindex = 1;
+  if (n <= 1 || incx <= 0) return xindex;
+
+  if (incx !== 1) {
+    let dmax = Math.abs(dx[1]);
+    let ii = 2;
+    for (let i = 1 + incx; i <= n * incx; i += incx) {
+      const xmag = Math.abs(dx[i]);
+      if (xmag > dmax) {
+        xindex = ii;
+        dmax = xmag;
+      }
+      ii++;
+    }
+    return xindex;
+  }
+
+  let dmax = Math.abs(dx[1]);
+  for (let i = 2; i <= n; i++) {
+    const xmag = Math.abs(dx[i]);
+    if (xmag > dmax) {
+      xindex = i;
+      dmax = xmag;
+    }
+  }
+  return xindex;
+}
+
+/**
+ * LU factorization by Gaussian elimination with partial pivoting.
+ * a: 2D matrix (a[i][j], 1-indexed rows and columns)
+ * n: matrix dimension
+ * ipvt: pivot indices output (1-indexed)
+ * Returns info: 0 = normal, k = U[k][k] == 0 (singular).
+ */
+export function dgefa(a: Float64Array[], n: number, ipvt: Int32Array): number {
+  let info = 0;
+
+  for (let k = 1; k <= n - 1; k++) {
+    // Find pivot index. a[k] + k - 1 in C => subarray from index k
+    const j = idamax(n - k + 1, a[k].subarray(k - 1), 1) + k - 1;
+    ipvt[k] = j;
+
+    if (a[k][j] === 0.) {
+      info = k;
+      continue;
+    }
+
+    // Interchange if necessary
+    if (j !== k) {
+      const t = a[k][j];
+      a[k][j] = a[k][k];
+      a[k][k] = t;
+    }
+
+    // Compute multipliers
+    const t = -1. / a[k][k];
+    dscal(n - k, t, a[k].subarray(k), 1);
+
+    // Column elimination with row indexing
+    for (let i = k + 1; i <= n; i++) {
+      const t2 = a[i][j];
+      if (j !== k) {
+        a[i][j] = a[i][k];
+        a[i][k] = t2;
+      }
+      daxpy(n - k, t2, a[k].subarray(k), 1, a[i].subarray(k), 1);
+    }
+  }
+
+  ipvt[n] = n;
+  if (a[n][n] === 0.) info = n;
+  return info;
+}
+
+/**
+ * Solve linear system using LU factors from dgefa.
+ * a: LU factored matrix (1-indexed)
+ * n: dimension
+ * ipvt: pivot indices (1-indexed)
+ * b: right-hand side on input, solution on output (1-indexed)
+ * job: 0 = solve A*x=b, nonzero = solve A^T*x=b
+ */
+export function dgesl(
+  a: Float64Array[], n: number, ipvt: Int32Array,
+  b: Float64Array, job: number,
+): void {
+  if (job === 0) {
+    // Solve L * y = b
+    for (let k = 1; k <= n; k++) {
+      const t = ddot(k - 1, a[k], 1, b, 1);
+      b[k] = (b[k] - t) / a[k][k];
+    }
+    // Solve U * x = y
+    for (let k = n - 1; k >= 1; k--) {
+      b[k] = b[k] + ddot(n - k, a[k].subarray(k), 1, b.subarray(k), 1);
+      const j = ipvt[k];
+      if (j !== k) {
+        const t = b[j];
+        b[j] = b[k];
+        b[k] = t;
+      }
+    }
+    return;
+  }
+
+  // Solve Transpose(U) * y = b
+  for (let k = 1; k <= n - 1; k++) {
+    const j = ipvt[k];
+    const t = b[j];
+    if (j !== k) {
+      b[j] = b[k];
+      b[k] = t;
+    }
+    daxpy(n - k, t, a[k].subarray(k), 1, b.subarray(k), 1);
+  }
+  // Solve Transpose(L) * x = y
+  for (let k = n; k >= 1; k--) {
+    b[k] = b[k] / a[k][k];
+    const t = -b[k];
+    daxpy(k - 1, t, a[k], 1, b, 1);
+  }
+}
+
+/**
+ * Weighted max-norm: max(i=1..n) |v[i]| * w[i]
+ * Arrays are 1-indexed.
+ */
+export function vmnorm(n: number, v: Float64Array, w: Float64Array): number {
+  let vm = 0.;
+  for (let i = 1; i <= n; i++)
+    vm = Math.max(vm, Math.abs(v[i]) * w[i]);
+  return vm;
+}
+
+/**
+ * Weighted matrix norm consistent with vmnorm.
+ * fnorm = max(i=1..n) ( w[i] * sum(j=1..n) |a[i][j]| / w[j] )
+ * a is 2D (1-indexed), w is 1-indexed.
+ */
+export function fnorm(n: number, a: Float64Array[], w: Float64Array): number {
+  let an = 0.;
+  for (let i = 1; i <= n; i++) {
+    let sum = 0.;
+    const ap1 = a[i];
+    for (let j = 1; j <= n; j++)
+      sum += Math.abs(ap1[j]) / w[j];
+    an = Math.max(an, sum * w[i]);
+  }
+  return an;
+}

package/src/solver-tools/lsoda/cfode.js

@@ -0,0 +1,73 @@
+/**
+ * Set coefficients for the current method.
+ * Computes elco and tesco arrays for all orders.
+ * meth=1: Adams (orders 1-12), meth=2: BDF (orders 1-5).
+ */
+export function cfode(ctx, meth) {
+    const c = ctx.common;
+    const pc = new Float64Array(13);
+    if (meth === 1) {
+        c.elco[1][1] = 1.;
+        c.elco[1][2] = 1.;
+        c.tesco[1][1] = 0.;
+        c.tesco[1][2] = 2.;
+        c.tesco[2][1] = 1.;
+        c.tesco[12][3] = 0.;
+        pc[1] = 1.;
+        let rqfac = 1.;
+        for (let nq = 2; nq <= 12; nq++) {
+            const rq1fac = rqfac;
+            rqfac = rqfac / nq;
+            const nqm1 = nq - 1;
+            const fnqm1 = nqm1;
+            const nqp1 = nq + 1;
+            // Form coefficients of p(x)*(x+nq-1)
+            pc[nq] = 0.;
+            for (let i = nq; i >= 2; i--)
+                pc[i] = pc[i - 1] + fnqm1 * pc[i];
+            pc[1] = fnqm1 * pc[1];
+            // Compute integral, -1 to 0, of p(x) and x*p(x)
+            let pint = pc[1];
+            let xpin = pc[1] / 2.;
+            let tsign = 1.;
+            for (let i = 2; i <= nq; i++) {
+                tsign = -tsign;
+                pint += tsign * pc[i] / i;
+                xpin += tsign * pc[i] / (i + 1);
+            }
+            // Store coefficients in elco and tesco
+            c.elco[nq][1] = pint * rq1fac;
+            c.elco[nq][2] = 1.;
+            for (let i = 2; i <= nq; i++)
+                c.elco[nq][i + 1] = rq1fac * pc[i] / i;
+            const agamq = rqfac * xpin;
+            const ragq = 1. / agamq;
+            c.tesco[nq][2] = ragq;
+            if (nq < 12)
+                c.tesco[nqp1][1] = ragq * rqfac / nqp1;
+            c.tesco[nqm1][3] = ragq;
+        }
+        return;
+    }
+    // meth = 2 (BDF)
+    pc[1] = 1.;
+    let rq1fac = 1.;
+    for (let nq = 1; nq <= 5; nq++) {
+        const fnq = nq;
+        const nqp1 = nq + 1;
+        // Form coefficients of p(x)*(x+nq)
+        pc[nqp1] = 0.;
+        for (let i = nq + 1; i >= 2; i--)
+            pc[i] = pc[i - 1] + fnq * pc[i];
+        pc[1] *= fnq;
+        // Store coefficients in elco and tesco
+        for (let i = 1; i <= nqp1; i++)
+            c.elco[nq][i] = pc[i] / pc[2];
+        c.elco[nq][2] = 1.;
+        c.tesco[nq][1] = rq1fac;
+        c.tesco[nq][2] = nqp1 / c.elco[nq][1];
+        c.tesco[nq][3] = (nq + 2) / c.elco[nq][1];
+        rq1fac /= fnq;
+    }
+}
+//# sourceMappingURL=cfode.js.map

package/src/solver-tools/lsoda/cfode.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"cfode.js","sourceRoot":"","sources":["cfode.ts"],"names":[],"mappings":"AAEA;;;;GAIG;AACH,MAAM,UAAU,KAAK,CAAC,GAAiB,EAAE,IAAY;IACnD,MAAM,CAAC,GAAG,GAAG,CAAC,MAAO,CAAC;IACtB,MAAM,EAAE,GAAG,IAAI,YAAY,CAAC,EAAE,CAAC,CAAC;IAEhC,IAAI,IAAI,KAAK,CAAC,EAAE,CAAC;QACf,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;QAClB,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;QAClB,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;QACnB,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;QACnB,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;QACnB,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;QACpB,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;QACX,IAAI,KAAK,GAAG,EAAE,CAAC;QAEf,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC;YAChC,MAAM,MAAM,GAAG,KAAK,CAAC;YACrB,KAAK,GAAG,KAAK,GAAG,EAAE,CAAC;YACnB,MAAM,IAAI,GAAG,EAAE,GAAG,CAAC,CAAC;YACpB,MAAM,KAAK,GAAG,IAAI,CAAC;YACnB,MAAM,IAAI,GAAG,EAAE,GAAG,CAAC,CAAC;YAEpB,qCAAqC;YACrC,EAAE,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC;YACZ,KAAK,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE;gBAC1B,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;YACpC,EAAE,CAAC,CAAC,CAAC,GAAG,KAAK,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;YAEtB,gDAAgD;YAChD,IAAI,IAAI,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;YACjB,IAAI,IAAI,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;YACtB,IAAI,KAAK,GAAG,EAAE,CAAC;YACf,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC7B,KAAK,GAAG,CAAC,KAAK,CAAC;gBACf,IAAI,IAAI,KAAK,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;gBAC1B,IAAI,IAAI,KAAK,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAClC,CAAC;YAED,uCAAuC;YACvC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,GAAG,MAAM,CAAC;YAC9B,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;YACnB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE;gBAC1B,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,MAAM,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YACzC,MAAM,KAAK,GAAG,KAAK,GAAG,IAAI,CAAC;YAC3B,MAAM,IAAI,GAAG,EAAE,GAAG,KAAK,CAAC;YACxB,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;YACtB,IAAI,EAAE,GAAG,EAAE;gBACT,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,GAAG,KAAK,GAAG,IAAI,CAAC;YACzC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;QAC1B,CAAC;QACD,OAAO;IACT,CAAC;IAED,iBAAiB;IACjB,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;IACX,IAAI,MAAM,GAAG,EAAE,CAAC;IAEhB,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC;QAC/B,MAAM,GAAG,GAAG,EAAE,CAAC;QACf,MAAM,IAAI,GAAG,EAAE,GAAG,CAAC,CAAC;QAEpB,mCAAmC;QACnC,EAAE,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC;QACd,KAAK,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE;YAC9B,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;QAClC,EAAE,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC;QAEb,uCAAuC;QACvC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,IAAI,EAAE,CAAC,EAAE;YAC5B,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;QAChC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;QACnB,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC;QACxB,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QACtC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAC1C,MAAM,IAAI,GAAG,CAAC;IAChB,CAAC;AACH,CAAC"}

package/src/solver-tools/lsoda/cfode.ts

@@ -0,0 +1,83 @@
+import {LsodaContext} from './common';
+
+/**
+ * Set coefficients for the current method.
+ * Computes elco and tesco arrays for all orders.
+ * meth=1: Adams (orders 1-12), meth=2: BDF (orders 1-5).
+ */
+export function cfode(ctx: LsodaContext, meth: number): void {
+  const c = ctx.common!;
+  const pc = new Float64Array(13);
+
+  if (meth === 1) {
+    c.elco[1][1] = 1.;
+    c.elco[1][2] = 1.;
+    c.tesco[1][1] = 0.;
+    c.tesco[1][2] = 2.;
+    c.tesco[2][1] = 1.;
+    c.tesco[12][3] = 0.;
+    pc[1] = 1.;
+    let rqfac = 1.;
+
+    for (let nq = 2; nq <= 12; nq++) {
+      const rq1fac = rqfac;
+      rqfac = rqfac / nq;
+      const nqm1 = nq - 1;
+      const fnqm1 = nqm1;
+      const nqp1 = nq + 1;
+
+      // Form coefficients of p(x)*(x+nq-1)
+      pc[nq] = 0.;
+      for (let i = nq; i >= 2; i--)
+        pc[i] = pc[i - 1] + fnqm1 * pc[i];
+      pc[1] = fnqm1 * pc[1];
+
+      // Compute integral, -1 to 0, of p(x) and x*p(x)
+      let pint = pc[1];
+      let xpin = pc[1] / 2.;
+      let tsign = 1.;
+      for (let i = 2; i <= nq; i++) {
+        tsign = -tsign;
+        pint += tsign * pc[i] / i;
+        xpin += tsign * pc[i] / (i + 1);
+      }
+
+      // Store coefficients in elco and tesco
+      c.elco[nq][1] = pint * rq1fac;
+      c.elco[nq][2] = 1.;
+      for (let i = 2; i <= nq; i++)
+        c.elco[nq][i + 1] = rq1fac * pc[i] / i;
+      const agamq = rqfac * xpin;
+      const ragq = 1. / agamq;
+      c.tesco[nq][2] = ragq;
+      if (nq < 12)
+        c.tesco[nqp1][1] = ragq * rqfac / nqp1;
+      c.tesco[nqm1][3] = ragq;
+    }
+    return;
+  }
+
+  // meth = 2 (BDF)
+  pc[1] = 1.;
+  let rq1fac = 1.;
+
+  for (let nq = 1; nq <= 5; nq++) {
+    const fnq = nq;
+    const nqp1 = nq + 1;
+
+    // Form coefficients of p(x)*(x+nq)
+    pc[nqp1] = 0.;
+    for (let i = nq + 1; i >= 2; i--)
+      pc[i] = pc[i - 1] + fnq * pc[i];
+    pc[1] *= fnq;
+
+    // Store coefficients in elco and tesco
+    for (let i = 1; i <= nqp1; i++)
+      c.elco[nq][i] = pc[i] / pc[2];
+    c.elco[nq][2] = 1.;
+    c.tesco[nq][1] = rq1fac;
+    c.tesco[nq][2] = nqp1 / c.elco[nq][1];
+    c.tesco[nq][3] = (nq + 2) / c.elco[nq][1];
+    rq1fac /= fnq;
+  }
+}

package/src/solver-tools/lsoda/common.js

@@ -0,0 +1,94 @@
+// Constants from common.h
+export const ETA = 2.2204460492503131e-16;
+export const SQRTETA = 1.4901161193847656e-08;
+export const CCMAX = 0.3;
+export const MAXCOR = 3;
+export const MSBP = 20;
+export const MXNCF = 10;
+export const RATIO = 5.0;
+// Stability region limits for Adams method (from common.c)
+export const sm1 = [
+    0., 0.5, 0.575, 0.55, 0.45, 0.35, 0.25, 0.2, 0.15, 0.1, 0.075, 0.05, 0.025,
+];
+// Method switch coefficients (from methodswitch.c)
+// cm1 and cm2 are calculated from tesco/elco 1 and 2 formula in cfode.c
+export const cm1 = [
+    0, 2.0, 5.999999999999998, 4.0,
+    1.5780346820809881, 0.44444444444444464, 0.09712509625876042, 0.017636684303350972,
+    0.002666977809498494, 0.00033760591160674403, 0.000035714285714285924, 3.1001984126984256e-06,
+    2.1543369643350994e-07,
+];
+export const cm2 = [
+    0, 2.0, 1.5, 0.6666666666666667,
+    0.20833333333333348, 0.04999999999999998, 0.09712509625876042, 0.017636684303350972,
+    0.002666977809498494, 0.00033760591160674403, 0.000035714285714285924, 3.1001984126984256e-06,
+    2.1543369643350994e-07,
+];
+// Internal solver state (mirrors lsoda_common_t)
+export class LsodaCommon {
+    constructor() {
+        // Solution history (2D: yh[j][i], 1-indexed)
+        this.yh = [];
+        // Working matrix for Jacobian/LU (2D: wm[i][j], 1-indexed)
+        this.wm = [];
+        // Error weights (1-indexed)
+        this.ewt = new Float64Array(0);
+        // Saved function values (1-indexed)
+        this.savf = new Float64Array(0);
+        // Accumulated corrections (1-indexed)
+        this.acor = new Float64Array(0);
+        // Pivot indices for LU (1-indexed)
+        this.ipvt = new Int32Array(0);
+        // Step size
+        this.h = 0;
+        this.hu = 0;
+        this.rc = 0;
+        this.tn = 0;
+        this.tsw = 0;
+        this.pdnorm = 0;
+        // Convergence
+        this.crate = 0;
+        this.el = new Float64Array(14);
+        this.hold = 0;
+        this.rmax = 0;
+        this.pdest = 0;
+        this.pdlast = 0;
+        // Method coefficients (2D arrays, 1-indexed)
+        this.elco = [];
+        this.tesco = [];
+        // Counters and flags
+        this.ialth = 0;
+        this.ipup = 0;
+        this.nslp = 0;
+        this.icount = 0;
+        this.irflag = 0;
+        this.imxer = 0;
+        this.illin = 0;
+        this.nhnil = 0;
+        this.nslast = 0;
+        this.jcur = 0;
+        this.meth = 0;
+        this.mused = 0;
+        this.nq = 0;
+        this.nst = 0;
+        this.ncf = 0;
+        this.nfe = 0;
+        this.nje = 0;
+        this.nqu = 0;
+        this.miter = 0;
+    }
+}
+// Solver context
+export class LsodaContext {
+    constructor(func, neq, data) {
+        this.error = null;
+        this.common = null;
+        this.opt = null;
+        this.snapshots = null;
+        this.func = func;
+        this.neq = neq;
+        this.data = data !== null && data !== void 0 ? data : null;
+        this.state = 1;
+    }
+}
+//# sourceMappingURL=common.js.map

package/src/solver-tools/lsoda/common.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"common.js","sourceRoot":"","sources":["common.ts"],"names":[],"mappings":"AAAA,0BAA0B;AAC1B,MAAM,CAAC,MAAM,GAAG,GAAG,sBAAsB,CAAC;AAC1C,MAAM,CAAC,MAAM,OAAO,GAAG,sBAAsB,CAAC;AAC9C,MAAM,CAAC,MAAM,KAAK,GAAG,GAAG,CAAC;AACzB,MAAM,CAAC,MAAM,MAAM,GAAG,CAAC,CAAC;AACxB,MAAM,CAAC,MAAM,IAAI,GAAG,EAAE,CAAC;AACvB,MAAM,CAAC,MAAM,KAAK,GAAG,EAAE,CAAC;AACxB,MAAM,CAAC,MAAM,KAAK,GAAG,GAAG,CAAC;AAEzB,2DAA2D;AAC3D,MAAM,CAAC,MAAM,GAAG,GAAa;IAC3B,EAAE,EAAE,GAAG,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK;CAC3E,CAAC;AAEF,mDAAmD;AACnD,wEAAwE;AACxE,MAAM,CAAC,MAAM,GAAG,GAAa;IAC3B,CAAC,EAAE,GAAG,EAAE,iBAAiB,EAAE,GAAG;IAC9B,kBAAkB,EAAE,mBAAmB,EAAE,mBAAmB,EAAE,oBAAoB;IAClF,oBAAoB,EAAE,sBAAsB,EAAE,uBAAuB,EAAE,sBAAsB;IAC7F,sBAAsB;CACvB,CAAC;AAEF,MAAM,CAAC,MAAM,GAAG,GAAa;IAC3B,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,kBAAkB;IAC/B,mBAAmB,EAAE,mBAAmB,EAAE,mBAAmB,EAAE,oBAAoB;IACnF,oBAAoB,EAAE,sBAAsB,EAAE,uBAAuB,EAAE,sBAAsB;IAC7F,sBAAsB;CACvB,CAAC;AAuBF,iDAAiD;AACjD,MAAM,OAAO,WAAW;IAAxB;QACE,6CAA6C;QAC7C,OAAE,GAAmB,EAAE,CAAC;QACxB,2DAA2D;QAC3D,OAAE,GAAmB,EAAE,CAAC;QACxB,4BAA4B;QAC5B,QAAG,GAAiB,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC;QACxC,oCAAoC;QACpC,SAAI,GAAiB,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC;QACzC,sCAAsC;QACtC,SAAI,GAAiB,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC;QACzC,mCAAmC;QACnC,SAAI,GAAe,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC;QAErC,YAAY;QACZ,MAAC,GAAW,CAAC,CAAC;QACd,OAAE,GAAW,CAAC,CAAC;QACf,OAAE,GAAW,CAAC,CAAC;QACf,OAAE,GAAW,CAAC,CAAC;QACf,QAAG,GAAW,CAAC,CAAC;QAChB,WAAM,GAAW,CAAC,CAAC;QAEnB,cAAc;QACd,UAAK,GAAW,CAAC,CAAC;QAClB,OAAE,GAAiB,IAAI,YAAY,CAAC,EAAE,CAAC,CAAC;QACxC,SAAI,GAAW,CAAC,CAAC;QACjB,SAAI,GAAW,CAAC,CAAC;QACjB,UAAK,GAAW,CAAC,CAAC;QAClB,WAAM,GAAW,CAAC,CAAC;QAEnB,6CAA6C;QAC7C,SAAI,GAAmB,EAAE,CAAC;QAC1B,UAAK,GAAmB,EAAE,CAAC;QAE3B,qBAAqB;QACrB,UAAK,GAAW,CAAC,CAAC;QAClB,SAAI,GAAW,CAAC,CAAC;QACjB,SAAI,GAAW,CAAC,CAAC;QACjB,WAAM,GAAW,CAAC,CAAC;QACnB,WAAM,GAAW,CAAC,CAAC;QACnB,UAAK,GAAW,CAAC,CAAC;QAClB,UAAK,GAAW,CAAC,CAAC;QAClB,UAAK,GAAW,CAAC,CAAC;QAClB,WAAM,GAAW,CAAC,CAAC;QACnB,SAAI,GAAW,CAAC,CAAC;QACjB,SAAI,GAAW,CAAC,CAAC;QACjB,UAAK,GAAW,CAAC,CAAC;QAClB,OAAE,GAAW,CAAC,CAAC;QACf,QAAG,GAAW,CAAC,CAAC;QAChB,QAAG,GAAW,CAAC,CAAC;QAChB,QAAG,GAAW,CAAC,CAAC;QAChB,QAAG,GAAW,CAAC,CAAC;QAChB,QAAG,GAAW,CAAC,CAAC;QAChB,UAAK,GAAW,CAAC,CAAC;IACpB,CAAC;CAAA;AAWD,iBAAiB;AACjB,MAAM,OAAO,YAAY;IAUvB,YAAY,IAAe,EAAE,GAAW,EAAE,IAAU;QALpD,UAAK,GAAkB,IAAI,CAAC;QAC5B,WAAM,GAAuB,IAAI,CAAC;QAClC,QAAG,GAAoB,IAAI,CAAC;QAC5B,cAAS,GAA+B,IAAI,CAAC;QAG3C,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC;QACf,IAAI,CAAC,IAAI,GAAG,IAAI,aAAJ,IAAI,cAAJ,IAAI,GAAI,IAAI,CAAC;QACzB,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;IACjB,CAAC;CACF"}

package/src/solver-tools/lsoda/common.ts

@@ -0,0 +1,135 @@
+// Constants from common.h
+export const ETA = 2.2204460492503131e-16;
+export const SQRTETA = 1.4901161193847656e-08;
+export const CCMAX = 0.3;
+export const MAXCOR = 3;
+export const MSBP = 20;
+export const MXNCF = 10;
+export const RATIO = 5.0;
+
+// Stability region limits for Adams method (from common.c)
+export const sm1: number[] = [
+  0., 0.5, 0.575, 0.55, 0.45, 0.35, 0.25, 0.2, 0.15, 0.1, 0.075, 0.05, 0.025,
+];
+
+// Method switch coefficients (from methodswitch.c)
+// cm1 and cm2 are calculated from tesco/elco 1 and 2 formula in cfode.c
+export const cm1: number[] = [
+  0, 2.0, 5.999999999999998, 4.0,
+  1.5780346820809881, 0.44444444444444464, 0.09712509625876042, 0.017636684303350972,
+  0.002666977809498494, 0.00033760591160674403, 0.000035714285714285924, 3.1001984126984256e-06,
+  2.1543369643350994e-07,
+];
+
+export const cm2: number[] = [
+  0, 2.0, 1.5, 0.6666666666666667,
+  0.20833333333333348, 0.04999999999999998, 0.09712509625876042, 0.017636684303350972,
+  0.002666977809498494, 0.00033760591160674403, 0.000035714285714285924, 3.1001984126984256e-06,
+  2.1543369643350994e-07,
+];
+
+// User-provided ODE function type
+// t: current time, y: state vector (0-based), ydot: output derivatives (0-based), data: user data
+export type LsodaFunc = (t: number, y: Float64Array, ydot: Float64Array, data: any) => number;
+
+// Solver options
+export interface LsodaOpt {
+  ixpr: number; // print flag
+  mxstep: number; // max internal steps per call
+  mxhnil: number; // max step size warnings
+  mxordn: number; // max Adams order (1-12)
+  mxords: number; // max BDF order (1-5)
+  tcrit: number; // critical time for itask 4,5
+  h0: number; // initial step size (0 = auto)
+  hmax: number; // max absolute step size
+  hmin: number; // min absolute step size
+  hmxi: number; // 1/hmax (computed)
+  itask: number; // integration task (1-5)
+  rtol: Float64Array; // relative tolerance (1-indexed)
+  atol: Float64Array; // absolute tolerance (1-indexed)
+}
+
+// Internal solver state (mirrors lsoda_common_t)
+export class LsodaCommon {
+  // Solution history (2D: yh[j][i], 1-indexed)
+  yh: Float64Array[] = [];
+  // Working matrix for Jacobian/LU (2D: wm[i][j], 1-indexed)
+  wm: Float64Array[] = [];
+  // Error weights (1-indexed)
+  ewt: Float64Array = new Float64Array(0);
+  // Saved function values (1-indexed)
+  savf: Float64Array = new Float64Array(0);
+  // Accumulated corrections (1-indexed)
+  acor: Float64Array = new Float64Array(0);
+  // Pivot indices for LU (1-indexed)
+  ipvt: Int32Array = new Int32Array(0);
+
+  // Step size
+  h: number = 0;
+  hu: number = 0;
+  rc: number = 0;
+  tn: number = 0;
+  tsw: number = 0;
+  pdnorm: number = 0;
+
+  // Convergence
+  crate: number = 0;
+  el: Float64Array = new Float64Array(14);
+  hold: number = 0;
+  rmax: number = 0;
+  pdest: number = 0;
+  pdlast: number = 0;
+
+  // Method coefficients (2D arrays, 1-indexed)
+  elco: Float64Array[] = [];
+  tesco: Float64Array[] = [];
+
+  // Counters and flags
+  ialth: number = 0;
+  ipup: number = 0;
+  nslp: number = 0;
+  icount: number = 0;
+  irflag: number = 0;
+  imxer: number = 0;
+  illin: number = 0;
+  nhnil: number = 0;
+  nslast: number = 0;
+  jcur: number = 0;
+  meth: number = 0;
+  mused: number = 0;
+  nq: number = 0;
+  nst: number = 0;
+  ncf: number = 0;
+  nfe: number = 0;
+  nje: number = 0;
+  nqu: number = 0;
+  miter: number = 0;
+}
+
+// Snapshot of the Nordsieck array at a successful step (0-based arrays)
+export interface NordsieckSnapshot {
+  tn: number; // right edge of the step
+  h: number; // step size used
+  hu: number; // last successful step size (for range check)
+  nq: number; // method order
+  yh: Float64Array[]; // yh[0..nq], each of length neq (0-based copies)
+}
+
+// Solver context
+export class LsodaContext {
+  func: LsodaFunc;
+  data: any;
+  neq: number;
+  state: number;
+  error: string | null = null;
+  common: LsodaCommon | null = null;
+  opt: LsodaOpt | null = null;
+  snapshots: NordsieckSnapshot[] | null = null;
+
+  constructor(func: LsodaFunc, neq: number, data?: any) {
+    this.func = func;
+    this.neq = neq;
+    this.data = data ?? null;
+    this.state = 1;
+  }
+}

package/src/solver-tools/lsoda/corfailure.js

@@ -0,0 +1,25 @@
+import { MXNCF } from './common';
+/**
+ * Handle corrector convergence failure.
+ * Retracts yh array and increments ncf.
+ * Returns 2 if unrecoverable, 1 if step can be retried.
+ */
+export function corfailure(ctx, told) {
+    const c = ctx.common;
+    const neq = ctx.neq;
+    const hmin = ctx.opt.hmin;
+    c.ncf++;
+    c.rmax = 2.;
+    c.tn = told;
+    for (let j = c.nq; j >= 1; j--) {
+        for (let i1 = j; i1 <= c.nq; i1++) {
+            for (let i = 1; i <= neq; i++)
+                c.yh[i1][i] -= c.yh[i1 + 1][i];
+        }
+    }
+    if (Math.abs(c.h) <= hmin * 1.00001 || c.ncf === MXNCF)
+        return 2;
+    c.ipup = c.miter;
+    return 1;
+}
+//# sourceMappingURL=corfailure.js.map

package/src/solver-tools/lsoda/corfailure.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"corfailure.js","sourceRoot":"","sources":["corfailure.ts"],"names":[],"mappings":"AAAA,OAAO,EAAe,KAAK,EAAC,MAAM,UAAU,CAAC;AAE7C;;;;GAIG;AACH,MAAM,UAAU,UAAU,CAAC,GAAiB,EAAE,IAAY;IACxD,MAAM,CAAC,GAAG,GAAG,CAAC,MAAO,CAAC;IACtB,MAAM,GAAG,GAAG,GAAG,CAAC,GAAG,CAAC;IACpB,MAAM,IAAI,GAAG,GAAG,CAAC,GAAI,CAAC,IAAI,CAAC;IAE3B,CAAC,CAAC,GAAG,EAAE,CAAC;IACR,CAAC,CAAC,IAAI,GAAG,EAAE,CAAC;IACZ,CAAC,CAAC,EAAE,GAAG,IAAI,CAAC;IAEZ,KAAK,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC/B,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC;YAClC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,GAAG,EAAE,CAAC,EAAE;gBAC3B,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACnC,CAAC;IACH,CAAC;IAED,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,IAAI,GAAG,OAAO,IAAI,CAAC,CAAC,GAAG,KAAK,KAAK;QACpD,OAAO,CAAC,CAAC;IAGX,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,KAAK,CAAC;IACjB,OAAO,CAAC,CAAC;AACX,CAAC"}