diff-grok 1.0.10 → 1.2.0

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

@@ -0,0 +1,108 @@
+/**
+ * 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, RATIO, sm1, cm1, cm2 } from './common';
+import { vmnorm } from './blas';
+/**
+ * Consider switching between Adams (meth=1) and BDF (meth=2).
+ * Modifies ctx.common.meth, miter, nq, icount, pdlast on switch.
+ */
+export function methodswitch(ctx, dsm, pnorm, out) {
+    const c = ctx.common;
+    const neq = ctx.neq;
+    const mxordn = ctx.opt.mxordn;
+    const mxords = ctx.opt.mxords;
+    if (c.meth === 1) {
+        // Currently Adams, consider switching to BDF
+        if (c.nq > 5)
+            return;
+        let rh2;
+        let nqm2;
+        if (dsm <= (100. * pnorm * ETA) || c.pdest === 0.) {
+            if (c.irflag === 0)
+                return;
+            rh2 = 2.;
+            nqm2 = Math.min(c.nq, mxords);
+        }
+        else {
+            const exsm = 1. / (c.nq + 1);
+            let rh1 = 1. / (1.2 * Math.pow(dsm, exsm) + 0.0000012);
+            let rh1it = 2. * rh1;
+            const pdh = c.pdlast * Math.abs(c.h);
+            if ((pdh * rh1) > 0.00001)
+                rh1it = sm1[c.nq] / pdh;
+            rh1 = Math.min(rh1, rh1it);
+            if (c.nq > mxords) {
+                nqm2 = mxords;
+                const lm2 = mxords + 1;
+                const exm2 = 1. / lm2;
+                const lm2p1 = lm2 + 1;
+                const dm2 = vmnorm(neq, c.yh[lm2p1], c.ewt) / cm2[mxords];
+                rh2 = 1. / (1.2 * Math.pow(dm2, exm2) + 0.0000012);
+            }
+            else {
+                const dm2 = dsm * (cm1[c.nq] / cm2[c.nq]);
+                rh2 = 1. / (1.2 * Math.pow(dm2, exsm) + 0.0000012);
+                nqm2 = c.nq;
+            }
+            if (rh2 < RATIO * rh1)
+                return;
+        }
+        // Switch to BDF
+        out.rh = rh2;
+        c.icount = 20;
+        c.meth = 2;
+        c.miter = 2;
+        c.pdlast = 0.;
+        c.nq = nqm2;
+        return;
+    }
+    // Currently BDF (meth=2), consider switching to Adams
+    const exsm = 1. / (c.nq + 1);
+    let nqm1;
+    let exm1;
+    let rh1;
+    let dm1;
+    if (mxordn < c.nq) {
+        nqm1 = mxordn;
+        const lm1 = mxordn + 1;
+        exm1 = 1. / lm1;
+        const lm1p1 = lm1 + 1;
+        dm1 = vmnorm(neq, c.yh[lm1p1], c.ewt) / cm1[mxordn];
+        rh1 = 1. / (1.2 * Math.pow(dm1, exm1) + 0.0000012);
+    }
+    else {
+        dm1 = dsm * (cm2[c.nq] / cm1[c.nq]);
+        rh1 = 1. / (1.2 * Math.pow(dm1, exsm) + 0.0000012);
+        nqm1 = c.nq;
+        exm1 = exsm;
+    }
+    let rh1it = 2. * rh1;
+    const pdh = c.pdnorm * Math.abs(c.h);
+    if ((pdh * rh1) > 0.00001)
+        rh1it = sm1[nqm1] / pdh;
+    rh1 = Math.min(rh1, rh1it);
+    const rh2 = 1. / (1.2 * Math.pow(dsm, exsm) + 0.0000012);
+    if ((rh1 * RATIO) < (5. * rh2))
+        return;
+    const alpha = Math.max(0.001, rh1);
+    dm1 *= Math.pow(alpha, exm1);
+    if (dm1 <= 1000. * ETA * pnorm)
+        return;
+    // Switch to Adams
+    out.rh = rh1;
+    c.icount = 20;
+    c.meth = 1;
+    c.miter = 0;
+    c.pdlast = 0.;
+    c.nq = nqm1;
+}
+//# sourceMappingURL=methodswitch.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"methodswitch.js","sourceRoot":"","sources":["methodswitch.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAEH,OAAO,EAAe,GAAG,EAAE,KAAK,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAC,MAAM,UAAU,CAAC;AACjE,OAAO,EAAC,MAAM,EAAC,MAAM,QAAQ,CAAC;AAO9B;;;GAGG;AACH,MAAM,UAAU,YAAY,CAC1B,GAAiB,EAAE,GAAW,EAAE,KAAa,EAAE,GAAuB;IAEtE,MAAM,CAAC,GAAG,GAAG,CAAC,MAAO,CAAC;IACtB,MAAM,GAAG,GAAG,GAAG,CAAC,GAAG,CAAC;IACpB,MAAM,MAAM,GAAG,GAAG,CAAC,GAAI,CAAC,MAAM,CAAC;IAC/B,MAAM,MAAM,GAAG,GAAG,CAAC,GAAI,CAAC,MAAM,CAAC;IAE/B,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;QACjB,6CAA6C;QAC7C,IAAI,CAAC,CAAC,EAAE,GAAG,CAAC;YAAE,OAAO;QAErB,IAAI,GAAW,CAAC;QAChB,IAAI,IAAY,CAAC;QAEjB,IAAI,GAAG,IAAI,CAAC,IAAI,GAAG,KAAK,GAAG,GAAG,CAAC,IAAI,CAAC,CAAC,KAAK,KAAK,EAAE,EAAE,CAAC;YAClD,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC;gBAAE,OAAO;YAC3B,GAAG,GAAG,EAAE,CAAC;YACT,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC;QAChC,CAAC;aAAM,CAAC;YACN,MAAM,IAAI,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;YAC7B,IAAI,GAAG,GAAG,EAAE,GAAG,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,SAAS,CAAC,CAAC;YACvD,IAAI,KAAK,GAAG,EAAE,GAAG,GAAG,CAAC;YACrB,MAAM,GAAG,GAAG,CAAC,CAAC,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACrC,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC,GAAG,OAAO;gBACvB,KAAK,GAAG,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC;YAC1B,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;YAE3B,IAAI,CAAC,CAAC,EAAE,GAAG,MAAM,EAAE,CAAC;gBAClB,IAAI,GAAG,MAAM,CAAC;gBACd,MAAM,GAAG,GAAG,MAAM,GAAG,CAAC,CAAC;gBACvB,MAAM,IAAI,GAAG,EAAE,GAAG,GAAG,CAAC;gBACtB,MAAM,KAAK,GAAG,GAAG,GAAG,CAAC,CAAC;gBACtB,MAAM,GAAG,GAAG,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC;gBAC1D,GAAG,GAAG,EAAE,GAAG,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,SAAS,CAAC,CAAC;YACrD,CAAC;iBAAM,CAAC;gBACN,MAAM,GAAG,GAAG,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;gBAC1C,GAAG,GAAG,EAAE,GAAG,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,SAAS,CAAC,CAAC;gBACnD,IAAI,GAAG,CAAC,CAAC,EAAE,CAAC;YACd,CAAC;YACD,IAAI,GAAG,GAAG,KAAK,GAAG,GAAG;gBAAE,OAAO;QAChC,CAAC;QAED,gBAAgB;QAChB,GAAG,CAAC,EAAE,GAAG,GAAG,CAAC;QACb,CAAC,CAAC,MAAM,GAAG,EAAE,CAAC;QACd,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC;QACX,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC;QACZ,CAAC,CAAC,MAAM,GAAG,EAAE,CAAC;QACd,CAAC,CAAC,EAAE,GAAG,IAAI,CAAC;QACZ,OAAO;IACT,CAAC;IAED,sDAAsD;IACtD,MAAM,IAAI,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;IAC7B,IAAI,IAAY,CAAC;IACjB,IAAI,IAAY,CAAC;IACjB,IAAI,GAAW,CAAC;IAChB,IAAI,GAAW,CAAC;IAEhB,IAAI,MAAM,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC;QAClB,IAAI,GAAG,MAAM,CAAC;QACd,MAAM,GAAG,GAAG,MAAM,GAAG,CAAC,CAAC;QACvB,IAAI,GAAG,EAAE,GAAG,GAAG,CAAC;QAChB,MAAM,KAAK,GAAG,GAAG,GAAG,CAAC,CAAC;QACtB,GAAG,GAAG,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC;QACpD,GAAG,GAAG,EAAE,GAAG,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,SAAS,CAAC,CAAC;IACrD,CAAC;SAAM,CAAC;QACN,GAAG,GAAG,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACpC,GAAG,GAAG,EAAE,GAAG,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,SAAS,CAAC,CAAC;QACnD,IAAI,GAAG,CAAC,CAAC,EAAE,CAAC;QACZ,IAAI,GAAG,IAAI,CAAC;IACd,CAAC;IAED,IAAI,KAAK,GAAG,EAAE,GAAG,GAAG,CAAC;IACrB,MAAM,GAAG,GAAG,CAAC,CAAC,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACrC,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC,GAAG,OAAO;QACvB,KAAK,GAAG,GAAG,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC;IAC1B,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;IAE3B,MAAM,GAAG,GAAG,EAAE,GAAG,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,SAAS,CAAC,CAAC;IACzD,IAAI,CAAC,GAAG,GAAG,KAAK,CAAC,GAAG,CAAC,EAAE,GAAG,GAAG,CAAC;QAAE,OAAO;IAEvC,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;IACnC,GAAG,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;IAC7B,IAAI,GAAG,IAAI,KAAK,GAAG,GAAG,GAAG,KAAK;QAAE,OAAO;IAEvC,kBAAkB;IAClB,GAAG,CAAC,EAAE,GAAG,GAAG,CAAC;IACb,CAAC,CAAC,MAAM,GAAG,EAAE,CAAC;IACd,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC;IACX,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC;IACZ,CAAC,CAAC,MAAM,GAAG,EAAE,CAAC;IACd,CAAC,CAAC,EAAE,GAAG,IAAI,CAAC;AACd,CAAC"}

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

