mathjs-min 11.7.2

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

@@ -0,0 +1,183 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createCsSqr = void 0;
+var _csPermute = require("./csPermute.js");
+var _csPost = require("./csPost.js");
+var _csEtree = require("./csEtree.js");
+var _csAmd = require("./csAmd.js");
+var _csCounts = require("./csCounts.js");
+var _factory = require("../../../utils/factory.js");
+var name = 'csSqr';
+var dependencies = ['add', 'multiply', 'transpose'];
+var createCsSqr = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var add = _ref.add,
+    multiply = _ref.multiply,
+    transpose = _ref.transpose;
+  var csAmd = (0, _csAmd.createCsAmd)({
+    add: add,
+    multiply: multiply,
+    transpose: transpose
+  });
+  var csCounts = (0, _csCounts.createCsCounts)({
+    transpose: transpose
+  });
+
+  /**
+   * Symbolic ordering and analysis for QR and LU decompositions.
+   *
+   * @param {Number}  order           The ordering strategy (see csAmd for more details)
+   * @param {Matrix}  a               The A matrix
+   * @param {boolean} qr              Symbolic ordering and analysis for QR decomposition (true) or
+   *                                  symbolic ordering and analysis for LU decomposition (false)
+   *
+   * @return {Object}                 The Symbolic ordering and analysis for matrix A
+   *
+   * Reference: http://faculty.cse.tamu.edu/davis/publications.html
+   */
+  return function csSqr(order, a, qr) {
+    // a arrays
+    var aptr = a._ptr;
+    var asize = a._size;
+    // columns
+    var n = asize[1];
+    // vars
+    var k;
+    // symbolic analysis result
+    var s = {};
+    // fill-reducing ordering
+    s.q = csAmd(order, a);
+    // validate results
+    if (order && !s.q) {
+      return null;
+    }
+    // QR symbolic analysis
+    if (qr) {
+      // apply permutations if needed
+      var c = order ? (0, _csPermute.csPermute)(a, null, s.q, 0) : a;
+      // etree of C'*C, where C=A(:,q)
+      s.parent = (0, _csEtree.csEtree)(c, 1);
+      // post order elimination tree
+      var post = (0, _csPost.csPost)(s.parent, n);
+      // col counts chol(C'*C)
+      s.cp = csCounts(c, s.parent, post, 1);
+      // check we have everything needed to calculate number of nonzero elements
+      if (c && s.parent && s.cp && _vcount(c, s)) {
+        // calculate number of nonzero elements
+        for (s.unz = 0, k = 0; k < n; k++) {
+          s.unz += s.cp[k];
+        }
+      }
+    } else {
+      // for LU factorization only, guess nnz(L) and nnz(U)
+      s.unz = 4 * aptr[n] + n;
+      s.lnz = s.unz;
+    }
+    // return result S
+    return s;
+  };
+
+  /**
+   * Compute nnz(V) = s.lnz, s.pinv, s.leftmost, s.m2 from A and s.parent
+   */
+  function _vcount(a, s) {
+    // a arrays
+    var aptr = a._ptr;
+    var aindex = a._index;
+    var asize = a._size;
+    // rows & columns
+    var m = asize[0];
+    var n = asize[1];
+    // initialize s arrays
+    s.pinv = []; // (m + n)
+    s.leftmost = []; // (m)
+    // vars
+    var parent = s.parent;
+    var pinv = s.pinv;
+    var leftmost = s.leftmost;
+    // workspace, next: first m entries, head: next n entries, tail: next n entries, nque: next n entries
+    var w = []; // (m + 3 * n)
+    var next = 0;
+    var head = m;
+    var tail = m + n;
+    var nque = m + 2 * n;
+    // vars
+    var i, k, p, p0, p1;
+    // initialize w
+    for (k = 0; k < n; k++) {
+      // queue k is empty
+      w[head + k] = -1;
+      w[tail + k] = -1;
+      w[nque + k] = 0;
+    }
+    // initialize row arrays
+    for (i = 0; i < m; i++) {
+      leftmost[i] = -1;
+    }
+    // loop columns backwards
+    for (k = n - 1; k >= 0; k--) {
+      // values & index for column k
+      for (p0 = aptr[k], p1 = aptr[k + 1], p = p0; p < p1; p++) {
+        // leftmost[i] = min(find(A(i,:)))
+        leftmost[aindex[p]] = k;
+      }
+    }
+    // scan rows in reverse order
+    for (i = m - 1; i >= 0; i--) {
+      // row i is not yet ordered
+      pinv[i] = -1;
+      k = leftmost[i];
+      // check row i is empty
+      if (k === -1) {
+        continue;
+      }
+      // first row in queue k
+      if (w[nque + k]++ === 0) {
+        w[tail + k] = i;
+      }
+      // put i at head of queue k
+      w[next + i] = w[head + k];
+      w[head + k] = i;
+    }
+    s.lnz = 0;
+    s.m2 = m;
+    // find row permutation and nnz(V)
+    for (k = 0; k < n; k++) {
+      // remove row i from queue k
+      i = w[head + k];
+      // count V(k,k) as nonzero
+      s.lnz++;
+      // add a fictitious row
+      if (i < 0) {
+        i = s.m2++;
+      }
+      // associate row i with V(:,k)
+      pinv[i] = k;
+      // skip if V(k+1:m,k) is empty
+      if (--nque[k] <= 0) {
+        continue;
+      }
+      // nque[k] is nnz (V(k+1:m,k))
+      s.lnz += w[nque + k];
+      // move all rows to parent of k
+      var pa = parent[k];
+      if (pa !== -1) {
+        if (w[nque + pa] === 0) {
+          w[tail + pa] = w[tail + k];
+        }
+        w[next + w[tail + k]] = w[head + pa];
+        w[head + pa] = w[next + i];
+        w[nque + pa] += w[nque + k];
+      }
+    }
+    for (i = 0; i < m; i++) {
+      if (pinv[i] < 0) {
+        pinv[i] = k++;
+      }
+    }
+    return true;
+  }
+});
+exports.createCsSqr = createCsSqr;

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

