ootk 2.0.1 → 4.0.0-0

package/lib/optimize/ChebyshevCompressor.js

@@ -0,0 +1,80 @@
+/**
+ * @author @thkruz Theodore Kruczek
+ *
+ * @license AGPL-3.0-or-later
+ * @Copyright (c) 2020-2024 Theodore Kruczek
+ *
+ * Orbital Object ToolKit is free software: you can redistribute it and/or modify it under the
+ * terms of the GNU Affero General Public License as published by the Free Software
+ * Foundation, either version 3 of the License, or (at your option) any later version.
+ *
+ * Orbital Object ToolKit is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY;
+ * without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
+ * See the GNU Affero General Public License for more details.
+ *
+ * You should have received a copy of the GNU Affero General Public License along with
+ * Orbital Object ToolKit. If not, see <http://www.gnu.org/licenses/>.
+ */
+import { EpochUTC, Vector3D } from 'ootk-core';
+import { ChebyshevCoefficients } from './../interpolator/ChebyshevCoefficients';
+import { ChebyshevInterpolator } from './../interpolator/ChebyshevInterpolator';
+// / Ephemeris compressor.
+export class ChebyshevCompressor {
+    // / Create a new [ChebyshevCompressor] object from an [Interpolator].
+    constructor(_interpolator) {
+        this._interpolator = _interpolator;
+        // Do nothing.
+    }
+    // / Return the cosine of π times [x].
+    static _cosPi(x) {
+        return Math.cos(Math.PI * x);
+    }
+    _fitCoefficient(j, n, a, b) {
+        let sumX = 0.0;
+        let sumY = 0.0;
+        let sumZ = 0.0;
+        const h = 0.5;
+        for (let i = 0; i < n; i++) {
+            const x = ChebyshevCompressor._cosPi((i + h) / n);
+            const state = this._interpolator.interpolate(new EpochUTC(x * (h * (b - a)) + h * (b + a)));
+            const fx = state.position.x;
+            const fy = state.position.y;
+            const fz = state.position.z;
+            const nFac = ChebyshevCompressor._cosPi((j * (i + h)) / n);
+            sumX += fx * nFac;
+            sumY += fy * nFac;
+            sumZ += fz * nFac;
+        }
+        return new Vector3D(sumX * (2 / n), sumY * (2 / n), sumZ * (2 / n));
+    }
+    _fitWindow(coeffs, a, b) {
+        const cx = new Float64Array();
+        const cy = new Float64Array();
+        const cz = new Float64Array();
+        for (let j = 0; j < coeffs; j++) {
+            const result = this._fitCoefficient(j, coeffs, a, b);
+            cx[j] = result.x;
+            cy[j] = result.y;
+            cz[j] = result.z;
+        }
+        return new ChebyshevCoefficients(a, b, cx, cy, cz);
+    }
+    /**
+     * Compress this object's interpolater, using the provided coefficients
+     * per revolution [cpr].
+     */
+    compress(cpr = 21) {
+        const { start, end } = this._interpolator.window();
+        const period = this._interpolator.interpolate(start).period();
+        const coefficients = [];
+        let current = start;
+        while (current < end) {
+            const step = Math.min(period, end.posix - current.posix);
+            const segment = current.roll(step);
+            coefficients.push(this._fitWindow(cpr, current.posix, segment.posix));
+            current = segment;
+        }
+        return new ChebyshevInterpolator(coefficients);
+    }
+}
+//# sourceMappingURL=ChebyshevCompressor.js.map

