mathjs 8.1.0 → 12.2.1

package/lib/cjs/function/algebra/sparse/csUnflip.js

@@ -4,9 +4,7 @@ Object.defineProperty(exports, "__esModule", {
   value: true
 });
 exports.csUnflip = csUnflip;
-
 var _csFlip = require("./csFlip.js");
-
 /**
  * Flips the value if it is negative of returns the same value otherwise.
  *

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

@@ -0,0 +1,126 @@
+"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 = exports.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;
+  }
+});

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

@@ -0,0 +1,64 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createSymbolicEqual = void 0;
+var _is = require("../../utils/is.js");
+var _factory = require("../../utils/factory.js");
+var name = 'symbolicEqual';
+var dependencies = ['parse', 'simplify', 'typed', 'OperatorNode'];
+var createSymbolicEqual = exports.createSymbolicEqual = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var parse = _ref.parse,
+    simplify = _ref.simplify,
+    typed = _ref.typed,
+    OperatorNode = _ref.OperatorNode;
+  /**
+   * Attempts to determine if two expressions are symbolically equal, i.e.
+   * one is the result of valid algebraic manipulations on the other.
+   * Currently, this simply checks if the difference of the two expressions
+   * simplifies down to 0. So there are two important caveats:
+   * 1. whether two expressions are symbolically equal depends on the
+   *     manipulations allowed. Therefore, this function takes an optional
+   *     third argument, which are the options that control the behavior
+   *     as documented for the `simplify()` function.
+   * 2. it is in general intractable to find the minimal simplification of
+   *     an arbitrarily complicated expression. So while a `true` value
+   *     of `symbolicEqual` ensures that the two expressions can be manipulated
+   *     to match each other, a `false` value does not absolutely rule this out.
+   *
+   * Syntax:
+   *
+   *     math.symbolicEqual(expr1, expr2)
+   *     math.symbolicEqual(expr1, expr2, options)
+   *
+   * Examples:
+   *
+   *     math.symbolicEqual('x*y', 'y*x') // Returns true
+   *     math.symbolicEqual('x*y', 'y*x', {context: {multiply: {commutative: false}}}) // Returns false
+   *     math.symbolicEqual('x/y', '(y*x^(-1))^(-1)') // Returns true
+   *     math.symbolicEqual('abs(x)','x') // Returns false
+   *     math.symbolicEqual('abs(x)','x', simplify.positiveContext) // Returns true
+   *
+   * See also:
+   *
+   *     simplify, evaluate
+   *
+   * @param {Node|string} expr1  The first expression to compare
+   * @param {Node|string} expr2  The second expression to compare
+   * @param {Object} [options] Optional option object, passed to simplify
+   * @returns {boolean}
+   *     Returns true if a valid manipulation making the expressions equal
+   *     is found.
+   */
+  function _symbolicEqual(e1, e2) {
+    var options = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : {};
+    var diff = new OperatorNode('-', 'subtract', [e1, e2]);
+    var simplified = simplify(diff, {}, options);
+    return (0, _is.isConstantNode)(simplified) && !simplified.value;
+  }
+  return typed(name, {
+    'Node, Node': _symbolicEqual,
+    'Node, Node, Object': _symbolicEqual
+  });
+});

package/lib/cjs/function/arithmetic/abs.js

@@ -4,18 +4,13 @@ Object.defineProperty(exports, "__esModule", {
   value: true
 });
 exports.createAbs = void 0;
-
 var _factory = require("../../utils/factory.js");
-
 var _collection = require("../../utils/collection.js");
-
 var _index = require("../../plain/number/index.js");
-
 var name = 'abs';
 var dependencies = ['typed'];
-var createAbs = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+var createAbs = exports.createAbs = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
   var typed = _ref.typed;
