diff-grok 1.0.10 → 1.2.0

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

@@ -0,0 +1,121 @@
+/**
+ * TypeScript port of liblsoda (https://github.com/sdwfrost/liblsoda)
+ * Original LSODA algorithm by Linda Petzold & Alan Hindmarsh (1983)
+ *
+ * Copyright (c) 2011 Yu Feng, McWilliam Cosmology Center, Carnegie Mellon University
+ * Copyright (c) 2016 Simon Frost
+ * Copyright (c) 2026 Datagrok
+ *
+ * Licensed under the MIT License. See THIRD_PARTY_LICENSES for the full
+ * license text and provenance chain of the original code.
+ */
+/**
+ * Dense output interpolator. Given a sequence of Nordsieck snapshots
+ * captured during integration, evaluates the solution at arbitrary points
+ * via Taylor/Horner interpolation.
+ */
+export class DenseOutput {
+    constructor(snapshots, neq) {
+        if (snapshots.length === 0)
+            throw new Error('[DenseOutput] no snapshots collected');
+        this.snaps = snapshots;
+        this.neq = neq;
+    }
+    /** Leftmost reachable time. */
+    get tMin() {
+        const s = this.snaps[0];
+        return s.tn - s.hu;
+    }
+    /** Rightmost reachable time. */
+    get tMax() {
+        return this.snaps[this.snaps.length - 1].tn;
+    }
+    /**
+     * Evaluate the solution at a single time point.
+     * Uses Horner's method on the Nordsieck array of the enclosing step.
+     */
+    evaluateAt(t) {
+        const snap = this.findSnap(t);
+        return this.horner(snap, t, new Float64Array(this.neq));
+    }
+    /**
+     * Evaluate the solution at each point in a sorted ascending array.
+     * Uses a linear scan over snapshots for efficiency.
+     */
+    solveAtTimes(tArray) {
+        if (tArray.length === 0)
+            return [];
+        const snaps = this.snaps;
+        // Validate range
+        const tFirst = tArray[0];
+        const tLast = tArray[tArray.length - 1];
+        if (tFirst < this.tMin - 1e-14 * Math.abs(this.tMin))
+            throw new Error(`[DenseOutput] t=${tFirst} is before tMin=${this.tMin}`);
+        if (tLast > this.tMax + 1e-14 * Math.abs(this.tMax))
+            throw new Error(`[DenseOutput] t=${tLast} is after tMax=${this.tMax}`);
+        const dky = new Float64Array(this.neq);
+        const result = [];
+        for (let i = 0; i < this.neq; ++i)
+            result.push(new Float64Array(tArray.length));
+        let si = 0; // snapshot pointer
+        for (let qi = 0; qi < tArray.length; qi++) {
+            const t = tArray[qi];
+            // Advance snapshot pointer until we find an interval containing t
+            while (si < snaps.length - 1 && t > snaps[si].tn + 1e-14 * Math.abs(snaps[si].tn))
+                si++;
+            this.horner(snaps[si], t, dky);
+            for (let i = 0; i < this.neq; ++i)
+                result[i][qi] = dky[i];
+        }
+        return result;
+    }
+    /**
+     * Evaluate the solution on a uniform grid from tStart to tEnd with given step.
+     */
+    solveOnGrid(tStart, tEnd, step) {
+        if (step <= 0)
+            throw new Error('[DenseOutput] step must be positive');
+        const n = Math.floor((tEnd - tStart) / step) + 1;
+        const tArr = new Float64Array(n);
+        for (let i = 0; i < n - 1; i++)
+            tArr[i] = tStart + i * step;
+        tArr[n - 1] = tEnd;
+        const t = tArr;
+        const y = this.solveAtTimes(t);
+        return { t, y };
+    }
+    /** Find the snapshot whose interval contains t via binary search. */
+    findSnap(t) {
+        const snaps = this.snaps;
+        // Quick boundary checks
+        if (t <= snaps[0].tn)
+            return snaps[0];
+        if (t >= snaps[snaps.length - 1].tn)
+            return snaps[snaps.length - 1];
+        // Binary search: find first snap with tn >= t
+        let lo = 0;
+        let hi = snaps.length - 1;
+        while (lo < hi) {
+            const mid = (lo + hi) >>> 1;
+            if (snaps[mid].tn < t)
+                lo = mid + 1;
+            else
+                hi = mid;
+        }
+        return snaps[lo];
+    }
+    /** Horner evaluation of the Nordsieck polynomial at time t. */
+    horner(snap, t, dky) {
+        const { nq, h, yh } = snap;
+        const neq = this.neq;
+        const s = (t - snap.tn) / h;
+        for (let i = 0; i < neq; i++) {
+            let val = yh[nq][i];
+            for (let j = nq - 1; j >= 0; j--)
+                val = yh[j][i] + s * val;
+            dky[i] = val;
+        }
+        return dky;
+    }
+}
+//# sourceMappingURL=dense.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"dense.js","sourceRoot":"","sources":["dense.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAIH;;;;GAIG;AACH,MAAM,OAAO,WAAW;IAItB,YAAY,SAA8B,EAAE,GAAW;QACrD,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC;YACxB,MAAM,IAAI,KAAK,CAAC,sCAAsC,CAAC,CAAC;QAC1D,IAAI,CAAC,KAAK,GAAG,SAAS,CAAC;QACvB,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC;IACjB,CAAC;IAED,+BAA+B;IAC/B,IAAI,IAAI;QACN,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QACxB,OAAO,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC;IACrB,CAAC;IAED,gCAAgC;IAChC,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;IAC9C,CAAC;IAED;;;OAGG;IACH,UAAU,CAAC,CAAS;QAClB,MAAM,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;QAC9B,OAAO,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,EAAE,IAAI,YAAY,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;IAC1D,CAAC;IAED;;;OAGG;IACH,YAAY,CAAC,MAAoB;QAC/B,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,EAAE,CAAC;QACnC,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC;QAEzB,iBAAiB;QACjB,MAAM,MAAM,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;QACzB,MAAM,KAAK,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACxC,IAAI,MAAM,GAAG,IAAI,CAAC,IAAI,GAAG,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC;YAClD,MAAM,IAAI,KAAK,CAAC,mBAAmB,MAAM,mBAAmB,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC;QAC3E,IAAI,KAAK,GAAG,IAAI,CAAC,IAAI,GAAG,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC;YACjD,MAAM,IAAI,KAAK,CAAC,mBAAmB,KAAK,kBAAkB,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC;QAEzE,MAAM,GAAG,GAAG,IAAI,YAAY,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACvC,MAAM,MAAM,GAAmB,EAAE,CAAC;QAElC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC;YAC/B,MAAM,CAAC,IAAI,CAAC,IAAI,YAAY,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC;QAE/C,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC,mBAAmB;QAE/B,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,MAAM,CAAC,MAAM,EAAE,EAAE,EAAE,EAAE,CAAC;YAC1C,MAAM,CAAC,GAAG,MAAM,CAAC,EAAE,CAAC,CAAC;YACrB,kEAAkE;YAClE,OAAO,EAAE,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;gBAC/E,EAAE,EAAE,CAAC;YAEP,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC;YAE/B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC;gBAC/B,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;QAC3B,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;OAEG;IACH,WAAW,CAAC,MAAc,EAAE,IAAY,EAAE,IAAY;QACpD,IAAI,IAAI,IAAI,CAAC;YACX,MAAM,IAAI,KAAK,CAAC,qCAAqC,CAAC,CAAC;QAEzD,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,GAAG,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC;QACjD,MAAM,IAAI,GAAG,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC;QACjC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;YAC5B,IAAI,CAAC,CAAC,CAAC,GAAG,MAAM,GAAG,CAAC,GAAG,IAAI,CAAC;QAC9B,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC;QAEnB,MAAM,CAAC,GAAG,IAAI,CAAC;QACf,MAAM,CAAC,GAAG,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QAC/B,OAAO,EAAC,CAAC,EAAE,CAAC,EAAC,CAAC;IAChB,CAAC;IAED,qEAAqE;IAC7D,QAAQ,CAAC,CAAS;QACxB,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC;QAEzB,wBAAwB;QACxB,IAAI,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE;YAAE,OAAO,KAAK,CAAC,CAAC,CAAC,CAAC;QACtC,IAAI,CAAC,IAAI,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,EAAE;YAAE,OAAO,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QAEpE,8CAA8C;QAC9C,IAAI,EAAE,GAAG,CAAC,CAAC;QAAC,IAAI,EAAE,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;QACtC,OAAO,EAAE,GAAG,EAAE,EAAE,CAAC;YACf,MAAM,GAAG,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,KAAK,CAAC,CAAC;YAC5B,IAAI,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC;gBACnB,EAAE,GAAG,GAAG,GAAG,CAAC,CAAC;;gBAEb,EAAE,GAAG,GAAG,CAAC;QACb,CAAC;QACD,OAAO,KAAK,CAAC,EAAE,CAAC,CAAC;IACnB,CAAC;IAED,+DAA+D;IACvD,MAAM,CAAC,IAAuB,EAAE,CAAS,EAAE,GAAiB;QAClE,MAAM,EAAC,EAAE,EAAE,CAAC,EAAE,EAAE,EAAC,GAAG,IAAI,CAAC;QACzB,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC;QACrB,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;QAE5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7B,IAAI,GAAG,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;YACpB,KAAK,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE;gBAC9B,GAAG,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC;YAC3B,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;QACf,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;CACF"}

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