package/lib/optimize/ChebyshevCompressor.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ChebyshevCompressor.js","sourceRoot":"","sources":["../../src/optimize/ChebyshevCompressor.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AAEH,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,WAAW,CAAC;AAE/C,OAAO,EAAE,qBAAqB,EAAE,MAAM,yCAAyC,CAAC;AAChF,OAAO,EAAE,qBAAqB,EAAE,MAAM,yCAAyC,CAAC;AAEhF,0BAA0B;AAC1B,MAAM,OAAO,mBAAmB;IAC9B,sEAAsE;IACtE,YAAoB,aAAgC;QAAhC,kBAAa,GAAb,aAAa,CAAmB;QAClD,cAAc;IAChB,CAAC;IAED,sCAAsC;IAC9B,MAAM,CAAC,MAAM,CAAC,CAAS;QAC7B,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;IAC/B,CAAC;IAEO,eAAe,CAAC,CAAS,EAAE,CAAS,EAAE,CAAS,EAAE,CAAS;QAChE,IAAI,IAAI,GAAG,GAAG,CAAC;QACf,IAAI,IAAI,GAAG,GAAG,CAAC;QACf,IAAI,IAAI,GAAG,GAAG,CAAC;QACf,MAAM,CAAC,GAAG,GAAG,CAAC;QAEd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;YAC1B,MAAM,CAAC,GAAG,mBAAmB,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAClD,MAAM,KAAK,GAAG,IAAI,CAAC,aAAa,CAAC,WAAW,CAAC,IAAI,QAAQ,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAE,CAAC;YAC7F,MAAM,EAAE,GAAG,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC;YAC5B,MAAM,EAAE,GAAG,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC;YAC5B,MAAM,EAAE,GAAG,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC;YAC5B,MAAM,IAAI,GAAG,mBAAmB,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAE3D,IAAI,IAAI,EAAE,GAAG,IAAI,CAAC;YAClB,IAAI,IAAI,EAAE,GAAG,IAAI,CAAC;YAClB,IAAI,IAAI,EAAE,GAAG,IAAI,CAAC;SACnB;QAED,OAAO,IAAI,QAAQ,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACtE,CAAC;IAEO,UAAU,CAAC,MAAc,EAAE,CAAS,EAAE,CAAS;QACrD,MAAM,EAAE,GAAG,IAAI,YAAY,EAAE,CAAC;QAC9B,MAAM,EAAE,GAAG,IAAI,YAAY,EAAE,CAAC;QAC9B,MAAM,EAAE,GAAG,IAAI,YAAY,EAAE,CAAC;QAE9B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE;YAC/B,MAAM,MAAM,GAAG,IAAI,CAAC,eAAe,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YAErD,EAAE,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC;YACjB,EAAE,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC;YACjB,EAAE,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC;SAClB;QAED,OAAO,IAAI,qBAAqB,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;IACrD,CAAC;IAED;;;OAGG;IACH,QAAQ,CAAC,GAAG,GAAG,EAAE;QACf,MAAM,EAAE,KAAK,EAAE,GAAG,EAAE,GAAG,IAAI,CAAC,aAAa,CAAC,MAAM,EAAE,CAAC;QACnD,MAAM,MAAM,GAAG,IAAI,CAAC,aAAa,CAAC,WAAW,CAAC,KAAK,CAAE,CAAC,MAAM,EAAE,CAAC;QAC/D,MAAM,YAAY,GAA4B,EAAE,CAAC;QACjD,IAAI,OAAO,GAAG,KAAK,CAAC;QAEpB,OAAO,OAAO,GAAG,GAAG,EAAE;YACpB,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC;YACzD,MAAM,OAAO,GAAG,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAEnC,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,GAAG,EAAE,OAAO,CAAC,KAAK,EAAE,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC;YACtE,OAAO,GAAG,OAAO,CAAC;SACnB;QAED,OAAO,IAAI,qBAAqB,CAAC,YAAY,CAAC,CAAC;IACjD,CAAC;CACF"}

package/lib/optimize/DownhillSimplex.d.ts

@@ -0,0 +1,50 @@
+/**
+ * @author @thkruz Theodore Kruczek
+ *
+ * @license AGPL-3.0-or-later
+ * @Copyright (c) 2020-2024 Theodore Kruczek
+ *
+ * Orbital Object ToolKit is free software: you can redistribute it and/or modify it under the
+ * terms of the GNU Affero General Public License as published by the Free Software
+ * Foundation, either version 3 of the License, or (at your option) any later version.
+ *
+ * Orbital Object ToolKit is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY;
+ * without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
+ * See the GNU Affero General Public License for more details.
+ *
+ * You should have received a copy of the GNU Affero General Public License along with
+ * Orbital Object ToolKit. If not, see <http://www.gnu.org/licenses/>.
+ */
+import { CostFunction } from './SimplexEntry';
+export declare class DownhillSimplex {
+    private constructor();
+    /**
+     * Compute the centroid from a list of [SimplexEntry] objects, using cost
+     * function [f].
+     */
+    private static _centroid;
+    private static _shrink;
+    /**
+     * Generate a new simplex from initial guess [x0], and an optional
+     * simplex [step] value.
+     */
+    static generateSimplex(x0: Float64Array, step?: number): Float64Array[];
+    /**
+     * Perform derivative-free Nelder-Mead simplex optimization to minimize the
+     * cost function [f] for the initial simplex [xs].
+     *
+     * Optional arguments:
+     *  - `xTolerance`: centroid delta termination criteria
+     * - `fTolerance`: cost function delta termination criteria
+     * - `maxIter`: maximum number of optimization iterations
+     * - `adaptive`: use adaptive coefficients if possible
+     * - `printIter`: print a debug statement after each iteration
+     */
+    static solveSimplex(f: CostFunction, xs: Float64Array[], { xTolerance, fTolerance, maxIter, adaptive, printIter, }: {
+        xTolerance?: number;
+        fTolerance?: number;
+        maxIter?: number;
+        adaptive?: boolean;
+        printIter?: boolean;
+    }): Float64Array;
+}

package/lib/optimize/DownhillSimplex.js