-
   /**
    * Calculate the absolute value of a number. For matrices, the function is
    * evaluated element wise.
@@ -42,22 +37,14 @@ var createAbs = /* #__PURE__ */(0, _factory.factory)(name, dependencies, functio
    */
   return typed(name, {
     number: _index.absNumber,
-    Complex: function Complex(x) {
-      return x.abs();
-    },
-    BigNumber: function BigNumber(x) {
-      return x.abs();
-    },
-    Fraction: function Fraction(x) {
+    'Complex | BigNumber | Fraction | Unit': function ComplexBigNumberFractionUnit(x) {
       return x.abs();
     },
-    'Array | Matrix': function ArrayMatrix(x) {
-      // deep map collection, skip zeros since abs(0) = 0
-      return (0, _collection.deepMap)(x, this, true);
-    },
-    Unit: function Unit(x) {
-      return x.abs();
-    }
+    // deep map collection, skip zeros since abs(0) = 0
+    'Array | Matrix': typed.referToSelf(function (self) {
+      return function (x) {
+        return (0, _collection.deepMap)(x, self, true);
+      };
+    })
   });
-});
-exports.createAbs = createAbs;
+});

package/lib/cjs/function/arithmetic/add.js

@@ -4,138 +4,86 @@ Object.defineProperty(exports, "__esModule", {
   value: true
 });
 exports.createAdd = void 0;
-
 var _factory = require("../../utils/factory.js");
-
-var _object = require("../../utils/object.js");
-
-var _algorithm = require("../../type/matrix/utils/algorithm01.js");
-
-var _algorithm2 = require("../../type/matrix/utils/algorithm04.js");
-
-var _algorithm3 = require("../../type/matrix/utils/algorithm10.js");
-
-var _algorithm4 = require("../../type/matrix/utils/algorithm13.js");
-
-var _algorithm5 = require("../../type/matrix/utils/algorithm14.js");
-
+var _matAlgo01xDSid = require("../../type/matrix/utils/matAlgo01xDSid.js");
+var _matAlgo04xSidSid = require("../../type/matrix/utils/matAlgo04xSidSid.js");
+var _matAlgo10xSids = require("../../type/matrix/utils/matAlgo10xSids.js");
+var _matrixAlgorithmSuite = require("../../type/matrix/utils/matrixAlgorithmSuite.js");
 var name = 'add';
-var dependencies = ['typed', 'matrix', 'addScalar', 'equalScalar', 'DenseMatrix', 'SparseMatrix'];
-var createAdd = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+var dependencies = ['typed', 'matrix', 'addScalar', 'equalScalar', 'DenseMatrix', 'SparseMatrix', 'concat'];
+var createAdd = exports.createAdd = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
   var typed = _ref.typed,
