ootk 3.0.0 → 4.0.0-1

package/dist/optimize/PolynomialRegression.js

@@ -0,0 +1,83 @@
+/**
+ * @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].
+     * @param xs x values
+     * @param ys y values
+     * @param order Polynomial order
+     * @param root0 Root0
+     * @param root0.printIter Root0.printIter
+     * @returns The optimal input value.
+     */
+    static solve(xs, ys, order, { printIter = false } = {}) {
+        const simplex = DownhillSimplex.generateSimplex(Float64Array.from(Array(order + 1).fill(1.0)));
+        /**
+         * Sum of squared errors.
+         * @param coeffs Polynomial coefficients
+         * @returns Sum of squared errors
+         */
+        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.
+     * @param xs x values
+     * @param ys y values
+     * @param minOrder Minimum polynomial order
+     * @param maxOrder Maximum polynomial order
+     * @param root0 Root0
+     * @param root0.printIter Root0.printIter
+     * @returns The optimal input value.
+     */
+    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/dist/optimize/PolynomialRegression.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"PolynomialRegression.js","sourceRoot":"","sources":["../../src/optimize/PolynomialRegression.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;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;;;;;;;;;OASG;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;;;;WAIG;QACH,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;;;;;;;;;;;OAWG;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/dist/optimize/PolynomicalRegressionResult.d.ts

@@ -0,0 +1,31 @@
+/**
+ * @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].
+     * @param coefficients  The polynomial coefficients.
+     * @param rss The root-sum-squared error.
+     * @param bic The Bayes information criterea.
+     * @returns The optimal input value.
+     */
+    constructor(coefficients: Float64Array, rss: number, bic: number);
+}

package/dist/optimize/PolynomicalRegressionResult.js

@@ -0,0 +1,38 @@
+/**
+ * @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 {
+    coefficients;
+    rss;
+    bic;
+    /**
+     * Create a new [PolynomicalRegressionResult] object, containing the
+     * polynomial [coefficients], root-sum-squared error [rss], and Bayes
+     * information criterea [bic].
+     * @param coefficients  The polynomial coefficients.
+     * @param rss The root-sum-squared error.
+     * @param bic The Bayes information criterea.
+     * @returns The optimal input value.
+     */
+    constructor(coefficients, rss, bic) {
+        this.coefficients = coefficients;
+        this.rss = rss;
+        this.bic = bic;
+        // Nothing to do here.
+    }
+}
+//# sourceMappingURL=PolynomicalRegressionResult.js.map

package/dist/optimize/PolynomicalRegressionResult.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"PolynomicalRegressionResult.js","sourceRoot":"","sources":["../../src/optimize/PolynomicalRegressionResult.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AAEH,+CAA+C;AAC/C,MAAM,OAAO,2BAA2B;IAUnB;IAAmC;IAAoB;IAT1E;;;;;;;;OAQG;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/dist/optimize/SimpleLinearRegression.d.ts

@@ -0,0 +1,44 @@
+/**
+ * @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.
+     * @param xs x values
+     * @param ys 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.
+     * @param sigma standard deviation
+     * @returns new [SimpleLinearRegression] object
+     */
+    filterOutliers(sigma?: number): SimpleLinearRegression;
+}

package/dist/optimize/SimpleLinearRegression.js