@@ -0,0 +1,119 @@
+/**
+ * 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, RATIO, sm1, cm1, cm2} from './common';
+import {vmnorm} from './blas';
+
+/** Mutable rh output */
+export interface MethodSwitchResult {
+  rh: number;
+}
+
+/**
+ * Consider switching between Adams (meth=1) and BDF (meth=2).
+ * Modifies ctx.common.meth, miter, nq, icount, pdlast on switch.
+ */
+export function methodswitch(
+  ctx: LsodaContext, dsm: number, pnorm: number, out: MethodSwitchResult,
+): void {
+  const c = ctx.common!;
+  const neq = ctx.neq;
+  const mxordn = ctx.opt!.mxordn;
+  const mxords = ctx.opt!.mxords;
+
+  if (c.meth === 1) {
+    // Currently Adams, consider switching to BDF
+    if (c.nq > 5) return;
+
+    let rh2: number;
+    let nqm2: number;
+
+    if (dsm <= (100. * pnorm * ETA) || c.pdest === 0.) {
+      if (c.irflag === 0) return;
+      rh2 = 2.;
+      nqm2 = Math.min(c.nq, mxords);
+    } else {
+      const exsm = 1. / (c.nq + 1);
+      let rh1 = 1. / (1.2 * Math.pow(dsm, exsm) + 0.0000012);
+      let rh1it = 2. * rh1;
+      const pdh = c.pdlast * Math.abs(c.h);
+      if ((pdh * rh1) > 0.00001)
+        rh1it = sm1[c.nq] / pdh;
+      rh1 = Math.min(rh1, rh1it);
+
+      if (c.nq > mxords) {
+        nqm2 = mxords;
+        const lm2 = mxords + 1;
+        const exm2 = 1. / lm2;
+        const lm2p1 = lm2 + 1;
+        const dm2 = vmnorm(neq, c.yh[lm2p1], c.ewt) / cm2[mxords];
+        rh2 = 1. / (1.2 * Math.pow(dm2, exm2) + 0.0000012);
+      } else {
+        const dm2 = dsm * (cm1[c.nq] / cm2[c.nq]);
+        rh2 = 1. / (1.2 * Math.pow(dm2, exsm) + 0.0000012);
+        nqm2 = c.nq;
+      }
+      if (rh2 < RATIO * rh1) return;
+    }
+
+    // Switch to BDF
+    out.rh = rh2;
+    c.icount = 20;
+    c.meth = 2;
+    c.miter = 2;
+    c.pdlast = 0.;
+    c.nq = nqm2;
+    return;
+  }
+
+  // Currently BDF (meth=2), consider switching to Adams
+  const exsm = 1. / (c.nq + 1);
+  let nqm1: number;
+  let exm1: number;
+  let rh1: number;
+  let dm1: number;
+
+  if (mxordn < c.nq) {
+    nqm1 = mxordn;
+    const lm1 = mxordn + 1;
+    exm1 = 1. / lm1;
+    const lm1p1 = lm1 + 1;
+    dm1 = vmnorm(neq, c.yh[lm1p1], c.ewt) / cm1[mxordn];
+    rh1 = 1. / (1.2 * Math.pow(dm1, exm1) + 0.0000012);
+  } else {
+    dm1 = dsm * (cm2[c.nq] / cm1[c.nq]);
+    rh1 = 1. / (1.2 * Math.pow(dm1, exsm) + 0.0000012);
+    nqm1 = c.nq;
+    exm1 = exsm;
+  }
+
+  let rh1it = 2. * rh1;
+  const pdh = c.pdnorm * Math.abs(c.h);
+  if ((pdh * rh1) > 0.00001)
+    rh1it = sm1[nqm1] / pdh;
+  rh1 = Math.min(rh1, rh1it);
+
+  const rh2 = 1. / (1.2 * Math.pow(dsm, exsm) + 0.0000012);
+  if ((rh1 * RATIO) < (5. * rh2)) return;
+
+  const alpha = Math.max(0.001, rh1);
+  dm1 *= Math.pow(alpha, exm1);
+  if (dm1 <= 1000. * ETA * pnorm) return;
+
+  // Switch to Adams
+  out.rh = rh1;
+  c.icount = 20;
+  c.meth = 1;
+  c.miter = 0;
+  c.pdlast = 0.;
+  c.nq = nqm1;
+}

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