-      matrix = _ref.matrix,
-      addScalar = _ref.addScalar,
-      equalScalar = _ref.equalScalar,
-      DenseMatrix = _ref.DenseMatrix,
-      SparseMatrix = _ref.SparseMatrix;
-  var algorithm01 = (0, _algorithm.createAlgorithm01)({
+    matrix = _ref.matrix,
+    addScalar = _ref.addScalar,
+    equalScalar = _ref.equalScalar,
+    DenseMatrix = _ref.DenseMatrix,
+    SparseMatrix = _ref.SparseMatrix,
+    concat = _ref.concat;
+  var matAlgo01xDSid = (0, _matAlgo01xDSid.createMatAlgo01xDSid)({
     typed: typed
   });
-  var algorithm04 = (0, _algorithm2.createAlgorithm04)({
+  var matAlgo04xSidSid = (0, _matAlgo04xSidSid.createMatAlgo04xSidSid)({
     typed: typed,
     equalScalar: equalScalar
   });
-  var algorithm10 = (0, _algorithm3.createAlgorithm10)({
+  var matAlgo10xSids = (0, _matAlgo10xSids.createMatAlgo10xSids)({
     typed: typed,
     DenseMatrix: DenseMatrix
   });
-  var algorithm13 = (0, _algorithm4.createAlgorithm13)({
-    typed: typed
-  });
-  var algorithm14 = (0, _algorithm5.createAlgorithm14)({
-    typed: typed
+  var matrixAlgorithmSuite = (0, _matrixAlgorithmSuite.createMatrixAlgorithmSuite)({
+    typed: typed,
+    matrix: matrix,
+    concat: concat
   });
   /**
-   * Add two or more values, `x + y`.
-   * For matrices, the function is evaluated element wise.
-   *
-   * Syntax:
-   *
-   *    math.add(x, y)
-   *    math.add(x, y, z, ...)
-   *
-   * Examples:
-   *
-   *    math.add(2, 3)               // returns number 5
-   *    math.add(2, 3, 4)            // returns number 9
-   *
-   *    const a = math.complex(2, 3)
-   *    const b = math.complex(-4, 1)
-   *    math.add(a, b)               // returns Complex -2 + 4i
-   *
-   *    math.add([1, 2, 3], 4)       // returns Array [5, 6, 7]
-   *
-   *    const c = math.unit('5 cm')
-   *    const d = math.unit('2.1 mm')
-   *    math.add(c, d)               // returns Unit 52.1 mm
-   *
-   *    math.add("2.3", "4")         // returns number 6.3
-   *
-   * See also:
-   *
-   *    subtract, sum
-   *
-   * @param  {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} x First value to add
-   * @param  {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} y Second value to add
-   * @return {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} Sum of `x` and `y`
-   */
-
-  return typed(name, (0, _object.extend)({
-    // we extend the signatures of addScalar with signatures dealing with matrices
-    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {
-      return algorithm13(x, y, addScalar);
-    },
-    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {
-      return algorithm01(x, y, addScalar, false);
-    },
-    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {
-      return algorithm01(y, x, addScalar, true);
-    },
-    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {
-      return algorithm04(x, y, addScalar);
-    },
-    'Array, Array': function ArrayArray(x, y) {
-      // use matrix implementation
-      return this(matrix(x), matrix(y)).valueOf();
-    },
-    'Array, Matrix': function ArrayMatrix(x, y) {
-      // use matrix implementation
-      return this(matrix(x), y);
-    },
-    'Matrix, Array': function MatrixArray(x, y) {
-      // use matrix implementation
-      return this(x, matrix(y));
-    },
-    'DenseMatrix, any': function DenseMatrixAny(x, y) {
-      return algorithm14(x, y, addScalar, false);
-    },
-    'SparseMatrix, any': function SparseMatrixAny(x, y) {
-      return algorithm10(x, y, addScalar, false);
-    },
-    'any, DenseMatrix': function anyDenseMatrix(x, y) {
-      return algorithm14(y, x, addScalar, true);
-    },
-    'any, SparseMatrix': function anySparseMatrix(x, y) {
-      return algorithm10(y, x, addScalar, true);
-    },
-    'Array, any': function ArrayAny(x, y) {
-      // use matrix implementation
-      return algorithm14(matrix(x), y, addScalar, false).valueOf();
-    },
-    'any, Array': function anyArray(x, y) {
-      // use matrix implementation
-      return algorithm14(matrix(y), x, addScalar, true).valueOf();
-    },
+  * Add two or more values, `x + y`.
+  * For matrices, the function is evaluated element wise.
+  *
+  * Syntax:
+  *
+  *    math.add(x, y)
+  *    math.add(x, y, z, ...)
+  *
+  * Examples:
+  *
+  *    math.add(2, 3)               // returns number 5
+  *    math.add(2, 3, 4)            // returns number 9
+  *
+  *    const a = math.complex(2, 3)
+  *    const b = math.complex(-4, 1)
+  *    math.add(a, b)               // returns Complex -2 + 4i
+  *
+  *    math.add([1, 2, 3], 4)       // returns Array [5, 6, 7]
+  *
+  *    const c = math.unit('5 cm')
+  *    const d = math.unit('2.1 mm')
+  *    math.add(c, d)               // returns Unit 52.1 mm
+  *
+  *    math.add("2.3", "4")         // returns number 6.3
+  *
+  * See also:
+  *
+  *    subtract, sum
+  *
+  * @param  {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} x First value to add
+  * @param  {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} y Second value to add
+  * @return {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} Sum of `x` and `y`
+  */
+  return typed(name, {
     'any, any': addScalar,
-    'any, any, ...any': function anyAnyAny(x, y, rest) {
-      var result = this(x, y);
-
-      for (var i = 0; i < rest.length; i++) {
-        result = this(result, rest[i]);
-      }
-
-      return result;
-    }
-  }, addScalar.signatures));
-});
-exports.createAdd = createAdd;
+    'any, any, ...any': typed.referToSelf(function (self) {
+      return function (x, y, rest) {
+        var result = self(x, y);
+        for (var i = 0; i < rest.length; i++) {
+          result = self(result, rest[i]);
+        }
+        return result;
+      };
+    })
+  }, matrixAlgorithmSuite({
+    elop: addScalar,
+    DS: matAlgo01xDSid,
+    SS: matAlgo04xSidSid,
+    Ss: matAlgo10xSids
+  }));
+});

package/lib/cjs/function/arithmetic/addScalar.js

@@ -4,16 +4,12 @@ Object.defineProperty(exports, "__esModule", {
   value: true
 });
 exports.createAddScalar = void 0;
-
 var _factory = require("../../utils/factory.js");
-
 var _index = require("../../plain/number/index.js");
-
 var name = 'addScalar';
 var dependencies = ['typed'];
-var createAddScalar = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+var createAddScalar = exports.createAddScalar = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
   var typed = _ref.typed;
-
   /**
    * Add two scalar values, `x + y`.
    * This function is meant for internal use: it is used by the public function
@@ -37,15 +33,20 @@ var createAddScalar = /* #__PURE__ */(0, _factory.factory)(name, dependencies, f
     'Fraction, Fraction': function FractionFraction(x, y) {
       return x.add(y);
     },
-    'Unit, Unit': function UnitUnit(x, y) {
-      if (x.value === null || x.value === undefined) throw new Error('Parameter x contains a unit with undefined value');
-      if (y.value === null || y.value === undefined) throw new Error('Parameter y contains a unit with undefined value');
-      if (!x.equalBase(y)) throw new Error('Units do not match');
-      var res = x.clone();
-      res.value = this(res.value, y.value);
-      res.fixPrefix = false;
-      return res;
-    }
+    'Unit, Unit': typed.referToSelf(function (self) {
+      return function (x, y) {
+        if (x.value === null || x.value === undefined) {
+          throw new Error('Parameter x contains a unit with undefined value');
+        }
+        if (y.value === null || y.value === undefined) {
+          throw new Error('Parameter y contains a unit with undefined value');
+        }
+        if (!x.equalBase(y)) throw new Error('Units do not match');
+        var res = x.clone();
+        res.value = typed.find(self, [res.valueType(), y.valueType()])(res.value, y.value);
+        res.fixPrefix = false;
+        return res;
+      };
+    })
   });
-});
-exports.createAddScalar = createAddScalar;
+});