@@ -0,0 +1,168 @@
+/**
+ * @author @thkruz Theodore Kruczek
+ *
+ * @license AGPL-3.0-or-later
+ * @Copyright (c) 2020-2024 Theodore Kruczek
+ *
+ * Orbital Object ToolKit is free software: you can redistribute it and/or modify it under the
+ * terms of the GNU Affero General Public License as published by the Free Software
+ * Foundation, either version 3 of the License, or (at your option) any later version.
+ *
+ * Orbital Object ToolKit is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY;
+ * without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
+ * See the GNU Affero General Public License for more details.
+ *
+ * You should have received a copy of the GNU Affero General Public License along with
+ * Orbital Object ToolKit. If not, see <http://www.gnu.org/licenses/>.
+ */
+import { SimplexEntry } from './SimplexEntry';
+// / Derivative-free Nelder-Mead simplex optimizer.
+export class DownhillSimplex {
+    constructor() {
+        // disable constructor
+    }
+    /**
+     * Compute the centroid from a list of [SimplexEntry] objects, using cost
+     * function [f].
+     */
+    static _centroid(f, xss) {
+        const n = xss[0].points.length;
+        const m = xss.length - 1;
+        const output = new Float64Array(n);
+        for (let i = 0; i < m; i++) {
+            for (let j = 0; j < n; j++) {
+                output[j] += xss[i].points[j];
+            }
+        }
+        for (let i = 0; i < n; i++) {
+            output[i] /= m;
+        }
+        return new SimplexEntry(f, output);
+    }
+    static _shrink(s, xss) {
+        const x1 = xss[0];
+        for (let i = 1; i < xss.length; i++) {
+            const xi = xss[i];
+            xss[i] = x1.modify(s, xi, x1);
+        }
+    }
+    /**
+     * Generate a new simplex from initial guess [x0], and an optional
+     * simplex [step] value.
+     */
+    static generateSimplex(x0, step = 0.01) {
+        const output = [x0.slice(0)];
+        for (let i = 0; i < x0.length; i++) {
+            const tmp = x0.slice(0);
+            tmp[i] += tmp[i] * step;
+            output.push(tmp);
+        }
+        return output;
+    }
+    /**
+     * Perform derivative-free Nelder-Mead simplex optimization to minimize the
+     * cost function [f] for the initial simplex [xs].
+     *
+     * Optional arguments:
+     *  - `xTolerance`: centroid delta termination criteria
+     * - `fTolerance`: cost function delta termination criteria
+     * - `maxIter`: maximum number of optimization iterations
+     * - `adaptive`: use adaptive coefficients if possible
+     * - `printIter`: print a debug statement after each iteration
+     */
+    static solveSimplex(f, xs, { xTolerance = 1e-12, fTolerance = 1e-12, maxIter = 10000, adaptive = false, printIter = false, }) {
+        let a;
+        let g;
+        let p;
+        let s;
+        const n = xs.length - 1;
+        if (adaptive && n >= 2) {
+            a = 1.0;
+            g = 1.0 + 2.0 / n;
+            p = 0.75 - 1.0 / (2.0 * n);
+            s = 1.0 - 1.0 / n;
+        }
+        else {
+            a = 1.0;
+            g = 2.0;
+            p = 0.5;
+            s = 0.5;
+        }
+        let iter = 0;
+        let action = 'init';
+        const ordered = [];
+        for (const x of xs) {
+            ordered.push(new SimplexEntry(f, x));
+        }
+        // eslint-disable-next-line no-constant-condition
+        while (true) {
+            ordered.sort((x, y) => x.score - y.score);
+            const x0 = DownhillSimplex._centroid(f, ordered);
+            // update exit criterea
+            let xd = 0.0;
+            let fd = 0.0;
+            for (let i = 1; i < ordered.length; i++) {
+                xd = Math.max(xd, x0.distance(ordered[i]));
+                fd = Math.max(fd, Math.abs(x0.score - ordered[i].score));
+            }
+            if (printIter) {
+                // eslint-disable-next-line no-console
+                console.log(`${iter}: score=${x0.score} xd=${xd} fd=${fd} [${action}]`);
+            }
+            if (iter !== 0 && (xd < xTolerance || fd < fTolerance)) {
+                return ordered[0].points;
+            }
+            if (iter >= maxIter) {
+                return ordered[0].points;
+            }
+            iter++;
+            // reflection
+            const xr = x0.modify(a, x0, ordered[ordered.length - 1]);
+            if (ordered[0].score <= xr.score && xr.score < ordered[ordered.length - 2].score) {
+                ordered[ordered.length - 1] = xr;
+                action = 'reflect';
+                continue;
+            }
+            // expansion
+            if (xr.score < ordered[0].score) {
+                const xe = x0.modify(g, xr, x0);
+                if (xe.score < xr.score) {
+                    ordered[ordered.length - 1] = xe;
+                }
+                else {
+                    ordered[ordered.length - 1] = xr;
+                }
+                action = 'expand';
+                continue;
+            }
+            // contraction
+            if (xr.score < ordered[ordered.length - 1].score) {
+                const xc = x0.modify(p, xr, x0);
+                if (xc.score < xr.score) {
+                    ordered[ordered.length - 1] = xc;
+                    action = 'contract';
+                    continue;
+                }
+                else {
+                    DownhillSimplex._shrink(s, ordered);
+                    action = 'shrink';
+                    continue;
+                }
+            }
+            else if (xr.score >= ordered[ordered.length - 1].score) {
+                const xc = x0.modify(p, ordered[ordered.length - 1], x0);
+                if (xc.score < ordered[ordered.length - 1].score) {
+                    ordered[ordered.length - 1] = xc;
+                    action = 'contract';
+                    continue;
+                }
+                else {
+                    DownhillSimplex._shrink(s, ordered);
+                    action = 'shrink';
+                    continue;
+                }
+            }
+        }
+    }
+}
+//# sourceMappingURL=DownhillSimplex.js.map