@@ -0,0 +1,112 @@
+/**
+ * @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/>.
+ */
+// / Simple linear regression _(y = mx + b)_.
+export class SimpleLinearRegression {
+    xs;
+    ys;
+    /**
+     * Create a new [SimpleLinearRegression] object from lists of x and y
+     * values.
+     * @param xs x values
+     * @param ys y values
+     */
+    constructor(xs, ys) {
+        this.xs = xs;
+        this.ys = ys;
+        this.update();
+    }
+    // / Line slope
+    _slope = 0.0;
+    // / Y-axis intercept
+    _intercept = 0.0;
+    _error = 0.0;
+    // / Line slope
+    get slope() {
+        return this._slope;
+    }
+    // / Y-axis intercept
+    get intercept() {
+        return this._intercept;
+    }
+    // / Linear regression standard deviation
+    get error() {
+        return this._error;
+    }
+    // / Data length
+    get length() {
+        return Math.min(this.xs.length, this.ys.length);
+    }
+    _calcError() {
+        let total = 0.0;
+        for (let i = 0; i < this.length; i++) {
+            const delta = this.ys[i] - this.evaluate(this.xs[i]);
+            total += delta * delta;
+        }
+        this._error = Math.sqrt(total / (this.length - 1));
+    }
+    // / Update the linear fit with this object's current [xs] and [ys] values.
+    update() {
+        const n = Math.min(this.xs.length, this.ys.length);
+        let xMu = 0.0;
+        let yMu = 0.0;
+        for (let i = 0; i < n; i++) {
+            xMu += this.xs[i];
+            yMu += this.ys[i];
+        }
+        xMu /= n;
+        yMu /= n;
+        let pa = 0.0;
+        let xSig = 0.0;
+        let ySig = 0.0;
+        for (let i = 0; i < n; i++) {
+            const xd = this.xs[i] - xMu;
+            const yd = this.ys[i] - yMu;
+            pa += xd * yd;
+            xSig += xd * xd;
+            ySig += yd * yd;
+        }
+        const p = pa / (Math.sqrt(xSig) * Math.sqrt(ySig));
+        xSig = Math.sqrt(xSig / (n - 1));
+        ySig = Math.sqrt(ySig / (n - 1));
+        this._slope = p * (ySig / xSig);
+        this._intercept = yMu - this._slope * xMu;
+        this._calcError();
+    }
+    // / Evaluate this linear fit for y, given an [x] value.
+    evaluate(x) {
+        return this._slope * x + this._intercept;
+    }
+    /**
+     * Create a new [SimpleLinearRegression] object with outliers above the
+     * provided standard deviation [sigma] value removed.
+     * @param sigma standard deviation
+     * @returns new [SimpleLinearRegression] object
+     */
+    filterOutliers(sigma = 1.0) {
+        const limit = this.error * sigma;
+        const xsOut = [];
+        const ysOut = [];
+        for (let i = 0; i < this.length; i++) {
+            if (Math.abs(this.ys[i] - this.evaluate(this.xs[i])) < limit) {
+                xsOut.push(this.xs[i]);
+                ysOut.push(this.ys[i]);
+            }
+        }
+        return new SimpleLinearRegression(xsOut, ysOut);
+    }
+}
+//# sourceMappingURL=SimpleLinearRegression.js.map

package/dist/optimize/SimpleLinearRegression.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"SimpleLinearRegression.js","sourceRoot":"","sources":["../../src/optimize/SimpleLinearRegression.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AAEH,6CAA6C;AAC7C,MAAM,OAAO,sBAAsB;IAOd;IAAqB;IANxC;;;;;OAKG;IACH,YAAmB,EAAY,EAAS,EAAY;QAAjC,OAAE,GAAF,EAAE,CAAU;QAAS,OAAE,GAAF,EAAE,CAAU;QAClD,IAAI,CAAC,MAAM,EAAE,CAAC;IAChB,CAAC;IAED,eAAe;IACP,MAAM,GAAG,GAAG,CAAC;IAErB,qBAAqB;IACb,UAAU,GAAG,GAAG,CAAC;IAEjB,MAAM,GAAG,GAAG,CAAC;IAErB,eAAe;IACf,IAAI,KAAK;QACP,OAAO,IAAI,CAAC,MAAM,CAAC;IACrB,CAAC;IAED,qBAAqB;IACrB,IAAI,SAAS;QACX,OAAO,IAAI,CAAC,UAAU,CAAC;IACzB,CAAC;IAED,yCAAyC;IACzC,IAAI,KAAK;QACP,OAAO,IAAI,CAAC,MAAM,CAAC;IACrB,CAAC;IAED,gBAAgB;IAChB,IAAI,MAAM;QACR,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,MAAM,EAAE,IAAI,CAAC,EAAE,CAAC,MAAM,CAAC,CAAC;IAClD,CAAC;IAEO,UAAU;QAChB,IAAI,KAAK,GAAG,GAAG,CAAC;QAEhB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YACpC,MAAM,KAAK,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;YAErD,KAAK,IAAI,KAAK,GAAG,KAAK,CAAC;SACxB;QACD,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;IACrD,CAAC;IAED,2EAA2E;IAC3E,MAAM;QACJ,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,MAAM,EAAE,IAAI,CAAC,EAAE,CAAC,MAAM,CAAC,CAAC;QACnD,IAAI,GAAG,GAAG,GAAG,CAAC;QACd,IAAI,GAAG,GAAG,GAAG,CAAC;QAEd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;YAC1B,GAAG,IAAI,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YAClB,GAAG,IAAI,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;SACnB;QACD,GAAG,IAAI,CAAC,CAAC;QACT,GAAG,IAAI,CAAC,CAAC;QACT,IAAI,EAAE,GAAG,GAAG,CAAC;QACb,IAAI,IAAI,GAAG,GAAG,CAAC;QACf,IAAI,IAAI,GAAG,GAAG,CAAC;QAEf,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;YAC1B,MAAM,EAAE,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;YAC5B,MAAM,EAAE,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;YAE5B,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC;YACd,IAAI,IAAI,EAAE,GAAG,EAAE,CAAC;YAChB,IAAI,IAAI,EAAE,GAAG,EAAE,CAAC;SACjB;QACD,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;QAEnD,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACjC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACjC,IAAI,CAAC,MAAM,GAAG,CAAC,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC,CAAC;QAChC,IAAI,CAAC,UAAU,GAAG,GAAG,GAAG,IAAI,CAAC,MAAM,GAAG,GAAG,CAAC;QAC1C,IAAI,CAAC,UAAU,EAAE,CAAC;IACpB,CAAC;IAED,wDAAwD;IACxD,QAAQ,CAAC,CAAS;QAChB,OAAO,IAAI,CAAC,MAAM,GAAG,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC;IAC3C,CAAC;IAED;;;;;OAKG;IACH,cAAc,CAAC,KAAK,GAAG,GAAG;QACxB,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACjC,MAAM,KAAK,GAAa,EAAE,CAAC;QAC3B,MAAM,KAAK,GAAa,EAAE,CAAC;QAE3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YACpC,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,EAAE;gBAC5D,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;gBACvB,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;aACxB;SACF;QAED,OAAO,IAAI,sBAAsB,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;IAClD,CAAC;CACF"}