@@ -0,0 +1,97 @@
+/**
+ * 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 { sm1 } from './common';
+import { vmnorm } from './blas';
+/**
+ * Decide whether to change the order and/or step size.
+ * Returns orderflag: 0 = no change, 1 = change h only, 2 = change both h and nq.
+ */
+export function orderswitch(ctx, rhup, dsm, out, kflag, maxord) {
+    const c = ctx.common;
+    const neq = ctx.neq;
+    const exsm = 1. / (c.nq + 1);
+    let rhsm = 1. / (1.2 * Math.pow(dsm, exsm) + 0.0000012);
+    let rhdn = 0.;
+    if (c.nq !== 1) {
+        const ddn = vmnorm(neq, c.yh[c.nq + 1], c.ewt) / c.tesco[c.nq][1];
+        const exdn = 1. / c.nq;
+        rhdn = 1. / (1.3 * Math.pow(ddn, exdn) + 0.0000013);
+    }
+    // If meth = 1, limit rh according to stability region
+    if (c.meth === 1) {
+        const pdh = Math.max(Math.abs(c.h) * c.pdlast, 0.000001);
+        if (c.nq + 1 < maxord + 1)
+            rhup = Math.min(rhup, sm1[c.nq + 1] / pdh);
+        rhsm = Math.min(rhsm, sm1[c.nq] / pdh);
+        if (c.nq > 1)
+            rhdn = Math.min(rhdn, sm1[c.nq - 1] / pdh);
+        c.pdest = 0.;
+    }
+    let newq;
+    if (rhsm >= rhup) {
+        if (rhsm >= rhdn) {
+            newq = c.nq;
+            out.rh = rhsm;
+        }
+        else {
+            newq = c.nq - 1;
+            out.rh = rhdn;
+            if (kflag < 0 && out.rh > 1.)
+                out.rh = 1.;
+        }
+    }
+    else {
+        if (rhup <= rhdn) {
+            newq = c.nq - 1;
+            out.rh = rhdn;
+            if (kflag < 0 && out.rh > 1.)
+                out.rh = 1.;
+        }
+        else {
+            out.rh = rhup;
+            if (out.rh >= 1.1) {
+                const r = c.el[c.nq + 1] / (c.nq + 1);
+                c.nq = c.nq + 1;
+                for (let i = 1; i <= neq; i++)
+                    c.yh[c.nq + 1][i] = c.acor[i] * r;
+                return 2;
+            }
+            else {
+                c.ialth = 3;
+                return 0;
+            }
+        }
+    }
+    // If meth = 1 and h is restricted by stability, bypass 10% test
+    if (c.meth === 1) {
+        const pdh = Math.max(Math.abs(c.h) * c.pdlast, 0.000001);
+        if (out.rh * pdh * 1.00001 < sm1[newq]) {
+            if (kflag === 0 && out.rh < 1.1) {
+                c.ialth = 3;
+                return 0;
+            }
+        }
+    }
+    else {
+        if (kflag === 0 && out.rh < 1.1) {
+            c.ialth = 3;
+            return 0;
+        }
+    }
+    if (kflag <= -2)
+        out.rh = Math.min(out.rh, 0.2);
+    if (newq === c.nq)
+        return 1;
+    c.nq = newq;
+    return 2;
+}
+//# sourceMappingURL=orderswitch.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"orderswitch.js","sourceRoot":"","sources":["orderswitch.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAEH,OAAO,EAAe,GAAG,EAAC,MAAM,UAAU,CAAC;AAC3C,OAAO,EAAC,MAAM,EAAC,MAAM,QAAQ,CAAC;AAO9B;;;GAGG;AACH,MAAM,UAAU,WAAW,CACzB,GAAiB,EAAE,IAAY,EAAE,GAAW,EAC5C,GAAsB,EAAE,KAAa,EAAE,MAAc;IAErD,MAAM,CAAC,GAAG,GAAG,CAAC,MAAO,CAAC;IACtB,MAAM,GAAG,GAAG,GAAG,CAAC,GAAG,CAAC;IAEpB,MAAM,IAAI,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;IAC7B,IAAI,IAAI,GAAG,EAAE,GAAG,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,SAAS,CAAC,CAAC;IAExD,IAAI,IAAI,GAAG,EAAE,CAAC;IACd,IAAI,CAAC,CAAC,EAAE,KAAK,CAAC,EAAE,CAAC;QACf,MAAM,GAAG,GAAG,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAClE,MAAM,IAAI,GAAG,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC;QACvB,IAAI,GAAG,EAAE,GAAG,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,SAAS,CAAC,CAAC;IACtD,CAAC;IAED,sDAAsD;IACtD,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;QACjB,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;QACzD,IAAI,CAAC,CAAC,EAAE,GAAG,CAAC,GAAG,MAAM,GAAG,CAAC;YACvB,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC;QAC7C,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC;QACvC,IAAI,CAAC,CAAC,EAAE,GAAG,CAAC;YACV,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC;QAC7C,CAAC,CAAC,KAAK,GAAG,EAAE,CAAC;IACf,CAAC;IAED,IAAI,IAAY,CAAC;IACjB,IAAI,IAAI,IAAI,IAAI,EAAE,CAAC;QACjB,IAAI,IAAI,IAAI,IAAI,EAAE,CAAC;YACjB,IAAI,GAAG,CAAC,CAAC,EAAE,CAAC;YACZ,GAAG,CAAC,EAAE,GAAG,IAAI,CAAC;QAChB,CAAC;aAAM,CAAC;YACN,IAAI,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;YAChB,GAAG,CAAC,EAAE,GAAG,IAAI,CAAC;YACd,IAAI,KAAK,GAAG,CAAC,IAAI,GAAG,CAAC,EAAE,GAAG,EAAE;gBAAE,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC;QAC5C,CAAC;IACH,CAAC;SAAM,CAAC;QACN,IAAI,IAAI,IAAI,IAAI,EAAE,CAAC;YACjB,IAAI,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;YAChB,GAAG,CAAC,EAAE,GAAG,IAAI,CAAC;YACd,IAAI,KAAK,GAAG,CAAC,IAAI,GAAG,CAAC,EAAE,GAAG,EAAE;gBAAE,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC;QAC5C,CAAC;aAAM,CAAC;YACN,GAAG,CAAC,EAAE,GAAG,IAAI,CAAC;YACd,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,EAAE,CAAC;gBAClB,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;gBACtC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;gBAChB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,GAAG,EAAE,CAAC,EAAE;oBAC3B,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;gBACpC,OAAO,CAAC,CAAC;YACX,CAAC;iBAAM,CAAC;gBACN,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC;gBACZ,OAAO,CAAC,CAAC;YACX,CAAC;QACH,CAAC;IACH,CAAC;IAED,gEAAgE;IAChE,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;QACjB,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;QACzD,IAAI,GAAG,CAAC,EAAE,GAAG,GAAG,GAAG,OAAO,GAAG,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YACvC,IAAI,KAAK,KAAK,CAAC,IAAI,GAAG,CAAC,EAAE,GAAG,GAAG,EAAE,CAAC;gBAChC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC;gBACZ,OAAO,CAAC,CAAC;YACX,CAAC;QACH,CAAC;IACH,CAAC;SAAM,CAAC;QACN,IAAI,KAAK,KAAK,CAAC,IAAI,GAAG,CAAC,EAAE,GAAG,GAAG,EAAE,CAAC;YAChC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC;YACZ,OAAO,CAAC,CAAC;QACX,CAAC;IACH,CAAC;IAED,IAAI,KAAK,IAAI,CAAC,CAAC;QACb,GAAG,CAAC,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;IAEjC,IAAI,IAAI,KAAK,CAAC,CAAC,EAAE;QACf,OAAO,CAAC,CAAC;IAEX,CAAC,CAAC,EAAE,GAAG,IAAI,CAAC;IACZ,OAAO,CAAC,CAAC;AACX,CAAC"}

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