package/lib/optimize/DownhillSimplex.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"DownhillSimplex.js","sourceRoot":"","sources":["../../src/optimize/DownhillSimplex.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AAEH,OAAO,EAAgB,YAAY,EAAE,MAAM,gBAAgB,CAAC;AAE5D,mDAAmD;AACnD,MAAM,OAAO,eAAe;IAC1B;QACE,sBAAsB;IACxB,CAAC;IAED;;;OAGG;IACK,MAAM,CAAC,SAAS,CAAC,CAAe,EAAE,GAAmB;QAC3D,MAAM,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC;QAC/B,MAAM,CAAC,GAAG,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC;QACzB,MAAM,MAAM,GAAG,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC;QAEnC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;YAC1B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;gBAC1B,MAAM,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;aAC/B;SACF;QACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;YAC1B,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;SAChB;QAED,OAAO,IAAI,YAAY,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;IACrC,CAAC;IAEO,MAAM,CAAC,OAAO,CAAC,CAAS,EAAE,GAAmB;QACnD,MAAM,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;QAElB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YACnC,MAAM,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;YAElB,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;SAC/B;IACH,CAAC;IAED;;;OAGG;IACH,MAAM,CAAC,eAAe,CAAC,EAAgB,EAAE,IAAI,GAAG,IAAI;QAClD,MAAM,MAAM,GAAmB,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;QAE7C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YAClC,MAAM,GAAG,GAAG,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YAExB,GAAG,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;YACxB,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;SAClB;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;;;;;;;;OAUG;IACH,MAAM,CAAC,YAAY,CACjB,CAAe,EACf,EAAkB,EAClB,EACE,UAAU,GAAG,KAAK,EAClB,UAAU,GAAG,KAAK,EAClB,OAAO,GAAG,KAAK,EACf,QAAQ,GAAG,KAAK,EAChB,SAAS,GAAG,KAAK,GAOlB;QAED,IAAI,CAAS,CAAC;QACd,IAAI,CAAS,CAAC;QACd,IAAI,CAAS,CAAC;QACd,IAAI,CAAS,CAAC;QACd,MAAM,CAAC,GAAG,EAAE,CAAC,MAAM,GAAG,CAAC,CAAC;QAExB,IAAI,QAAQ,IAAI,CAAC,IAAI,CAAC,EAAE;YACtB,CAAC,GAAG,GAAG,CAAC;YACR,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC;YAClB,CAAC,GAAG,IAAI,GAAG,GAAG,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;YAC3B,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC;SACnB;aAAM;YACL,CAAC,GAAG,GAAG,CAAC;YACR,CAAC,GAAG,GAAG,CAAC;YACR,CAAC,GAAG,GAAG,CAAC;YACR,CAAC,GAAG,GAAG,CAAC;SACT;QACD,IAAI,IAAI,GAAG,CAAC,CAAC;QACb,IAAI,MAAM,GAAG,MAAM,CAAC;QACpB,MAAM,OAAO,GAAmB,EAAE,CAAC;QAEnC,KAAK,MAAM,CAAC,IAAI,EAAE,EAAE;YAClB,OAAO,CAAC,IAAI,CAAC,IAAI,YAAY,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;SACtC;QACD,iDAAiD;QACjD,OAAO,IAAI,EAAE;YACX,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;YAC1C,MAAM,EAAE,GAAG,eAAe,CAAC,SAAS,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;YACjD,uBAAuB;YACvB,IAAI,EAAE,GAAG,GAAG,CAAC;YACb,IAAI,EAAE,GAAG,GAAG,CAAC;YAEb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;gBACvC,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC3C,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,KAAK,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;aAC1D;YACD,IAAI,SAAS,EAAE;gBACb,sCAAsC;gBACtC,OAAO,CAAC,GAAG,CAAC,GAAG,IAAI,WAAW,EAAE,CAAC,KAAK,OAAO,EAAE,OAAO,EAAE,KAAK,MAAM,GAAG,CAAC,CAAC;aACzE;YACD,IAAI,IAAI,KAAK,CAAC,IAAI,CAAC,EAAE,GAAG,UAAU,IAAI,EAAE,GAAG,UAAU,CAAC,EAAE;gBACtD,OAAO,OAAO,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;aAC1B;YACD,IAAI,IAAI,IAAI,OAAO,EAAE;gBACnB,OAAO,OAAO,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;aAC1B;YACD,IAAI,EAAE,CAAC;YACP,aAAa;YACb,MAAM,EAAE,GAAG,EAAE,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,OAAO,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;YAEzD,IAAI,OAAO,CAAC,CAAC,CAAC,CAAC,KAAK,IAAI,EAAE,CAAC,KAAK,IAAI,EAAE,CAAC,KAAK,GAAG,OAAO,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,KAAK,EAAE;gBAChF,OAAO,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC;gBACjC,MAAM,GAAG,SAAS,CAAC;gBACnB,SAAS;aACV;YACD,YAAY;YACZ,IAAI,EAAE,CAAC,KAAK,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE;gBAC/B,MAAM,EAAE,GAAG,EAAE,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;gBAEhC,IAAI,EAAE,CAAC,KAAK,GAAG,EAAE,CAAC,KAAK,EAAE;oBACvB,OAAO,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC;iBAClC;qBAAM;oBACL,OAAO,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC;iBAClC;gBACD,MAAM,GAAG,QAAQ,CAAC;gBAClB,SAAS;aACV;YACD,cAAc;YACd,IAAI,EAAE,CAAC,KAAK,GAAG,OAAO,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,KAAK,EAAE;gBAChD,MAAM,EAAE,GAAG,EAAE,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;gBAEhC,IAAI,EAAE,CAAC,KAAK,GAAG,EAAE,CAAC,KAAK,EAAE;oBACvB,OAAO,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC;oBACjC,MAAM,GAAG,UAAU,CAAC;oBACpB,SAAS;iBACV;qBAAM;oBACL,eAAe,CAAC,OAAO,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;oBACpC,MAAM,GAAG,QAAQ,CAAC;oBAClB,SAAS;iBACV;aACF;iBAAM,IAAI,EAAE,CAAC,KAAK,IAAI,OAAO,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,KAAK,EAAE;gBACxD,MAAM,EAAE,GAAG,EAAE,CAAC,MAAM,CAAC,CAAC,EAAE,OAAO,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;gBAEzD,IAAI,EAAE,CAAC,KAAK,GAAG,OAAO,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,KAAK,EAAE;oBAChD,OAAO,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC;oBACjC,MAAM,GAAG,UAAU,CAAC;oBACpB,SAAS;iBACV;qBAAM;oBACL,eAAe,CAAC,OAAO,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;oBACpC,MAAM,GAAG,QAAQ,CAAC;oBAClB,SAAS;iBACV;aACF;SACF;IACH,CAAC;CACF"}