@@ -0,0 +1,141 @@
+/**
+ * TypeScript port of liblsoda (https://github.com/sdwfrost/liblsoda)
+ * Original LSODA algorithm by Linda Petzold & Alan Hindmarsh (1983)
+ *
+ * Copyright (c) 2011 Yu Feng, McWilliam Cosmology Center, Carnegie Mellon University
+ * Copyright (c) 2016 Simon Frost
+ * Copyright (c) 2026 Datagrok
+ *
+ * Licensed under the MIT License. See THIRD_PARTY_LICENSES for the full
+ * license text and provenance chain of the original code.
+ */
+
+import {NordsieckSnapshot} from './common';
+
+/**
+ * Dense output interpolator. Given a sequence of Nordsieck snapshots
+ * captured during integration, evaluates the solution at arbitrary points
+ * via Taylor/Horner interpolation.
+ */
+export class DenseOutput {
+  private snaps: NordsieckSnapshot[];
+  private neq: number;
+
+  constructor(snapshots: NordsieckSnapshot[], neq: number) {
+    if (snapshots.length === 0)
+      throw new Error('[DenseOutput] no snapshots collected');
+    this.snaps = snapshots;
+    this.neq = neq;
+  }
+
+  /** Leftmost reachable time. */
+  get tMin(): number {
+    const s = this.snaps[0];
+    return s.tn - s.hu;
+  }
+
+  /** Rightmost reachable time. */
+  get tMax(): number {
+    return this.snaps[this.snaps.length - 1].tn;
+  }
+
+  /**
+   * Evaluate the solution at a single time point.
+   * Uses Horner's method on the Nordsieck array of the enclosing step.
+   */
+  evaluateAt(t: number): Float64Array {
+    const snap = this.findSnap(t);
+    return this.horner(snap, t, new Float64Array(this.neq));
+  }
+
+  /**
+   * Evaluate the solution at each point in a sorted ascending array.
+   * Uses a linear scan over snapshots for efficiency.
+   */
+  solveAtTimes(tArray: Float64Array): Float64Array[] {
+    if (tArray.length === 0) return [];
+    const snaps = this.snaps;
+
+    // Validate range
+    const tFirst = tArray[0];
+    const tLast = tArray[tArray.length - 1];
+    if (tFirst < this.tMin - 1e-14 * Math.abs(this.tMin))
+      throw new Error(`[DenseOutput] t=${tFirst} is before tMin=${this.tMin}`);
+    if (tLast > this.tMax + 1e-14 * Math.abs(this.tMax))
+      throw new Error(`[DenseOutput] t=${tLast} is after tMax=${this.tMax}`);
+
+    const dky = new Float64Array(this.neq);
+    const result: Float64Array[] = [];
+
+    for (let i = 0; i < this.neq; ++i)
+      result.push(new Float64Array(tArray.length));
+
+    let si = 0; // snapshot pointer
+
+    for (let qi = 0; qi < tArray.length; qi++) {
+      const t = tArray[qi];
+      // Advance snapshot pointer until we find an interval containing t
+      while (si < snaps.length - 1 && t > snaps[si].tn + 1e-14 * Math.abs(snaps[si].tn))
+        si++;
+
+      this.horner(snaps[si], t, dky);
+
+      for (let i = 0; i < this.neq; ++i)
+        result[i][qi] = dky[i];
+    }
+    return result;
+  }
+
+  /**
+   * Evaluate the solution on a uniform grid from tStart to tEnd with given step.
+   */
+  solveOnGrid(tStart: number, tEnd: number, step: number): { t: Float64Array, y: Float64Array[] } {
+    if (step <= 0)
+      throw new Error('[DenseOutput] step must be positive');
+
+    const n = Math.floor((tEnd - tStart) / step) + 1;
+    const tArr = new Float64Array(n);
+    for (let i = 0; i < n - 1; i++)
+      tArr[i] = tStart + i * step;
+    tArr[n - 1] = tEnd;
+
+    const t = tArr;
+    const y = this.solveAtTimes(t);
+    return {t, y};
+  }
+
+  /** Find the snapshot whose interval contains t via binary search. */
+  private findSnap(t: number): NordsieckSnapshot {
+    const snaps = this.snaps;
+
+    // Quick boundary checks
+    if (t <= snaps[0].tn) return snaps[0];
+    if (t >= snaps[snaps.length - 1].tn) return snaps[snaps.length - 1];
+
+    // Binary search: find first snap with tn >= t
+    let lo = 0; let hi = snaps.length - 1;
+    while (lo < hi) {
+      const mid = (lo + hi) >>> 1;
+      if (snaps[mid].tn < t)
+        lo = mid + 1;
+      else
+        hi = mid;
+    }
+    return snaps[lo];
+  }
+
+  /** Horner evaluation of the Nordsieck polynomial at time t. */
+  private horner(snap: NordsieckSnapshot, t: number, dky: Float64Array): Float64Array {
+    const {nq, h, yh} = snap;
+    const neq = this.neq;
+    const s = (t - snap.tn) / h;
+
+    for (let i = 0; i < neq; i++) {
+      let val = yh[nq][i];
+      for (let j = nq - 1; j >= 0; j--)
+        val = yh[j][i] + s * val;
+      dky[i] = val;
+    }
+    return dky;
+  }
+}

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