@@ -0,0 +1,97 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createCsSymperm = void 0;
+var _csCumsum = require("./csCumsum.js");
+var _factory = require("../../../utils/factory.js");
+var name = 'csSymperm';
+var dependencies = ['conj', 'SparseMatrix'];
+var createCsSymperm = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var conj = _ref.conj,
+    SparseMatrix = _ref.SparseMatrix;
+  /**
+   * Computes the symmetric permutation of matrix A accessing only
+   * the upper triangular part of A.
+   *
+   * C = P * A * P'
+   *
+   * @param {Matrix}  a               The A matrix
+   * @param {Array}   pinv            The inverse of permutation vector
+   * @param {boolean} values          Process matrix values (true)
+   *
+   * @return {Matrix}                 The C matrix, C = P * A * P'
+   *
+   * Reference: http://faculty.cse.tamu.edu/davis/publications.html
+   */
+  return function csSymperm(a, pinv, values) {
+    // A matrix arrays
+    var avalues = a._values;
+    var aindex = a._index;
+    var aptr = a._ptr;
+    var asize = a._size;
+    // columns
+    var n = asize[1];
+    // C matrix arrays
+    var cvalues = values && avalues ? [] : null;
+    var cindex = []; // (nz)
+    var cptr = []; // (n + 1)
+    // variables
+    var i, i2, j, j2, p, p0, p1;
+    // create workspace vector
+    var w = []; // (n)
+    // count entries in each column of C
+    for (j = 0; j < n; j++) {
+      // column j of A is column j2 of C
+      j2 = pinv ? pinv[j] : j;
+      // loop values in column j
+      for (p0 = aptr[j], p1 = aptr[j + 1], p = p0; p < p1; p++) {
+        // row
+        i = aindex[p];
+        // skip lower triangular part of A
+        if (i > j) {
+          continue;
+        }
+        // row i of A is row i2 of C
+        i2 = pinv ? pinv[i] : i;
+        // column count of C
+        w[Math.max(i2, j2)]++;
+      }
+    }
+    // compute column pointers of C
+    (0, _csCumsum.csCumsum)(cptr, w, n);
+    // loop columns
+    for (j = 0; j < n; j++) {
+      // column j of A is column j2 of C
+      j2 = pinv ? pinv[j] : j;
+      // loop values in column j
+      for (p0 = aptr[j], p1 = aptr[j + 1], p = p0; p < p1; p++) {
+        // row
+        i = aindex[p];
+        // skip lower triangular part of A
+        if (i > j) {
+          continue;
+        }
+        // row i of A is row i2 of C
+        i2 = pinv ? pinv[i] : i;
+        // C index for column j2
+        var q = w[Math.max(i2, j2)]++;
+        // update C index for entry q
+        cindex[q] = Math.min(i2, j2);
+        // check we need to process values
+        if (cvalues) {
+          cvalues[q] = i2 <= j2 ? avalues[p] : conj(avalues[p]);
+        }
+      }
+    }
+    // return C matrix
+    return new SparseMatrix({
+      values: cvalues,
+      index: cindex,
+      ptr: cptr,
+      size: [n, n]
+    });
+  };
+});
+exports.createCsSymperm = createCsSymperm;

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