package/lib/optimize/GoldenSection.d.ts

@@ -0,0 +1,33 @@
+/**
+ * @author @thkruz Theodore Kruczek
+ *
+ * @license AGPL-3.0-or-later
+ * @Copyright (c) 2020-2024 Theodore Kruczek
+ *
+ * Orbital Object ToolKit is free software: you can redistribute it and/or modify it under the
+ * terms of the GNU Affero General Public License as published by the Free Software
+ * Foundation, either version 3 of the License, or (at your option) any later version.
+ *
+ * Orbital Object ToolKit is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY;
+ * without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
+ * See the GNU Affero General Public License for more details.
+ *
+ * You should have received a copy of the GNU Affero General Public License along with
+ * Orbital Object ToolKit. If not, see <http://www.gnu.org/licenses/>.
+ */
+import { DifferentiableFunction } from 'ootk-core';
+export declare class GoldenSection {
+    private static readonly _grInv;
+    private static _check;
+    /**
+     * Search for an optimal input value for function [f] that minimizes the
+     * output value.
+     *
+     * Takes [lower] and [upper] input search bounds, and an optional
+     * search [tolerance].
+     */
+    static search(f: DifferentiableFunction, lower: number, upper: number, { tolerance, solveMax, }: {
+        tolerance?: number;
+        solveMax?: boolean;
+    }): number;
+}

package/lib/optimize/GoldenSection.js

@@ -0,0 +1,49 @@
+/**
+ * @author @thkruz Theodore Kruczek
+ *
+ * @license AGPL-3.0-or-later
+ * @Copyright (c) 2020-2024 Theodore Kruczek
+ *
+ * Orbital Object ToolKit is free software: you can redistribute it and/or modify it under the
+ * terms of the GNU Affero General Public License as published by the Free Software
+ * Foundation, either version 3 of the License, or (at your option) any later version.
+ *
+ * Orbital Object ToolKit is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY;
+ * without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
+ * See the GNU Affero General Public License for more details.
+ *
+ * You should have received a copy of the GNU Affero General Public License along with
+ * Orbital Object ToolKit. If not, see <http://www.gnu.org/licenses/>.
+ */
+// / Golden Section bounded single value optimizer.
+export class GoldenSection {
+    static _check(fc, fd, solveMax) {
+        return solveMax ? fc > fd : fc < fd;
+    }
+    /**
+     * Search for an optimal input value for function [f] that minimizes the
+     * output value.
+     *
+     * Takes [lower] and [upper] input search bounds, and an optional
+     * search [tolerance].
+     */
+    static search(f, lower, upper, { tolerance = 1e-5, solveMax = false, }) {
+        let a = lower;
+        let b = upper;
+        let c = b - (b - a) * GoldenSection._grInv;
+        let d = a + (b - a) * GoldenSection._grInv;
+        while (Math.abs(b - a) > tolerance) {
+            if (GoldenSection._check(f(c), f(d), solveMax)) {
+                b = d;
+            }
+            else {
+                a = c;
+            }
+            c = b - (b - a) * GoldenSection._grInv;
+            d = a + (b - a) * GoldenSection._grInv;
+        }
+        return 0.5 * (b + a);
+    }
+}
+GoldenSection._grInv = 1.0 / (0.5 * (Math.sqrt(5) + 1));
+//# sourceMappingURL=GoldenSection.js.map