package/dist/optimize/SimplexEntry.d.ts

@@ -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/>.
+ */
+/**
+ * Optimization cost function that takes in parameter array [xs] and returns
+ * a score.
+ */
+export type CostFunction = (points: Float64Array) => number;
+export declare class SimplexEntry {
+    private _f;
+    points: Float64Array;
+    score: number;
+    private _x;
+    constructor(_f: CostFunction, points: Float64Array);
+    getPoints(): Float64Array;
+    getScore(): number;
+    modify(n: number, xa: SimplexEntry, xb: SimplexEntry): SimplexEntry;
+    distance(se: SimplexEntry): number;
+}

package/dist/optimize/SimplexEntry.js

@@ -0,0 +1,42 @@
+/**
+ * @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 { Vector } from 'ootk-core';
+export class SimplexEntry {
+    _f;
+    points;
+    score;
+    _x;
+    constructor(_f, points) {
+        this._f = _f;
+        this.points = points;
+        this._x = new Vector(points);
+        this.score = this._f(points);
+    }
+    getPoints() {
+        return this._x.toArray();
+    }
+    getScore() {
+        return this.score;
+    }
+    modify(n, xa, xb) {
+        return new SimplexEntry(this._f, this._x.add(xa._x.subtract(xb._x).scale(n)).toArray());
+    }
+    distance(se) {
+        return this._x.distance(se._x);
+    }
+}
+//# sourceMappingURL=SimplexEntry.js.map

package/dist/optimize/SimplexEntry.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"SimplexEntry.js","sourceRoot":"","sources":["../../src/optimize/SimplexEntry.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AAEH,OAAO,EAAE,MAAM,EAAE,MAAM,WAAW,CAAC;AAQnC,MAAM,OAAO,YAAY;IAIH;IAAyB;IAH7C,KAAK,CAAS;IACN,EAAE,CAAS;IAEnB,YAAoB,EAAgB,EAAS,MAAoB;QAA7C,OAAE,GAAF,EAAE,CAAc;QAAS,WAAM,GAAN,MAAM,CAAc;QAC/D,IAAI,CAAC,EAAE,GAAG,IAAI,MAAM,CAAC,MAAM,CAAC,CAAC;QAC7B,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,EAAE,CAAC,MAAM,CAAC,CAAC;IAC/B,CAAC;IAED,SAAS;QACP,OAAO,IAAI,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC;IAC3B,CAAC;IAED,QAAQ;QACN,OAAO,IAAI,CAAC,KAAK,CAAC;IACpB,CAAC;IAED,MAAM,CAAC,CAAS,EAAE,EAAgB,EAAE,EAAgB;QAClD,OAAO,IAAI,YAAY,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC;IAC1F,CAAC;IAED,QAAQ,CAAC,EAAgB;QACvB,OAAO,IAAI,CAAC,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;IACjC,CAAC;CACF"}

package/dist/orbit_determination/BatchLeastSquaresOD.d.ts

@@ -0,0 +1,65 @@
+/**
+ * @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 { J2000 } from 'ootk-core';
+import { Observation } from '../observation/Observation';
+import { ForceModel } from './../force/ForceModel';
+import { BatchLeastSquaresResult } from './BatchLeastSquaresResult';
+/**
+ * Batch least squares orbit determination.
+ */
+export declare class BatchLeastSquaresOD {
+    private observations_;
+    private apriori_;
+    private forceModel_?;
+    private posStep_;
+    private velStep_;
+    private fastDerivatives_;
+    private propPairs_;
+    private propagator_;
+    private nominal_;
+    private start_;
+    /**
+     * Create a new [BatchLeastSquaresOD] object from a list of [Observation]
+     * objects, an [apriori] state estimate, and an optional
+     * spacecraft [forceModel].
+     * @param observations_ List of observations.
+     * @param apriori_ Apriori state estimate.
+     * @param forceModel_ Spacecraft force model.
+     * @param posStep_ Position step size.
+     * @param velStep_ Velocity step size.
+     * @param fastDerivatives_ Use fast derivatives.
+     * @returns [BatchLeastSquaresOD] object.
+     */
+    constructor(observations_: Observation[], apriori_: J2000, forceModel_?: ForceModel | undefined, posStep_?: number, velStep_?: number, fastDerivatives_?: boolean);
+    private buildPropagator_;
+    private static stateToX0_;
+    private setPropagatorPairs_;
+    /**
+     * Attempt to solve a state estimate with the given root-mean-squared delta
+     * [tolerance].
+     * @param root0 Root initial guess.
+     * @param root0.tolerance Root-mean-squared delta tolerance.
+     * @param root0.maxIter Maximum number of iterations.
+     * @param root0.printIter Print iterations.
+     * @returns [BatchLeastSquaresResult] object.
+     */
+    solve({ tolerance, maxIter, printIter, }?: {
+        tolerance?: number;
+        maxIter?: number;
+        printIter?: boolean;
+    }): BatchLeastSquaresResult;
+}