@@ -0,0 +1,15 @@
+/**
+ * TypeScript port of liblsoda (https://github.com/sdwfrost/liblsoda)
+ * Original LSODA algorithm by Linda Petzold & Alan Hindmarsh (1983)
+ *
+ * Copyright (c) 2011 Yu Feng, McWilliam Cosmology Center, Carnegie Mellon University
+ * Copyright (c) 2016 Simon Frost
+ * Copyright (c) 2026 Datagrok
+ *
+ * Licensed under the MIT License. See THIRD_PARTY_LICENSES for the full
+ * license text and provenance chain of the original code.
+ */
+export { Lsoda, lsoda, lsodaPrepare, lsodaReset, lsodaFree } from './lsoda';
+export { LsodaContext } from './common';
+export { DenseOutput } from './dense';
+//# sourceMappingURL=index.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAEH,OAAO,EAAC,KAAK,EAAE,KAAK,EAAE,YAAY,EAAE,UAAU,EAAE,SAAS,EAAC,MAAM,SAAS,CAAC;AAG1E,OAAO,EAAC,YAAY,EAAC,MAAM,UAAU,CAAC;AACtC,OAAO,EAAC,WAAW,EAAC,MAAM,SAAS,CAAC"}

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

@@ -0,0 +1,17 @@
+/**
+ * TypeScript port of liblsoda (https://github.com/sdwfrost/liblsoda)
+ * Original LSODA algorithm by Linda Petzold & Alan Hindmarsh (1983)
+ *
+ * Copyright (c) 2011 Yu Feng, McWilliam Cosmology Center, Carnegie Mellon University
+ * Copyright (c) 2016 Simon Frost
+ * Copyright (c) 2026 Datagrok
+ *
+ * Licensed under the MIT License. See THIRD_PARTY_LICENSES for the full
+ * license text and provenance chain of the original code.
+ */
+
+export {Lsoda, lsoda, lsodaPrepare, lsodaReset, lsodaFree} from './lsoda';
+export type {OdeFunction, LsodaSolveResult} from './lsoda';
+export type {LsodaOpt, LsodaFunc, NordsieckSnapshot} from './common';
+export {LsodaContext} from './common';
+export {DenseOutput} from './dense';

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