package/lib/optimize/GoldenSection.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"GoldenSection.js","sourceRoot":"","sources":["../../src/optimize/GoldenSection.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AAIH,mDAAmD;AACnD,MAAM,OAAO,aAAa;IAGhB,MAAM,CAAC,MAAM,CAAC,EAAU,EAAE,EAAU,EAAE,QAAiB;QAC7D,OAAO,QAAQ,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC;IACtC,CAAC;IAED;;;;;;OAMG;IACH,MAAM,CAAC,MAAM,CACX,CAAyB,EACzB,KAAa,EACb,KAAa,EACb,EACE,SAAS,GAAG,IAAI,EAChB,QAAQ,GAAG,KAAK,GAIjB;QAED,IAAI,CAAC,GAAG,KAAK,CAAC;QACd,IAAI,CAAC,GAAG,KAAK,CAAC;QACd,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,aAAa,CAAC,MAAM,CAAC;QAC3C,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,aAAa,CAAC,MAAM,CAAC;QAE3C,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,SAAS,EAAE;YAClC,IAAI,aAAa,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,EAAE;gBAC9C,CAAC,GAAG,CAAC,CAAC;aACP;iBAAM;gBACL,CAAC,GAAG,CAAC,CAAC;aACP;YACD,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,aAAa,CAAC,MAAM,CAAC;YACvC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,aAAa,CAAC,MAAM,CAAC;SACxC;QAED,OAAO,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACvB,CAAC;;AAzCuB,oBAAM,GAAW,GAAG,GAAG,CAAC,GAAG,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC"}

package/lib/optimize/PolynomialRegression.d.ts

@@ -0,0 +1,37 @@
+/**
+ * @author @thkruz Theodore Kruczek
+ *
+ * @license AGPL-3.0-or-later
+ * @Copyright (c) 2020-2024 Theodore Kruczek
+ *
+ * Orbital Object ToolKit is free software: you can redistribute it and/or modify it under the
+ * terms of the GNU Affero General Public License as published by the Free Software
+ * Foundation, either version 3 of the License, or (at your option) any later version.
+ *
+ * Orbital Object ToolKit is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY;
+ * without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
+ * See the GNU Affero General Public License for more details.
+ *
+ * You should have received a copy of the GNU Affero General Public License along with
+ * Orbital Object ToolKit. If not, see <http://www.gnu.org/licenses/>.
+ */
+import { PolynomicalRegressionResult } from './PolynomicalRegressionResult';
+export declare class PolynomialRegression {
+    private constructor();
+    private static _bayesInformationCriterea;
+    /**
+     * Optimize polynomial coefficients to fit data series [xs] and [ys] for the
+     * provided polynomial [order].
+     */
+    static solve(xs: Float64Array, ys: Float64Array, order: number, { printIter }?: {
+        printIter?: boolean;
+    }): PolynomicalRegressionResult;
+    /**
+     * Optimize polynomial coefficients to fit data series [xs] and [ys], and
+     * attempt to find an optimal order within the [minOrder] and
+     * [maxOrder] bounds.
+     */
+    static solveOrder(xs: Float64Array, ys: Float64Array, minOrder: number, maxOrder: number, { printIter }?: {
+        printIter?: boolean;
+    }): PolynomicalRegressionResult;
+}

package/lib/optimize/PolynomialRegression.js