@@ -0,0 +1,46 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.csTdfs = csTdfs;
+/**
+ * Depth-first search and postorder of a tree rooted at node j
+ *
+ * @param {Number}  j               The tree node
+ * @param {Number}  k
+ * @param {Array}   w               The workspace array
+ * @param {Number}  head            The index offset within the workspace for the head array
+ * @param {Number}  next            The index offset within the workspace for the next array
+ * @param {Array}   post            The post ordering array
+ * @param {Number}  stack           The index offset within the workspace for the stack array
+ *
+ * Reference: http://faculty.cse.tamu.edu/davis/publications.html
+ */
+function csTdfs(j, k, w, head, next, post, stack) {
+  // variables
+  var top = 0;
+  // place j on the stack
+  w[stack] = j;
+  // while (stack is not empty)
+  while (top >= 0) {
+    // p = top of stack
+    var p = w[stack + top];
+    // i = youngest child of p
+    var i = w[head + p];
+    if (i === -1) {
+      // p has no unordered children left
+      top--;
+      // node p is the kth postordered node
+      post[k++] = p;
+    } else {
+      // remove i from children of p
+      w[head + p] = w[next + i];
+      // increment top
+      ++top;
+      // start dfs on child node i
+      w[stack + top] = i;
+    }
+  }
+  return k;
+}

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

@@ -0,0 +1,18 @@
+"use strict";
+
+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.
+ *
+ * @param {Number}  i               The value to flip
+ *
+ * Reference: http://faculty.cse.tamu.edu/davis/publications.html
+ */
+function csUnflip(i) {
+  // flip the value if it is negative
+  return i < 0 ? (0, _csFlip.csFlip)(i) : i;
+}

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/algebra/symbolicEqual.js

@@ -0,0 +1,65 @@
+"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 = /* #__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:
+   *
+   *    symbolicEqual(expr1, expr2)
+   *    symbolicEqual(expr1, expr2, options)
+   *
+   * Examples:
+   *
+   *    symbolicEqual('x*y', 'y*x') // Returns true
+   *    symbolicEqual('x*y', 'y*x', {context: {multiply: {commutative: false}}}) // Returns false
+   *    symbolicEqual('x/y', '(y*x^(-1))^(-1)') // Returns true
+   *    symbolicEqual('abs(x)','x') // Returns false
+   *    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
+  });
+});
+exports.createSymbolicEqual = createSymbolicEqual;

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

@@ -0,0 +1,51 @@
+"use strict";
+
+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 typed = _ref.typed;
+  /**
+   * Calculate the absolute value of a number. For matrices, the function is
+   * evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.abs(x)
+   *
+   * Examples:
+   *
+   *    math.abs(3.5)                // returns number 3.5
+   *    math.abs(-4.2)               // returns number 4.2
+   *
+   *    math.abs([3, -5, -1, 0, 2])  // returns Array [3, 5, 1, 0, 2]
+   *
+   * See also:
+   *
+   *    sign
+   *
+   * @param  {number | BigNumber | Fraction | Complex | Array | Matrix | Unit} x
+   *            A number or matrix for which to get the absolute value
+   * @return {number | BigNumber | Fraction | Complex | Array | Matrix | Unit}
+   *            Absolute value of `x`
+   */
+  return typed(name, {
+    number: _index.absNumber,
+    'Complex | BigNumber | Fraction | Unit': function ComplexBigNumberFractionUnit(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

@@ -0,0 +1,90 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createAdd = void 0;
+var _factory = require("../../utils/factory.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', 'concat'];
+var 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,
+    concat = _ref.concat;
+  var matAlgo01xDSid = (0, _matAlgo01xDSid.createMatAlgo01xDSid)({
+    typed: typed
+  });
+  var matAlgo04xSidSid = (0, _matAlgo04xSidSid.createMatAlgo04xSidSid)({
+    typed: typed,
+    equalScalar: equalScalar
+  });
+  var matAlgo10xSids = (0, _matAlgo10xSids.createMatAlgo10xSids)({
+    typed: typed,
+    DenseMatrix: DenseMatrix
+  });
+  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, {
+    'any, any': addScalar,
+    '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
+  }));
+});
+exports.createAdd = createAdd;