package/dist/orbit_determination/BatchLeastSquaresOD.js

@@ -0,0 +1,143 @@
+/**
+ * @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 { concat, J2000, Matrix, Vector, Vector3D } from 'ootk-core';
+import { PropagatorPairs } from '../observation/PropagatorPairs';
+import { CovarianceFrame, StateCovariance } from './../covariance/StateCovariance';
+import { ForceModel } from './../force/ForceModel';
+import { KeplerPropagator } from './../propagator/KeplerPropagator';
+import { RungeKutta89Propagator } from './../propagator/RungeKutta89Propagator';
+import { BatchLeastSquaresResult } from './BatchLeastSquaresResult';
+/**
+ * Batch least squares orbit determination.
+ */
+export class BatchLeastSquaresOD {
+    observations_;
+    apriori_;
+    forceModel_;
+    posStep_;
+    velStep_;
+    fastDerivatives_;
+    // / Propagator pair cache, for generating observation Jacobians.
+    propPairs_;
+    // / Nominal state propagator.
+    propagator_;
+    // / State estimate during solve.
+    nominal_;
+    // / Solve start epoch.
+    start_;
+    /**
+     * Create a new [BatchLeastSquaresOD] object from a list of [Observation]
+     * objects, an [apriori] state estimate, and an optional
+     * spacecraft [forceModel].
+     * @param observations_ List of observations.
+     * @param apriori_ Apriori state estimate.
+     * @param forceModel_ Spacecraft force model.
+     * @param posStep_ Position step size.
+     * @param velStep_ Velocity step size.
+     * @param fastDerivatives_ Use fast derivatives.
+     * @returns [BatchLeastSquaresOD] object.
+     */
+    constructor(observations_, apriori_, forceModel_, posStep_ = 1e-5, velStep_ = 1e-5, fastDerivatives_ = false) {
+        this.observations_ = observations_;
+        this.apriori_ = apriori_;
+        this.forceModel_ = forceModel_;
+        this.posStep_ = posStep_;
+        this.velStep_ = velStep_;
+        this.fastDerivatives_ = fastDerivatives_;
+        this.observations_.sort((a, b) => a.epoch.posix - b.epoch.posix);
+        this.start_ = this.observations_[0].epoch;
+        this.propPairs_ = new PropagatorPairs(this.posStep_, this.velStep_);
+        this.forceModel_ ??= new ForceModel().setGravity();
+        this.propagator_ = new RungeKutta89Propagator(this.apriori_, this.forceModel_);
+        this.nominal_ = this.propagator_.propagate(this.start_);
+    }
+    buildPropagator_(x0, simple) {
+        const state = new J2000(this.nominal_.epoch, new Vector3D(x0[0], x0[1], x0[2]), new Vector3D(x0[3], x0[4], x0[5]));
+        if (simple) {
+            return new KeplerPropagator(state.toClassicalElements());
+        }
+        return new RungeKutta89Propagator(state, this.forceModel_);
+    }
+    static stateToX0_(state) {
+        return concat(state.position.toArray(), state.velocity.toArray());
+    }
+    setPropagatorPairs_(x0) {
+        const pl = this.buildPropagator_(x0, this.fastDerivatives_);
+        for (let i = 0; i < 6; i++) {
+            const step = this.propPairs_.step(i);
+            const xh = x0.slice();
+            xh[i] += step;
+            const ph = this.buildPropagator_(xh, this.fastDerivatives_);
+            this.propPairs_.set(i, ph, pl);
+        }
+    }
+    /**
+     * Attempt to solve a state estimate with the given root-mean-squared delta
+     * [tolerance].
+     * @param root0 Root initial guess.
+     * @param root0.tolerance Root-mean-squared delta tolerance.
+     * @param root0.maxIter Maximum number of iterations.
+     * @param root0.printIter Print iterations.
+     * @returns [BatchLeastSquaresResult] object.
+     */
+    solve({ tolerance = 1e-3, maxIter = 250, printIter = false, } = {}) {
+        let breakFlag = false;
+        const xNom = BatchLeastSquaresOD.stateToX0_(this.nominal_);
+        let weightedRms = Infinity;
+        const atwaMatInit = Matrix.zero(6, 6);
+        const atwbMatInit = Matrix.zero(6, 1);
+        let atwaMat = atwaMatInit;
+        for (let iter = 0; iter < maxIter; iter++) {
+            atwaMat = atwaMatInit;
+            let atwbMat = atwbMatInit;
+            this.propagator_ = this.buildPropagator_(xNom, false);
+            this.setPropagatorPairs_(xNom);
+            let rmsTotal = 0.0;
+            let measCount = 0;
+            for (const ob of this.observations_) {
+                const noise = ob.noise;
+                const aMat = ob.jacobian(this.propPairs_);
+                const aMatTN = aMat.transpose().multiply(noise);
+                const bMat = ob.residual(this.propagator_);
+                atwaMat = atwaMat.add(aMatTN.multiply(aMat));
+                atwbMat = atwbMat.add(aMatTN.multiply(bMat));
+                rmsTotal += bMat.transpose().multiply(noise).multiply(bMat).elements[0][0];
+                measCount += noise.rows;
+            }
+            const newWeightedRms = Math.sqrt(rmsTotal / measCount);
+            if (printIter) {
+                // eslint-disable-next-line no-console
+                console.log(`${iter + 1}: rms=${newWeightedRms} x=${new Vector(xNom)}`);
+            }
+            if (Math.abs((weightedRms - newWeightedRms) / weightedRms) <= tolerance) {
+                breakFlag = true;
+            }
+            weightedRms = newWeightedRms;
+            const dX = atwaMat.inverse().multiply(atwbMat);
+            for (let i = 0; i < 6; i++) {
+                xNom[i] += dX.elements[i][0];
+            }
+            if (breakFlag) {
+                break;
+            }
+        }
+        const p = atwaMat.inverse();
+        const covariance = new StateCovariance(p, CovarianceFrame.ECI);
+        return new BatchLeastSquaresResult(this.buildPropagator_(xNom, false).propagate(this.start_), covariance, weightedRms);
+    }
+}
+//# sourceMappingURL=BatchLeastSquaresOD.js.map