@@ -0,0 +1,66 @@
+/**
+ * @author @thkruz Theodore Kruczek
+ *
+ * @license AGPL-3.0-or-later
+ * @Copyright (c) 2020-2024 Theodore Kruczek
+ *
+ * Orbital Object ToolKit is free software: you can redistribute it and/or modify it under the
+ * terms of the GNU Affero General Public License as published by the Free Software
+ * Foundation, either version 3 of the License, or (at your option) any later version.
+ *
+ * Orbital Object ToolKit is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY;
+ * without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
+ * See the GNU Affero General Public License for more details.
+ *
+ * You should have received a copy of the GNU Affero General Public License along with
+ * Orbital Object ToolKit. If not, see <http://www.gnu.org/licenses/>.
+ */
+/* eslint-disable require-jsdoc */
+/* eslint-disable func-style */
+import { evalPoly } from 'ootk-core';
+import { DownhillSimplex } from './DownhillSimplex';
+import { PolynomicalRegressionResult } from './PolynomicalRegressionResult';
+// / Polynomial regression optimizer.
+export class PolynomialRegression {
+    constructor() {
+        // disable constructor
+    }
+    static _bayesInformationCriterea(n, k, sse) {
+        return n * Math.log(sse) + k * Math.log(n);
+    }
+    /**
+     * Optimize polynomial coefficients to fit data series [xs] and [ys] for the
+     * provided polynomial [order].
+     */
+    static solve(xs, ys, order, { printIter = false } = {}) {
+        const simplex = DownhillSimplex.generateSimplex(Float64Array.from(Array(order + 1).fill(1.0)));
+        function f(coeffs) {
+            let sse = 0.0;
+            for (let i = 0; i < xs.length; i++) {
+                const diff = ys[i] - evalPoly(xs[i], coeffs);
+                sse += diff * diff;
+            }
+            return sse;
+        }
+        const result = DownhillSimplex.solveSimplex(f, simplex, {
+            adaptive: true,
+            printIter,
+        });
+        const sse = f(result);
+        return new PolynomicalRegressionResult(result, Math.sqrt(sse), PolynomialRegression._bayesInformationCriterea(xs.length, order, sse));
+    }
+    /**
+     * Optimize polynomial coefficients to fit data series [xs] and [ys], and
+     * attempt to find an optimal order within the [minOrder] and
+     * [maxOrder] bounds.
+     */
+    static solveOrder(xs, ys, minOrder, maxOrder, { printIter = false } = {}) {
+        const cache = [];
+        for (let order = minOrder; order <= maxOrder; order++) {
+            cache.push(PolynomialRegression.solve(xs, ys, order, { printIter }));
+        }
+        cache.sort((a, b) => a.bic - b.bic);
+        return cache[0];
+    }
+}
+//# sourceMappingURL=PolynomialRegression.js.map

package/lib/optimize/PolynomialRegression.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"PolynomialRegression.js","sourceRoot":"","sources":["../../src/optimize/PolynomialRegression.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AAEH,kCAAkC;AAClC,+BAA+B;AAC/B,OAAO,EAAE,QAAQ,EAAE,MAAM,WAAW,CAAC;AACrC,OAAO,EAAE,eAAe,EAAE,MAAM,mBAAmB,CAAC;AACpD,OAAO,EAAE,2BAA2B,EAAE,MAAM,+BAA+B,CAAC;AAC5E,qCAAqC;AACrC,MAAM,OAAO,oBAAoB;IAC/B;QACE,sBAAsB;IACxB,CAAC;IAEO,MAAM,CAAC,yBAAyB,CAAC,CAAS,EAAE,CAAS,EAAE,GAAW;QACxE,OAAO,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAC7C,CAAC;IAED;;;OAGG;IACH,MAAM,CAAC,KAAK,CACV,EAAgB,EAChB,EAAgB,EAChB,KAAa,EACb,EAAE,SAAS,GAAG,KAAK,KAA8B,EAAE;QAEnD,MAAM,OAAO,GAAG,eAAe,CAAC,eAAe,CAAC,YAAY,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAE/F,SAAS,CAAC,CAAC,MAAoB;YAC7B,IAAI,GAAG,GAAG,GAAG,CAAC;YAEd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;gBAClC,MAAM,IAAI,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;gBAE7C,GAAG,IAAI,IAAI,GAAG,IAAI,CAAC;aACpB;YAED,OAAO,GAAG,CAAC;QACb,CAAC;QAED,MAAM,MAAM,GAAG,eAAe,CAAC,YAAY,CAAC,CAAC,EAAE,OAAO,EAAE;YACtD,QAAQ,EAAE,IAAI;YACd,SAAS;SACV,CAAC,CAAC;QACH,MAAM,GAAG,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC;QAEtB,OAAO,IAAI,2BAA2B,CACpC,MAAM,EACN,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,EACd,oBAAoB,CAAC,yBAAyB,CAAC,EAAE,CAAC,MAAM,EAAE,KAAK,EAAE,GAAG,CAAC,CACtE,CAAC;IACJ,CAAC;IAED;;;;OAIG;IACH,MAAM,CAAC,UAAU,CACf,EAAgB,EAChB,EAAgB,EAChB,QAAgB,EAChB,QAAgB,EAChB,EAAE,SAAS,GAAG,KAAK,KAA8B,EAAE;QAEnD,MAAM,KAAK,GAAkC,EAAE,CAAC;QAEhD,KAAK,IAAI,KAAK,GAAG,QAAQ,EAAE,KAAK,IAAI,QAAQ,EAAE,KAAK,EAAE,EAAE;YACrD,KAAK,CAAC,IAAI,CAAC,oBAAoB,CAAC,KAAK,CAAC,EAAE,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,SAAS,EAAE,CAAC,CAAC,CAAC;SACtE;QACD,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;QAEpC,OAAO,KAAK,CAAC,CAAC,CAAC,CAAC;IAClB,CAAC;CACF"}