@@ -0,0 +1,54 @@
+/**
+ * TypeScript port of liblsoda (https://github.com/sdwfrost/liblsoda)
+ * Original LSODA algorithm by Linda Petzold & Alan Hindmarsh (1983)
+ *
+ * Copyright (c) 2011 Yu Feng, McWilliam Cosmology Center, Carnegie Mellon University
+ * Copyright (c) 2016 Simon Frost
+ * Copyright (c) 2026 Datagrok
+ *
+ * Licensed under the MIT License. See THIRD_PARTY_LICENSES for the full
+ * license text and provenance chain of the original code.
+ */
+import { ETA } from './common';
+/**
+ * Interpolate solution at time t using Nordsieck history array.
+ * k: derivative order (0 for solution)
+ * dky: output array (1-indexed)
+ * Returns 0 on success, negative on error.
+ */
+export function intdy(ctx, t, k, dky) {
+    const c = ctx.common;
+    const neq = ctx.neq;
+    if (k < 0 || k > c.nq) {
+        console.error(`[intdy] k = ${k} illegal`);
+        return -1;
+    }
+    const tp = c.tn - c.hu - 100. * ETA * (c.tn + c.hu);
+    if ((t - tp) * (t - c.tn) > 0.) {
+        console.error(`intdy -- t = ${t} illegal. t not in interval tcur - hu to tcur`);
+        return -2;
+    }
+    const s = (t - c.tn) / c.h;
+    let ic = 1;
+    for (let jj = (c.nq + 1) - k; jj <= c.nq; jj++)
+        ic *= jj;
+    let cc = ic;
+    for (let i = 1; i <= neq; i++)
+        dky[i] = cc * c.yh[c.nq + 1][i];
+    for (let j = c.nq - 1; j >= k; j--) {
+        const jp1 = j + 1;
+        ic = 1;
+        for (let jj = jp1 - k; jj <= j; jj++)
+            ic *= jj;
+        cc = ic;
+        for (let i = 1; i <= neq; i++)
+            dky[i] = cc * c.yh[jp1][i] + s * dky[i];
+    }
+    if (k === 0)
+        return 0;
+    const r = Math.pow(c.h, -k);
+    for (let i = 1; i <= neq; i++)
+        dky[i] *= r;
+    return 0;
+}
+//# sourceMappingURL=intdy.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"intdy.js","sourceRoot":"","sources":["intdy.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAEH,OAAO,EAAe,GAAG,EAAC,MAAM,UAAU,CAAC;AAE3C;;;;;GAKG;AACH,MAAM,UAAU,KAAK,CAAC,GAAiB,EAAE,CAAS,EAAE,CAAS,EAAE,GAAiB;IAC9E,MAAM,CAAC,GAAG,GAAG,CAAC,MAAO,CAAC;IACtB,MAAM,GAAG,GAAG,GAAG,CAAC,GAAG,CAAC;IAEpB,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC;QACtB,OAAO,CAAC,KAAK,CAAC,eAAe,CAAC,UAAU,CAAC,CAAC;QAC1C,OAAO,CAAC,CAAC,CAAC;IACZ,CAAC;IAED,MAAM,EAAE,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,GAAG,IAAI,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC;IACpD,IAAI,CAAC,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC;QAC/B,OAAO,CAAC,KAAK,CAAC,gBAAgB,CAAC,+CAA+C,CAAC,CAAC;QAChF,OAAO,CAAC,CAAC,CAAC;IACZ,CAAC;IAED,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAC3B,IAAI,EAAE,GAAG,CAAC,CAAC;IACX,KAAK,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE;QAC5C,EAAE,IAAI,EAAE,CAAC;IACX,IAAI,EAAE,GAAG,EAAE,CAAC;IAEZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,GAAG,EAAE,CAAC,EAAE;QAC3B,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAElC,KAAK,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QACnC,MAAM,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC;QAClB,EAAE,GAAG,CAAC,CAAC;QACP,KAAK,IAAI,EAAE,GAAG,GAAG,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,EAAE;YAClC,EAAE,IAAI,EAAE,CAAC;QACX,EAAE,GAAG,EAAE,CAAC;QACR,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,GAAG,EAAE,CAAC,EAAE;YAC3B,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;IAC5C,CAAC;IAED,IAAI,CAAC,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAEtB,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IAC5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,GAAG,EAAE,CAAC,EAAE;QAC3B,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IAEd,OAAO,CAAC,CAAC;AACX,CAAC"}

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

