diff-grok 1.2.0 → 1.3.0

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

@@ -1,95 +0,0 @@
-/**
- * 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} 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

@@ -1,94 +0,0 @@
-// 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

@@ -1 +0,0 @@
-{"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

@@ -1,135 +0,0 @@
-// 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.map

@@ -1 +0,0 @@
-{"version":3,"file":"corfailure.js","sourceRoot":"","sources":["corfailure.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAEH,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"}

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

@@ -1 +0,0 @@
-{"version":3,"file":"correction.js","sourceRoot":"","sources":["correction.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAEH,OAAO,EAAe,GAAG,EAAE,MAAM,EAAC,MAAM,UAAU,CAAC;AACnD,OAAO,EAAC,MAAM,EAAC,MAAM,QAAQ,CAAC;AAC9B,OAAO,EAAC,IAAI,EAAC,MAAM,QAAQ,CAAC;AAC5B,OAAO,EAAC,KAAK,EAAC,MAAM,SAAS,CAAC;AAC9B,OAAO,EAAC,UAAU,EAAC,MAAM,cAAc,CAAC;AASxC;;;GAGG;AACH,MAAM,UAAU,UAAU,CACxB,GAAiB,EAAE,CAAe,EAAE,KAAa,EACjD,EAAmB,EAAE,IAAY;IAEjC,MAAM,CAAC,GAAG,GAAG,CAAC,MAAO,CAAC;IACtB,MAAM,GAAG,GAAG,GAAG,CAAC,GAAG,CAAC;IAEpB,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC;IACT,IAAI,IAAI,GAAG,EAAE,CAAC;IACd,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC;IAEZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,GAAG,EAAE,CAAC,EAAE;QAC3B,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAEpB,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,IAAI,CAAC,CAAC;IAC5D,CAAC,CAAC,GAAG,EAAE,CAAC;IAER,OAAO,IAAI,EAAE,CAAC;QACZ,IAAI,EAAE,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC;YACf,IAAI,CAAC,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;gBACf,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;gBAC3B,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC;gBACX,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC;gBACX,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC;gBACV,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC;gBACf,CAAC,CAAC,KAAK,GAAG,GAAG,CAAC;gBACd,IAAI,CAAC,KAAK;oBACR,OAAO,UAAU,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;YACjC,CAAC;YACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,GAAG,EAAE,CAAC,EAAE;gBAC3B,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;QACnB,CAAC;QAED,IAAI,CAAC,CAAC,KAAK,KAAK,CAAC,EAAE,CAAC;YAClB,uBAAuB;YACvB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC9B,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBACzC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC/B,CAAC;YACD,EAAE,CAAC,GAAG,GAAG,MAAM,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC;YAC/B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC9B,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBACxC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACxB,CAAC;QACH,CAAC;aAAM,CAAC;YACN,eAAe;YACf,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,GAAG,EAAE,CAAC,EAAE;gBAC3B,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;YACpD,KAAK,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;YACd,EAAE,CAAC,GAAG,GAAG,MAAM,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC;YAC/B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC9B,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;gBAClB,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC1C,CAAC;QACH,CAAC;QAED,uBAAuB;QACvB,IAAI,EAAE,CAAC,GAAG,IAAI,IAAI,GAAG,KAAK,GAAG,GAAG;YAC9B,MAAM;QAER,IAAI,EAAE,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;YAC/B,IAAI,EAAE,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC;gBACf,IAAI,EAAE,GAAG,MAAM,CAAC;gBAChB,IAAI,EAAE,CAAC,GAAG,IAAI,KAAK,GAAG,EAAE,CAAC,IAAI;oBAC3B,EAAE,GAAG,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,IAAI,CAAC;gBACxB,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;gBAC1B,CAAC,CAAC,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;YACxC,CAAC;YACD,MAAM,KAAK,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;YAC/B,MAAM,IAAI,GAAG,EAAE,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,GAAG,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC;YAC/E,IAAI,IAAI,IAAI,EAAE,EAAE,CAAC;gBACf,CAAC,CAAC,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,EAAE,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC5D,IAAI,CAAC,CAAC,KAAK,KAAK,EAAE;oBAChB,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,KAAK,CAAC;gBACrB,MAAM;YACR,CAAC;QACH,CAAC;QAED,yCAAyC;QACzC,EAAE,CAAC,CAAC,EAAE,CAAC;QACP,IAAI,EAAE,CAAC,CAAC,KAAK,MAAM,IAAI,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,GAAG,GAAG,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;YAC5D,IAAI,CAAC,CAAC,KAAK,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC;gBAC/B,OAAO,UAAU,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;YAE/B,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,KAAK,CAAC;YACjB,8CAA8C;YAC9C,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC;YACT,IAAI,GAAG,EAAE,CAAC;YACV,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC;YACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,GAAG,EAAE,CAAC,EAAE;gBAC3B,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACpB,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,IAAI,CAAC,CAAC;YAC5D,CAAC,CAAC,GAAG,EAAE,CAAC;QACV,CAAC;aAAM,CAAC;YACN,EAAE,CAAC,IAAI,GAAG,EAAE,CAAC,GAAG,CAAC;YACjB,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,IAAI,CAAC,CAAC;YAC5D,CAAC,CAAC,GAAG,EAAE,CAAC;QACV,CAAC;IACH,CAAC;IAED,OAAO,CAAC,CAAC;AACX,CAAC"}

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

@@ -1,131 +0,0 @@
-/**
- * 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, MAXCOR} from './common';
-import {vmnorm} from './blas';
-import {prja} from './prja';
-import {solsy} from './solsy';
-import {corfailure} from './corfailure';
-
-/** Mutable state passed between correction and stoda */
-export interface CorrectionState {
-  del: number;
-  delp: number;
-  m: number;
-}
-
-/**
- * Corrector iteration.
- * Returns corflag: 0 = converged, 1 = reduce step & redo prediction, 2 = failure.
- */
-export function correction(
-  ctx: LsodaContext, y: Float64Array, pnorm: number,
-  cs: CorrectionState, told: number,
-): number {
-  const c = ctx.common!;
-  const neq = ctx.neq;
-
-  cs.m = 0;
-  let rate = 0.;
-  cs.del = 0.;
-
-  for (let i = 1; i <= neq; i++)
-    y[i] = c.yh[1][i];
-
-  ctx.func(c.tn, y.subarray(1), c.savf.subarray(1), ctx.data);
-  c.nfe++;
-
-  while (true) {
-    if (cs.m === 0) {
-      if (c.ipup > 0) {
-        const ierpj = prja(ctx, y);
-        c.jcur = 1;
-        c.ipup = 0;
-        c.rc = 1.;
-        c.nslp = c.nst;
-        c.crate = 0.7;
-        if (!ierpj)
-          return corfailure(ctx, told);
-      }
-      for (let i = 1; i <= neq; i++)
-        c.acor[i] = 0.;
-    }
-
-    if (c.miter === 0) {
-      // Functional iteration
-      for (let i = 1; i <= neq; i++) {
-        c.savf[i] = c.h * c.savf[i] - c.yh[2][i];
-        y[i] = c.savf[i] - c.acor[i];
-      }
-      cs.del = vmnorm(neq, y, c.ewt);
-      for (let i = 1; i <= neq; i++) {
-        y[i] = c.yh[1][i] + c.el[1] * c.savf[i];
-        c.acor[i] = c.savf[i];
-      }
-    } else {
-      // Chord method
-      for (let i = 1; i <= neq; i++)
-        y[i] = c.h * c.savf[i] - (c.yh[2][i] + c.acor[i]);
-      solsy(ctx, y);
-      cs.del = vmnorm(neq, y, c.ewt);
-      for (let i = 1; i <= neq; i++) {
-        c.acor[i] += y[i];
-        y[i] = c.yh[1][i] + c.el[1] * c.acor[i];
-      }
-    }
-
-    // Test for convergence
-    if (cs.del <= 100. * pnorm * ETA)
-      break;
-
-    if (cs.m !== 0 || c.meth !== 1) {
-      if (cs.m !== 0) {
-        let rm = 1024.0;
-        if (cs.del <= 1024. * cs.delp)
-          rm = cs.del / cs.delp;
-        rate = Math.max(rate, rm);
-        c.crate = Math.max(0.2 * c.crate, rm);
-      }
-      const conit = 0.5 / (c.nq + 2);
-      const dcon = cs.del * Math.min(1., 1.5 * c.crate) / (c.tesco[c.nq][2] * conit);
-      if (dcon <= 1.) {
-        c.pdest = Math.max(c.pdest, rate / Math.abs(c.h * c.el[1]));
-        if (c.pdest !== 0.)
-          c.pdlast = c.pdest;
-        break;
-      }
-    }
-
-    // Corrector iteration failed to converge
-    cs.m++;
-    if (cs.m === MAXCOR || (cs.m >= 2 && cs.del > 2. * cs.delp)) {
-      if (c.miter === 0 || c.jcur === 1)
-        return corfailure(ctx, told);
-
-      c.ipup = c.miter;
-      // Restart corrector if Jacobian is recomputed
-      cs.m = 0;
-      rate = 0.;
-      cs.del = 0.;
-      for (let i = 1; i <= neq; i++)
-        y[i] = c.yh[1][i];
-      ctx.func(c.tn, y.subarray(1), c.savf.subarray(1), ctx.data);
-      c.nfe++;
-    } else {
-      cs.delp = cs.del;
-      ctx.func(c.tn, y.subarray(1), c.savf.subarray(1), ctx.data);
-      c.nfe++;
-    }
-  }
-
-  return 0;
-}

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

@@ -1 +0,0 @@
-{"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

@@ -1,141 +0,0 @@
-/**
- * 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.map

@@ -1 +0,0 @@
-{"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/intdy.js.map

@@ -1 +0,0 @@
-{"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"}