@@ -0,0 +1,107 @@
+/**
+ * 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, sm1} from './common';
+import {vmnorm} from './blas';
+
+/** Mutable rh output */
+export interface OrderSwitchResult {
+  rh: number;
+}
+
+/**
+ * Decide whether to change the order and/or step size.
+ * Returns orderflag: 0 = no change, 1 = change h only, 2 = change both h and nq.
+ */
+export function orderswitch(
+  ctx: LsodaContext, rhup: number, dsm: number,
+  out: OrderSwitchResult, kflag: number, maxord: number,
+): number {
+  const c = ctx.common!;
+  const neq = ctx.neq;
+
+  const exsm = 1. / (c.nq + 1);
+  let rhsm = 1. / (1.2 * Math.pow(dsm, exsm) + 0.0000012);
+
+  let rhdn = 0.;
+  if (c.nq !== 1) {
+    const ddn = vmnorm(neq, c.yh[c.nq + 1], c.ewt) / c.tesco[c.nq][1];
+    const exdn = 1. / c.nq;
+    rhdn = 1. / (1.3 * Math.pow(ddn, exdn) + 0.0000013);
+  }
+
+  // If meth = 1, limit rh according to stability region
+  if (c.meth === 1) {
+    const pdh = Math.max(Math.abs(c.h) * c.pdlast, 0.000001);
+    if (c.nq + 1 < maxord + 1)
+      rhup = Math.min(rhup, sm1[c.nq + 1] / pdh);
+    rhsm = Math.min(rhsm, sm1[c.nq] / pdh);
+    if (c.nq > 1)
+      rhdn = Math.min(rhdn, sm1[c.nq - 1] / pdh);
+    c.pdest = 0.;
+  }
+
+  let newq: number;
+  if (rhsm >= rhup) {
+    if (rhsm >= rhdn) {
+      newq = c.nq;
+      out.rh = rhsm;
+    } else {
+      newq = c.nq - 1;
+      out.rh = rhdn;
+      if (kflag < 0 && out.rh > 1.) out.rh = 1.;
+    }
+  } else {
+    if (rhup <= rhdn) {
+      newq = c.nq - 1;
+      out.rh = rhdn;
+      if (kflag < 0 && out.rh > 1.) out.rh = 1.;
+    } else {
+      out.rh = rhup;
+      if (out.rh >= 1.1) {
+        const r = c.el[c.nq + 1] / (c.nq + 1);
+        c.nq = c.nq + 1;
+        for (let i = 1; i <= neq; i++)
+          c.yh[c.nq + 1][i] = c.acor[i] * r;
+        return 2;
+      } else {
+        c.ialth = 3;
+        return 0;
+      }
+    }
+  }
+
+  // If meth = 1 and h is restricted by stability, bypass 10% test
+  if (c.meth === 1) {
+    const pdh = Math.max(Math.abs(c.h) * c.pdlast, 0.000001);
+    if (out.rh * pdh * 1.00001 < sm1[newq]) {
+      if (kflag === 0 && out.rh < 1.1) {
+        c.ialth = 3;
+        return 0;
+      }
+    }
+  } else {
+    if (kflag === 0 && out.rh < 1.1) {
+      c.ialth = 3;
+      return 0;
+    }
+  }
+
+  if (kflag <= -2)
+    out.rh = Math.min(out.rh, 0.2);
+
+  if (newq === c.nq)
+    return 1;
+
+  c.nq = newq;
+  return 2;
+}

