mathjs 11.3.3 → 11.5.0

package/lib/cjs/function/algebra/simplify.js

@@ -7,6 +7,7 @@ Object.defineProperty(exports, "__esModule", {
 exports.createSimplify = void 0;
 var _typeof2 = _interopRequireDefault(require("@babel/runtime/helpers/typeof"));
 var _is = require("../../utils/is.js");
+var _wildcards = require("./simplify/wildcards.js");
 var _factory = require("../../utils/factory.js");
 var _util = require("./simplify/util.js");
 var _object = require("../../utils/object.js");
@@ -80,9 +81,15 @@ var createSimplify = /* #__PURE__ */(0, _factory.factory)(name, dependencies, fu
    * expression is that variables starting with the following characters are
    * interpreted as wildcards:
    *
-   * - 'n' - matches any Node
-   * - 'c' - matches any ConstantNode
-   * - 'v' - matches any Node that is not a ConstantNode
+   * - 'n' - Matches any node [Node]
+   * - 'c' - Matches a constant literal (5 or 3.2) [ConstantNode]
+   * - 'cl' - Matches a constant literal; same as c [ConstantNode]
+   * - 'cd' - Matches a decimal literal (5 or -3.2) [ConstantNode or unaryMinus wrapping a ConstantNode]
+   * - 'ce' - Matches a constant expression (-5 or √3) [Expressions consisting of only ConstantNodes, functions, and operators]
+   * - 'v' - Matches a variable; anything not matched by c (-5 or x) [Node that is not a ConstantNode]
+   * - 'vl' - Matches a variable literal (x or y) [SymbolNode]
+   * - 'vd' - Matches a non-decimal expression; anything not matched by cd (x or √3) [Node that is not a ConstantNode or unaryMinus that is wrapping a ConstantNode]
+   * - 've' - Matches a variable expression; anything not matched by ce (x or 2x) [Expressions that contain a SymbolNode or other non-constant term]
    *
    * The default list of rules is exposed on the function as `simplify.rules`
    * and can be used as a basis to built a set of custom rules. Note that since
@@ -259,7 +266,7 @@ var createSimplify = /* #__PURE__ */(0, _factory.factory)(name, dependencies, fu
       }
     }
   }, {
-    s: '-(c*v) -> v * (-c)',
+    s: '-(cl*v) -> v * (-cl)',
     // make non-constant terms positive
     assuming: {
       multiply: {
@@ -270,7 +277,7 @@ var createSimplify = /* #__PURE__ */(0, _factory.factory)(name, dependencies, fu
       }
     }
   }, {
-    s: '-(c*v) -> (-c) * v',
+    s: '-(cl*v) -> (-cl) * v',
     // non-commutative version, part 1
     assuming: {
       multiply: {
@@ -281,7 +288,7 @@ var createSimplify = /* #__PURE__ */(0, _factory.factory)(name, dependencies, fu
       }
     }
   }, {
-    s: '-(v*c) -> v * (-c)',
+    s: '-(v*cl) -> v * (-cl)',
     // non-commutative version, part 2
     assuming: {
       multiply: {
@@ -339,24 +346,24 @@ var createSimplify = /* #__PURE__ */(0, _factory.factory)(name, dependencies, fu
   },
   // collect like factors; into a sum, only do this for nonconstants
   {
-    l: ' v   * ( v   * n1 + n2)',
-    r: 'v^2       * n1 +  v   * n2'
+    l: ' vd   * ( vd   * n1 + n2)',
+    r: 'vd^2       * n1 +  vd   * n2'
   }, {
-    s: ' v   * (v^n4 * n1 + n2)   ->  v^(1+n4)  * n1 +  v   * n2',
+    s: ' vd   * (vd^n4 * n1 + n2)   ->  vd^(1+n4)  * n1 +  vd   * n2',
     assuming: {
       divide: {
         total: true
       }
     } // v*1/v = v^(1+-1) needs 1/v
   }, {
-    s: 'v^n3 * ( v   * n1 + n2)   ->  v^(n3+1)  * n1 + v^n3 * n2',
+    s: 'vd^n3 * ( vd   * n1 + n2)   ->  vd^(n3+1)  * n1 + vd^n3 * n2',
     assuming: {
       divide: {
         total: true
       }
     }
   }, {
-    s: 'v^n3 * (v^n4 * n1 + n2)   ->  v^(n3+n4) * n1 + v^n3 * n2',
+    s: 'vd^n3 * (vd^n4 * n1 + n2)   ->  vd^(n3+n4) * n1 + vd^n3 * n2',
     assuming: {
       divide: {
         total: true
@@ -399,8 +406,8 @@ var createSimplify = /* #__PURE__ */(0, _factory.factory)(name, dependencies, fu
     l: 'n+-n',
     r: '0'
   }, {
-    l: 'v*n + v',
-    r: 'v*(n+1)'
+    l: 'vd*n + vd',
+    r: 'vd*(n+1)'
   },
   // NOTE: leftmost position is special:
   {
@@ -414,9 +421,17 @@ var createSimplify = /* #__PURE__ */(0, _factory.factory)(name, dependencies, fu
   }, {
     l: 'n3^(-n4)*n1 + n3^n5 * n2',
     r: 'n3^(-n4)*(n1 + n3^(n4+n5)*n2)'
+  },
+  // noncommutative additional cases (term collection & factoring)
+  {
+    s: 'n*vd + vd -> (n+1)*vd',
+    assuming: {
+      multiply: {
+        commutative: false
+      }
+    }
   }, {
-    s: 'n*v + v -> (n+1)*v',
-    // noncommutative additional cases
+    s: 'vd + n*vd -> (1+n)*vd',
     assuming: {
       multiply: {
         commutative: false
@@ -429,6 +444,16 @@ var createSimplify = /* #__PURE__ */(0, _factory.factory)(name, dependencies, fu
         commutative: false
       }
     }
+  }, {
+    s: 'n^n1 * n -> n^(n1+1)',
+    assuming: {
+      divide: {
+        total: true
+      },
+      multiply: {
+        commutative: false
+      }
+    }
   }, {
     s: 'n1*n3^(-n4) + n2 * n3    -> (n1 + n2*n3^(n4 +  1))*n3^(-n4)',
     assuming: {
@@ -444,10 +469,17 @@ var createSimplify = /* #__PURE__ */(0, _factory.factory)(name, dependencies, fu
       }
     }
   }, {
-    l: 'n*c + c',
-    r: '(n+1)*c'
+    l: 'n*cd + cd',
+    r: '(n+1)*cd'
   }, {
-    s: 'c*n + c -> c*(n+1)',
+    s: 'cd*n + cd -> cd*(n+1)',
+    assuming: {
+      multiply: {
+        commutative: false
+      }
+    }
+  }, {
+    s: 'cd + cd*n -> cd*(1+n)',
     assuming: {
       multiply: {
         commutative: false
@@ -478,7 +510,7 @@ var createSimplify = /* #__PURE__ */(0, _factory.factory)(name, dependencies, fu
   },
   // final ordering of constants
   {
-    s: 'c+v -> v+c',
+    s: 'ce+ve -> ve+ce',
     assuming: {
       add: {
         commutative: true
@@ -490,7 +522,7 @@ var createSimplify = /* #__PURE__ */(0, _factory.factory)(name, dependencies, fu
       }
     }
   }, {
-    s: 'v*c -> c*v',
+    s: 'vd*cd -> cd*vd',
     assuming: {
       multiply: {
         commutative: true
@@ -609,15 +641,33 @@ var createSimplify = /* #__PURE__ */(0, _factory.factory)(name, dependencies, fu
       newRule.evaluate = parse(ruleObject.evaluate);
     }
     if (isAssociative(newRule.l, context)) {
+      var nonCommutative = !isCommutative(newRule.l, context);
+      var leftExpandsym;
+      // Gen. the LHS placeholder used in this NC-context specific expansion rules
+      if (nonCommutative) leftExpandsym = _getExpandPlaceholderSymbol();
       var makeNode = createMakeNodeFunction(newRule.l);
       var expandsym = _getExpandPlaceholderSymbol();
       newRule.expanded = {};
-      newRule.expanded.l = makeNode([newRule.l.clone(), expandsym]);
+      newRule.expanded.l = makeNode([newRule.l, expandsym]);
       // Push the expandsym into the deepest possible branch.
       // This helps to match the newRule against nodes returned from getSplits() later on.
       flatten(newRule.expanded.l, context);
       unflattenr(newRule.expanded.l, context);
       newRule.expanded.r = makeNode([newRule.r, expandsym]);
+
+      // In and for a non-commutative context, attempting with yet additional expansion rules makes
+      // way for more matches cases of multi-arg expressions; such that associative rules (such as
+      // 'n*n -> n^2') can be applied to exprs. such as 'a * b * b' and 'a * b * b * a'.
+      if (nonCommutative) {
+        // 'Non-commutative' 1: LHS (placeholder) only
+        newRule.expandedNC1 = {};
+        newRule.expandedNC1.l = makeNode([leftExpandsym, newRule.l]);
+        newRule.expandedNC1.r = makeNode([leftExpandsym, newRule.r]);
+        // 'Non-commutative' 2: farmost LHS and RHS placeholders
+        newRule.expandedNC2 = {};
+        newRule.expandedNC2.l = makeNode([leftExpandsym, newRule.expanded.l]);
+        newRule.expandedNC2.r = makeNode([leftExpandsym, newRule.expanded.r]);
+      }
     }
     return newRule;
   }
@@ -823,6 +873,16 @@ var createSimplify = /* #__PURE__ */(0, _factory.factory)(name, dependencies, fu
       repl = rule.expanded.r;
       matches = _ruleMatch(rule.expanded.l, res, mergedContext)[0];
     }
+    // Additional, non-commutative context expansion-rules
+    if (!matches && rule.expandedNC1) {
+      repl = rule.expandedNC1.r;
+      matches = _ruleMatch(rule.expandedNC1.l, res, mergedContext)[0];
+      if (!matches) {
+        // Existence of NC1 implies NC2
+        repl = rule.expandedNC2.r;
+        matches = _ruleMatch(rule.expandedNC2.l, res, mergedContext)[0];
+      }
+    }
     if (matches) {
       // const before = res.toString({parenthesis: 'all'})
 
@@ -1040,8 +1100,8 @@ var createSimplify = /* #__PURE__ */(0, _factory.factory)(name, dependencies, fu
         res = mergeChildMatches(childMatches);
       } else if (node.args.length >= 2 && rule.args.length === 2) {
         // node is flattened, rule is not
-        // Associative operators/functions can be split in different ways so we check if the rule matches each
-        // them and return their union.
+        // Associative operators/functions can be split in different ways so we check if the rule
+        // matches for each of them and return their union.
         var splits = getSplits(node, context);
         var splitMatches = [];
         for (var _i3 = 0; _i3 < splits.length; _i3++) {
@@ -1057,9 +1117,8 @@ var createSimplify = /* #__PURE__ */(0, _factory.factory)(name, dependencies, fu
       }
     } else if (rule instanceof SymbolNode) {
       // If the rule is a SymbolNode, then it carries a special meaning
-      // according to the first character of the symbol node name.
-      // c.* matches a ConstantNode
-      // n.* matches any node
+      // according to the first one or two characters of the symbol node name.
+      // These meanings are expalined in the documentation for simplify()
       if (rule.name.length === 0) {
         throw new Error('Symbol in rule has 0 length...!?');
       }
@@ -1068,29 +1127,83 @@ var createSimplify = /* #__PURE__ */(0, _factory.factory)(name, dependencies, fu
         if (rule.name !== node.name) {
           return [];
         }
-      } else if (rule.name[0] === 'n' || rule.name.substring(0, 2) === '_p') {
-        // rule matches _anything_, so assign this node to the rule.name placeholder
-        // Assign node to the rule.name placeholder.
-        // Our parent will check for matches among placeholders.
-        res[0].placeholders[rule.name] = node;
-      } else if (rule.name[0] === 'v') {
-        // rule matches any variable thing (not a ConstantNode)
-        if (!(0, _is.isConstantNode)(node)) {
-          res[0].placeholders[rule.name] = node;
-        } else {
-          // Mis-match: rule was expecting something other than a ConstantNode
-          return [];
-        }
-      } else if (rule.name[0] === 'c') {
-        // rule matches any ConstantNode
-        if (node instanceof ConstantNode) {
-          res[0].placeholders[rule.name] = node;
-        } else {
-          // Mis-match: rule was expecting a ConstantNode
-          return [];
-        }
       } else {
-        throw new Error('Invalid symbol in rule: ' + rule.name);
+        // wildcards are composed of up to two alphabetic or underscore characters
+        switch (rule.name[1] >= 'a' && rule.name[1] <= 'z' ? rule.name.substring(0, 2) : rule.name[0]) {
+          case 'n':
+          case '_p':
+            // rule matches _anything_, so assign this node to the rule.name placeholder
+            // Assign node to the rule.name placeholder.
+            // Our parent will check for matches among placeholders.
+            res[0].placeholders[rule.name] = node;
+            break;
+          case 'c':
+          case 'cl':
+            // rule matches a ConstantNode
+            if ((0, _wildcards.isConstantNode)(node)) {
+              res[0].placeholders[rule.name] = node;
+            } else {
+              // mis-match: rule does not encompass current node
+              return [];
+            }
+            break;
+          case 'v':
+            // rule matches anything other than a ConstantNode
+            if (!(0, _wildcards.isConstantNode)(node)) {
+              res[0].placeholders[rule.name] = node;
+            } else {
+              // mis-match: rule does not encompass current node
+              return [];
+            }
+            break;
+          case 'vl':
+            // rule matches VariableNode
+            if ((0, _wildcards.isVariableNode)(node)) {
+              res[0].placeholders[rule.name] = node;
+            } else {
+              // mis-match: rule does not encompass current node
+              return [];
+            }
+            break;
+          case 'cd':
+            // rule matches a ConstantNode or unaryMinus-wrapped ConstantNode
+            if ((0, _wildcards.isNumericNode)(node)) {
+              res[0].placeholders[rule.name] = node;
+            } else {
+              // mis-match: rule does not encompass current node
+              return [];
+            }
+            break;
+          case 'vd':
+            // rule matches anything other than a ConstantNode or unaryMinus-wrapped ConstantNode
+            if (!(0, _wildcards.isNumericNode)(node)) {
+              res[0].placeholders[rule.name] = node;
+            } else {
+              // mis-match: rule does not encompass current node
+              return [];
+            }
+            break;
+          case 'ce':
+            // rule matches expressions that have a constant value
+            if ((0, _wildcards.isConstantExpression)(node)) {
+              res[0].placeholders[rule.name] = node;
+            } else {
+              // mis-match: rule does not encompass current node
+              return [];
+            }
+            break;
+          case 've':
+            // rule matches expressions that do not have a constant value
+            if (!(0, _wildcards.isConstantExpression)(node)) {
+              res[0].placeholders[rule.name] = node;
+            } else {
+              // mis-match: rule does not encompass current node
+              return [];
+            }
+            break;
+          default:
+            throw new Error('Invalid symbol in rule: ' + rule.name);
+        }
       }
     } else if (rule instanceof ConstantNode) {
       // Literal constant must match exactly

package/lib/cjs/function/algebra/simplifyConstant.js

@@ -307,20 +307,37 @@ var createSimplifyConstant = /* #__PURE__ */(0, _factory.factory)(name, dependen
    * @return - Either a Node representing a binary expression or Fraction
    */
   function foldOp(fn, args, makeNode, options) {
-    return args.reduce(function (a, b) {
-      if (!(0, _is.isNode)(a) && !(0, _is.isNode)(b)) {
+    var first = args.shift();
+
+    // In the following reduction, sofar always has one of the three following
+    // forms: [NODE], [CONSTANT], or [NODE, CONSTANT]
+    var reduction = args.reduce(function (sofar, next) {
+      if (!(0, _is.isNode)(next)) {
+        var last = sofar.pop();
+        if ((0, _is.isNode)(last)) {
+          return [last, next];
+        }
+        // Two constants in a row, try to fold them into one
         try {
-          return _eval(fn, [a, b], options);
-        } catch (ignoreandcontinue) {}
-        a = _toNode(a);
-        b = _toNode(b);
-      } else if (!(0, _is.isNode)(a)) {
-        a = _toNode(a);
-      } else if (!(0, _is.isNode)(b)) {
-        b = _toNode(b);
+          sofar.push(_eval(fn, [last, next], options));
+          return sofar;
+        } catch (ignoreandcontinue) {
+          sofar.push(last);
+          // fall through to Node case
+        }
       }
-      return makeNode([a, b]);
-    });
+
+      // Encountered a Node, or failed folding --
+      // collapse everything so far into a single tree:
+      sofar.push(_ensureNode(sofar.pop()));
+      var newtree = sofar.length === 1 ? sofar[0] : makeNode(sofar);
+      return [makeNode([newtree, _ensureNode(next)])];
+    }, [first]);
+    if (reduction.length === 1) {
+      return reduction[0];
+    }
+    // Might end up with a tree and a constant at the end:
+    return makeNode([reduction[0], _toNode(reduction[1])]);
   }
 
   // destroys the original node and returns a folded one

package/lib/cjs/function/algebra/sylvester.js

@@ -0,0 +1,127 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createSylvester = void 0;
+var _factory = require("../../utils/factory.js");
+var name = 'sylvester';
+var dependencies = ['typed', 'schur', 'matrixFromColumns', 'matrix', 'multiply', 'range', 'concat', 'transpose', 'index', 'subset', 'add', 'subtract', 'identity', 'lusolve', 'abs'];
+var createSylvester = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+    schur = _ref.schur,
+    matrixFromColumns = _ref.matrixFromColumns,
+    matrix = _ref.matrix,
+    multiply = _ref.multiply,
+    range = _ref.range,
+    concat = _ref.concat,
+    transpose = _ref.transpose,
+    index = _ref.index,
+    subset = _ref.subset,
+    add = _ref.add,
+    subtract = _ref.subtract,
+    identity = _ref.identity,
+    lusolve = _ref.lusolve,
+    abs = _ref.abs;
+  /**
+   *
+   * Solves the real-valued Sylvester equation AX+XB=C for X, where A, B and C are
+   * matrices of appropriate dimensions, being A and B squared. Notice that other
+   * equivalent definitions for the Sylvester equation exist and this function
+   * assumes the one presented in the original publication of the the Bartels-
+   * Stewart algorithm, which is implemented by this function.
+   * https://en.wikipedia.org/wiki/Sylvester_equation
+   *
+   * Syntax:
+   *
+   *     math.sylvester(A, B, C)
+   *
+   * Examples:
+   *
+   *     const A = [[-1, -2], [1, 1]]
+   *     const B = [[2, -1], [1, -2]]
+   *     const C = [[-3, 2], [3, 0]]
+   *     math.sylvester(A, B, C)      // returns DenseMatrix [[-0.25, 0.25], [1.5, -1.25]]
+   *
+   * See also:
+   *
+   *     schur, lyap
+   *
+   * @param {Matrix | Array} A  Matrix A
+   * @param {Matrix | Array} B  Matrix B
+   * @param {Matrix | Array} C  Matrix C
+   * @return {Matrix | Array}   Matrix X, solving the Sylvester equation
+   */
+  return typed(name, {
+    'Matrix, Matrix, Matrix': _sylvester,
+    'Array, Matrix, Matrix': function ArrayMatrixMatrix(A, B, C) {
+      return _sylvester(matrix(A), B, C);
+    },
+    'Array, Array, Matrix': function ArrayArrayMatrix(A, B, C) {
+      return _sylvester(matrix(A), matrix(B), C);
+    },
+    'Array, Matrix, Array': function ArrayMatrixArray(A, B, C) {
+      return _sylvester(matrix(A), B, matrix(C));
+    },
+    'Matrix, Array, Matrix': function MatrixArrayMatrix(A, B, C) {
+      return _sylvester(A, matrix(B), C);
+    },
+    'Matrix, Array, Array': function MatrixArrayArray(A, B, C) {
+      return _sylvester(A, matrix(B), matrix(C));
+    },
+    'Matrix, Matrix, Array': function MatrixMatrixArray(A, B, C) {
+      return _sylvester(A, B, matrix(C));
+    },
+    'Array, Array, Array': function ArrayArrayArray(A, B, C) {
+      return _sylvester(matrix(A), matrix(B), matrix(C)).toArray();
+    }
+  });
+  function _sylvester(A, B, C) {
+    var n = B.size()[0];
+    var m = A.size()[0];
+    var sA = schur(A);
+    var F = sA.T;
+    var U = sA.U;
+    var sB = schur(multiply(-1, B));
+    var G = sB.T;
+    var V = sB.U;
+    var D = multiply(multiply(transpose(U), C), V);
+    var all = range(0, m);
+    var y = [];
+    var hc = function hc(a, b) {
+      return concat(a, b, 1);
+    };
+    var vc = function vc(a, b) {
+      return concat(a, b, 0);
+    };
+    for (var k = 0; k < n; k++) {
+      if (k < n - 1 && abs(subset(G, index(k + 1, k))) > 1e-5) {
+        var RHS = vc(subset(D, index(all, k)), subset(D, index(all, k + 1)));
+        for (var j = 0; j < k; j++) {
+          RHS = add(RHS, vc(multiply(y[j], subset(G, index(j, k))), multiply(y[j], subset(G, index(j, k + 1)))));
+        }
+        var gkk = multiply(identity(m), multiply(-1, subset(G, index(k, k))));
+        var gmk = multiply(identity(m), multiply(-1, subset(G, index(k + 1, k))));
+        var gkm = multiply(identity(m), multiply(-1, subset(G, index(k, k + 1))));
+        var gmm = multiply(identity(m), multiply(-1, subset(G, index(k + 1, k + 1))));
+        var LHS = vc(hc(add(F, gkk), gmk), hc(gkm, add(F, gmm)));
+        var yAux = lusolve(LHS, RHS);
+        y[k] = yAux.subset(index(range(0, m), 0));
+        y[k + 1] = yAux.subset(index(range(m, 2 * m), 0));
+        k++;
+      } else {
+        var _RHS = subset(D, index(all, k));
+        for (var _j = 0; _j < k; _j++) {
+          _RHS = add(_RHS, multiply(y[_j], subset(G, index(_j, k))));
+        }
+        var _gkk = subset(G, index(k, k));
+        var _LHS = subtract(F, multiply(_gkk, identity(m)));
+        y[k] = lusolve(_LHS, _RHS);
+      }
+    }
+    var Y = matrix(matrixFromColumns.apply(void 0, y));
+    var X = multiply(U, multiply(Y, transpose(V)));
+    return X;
+  }
+});
+exports.createSylvester = createSylvester;

package/lib/cjs/function/matrix/forEach.js

@@ -37,7 +37,7 @@ var createForEach = /* #__PURE__ */(0, _factory.factory)(name, dependencies, fun
   return typed(name, {
     'Array, function': _forEach,
     'Matrix, function': function MatrixFunction(x, callback) {
-      return x.forEach(callback);
+      x.forEach(callback);
     }
   });
 });

package/lib/cjs/function/matrix/reshape.js

@@ -53,7 +53,7 @@ var createReshape = /* #__PURE__ */(0, _factory.factory)(name, dependencies, fun
    */
   return typed(name, {
     'Matrix, Array': function MatrixArray(x, sizes) {
-      return x.reshape(sizes);
+      return x.reshape(sizes, true);
     },
     'Array, Array': function ArrayArray(x, sizes) {
       sizes.forEach(function (size) {

package/lib/cjs/function/string/format.js

@@ -28,53 +28,53 @@ var createFormat = /* #__PURE__ */(0, _factory.factory)(name, dependencies, func
    *    An object with formatting options. Available options:
    *    - `notation: string`
    *      Number notation. Choose from:
-   *      - 'fixed'
+   *      - `'fixed'`
    *        Always use regular number notation.
-   *        For example '123.40' and '14000000'
-   *      - 'exponential'
+   *        For example `'123.40'` and `'14000000'`
+   *      - `'exponential'`
    *        Always use exponential notation.
-   *        For example '1.234e+2' and '1.4e+7'
-   *      - 'engineering'
+   *        For example `'1.234e+2'` and `'1.4e+7'`
+   *      - `'engineering'`
    *        Always use engineering notation: always have exponential notation,
-   *        and select the exponent to be a multiple of 3.
-   *        For example '123.4e+0' and '14.0e+6'
-   *      - 'auto' (default)
+   *        and select the exponent to be a multiple of `3`.
+   *        For example `'123.4e+0'` and `'14.0e+6'`
+   *      - `'auto'` (default)
    *        Regular number notation for numbers having an absolute value between
    *        `lower` and `upper` bounds, and uses exponential notation elsewhere.
    *        Lower bound is included, upper bound is excluded.
-   *        For example '123.4' and '1.4e7'.
-   *      - 'bin', 'oct, or 'hex'
+   *        For example `'123.4'` and `'1.4e7'`.
+   *      - `'bin'`, `'oct'`, or `'hex'`
    *        Format the number using binary, octal, or hexadecimal notation.
-   *        For example '0b1101' and '0x10fe'.
+   *        For example `'0b1101'` and `'0x10fe'`.
    *    - `wordSize: number`
    *      The word size in bits to use for formatting in binary, octal, or
-   *      hexadecimal notation. To be used only with 'bin', 'oct', or 'hex'
-   *      values for 'notation' option. When this option is defined the value
+   *      hexadecimal notation. To be used only with `'bin'`, `'oct'`, or `'hex'`
+   *      values for `notation` option. When this option is defined the value
    *      is formatted as a signed twos complement integer of the given word
    *      size and the size suffix is appended to the output.
-   *      For example format(-1, {notation: 'hex', wordSize: 8}) === '0xffi8'.
+   *      For example `format(-1, {notation: 'hex', wordSize: 8}) === '0xffi8'`.
    *      Default value is undefined.
    *    - `precision: number`
    *      Limit the number of digits of the formatted value.
-   *      For regular numbers, must be a number between 0 and 16.
+   *      For regular numbers, must be a number between `0` and `16`.
    *      For bignumbers, the maximum depends on the configured precision,
    *      see function `config()`.
-   *      In case of notations 'exponential', 'engineering', and 'auto', `precision`
-   *      defines the total number of significant digits returned.
-   *      In case of notation 'fixed', `precision` defines the number of
+   *      In case of notations `'exponential'`, `'engineering'`, and `'auto'`,
+   *      `precision` defines the total number of significant digits returned.
+   *      In case of notation `'fixed'`, `precision` defines the number of
    *      significant digits after the decimal point.
    *      `precision` is undefined by default.
    *    - `lowerExp: number`
    *      Exponent determining the lower boundary for formatting a value with
-   *      an exponent when `notation='auto`. Default value is `-3`.
+   *      an exponent when `notation='auto'`. Default value is `-3`.
    *    - `upperExp: number`
    *      Exponent determining the upper boundary for formatting a value with
-   *      an exponent when `notation='auto`. Default value is `5`.
-   *    - `fraction: string`. Available values: 'ratio' (default) or 'decimal'.
-   *      For example `format(fraction(1, 3))` will output '1/3' when 'ratio' is
-   *      configured, and will output `0.(3)` when 'decimal' is configured.
+   *      an exponent when `notation='auto'`. Default value is `5`.
+   *    - `fraction: string`. Available values: `'ratio'` (default) or `'decimal'`.
+   *      For example `format(fraction(1, 3))` will output `'1/3'` when `'ratio'`
+   *      is configured, and will output `'0.(3)'` when `'decimal'` is configured.
    *    - `truncate: number`. Specifies the maximum allowed length of the
-   *      returned string. If it would have been longer, the excess characters
+   *      returned string. If it had been longer, the excess characters
    *      are deleted and replaced with `'...'`.
    * - `callback: function`
    *   A custom formatting function, invoked for all numeric elements in `value`,

package/lib/cjs/header.js

@@ -6,8 +6,8 @@
  * It features real and complex numbers, units, matrices, a large set of
  * mathematical functions, and a flexible expression parser.
  *
- * @version 11.3.3
- * @date    2022-11-07
+ * @version 11.5.0
+ * @date    2022-12-05
  *
  * @license
  * Copyright (C) 2013-2022 Jos de Jong <wjosdejong@gmail.com>

package/lib/cjs/version.js

@@ -4,7 +4,7 @@ Object.defineProperty(exports, "__esModule", {
   value: true
 });
 exports.version = void 0;
-var version = '11.3.3';
+var version = '11.5.0';
 // Note: This file is automatically generated when building math.js.
 // Changes made in this file will be overwritten.
 exports.version = version;

package/lib/esm/entry/dependenciesAny/dependenciesLyap.generated.js

@@ -0,0 +1,18 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { multiplyDependencies } from './dependenciesMultiply.generated.js';
+import { sylvesterDependencies } from './dependenciesSylvester.generated.js';
+import { transposeDependencies } from './dependenciesTranspose.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createLyap } from '../../factoriesAny.js';
+export var lyapDependencies = {
+  matrixDependencies,
+  multiplyDependencies,
+  sylvesterDependencies,
+  transposeDependencies,
+  typedDependencies,
+  createLyap
+};