@cortex-js/compute-engine 0.17.0 → 0.18.0

package/dist/types/compute-engine/numerics/numeric.d.ts

@@ -1,4 +1,4 @@
-/* 0.17.0 */
+/* 0.18.0 */
 import { Decimal } from 'decimal.js';
 import { BoxedExpression } from '../public';
 export declare const MACHINE_PRECISION_BITS = 53;
@@ -98,3 +98,11 @@ export declare function centeredDiff8thOrder(f: (number: any) => number, x: numb
  *
  */
 export declare function monteCarloEstimate(f: (x: number) => number, a: number, b: number, n?: number): number;
+/**
+ *
+ * @param f
+ * @param x
+ * @param dir Direction of approach: > 0 for right, < 0 for left, 0 for both
+ * @returns
+ */
+export declare function limit(f: (x: number) => number, x: number, dir?: number): number;

package/dist/types/compute-engine/numerics/primes.d.ts

@@ -1,2 +1,2 @@
-/* 0.17.0 */
+/* 0.18.0 */
 export declare function isPrime(n: number): boolean | undefined;

package/dist/types/compute-engine/numerics/rationals.d.ts

@@ -1,4 +1,4 @@
-/* 0.17.0 */
+/* 0.18.0 */
 export declare function isRational(x: any | null): x is Rational;
 export declare function isMachineRational(x: any | null): x is [number, number];
 export declare function isBigRational(x: any | null): x is [bigint, bigint];

package/dist/types/compute-engine/numerics/richardson.d.ts

@@ -0,0 +1,80 @@
+/* 0.18.0 */
+
+    Translated from https://github.com/JuliaMath/Richardson.jl/blob/master/src/Richardson.jl
+
+
+    The `Richardson` module provides a function `extrapolate` that
+    extrapolates a given function `f(x)` to `f(x0)`, evaluating
+    `f` only  at a geometric sequence of points `> x0`
+    (or optionally `< x0`).
+    
+    The key algorithm is Richardson extrapolation using a Neville—Aitken
+    tableau, which adaptively increases the degree of an extrapolation
+    polynomial until convergence is achieved to a desired tolerance
+    (or convergence stalls due to e.g. floating-point errors).  This
+    allows one to obtain `f(x0)` to high-order accuracy, assuming
+    that `f(x0+h)` has a Taylor series or some other power
+    series in `h`.
+*/
+export interface ExtrapolateOptions {
+    contract?: number;
+    step?: number;
+    power?: number;
+    atol?: number;
+    rtol?: number;
+    maxeval?: number;
+    breaktol?: number;
+}
+/**
+ *
+ * Extrapolate `f(x)` to `f₀ ≈ f(x0)`, evaluating `f` only at `x > x0` points
+(or `x < x0` if `h < 0`) using Richardson extrapolation starting at
+`x=x₀+h`.  It returns a tuple `(f₀, err)` of the estimated `f(x0)`
+and an error estimate.
+
+The return value of `f` can be any type supporting `±` and `norm`
+operations (i.e. a normed vector space).
+Similarly, `h` and `x0` can be in any normed vector space,
+in which case `extrapolate` performs Richardson extrapolation
+of `f(x0+s*h)` to `s=0⁺` (i.e. it takes the limit as `x` goes
+to `x0` along the `h` direction).
+
+On each step of Richardson extrapolation, it shrinks `x-x0` by
+a factor of `contract`, stopping when the estimated error is
+`< max(rtol*norm(f₀), atol)`, when the estimated error
+increases by more than `breaktol` (e.g. due to numerical errors in the
+computation of `f`), when `f` returns a non-finite value (`NaN` or `Inf`),
+ or when `f` has been evaluated `maxeval` times.   Note that
+if the function may converge to zero, you may want
+specify a nonzero `atol` (which cannot be set by default
+because it depends on the scale/units of `f`); alternatively,
+in such cases `extrapolate` will halt when it becomes
+limited by the floating-point precision.   (Passing `breaktol=Inf`
+can be useful to force `extrapolate` to continue shrinking `h` even
+if polynomial extrapolation is initially failing to converge,
+possibly at the cost of extraneous function evaluations.)
+
+
+If `x0 = ±∞` (`±Inf`), then `extrapolate` computes the limit of
+`f(x)` as `x ⟶ ±∞` using geometrically *increasing* values
+of `h` (by factors of `1/contract`).
+
+In general, the starting `h` should be large enough that `f(x0+h)`
+can be computed accurately and efficiently (e.g. without
+severe cancellation errors), but small enough that `f` does not
+oscillate much between `x0` and `h`.  i.e. `h` should be a typical
+scale over which the function `f` varies significantly.
+
+Technically, Richardson extrapolation assumes that `f(x0+h)` can
+be expanded in a power series in `h^power`, where the default
+`power=1` corresponds to an ordinary Taylor series (i.e. assuming
+`f` is analytic at `x0`).  If this is not true, you may obtain
+slow convergence from `extrapolate`, but you can pass a different
+value of `power` (e.g. `power=0.5`) if your `f` has some different
+(Puiseux) power-series expansion.   Conversely, if `f` is
+an *even* function around `x0`, i.e. `f(x0+h) == f(x0-h)`,
+so that its Taylor series contains only *even* powers of `h`,
+you can accelerate convergence by passing `power=2`.
+
+ */
+export declare function extrapolate(f: (x: number) => number, x0: number, options?: ExtrapolateOptions): [val: number, err: number];

package/dist/types/compute-engine/public.d.ts

@@ -1,4 +1,4 @@
-/* 0.17.0 */
+/* 0.18.0 */
  * The most important classes are {@link ComputeEngine} and
  * {@link BoxedExpression}.
  *

package/dist/types/compute-engine/rules.d.ts

@@ -1,4 +1,4 @@
-/* 0.17.0 */
+/* 0.18.0 */
 /**
  * Go through all the rules in the rule set, and for all the rules that match
  * return the rhs of the rule applied to `expr`.

package/dist/types/compute-engine/simplify-rules.d.ts

@@ -1,4 +1,4 @@
-/* 0.17.0 */
+/* 0.18.0 */
 /**
  * A set of simplification rules.
  *

package/dist/types/compute-engine/solve.d.ts

@@ -1,4 +1,4 @@
-/* 0.17.0 */
+/* 0.18.0 */
 export declare const UNIVARIATE_ROOTS: Rule[];
 /**
  * Expression is a function of a single variable (`x`) or an Equality

package/dist/types/compute-engine/symbolic/derivative.d.ts

@@ -1,4 +1,4 @@
-/* 0.17.0 */
+/* 0.18.0 */
 /**
  *
  * @param fn The function to differentiate, a `["Function"]` expression or

package/dist/types/compute-engine/symbolic/expand.d.ts

@@ -1,4 +1,4 @@
-/* 0.17.0 */
+/* 0.18.0 */
 export declare function distribute(expr: BoxedExpression[]): BoxedExpression;
 /** Use the multinomial theorem (https://en.wikipedia.org/wiki/Multinomial_theorem) to expand the expression.
  * The expression must be a power of a sum of terms.

package/dist/types/compute-engine/symbolic/flatten.d.ts

@@ -1,4 +1,4 @@
-/* 0.17.0 */
+/* 0.18.0 */
 /**
  * Flatten the arguments.
  * If `expr` was canonical, the result it canonical.

package/dist/types/compute-engine/symbolic/negate.d.ts

@@ -1,4 +1,4 @@
-/* 0.17.0 */
+/* 0.18.0 */
 /**
  * Distribute `Negate` (multiply by -1) if expr is a number literal, an
  * addition or multiplication or another `Negate`.

package/dist/types/compute-engine/symbolic/polynomials.d.ts

@@ -1,4 +1,4 @@
-/* 0.17.0 */
+/* 0.18.0 */
 /**
  * Coefficient of a univariate (single variable) polynomial.
  *

package/dist/types/compute-engine/symbolic/product.d.ts

@@ -1,4 +1,4 @@
-/* 0.17.0 */
+/* 0.18.0 */
 /**
  * Group terms in a product by common term.
  *

package/dist/types/compute-engine/symbolic/sum.d.ts

@@ -1,4 +1,4 @@
-/* 0.17.0 */
+/* 0.18.0 */
 export declare class Sum {
     private engine;
     private _isCanonical;

package/dist/types/compute-engine/symbolic/utils.d.ts

@@ -1,4 +1,4 @@
-/* 0.17.0 */
+/* 0.18.0 */
 import { Decimal } from 'decimal.js';
 import { BoxedExpression, Hold, Rational } from '../public';
 /**

package/dist/types/compute-engine.d.ts

@@ -1,3 +1,3 @@
-/* 0.17.0 */
-export declare const version = "0.17.0";
+/* 0.18.0 */
+export declare const version = "0.18.0";
 export { ComputeEngine } from './compute-engine/compute-engine';

package/dist/types/math-json/math-json-format.d.ts

@@ -1,4 +1,4 @@
-/* 0.17.0 */
+/* 0.18.0 */
     /** A human readable string to annotate this expression, since JSON does not
      * allow comments in its encoding */
     comment?: string;

package/dist/types/math-json/utils.d.ts

@@ -1,4 +1,4 @@
-/* 0.17.0 */
+/* 0.18.0 */
 export declare const MISSING: Expression;
 export declare function isNumberExpression(expr: Expression | null): expr is number | string | MathJsonNumber;
 export declare function isNumberObject(expr: Expression | null): expr is MathJsonNumber;

package/dist/types/math-json.d.ts

@@ -1,3 +1,3 @@
-/* 0.17.0 */
+/* 0.18.0 */
 export { isSymbolObject, isStringObject, isFunctionObject, isDictionaryObject, stringValue as getStringValue, head, headName, symbol, applyRecursively, mapArgs, op, nops, dictionary as getDictionary, } from './math-json/utils';
-export declare const version = "0.17.0";
+export declare const version = "0.18.0";

package/package.json

@@ -1,5 +1,5 @@
 {
-  "version": "0.17.0",
+  "version": "0.18.0",
   "scripts": {
     "build": "bash ./scripts/build.sh",
     "clean": "bash ./scripts/clean.sh",
@@ -38,6 +38,14 @@
   "files": [
     "/dist"
   ],
+  "exports": {
+    ".": {
+      "types": "./dist/types/compute-engine.d.ts",
+      "require": "./dist/compute-engine.min.js",
+      "import": "./dist/compute-engine.min.esm.js",
+      "default": "./dist/compute-engine.min.js"
+    }
+  },
   "main": "./dist/compute-engine.min.js",
   "module": "./dist/compute-engine.min.esm.js",
   "types": "./dist/types/compute-engine.d.ts",
@@ -76,6 +84,5 @@
   "dependencies": {
     "complex.js": "^2.1.1",
     "decimal.js": "^10.4.3"
-  },
-  "type": "module"
+  }
 }