@@ -0,0 +1,62 @@
+/**
+ * TypeScript port of liblsoda (https://github.com/sdwfrost/liblsoda)
+ * Original LSODA algorithm by Linda Petzold & Alan Hindmarsh (1983)
+ *
+ * Copyright (c) 2011 Yu Feng, McWilliam Cosmology Center, Carnegie Mellon University
+ * Copyright (c) 2016 Simon Frost
+ * Copyright (c) 2026 Datagrok
+ *
+ * Licensed under the MIT License. See THIRD_PARTY_LICENSES for the full
+ * license text and provenance chain of the original code.
+ */
+
+import {LsodaContext, ETA} from './common';
+
+/**
+ * Interpolate solution at time t using Nordsieck history array.
+ * k: derivative order (0 for solution)
+ * dky: output array (1-indexed)
+ * Returns 0 on success, negative on error.
+ */
+export function intdy(ctx: LsodaContext, t: number, k: number, dky: Float64Array): number {
+  const c = ctx.common!;
+  const neq = ctx.neq;
+
+  if (k < 0 || k > c.nq) {
+    console.error(`[intdy] k = ${k} illegal`);
+    return -1;
+  }
+
+  const tp = c.tn - c.hu - 100. * ETA * (c.tn + c.hu);
+  if ((t - tp) * (t - c.tn) > 0.) {
+    console.error(`intdy -- t = ${t} illegal. t not in interval tcur - hu to tcur`);
+    return -2;
+  }
+
+  const s = (t - c.tn) / c.h;
+  let ic = 1;
+  for (let jj = (c.nq + 1) - k; jj <= c.nq; jj++)
+    ic *= jj;
+  let cc = ic;
+
+  for (let i = 1; i <= neq; i++)
+    dky[i] = cc * c.yh[c.nq + 1][i];
+
+  for (let j = c.nq - 1; j >= k; j--) {
+    const jp1 = j + 1;
+    ic = 1;
+    for (let jj = jp1 - k; jj <= j; jj++)
+      ic *= jj;
+    cc = ic;
+    for (let i = 1; i <= neq; i++)
+      dky[i] = cc * c.yh[jp1][i] + s * dky[i];
+  }
+
+  if (k === 0) return 0;
+
+  const r = Math.pow(c.h, -k);
+  for (let i = 1; i <= neq; i++)
+    dky[i] *= r;
+
+  return 0;
+}