package/lib/cjs/function/arithmetic/cbrt.js

@@ -4,31 +4,26 @@ Object.defineProperty(exports, "__esModule", {
   value: true
 });
 exports.createCbrt = void 0;
-
 var _factory = require("../../utils/factory.js");
-
 var _is = require("../../utils/is.js");
-
-var _collection = require("../../utils/collection.js");
-
 var _index = require("../../plain/number/index.js");
-
 var name = 'cbrt';
 var dependencies = ['config', 'typed', 'isNegative', 'unaryMinus', 'matrix', 'Complex', 'BigNumber', 'Fraction'];
-var createCbrt = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+var createCbrt = exports.createCbrt = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
   var config = _ref.config,
-      typed = _ref.typed,
-      isNegative = _ref.isNegative,
-      unaryMinus = _ref.unaryMinus,
-      matrix = _ref.matrix,
-      Complex = _ref.Complex,
-      BigNumber = _ref.BigNumber,
-      Fraction = _ref.Fraction;
-
+    typed = _ref.typed,
+    isNegative = _ref.isNegative,
+    unaryMinus = _ref.unaryMinus,
+    matrix = _ref.matrix,
+    Complex = _ref.Complex,
+    BigNumber = _ref.BigNumber,
+    Fraction = _ref.Fraction;
   /**
    * Calculate the cubic root of a value.
    *
-   * For matrices, the function is evaluated element wise.
+   * To avoid confusion with the matrix cube root, this function does not
+   * apply to matrices. For a matrix, to take the cube root elementwise,
+   * see the examples.
    *
    * Syntax:
    *
@@ -41,7 +36,7 @@ var createCbrt = /* #__PURE__ */(0, _factory.factory)(name, dependencies, functi
    *    math.cube(3)                   // returns 27
    *    math.cbrt(-64)                 // returns -4
    *    math.cbrt(math.unit('27 m^3')) // returns Unit 3 m
-   *    math.cbrt([27, 64, 125])       // returns [3, 4, 5]
+   *    math.map([27, 64, 125], x => math.cbrt(x))       // returns [3, 4, 5]
    *
    *    const x = math.complex('8i')
    *    math.cbrt(x)                   // returns Complex 1.7320508075689 + i
@@ -55,30 +50,28 @@ var createCbrt = /* #__PURE__ */(0, _factory.factory)(name, dependencies, functi
    *
    *    square, sqrt, cube
    *
-   * @param {number | BigNumber | Complex | Unit | Array | Matrix} x
+   * @param {number | BigNumber | Complex | Unit} x
    *            Value for which to calculate the cubic root.
    * @param {boolean} [allRoots]  Optional, false by default. Only applicable
    *            when `x` is a number or complex number. If true, all complex
    *            roots are returned, if false (default) the principal root is
    *            returned.
-   * @return {number | BigNumber | Complex | Unit | Array | Matrix}
+   * @return {number | BigNumber | Complex | Unit}
    *            Returns the cubic root of `x`
    */
   return typed(name, {
     number: _index.cbrtNumber,
     // note: signature 'number, boolean' is also supported,
     //       created by typed as it knows how to convert number to Complex
+
     Complex: _cbrtComplex,
     'Complex, boolean': _cbrtComplex,
     BigNumber: function BigNumber(x) {
       return x.cbrt();
     },
-    Unit: _cbrtUnit,
-    'Array | Matrix': function ArrayMatrix(x) {
-      // deep map collection, skip zeros since cbrt(0) = 0
-      return (0, _collection.deepMap)(x, this, true);
-    }
+    Unit: _cbrtUnit
   });
+
   /**
    * Calculate the cubic root for a complex number
    * @param {Complex} x
@@ -88,14 +81,14 @@ var createCbrt = /* #__PURE__ */(0, _factory.factory)(name, dependencies, functi
    * @returns {Complex | Array.<Complex> | Matrix.<Complex>} Returns the cubic root(s) of x
    * @private
    */
-
   function _cbrtComplex(x, allRoots) {
     // https://www.wikiwand.com/en/Cube_root#/Complex_numbers
+
     var arg3 = x.arg() / 3;
-    var abs = x.abs(); // principal root:
+    var abs = x.abs();
 
+    // principal root:
     var principal = new Complex((0, _index.cbrtNumber)(abs), 0).mul(new Complex(0, arg3).exp());
-
     if (allRoots) {
       var all = [principal, new Complex((0, _index.cbrtNumber)(abs), 0).mul(new Complex(0, arg3 + Math.PI * 2 / 3).exp()), new Complex((0, _index.cbrtNumber)(abs), 0).mul(new Complex(0, arg3 - Math.PI * 2 / 3).exp())];
       return config.matrix === 'Array' ? all : matrix(all);
@@ -103,33 +96,28 @@ var createCbrt = /* #__PURE__ */(0, _factory.factory)(name, dependencies, functi
       return principal;
     }
   }
+
   /**
    * Calculate the cubic root for a Unit
    * @param {Unit} x
    * @return {Unit} Returns the cubic root of x
    * @private
    */
-
-
   function _cbrtUnit(x) {
     if (x.value && (0, _is.isComplex)(x.value)) {
       var result = x.clone();
       result.value = 1.0;
       result = result.pow(1.0 / 3); // Compute the units
-
       result.value = _cbrtComplex(x.value); // Compute the value
-
       return result;
     } else {
       var negate = isNegative(x.value);
-
       if (negate) {
         x.value = unaryMinus(x.value);
-      } // TODO: create a helper function for this
-
+      }
 
+      // TODO: create a helper function for this
       var third;
-
       if ((0, _is.isBigNumber)(x.value)) {
         third = new BigNumber(1).div(3);
       } else if ((0, _is.isFraction)(x.value)) {
@@ -137,15 +125,11 @@ var createCbrt = /* #__PURE__ */(0, _factory.factory)(name, dependencies, functi
       } else {
         third = 1 / 3;
       }
-
       var _result = x.pow(third);
-
       if (negate) {
         _result.value = unaryMinus(_result.value);
       }
-
       return _result;
     }
   }
-});
-exports.createCbrt = createCbrt;
+});