package/src/solver-tools/lsoda/prja.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, SQRTETA } from './common';
+import { vmnorm, fnorm, dgefa } from './blas';
+/**
+ * Compute and process the matrix P = I - h * el[1] * J,
+ * where J is approximated by finite differences.
+ * Returns 1 on success, 0 on failure (singular matrix).
+ */
+export function prja(ctx, y) {
+    const c = ctx.common;
+    const neq = ctx.neq;
+    c.nje++;
+    const hl0 = c.h * c.el[1];
+    if (c.miter !== 2) {
+        console.error('[prja] miter != 2');
+        return 0;
+    }
+    let fac = vmnorm(neq, c.savf, c.ewt);
+    let r0 = 1000. * Math.abs(c.h) * ETA * neq * fac;
+    if (r0 === 0.)
+        r0 = 1.;
+    for (let j = 1; j <= neq; j++) {
+        const yj = y[j];
+        const r = Math.max(SQRTETA * Math.abs(yj), r0 / c.ewt[j]);
+        y[j] += r;
+        fac = -hl0 / r;
+        ctx.func(c.tn, y.subarray(1), c.acor.subarray(1), ctx.data);
+        for (let i = 1; i <= neq; i++)
+            c.wm[i][j] = (c.acor[i] - c.savf[i]) * fac;
+        y[j] = yj;
+    }
+    c.nfe += neq;
+    // Compute norm of Jacobian
+    c.pdnorm = fnorm(neq, c.wm, c.ewt) / Math.abs(hl0);
+    // Add identity matrix
+    for (let i = 1; i <= neq; i++)
+        c.wm[i][i] += 1.;
+    // LU decomposition on P
+    const ier = dgefa(c.wm, neq, c.ipvt);
+    if (ier !== 0)
+        return 0;
+    return 1;
+}
+//# sourceMappingURL=prja.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"prja.js","sourceRoot":"","sources":["prja.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAEH,OAAO,EAAe,GAAG,EAAE,OAAO,EAAC,MAAM,UAAU,CAAC;AACpD,OAAO,EAAC,MAAM,EAAE,KAAK,EAAE,KAAK,EAAC,MAAM,QAAQ,CAAC;AAE5C;;;;GAIG;AACH,MAAM,UAAU,IAAI,CAAC,GAAiB,EAAE,CAAe;IACrD,MAAM,CAAC,GAAG,GAAG,CAAC,MAAO,CAAC;IACtB,MAAM,GAAG,GAAG,GAAG,CAAC,GAAG,CAAC;IAEpB,CAAC,CAAC,GAAG,EAAE,CAAC;IACR,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IAE1B,IAAI,CAAC,CAAC,KAAK,KAAK,CAAC,EAAE,CAAC;QAClB,OAAO,CAAC,KAAK,CAAC,mBAAmB,CAAC,CAAC;QACnC,OAAO,CAAC,CAAC;IACX,CAAC;IAED,IAAI,GAAG,GAAG,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC;IACrC,IAAI,EAAE,GAAG,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC;IACjD,IAAI,EAAE,KAAK,EAAE;QAAE,EAAE,GAAG,EAAE,CAAC;IAEvB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;QAC9B,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAChB,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAC1D,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QACV,GAAG,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC;QACf,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;QAC5D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,GAAG,EAAE,CAAC,EAAE;YAC3B,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;QAC7C,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;IACZ,CAAC;IACD,CAAC,CAAC,GAAG,IAAI,GAAG,CAAC;IAEb,2BAA2B;IAC3B,CAAC,CAAC,MAAM,GAAG,KAAK,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAEnD,sBAAsB;IACtB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,GAAG,EAAE,CAAC,EAAE;QAC3B,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;IAEnB,wBAAwB;IACxB,MAAM,GAAG,GAAG,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC;IACrC,IAAI,GAAG,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAExB,OAAO,CAAC,CAAC;AACX,CAAC"}

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