package/dist/orbit_determination/BatchLeastSquaresOD.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"BatchLeastSquaresOD.js","sourceRoot":"","sources":["../../src/orbit_determination/BatchLeastSquaresOD.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AAEH,OAAO,EAAE,MAAM,EAAY,KAAK,EAAmC,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,WAAW,CAAC;AAE/G,OAAO,EAAE,eAAe,EAAE,MAAM,gCAAgC,CAAC;AAEjE,OAAO,EAAE,eAAe,EAAE,eAAe,EAAE,MAAM,iCAAiC,CAAC;AACnF,OAAO,EAAE,UAAU,EAAE,MAAM,uBAAuB,CAAC;AACnD,OAAO,EAAE,gBAAgB,EAAE,MAAM,kCAAkC,CAAC;AACpE,OAAO,EAAE,sBAAsB,EAAE,MAAM,wCAAwC,CAAC;AAChF,OAAO,EAAE,uBAAuB,EAAE,MAAM,2BAA2B,CAAC;AAEpE;;GAEG;AACH,MAAM,OAAO,mBAAmB;IAuBpB;IACA;IACA;IACA;IACA;IACA;IA3BV,iEAAiE;IACzD,UAAU,CAAkB;IACpC,8BAA8B;IACtB,WAAW,CAAa;IAChC,iCAAiC;IACzB,QAAQ,CAAQ;IACxB,uBAAuB;IACf,MAAM,CAAW;IAEzB;;;;;;;;;;;OAWG;IACH,YACU,aAA4B,EAC5B,QAAe,EACf,WAAwB,EACxB,WAAmB,IAAI,EACvB,WAAmB,IAAI,EACvB,mBAA4B,KAAK;QALjC,kBAAa,GAAb,aAAa,CAAe;QAC5B,aAAQ,GAAR,QAAQ,CAAO;QACf,gBAAW,GAAX,WAAW,CAAa;QACxB,aAAQ,GAAR,QAAQ,CAAe;QACvB,aAAQ,GAAR,QAAQ,CAAe;QACvB,qBAAgB,GAAhB,gBAAgB,CAAiB;QAEzC,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;QACjE,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;QAC1C,IAAI,CAAC,UAAU,GAAG,IAAI,eAAe,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;QACpE,IAAI,CAAC,WAAW,KAAK,IAAI,UAAU,EAAE,CAAC,UAAU,EAAE,CAAC;QACnD,IAAI,CAAC,WAAW,GAAG,IAAI,sBAAsB,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC;QAC/E,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,WAAW,CAAC,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAC1D,CAAC;IAEO,gBAAgB,CAAC,EAAgB,EAAE,MAAe;QACxD,MAAM,KAAK,GAAG,IAAI,KAAK,CACrB,IAAI,CAAC,QAAQ,CAAC,KAAK,EACnB,IAAI,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAe,EAAE,EAAE,CAAC,CAAC,CAAe,EAAE,EAAE,CAAC,CAAC,CAAe,CAAC,EAC3E,IAAI,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAwB,EAAE,EAAE,CAAC,CAAC,CAAwB,EAAE,EAAE,CAAC,CAAC,CAAwB,CAAC,CACvG,CAAC;QAEF,IAAI,MAAM,EAAE;YACV,OAAO,IAAI,gBAAgB,CAAC,KAAK,CAAC,mBAAmB,EAAE,CAAC,CAAC;SAC1D;QAED,OAAO,IAAI,sBAAsB,CAAC,KAAK,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC;IAC7D,CAAC;IAEO,MAAM,CAAC,UAAU,CAAC,KAAY;QACpC,OAAO,MAAM,CAAC,KAAK,CAAC,QAAQ,CAAC,OAAO,EAAE,EAAE,KAAK,CAAC,QAAQ,CAAC,OAAO,EAAE,CAAC,CAAC;IACpE,CAAC;IAEO,mBAAmB,CAAC,EAAgB;QAC1C,MAAM,EAAE,GAAG,IAAI,CAAC,gBAAgB,CAAC,EAAE,EAAE,IAAI,CAAC,gBAAgB,CAAC,CAAC;QAE5D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;YAC1B,MAAM,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACrC,MAAM,EAAE,GAAG,EAAE,CAAC,KAAK,EAAE,CAAC;YAEtB,EAAE,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC;YACd,MAAM,EAAE,GAAG,IAAI,CAAC,gBAAgB,CAAC,EAAE,EAAE,IAAI,CAAC,gBAAgB,CAAC,CAAC;YAE5D,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;SAChC;IACH,CAAC;IAED;;;;;;;;OAQG;IACH,KAAK,CAAC,EACJ,SAAS,GAAG,IAAI,EAChB,OAAO,GAAG,GAAG,EACb,SAAS,GAAG,KAAK,MAKf,EAAE;QACJ,IAAI,SAAS,GAAG,KAAK,CAAC;QACtB,MAAM,IAAI,GAAG,mBAAmB,CAAC,UAAU,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAC3D,IAAI,WAAW,GAAG,QAAQ,CAAC;QAC3B,MAAM,WAAW,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACtC,MAAM,WAAW,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACtC,IAAI,OAAO,GAAG,WAAW,CAAC;QAE1B,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,OAAO,EAAE,IAAI,EAAE,EAAE;YACzC,OAAO,GAAG,WAAW,CAAC;YACtB,IAAI,OAAO,GAAG,WAAW,CAAC;YAE1B,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,gBAAgB,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;YACtD,IAAI,CAAC,mBAAmB,CAAC,IAAI,CAAC,CAAC;YAC/B,IAAI,QAAQ,GAAG,GAAG,CAAC;YACnB,IAAI,SAAS,GAAG,CAAC,CAAC;YAElB,KAAK,MAAM,EAAE,IAAI,IAAI,CAAC,aAAa,EAAE;gBACnC,MAAM,KAAK,GAAG,EAAE,CAAC,KAAK,CAAC;gBACvB,MAAM,IAAI,GAAG,EAAE,CAAC,QAAQ,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;gBAC1C,MAAM,MAAM,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;gBAChD,MAAM,IAAI,GAAG,EAAE,CAAC,QAAQ,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;gBAE3C,OAAO,GAAG,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC;gBAC7C,OAAO,GAAG,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC;gBAC7C,QAAQ,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC3E,SAAS,IAAI,KAAK,CAAC,IAAI,CAAC;aACzB;YACD,MAAM,cAAc,GAAG,IAAI,CAAC,IAAI,CAAC,QAAQ,GAAG,SAAS,CAAC,CAAC;YAEvD,IAAI,SAAS,EAAE;gBACb,sCAAsC;gBACtC,OAAO,CAAC,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,SAAS,cAAc,MAAM,IAAI,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;aACzE;YACD,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,WAAW,GAAG,cAAc,CAAC,GAAG,WAAW,CAAC,IAAI,SAAS,EAAE;gBACvE,SAAS,GAAG,IAAI,CAAC;aAClB;YACD,WAAW,GAAG,cAAc,CAAC;YAC7B,MAAM,EAAE,GAAG,OAAO,CAAC,OAAO,EAAE,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC;YAE/C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;gBAC1B,IAAI,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;aAC9B;YACD,IAAI,SAAS,EAAE;gBACb,MAAM;aACP;SACF;QACD,MAAM,CAAC,GAAG,OAAO,CAAC,OAAO,EAAE,CAAC;QAC5B,MAAM,UAAU,GAAG,IAAI,eAAe,CAAC,CAAC,EAAE,eAAe,CAAC,GAAG,CAAC,CAAC;QAE/D,OAAO,IAAI,uBAAuB,CAChC,IAAI,CAAC,gBAAgB,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,EACzD,UAAU,EACV,WAAW,CACZ,CAAC;IACJ,CAAC;CACF"}

package/dist/orbit_determination/BatchLeastSquaresResult.d.ts

@@ -0,0 +1,31 @@
+/**
+ * @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 { J2000 } from 'ootk-core';
+import { StateCovariance } from './../covariance/StateCovariance';
+export declare class BatchLeastSquaresResult {
+    state: J2000;
+    covariance: StateCovariance;
+    rms: number;
+    /**
+     * Create a new [BatchLeastSquaresResult] object, containing the solved
+     * [state], [covariance], and root-mean-squared error [rms].
+     * @param state The solved state.
+     * @param covariance The solved covariance.
+     * @param rms The root-mean-squared error.
+     */
+    constructor(state: J2000, covariance: StateCovariance, rms: number);
+}