package/lib/optimize/PolynomicalRegressionResult.d.ts

@@ -0,0 +1,28 @@
+/**
+ * @author @thkruz Theodore Kruczek
+ *
+ * @license AGPL-3.0-or-later
+ * @Copyright (c) 2020-2024 Theodore Kruczek
+ *
+ * Orbital Object ToolKit is free software: you can redistribute it and/or modify it under the
+ * terms of the GNU Affero General Public License as published by the Free Software
+ * Foundation, either version 3 of the License, or (at your option) any later version.
+ *
+ * Orbital Object ToolKit is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY;
+ * without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
+ * See the GNU Affero General Public License for more details.
+ *
+ * You should have received a copy of the GNU Affero General Public License along with
+ * Orbital Object ToolKit. If not, see <http://www.gnu.org/licenses/>.
+ */
+export declare class PolynomicalRegressionResult {
+    coefficients: Float64Array;
+    rss: number;
+    bic: number;
+    /**
+     * Create a new [PolynomicalRegressionResult] object, containing the
+     * polynomial [coefficients], root-sum-squared error [rss], and Bayes
+     * information criterea [bic].
+     */
+    constructor(coefficients: Float64Array, rss: number, bic: number);
+}

package/lib/optimize/PolynomicalRegressionResult.js

@@ -0,0 +1,32 @@
+/**
+ * @author @thkruz Theodore Kruczek
+ *
+ * @license AGPL-3.0-or-later
+ * @Copyright (c) 2020-2024 Theodore Kruczek
+ *
+ * Orbital Object ToolKit is free software: you can redistribute it and/or modify it under the
+ * terms of the GNU Affero General Public License as published by the Free Software
+ * Foundation, either version 3 of the License, or (at your option) any later version.
+ *
+ * Orbital Object ToolKit is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY;
+ * without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
+ * See the GNU Affero General Public License for more details.
+ *
+ * You should have received a copy of the GNU Affero General Public License along with
+ * Orbital Object ToolKit. If not, see <http://www.gnu.org/licenses/>.
+ */
+// / Polynomial regression optimization result.
+export class PolynomicalRegressionResult {
+    /**
+     * Create a new [PolynomicalRegressionResult] object, containing the
+     * polynomial [coefficients], root-sum-squared error [rss], and Bayes
+     * information criterea [bic].
+     */
+    constructor(coefficients, rss, bic) {
+        this.coefficients = coefficients;
+        this.rss = rss;
+        this.bic = bic;
+        // Nothing to do here.
+    }
+}
+//# sourceMappingURL=PolynomicalRegressionResult.js.map

package/lib/optimize/PolynomicalRegressionResult.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"PolynomicalRegressionResult.js","sourceRoot":"","sources":["../../src/optimize/PolynomicalRegressionResult.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AAEH,+CAA+C;AAC/C,MAAM,OAAO,2BAA2B;IACtC;;;;OAIG;IACH,YAAmB,YAA0B,EAAS,GAAW,EAAS,GAAW;QAAlE,iBAAY,GAAZ,YAAY,CAAc;QAAS,QAAG,GAAH,GAAG,CAAQ;QAAS,QAAG,GAAH,GAAG,CAAQ;QACnF,sBAAsB;IACxB,CAAC;CACF"}

package/lib/optimize/SimpleLinearRegression.d.ts

@@ -0,0 +1,41 @@
+/**
+ * @author @thkruz Theodore Kruczek
+ *
+ * @license AGPL-3.0-or-later
+ * @Copyright (c) 2020-2024 Theodore Kruczek
+ *
+ * Orbital Object ToolKit is free software: you can redistribute it and/or modify it under the
+ * terms of the GNU Affero General Public License as published by the Free Software
+ * Foundation, either version 3 of the License, or (at your option) any later version.
+ *
+ * Orbital Object ToolKit is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY;
+ * without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
+ * See the GNU Affero General Public License for more details.
+ *
+ * You should have received a copy of the GNU Affero General Public License along with
+ * Orbital Object ToolKit. If not, see <http://www.gnu.org/licenses/>.
+ */
+export declare class SimpleLinearRegression {
+    xs: number[];
+    ys: number[];
+    /**
+     * Create a new [SimpleLinearRegression] object from lists of x and y
+     * values.
+     */
+    constructor(xs: number[], ys: number[]);
+    private _slope;
+    private _intercept;
+    private _error;
+    get slope(): number;
+    get intercept(): number;
+    get error(): number;
+    get length(): number;
+    private _calcError;
+    update(): void;
+    evaluate(x: number): number;
+    /**
+     * Create a new [SimpleLinearRegression] object with outliers above the
+     * provided standard deviation [sigma] value removed.
+     */
+    filterOutliers(sigma?: number): SimpleLinearRegression;
+}