@@ -0,0 +1,61 @@
+/**
+ * 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, SQRTETA} from './common';
+import {vmnorm, fnorm, dgefa} from './blas';
+
+/**
+ * Compute and process the matrix P = I - h * el[1] * J,
+ * where J is approximated by finite differences.
+ * Returns 1 on success, 0 on failure (singular matrix).
+ */
+export function prja(ctx: LsodaContext, y: Float64Array): number {
+  const c = ctx.common!;
+  const neq = ctx.neq;
+
+  c.nje++;
+  const hl0 = c.h * c.el[1];
+
+  if (c.miter !== 2) {
+    console.error('[prja] miter != 2');
+    return 0;
+  }
+
+  let fac = vmnorm(neq, c.savf, c.ewt);
+  let r0 = 1000. * Math.abs(c.h) * ETA * neq * fac;
+  if (r0 === 0.) r0 = 1.;
+
+  for (let j = 1; j <= neq; j++) {
+    const yj = y[j];
+    const r = Math.max(SQRTETA * Math.abs(yj), r0 / c.ewt[j]);
+    y[j] += r;
+    fac = -hl0 / r;
+    ctx.func(c.tn, y.subarray(1), c.acor.subarray(1), ctx.data);
+    for (let i = 1; i <= neq; i++)
+      c.wm[i][j] = (c.acor[i] - c.savf[i]) * fac;
+    y[j] = yj;
+  }
+  c.nfe += neq;
+
+  // Compute norm of Jacobian
+  c.pdnorm = fnorm(neq, c.wm, c.ewt) / Math.abs(hl0);
+
+  // Add identity matrix
+  for (let i = 1; i <= neq; i++)
+    c.wm[i][i] += 1.;
+
+  // LU decomposition on P
+  const ier = dgefa(c.wm, neq, c.ipvt);
+  if (ier !== 0) return 0;
+
+  return 1;
+}

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

@@ -0,0 +1,41 @@
+/**
+ * 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 { sm1 } from './common';
+/**
+ * Scale step size. Rescales the yh array when h changes.
+ */
+export function scaleh(ctx, rh) {
+    const c = ctx.common;
+    const neq = ctx.neq;
+    const hmxi = ctx.opt.hmxi;
+    rh = Math.min(rh, c.rmax);
+    rh = rh / Math.max(1., Math.abs(c.h) * hmxi * rh);
+    // If meth = 1, restrict by stability region
+    if (c.meth === 1) {
+        c.irflag = 0;
+        const pdh = Math.max(Math.abs(c.h) * c.pdlast, 0.000001);
+        if ((rh * pdh * 1.00001) >= sm1[c.nq]) {
+            rh = sm1[c.nq] / pdh;
+            c.irflag = 1;
+        }
+    }
+    let r = 1.;
+    for (let j = 2; j <= c.nq + 1; j++) {
+        r *= rh;
+        for (let i = 1; i <= neq; i++)
+            c.yh[j][i] *= r;
+    }
+    c.h *= rh;
+    c.rc *= rh;
+    c.ialth = c.nq + 1;
+}
+//# sourceMappingURL=scaleh.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"scaleh.js","sourceRoot":"","sources":["scaleh.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAEH,OAAO,EAAe,GAAG,EAAC,MAAM,UAAU,CAAC;AAE3C;;GAEG;AACH,MAAM,UAAU,MAAM,CAAC,GAAiB,EAAE,EAAU;IAClD,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,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC;IAC1B,EAAE,GAAG,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,GAAG,EAAE,CAAC,CAAC;IAElD,4CAA4C;IAC5C,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;QACjB,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC;QACb,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;QACzD,IAAI,CAAC,EAAE,GAAG,GAAG,GAAG,OAAO,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC;YACtC,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC;YACrB,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC;QACf,CAAC;IACH,CAAC;IAED,IAAI,CAAC,GAAG,EAAE,CAAC;IACX,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QACnC,CAAC,IAAI,EAAE,CAAC;QACR,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,GAAG,EAAE,CAAC,EAAE;YAC3B,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IACpB,CAAC;IACD,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;IACV,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC;IACX,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;AACrB,CAAC"}

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

@@ -0,0 +1,45 @@
+/**
+ * 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, sm1} from './common';
+
+/**
+ * Scale step size. Rescales the yh array when h changes.
+ */
+export function scaleh(ctx: LsodaContext, rh: number): void {
+  const c = ctx.common!;
+  const neq = ctx.neq;
+  const hmxi = ctx.opt!.hmxi;
+
+  rh = Math.min(rh, c.rmax);
+  rh = rh / Math.max(1., Math.abs(c.h) * hmxi * rh);
+
+  // If meth = 1, restrict by stability region
+  if (c.meth === 1) {
+    c.irflag = 0;
+    const pdh = Math.max(Math.abs(c.h) * c.pdlast, 0.000001);
+    if ((rh * pdh * 1.00001) >= sm1[c.nq]) {
+      rh = sm1[c.nq] / pdh;
+      c.irflag = 1;
+    }
+  }
+
+  let r = 1.;
+  for (let j = 2; j <= c.nq + 1; j++) {
+    r *= rh;
+    for (let i = 1; i <= neq; i++)
+      c.yh[j][i] *= r;
+  }
+  c.h *= rh;
+  c.rc *= rh;
+  c.ialth = c.nq + 1;
+}