mathjs 10.4.3 → 10.5.0

package/lib/cjs/entry/pureFunctionsNumber.generated.js

@@ -3,8 +3,8 @@
 Object.defineProperty(exports, "__esModule", {
   value: true
 });
-exports.mode = exports.mod = exports.min = exports.median = exports.mean = exports.max = exports.matrix = exports.map = exports.mad = exports.log2 = exports.log1p = exports.log10 = exports.log = exports.leftShift = exports.lcm = exports.largerEq = exports.larger = exports.isZero = exports.isPrime = exports.isPositive = exports.isNumeric = exports.isNegative = exports.isNaN = exports.isInteger = exports.index = exports.hypot = exports.hasNumericValue = exports.gcd = exports.gamma = exports.format = exports.forEach = exports.floor = exports.fix = exports.filter = exports.factorial = exports.expm1 = exports.exp = exports.erf = exports.equalText = exports.equalScalar = exports.equal = exports.e = exports.divideScalar = exports.divide = exports.deepEqual = exports.cumsum = exports.cube = exports.csch = exports.csc = exports.coth = exports.cot = exports.cosh = exports.cos = exports.composition = exports.compareText = exports.compareNatural = exports.compare = exports.combinationsWithRep = exports.combinations = exports.clone = exports.ceil = exports.cbrt = exports.catalan = exports.boolean = exports.bitXor = exports.bitOr = exports.bitNot = exports.bitAnd = exports.bellNumbers = exports.atanh = exports.atan2 = exports.atan = exports.asinh = exports.asin = exports.asech = exports.asec = exports.apply = exports.and = exports.addScalar = exports.add = exports.acsch = exports.acsc = exports.acoth = exports.acot = exports.acosh = exports.acos = exports.abs = exports._true = exports._null = exports._false = exports._NaN = exports._Infinity = exports.SQRT2 = exports.SQRT1_2 = exports.ResultSet = exports.Range = exports.LOG2E = exports.LOG10E = exports.LN2 = exports.LN10 = void 0;
-exports.xor = exports.xgcd = exports.version = exports.variance = exports.unequal = exports.unaryPlus = exports.unaryMinus = exports.typed = exports.typeOf = exports.tau = exports.tanh = exports.tan = exports.sum = exports.subtract = exports.subset = exports.string = exports.stirlingS2 = exports.std = exports.square = exports.sqrt = exports.smallerEq = exports.smaller = exports.size = exports.sinh = exports.sin = exports.sign = exports.sech = exports.sec = exports.round = exports.rightLogShift = exports.rightArithShift = exports.replacer = exports.range = exports.randomInt = exports.random = exports.quantileSeq = exports.prod = exports.print = exports.pow = exports.pickRandom = exports.pi = exports.phi = exports.permutations = exports.partitionSelect = exports.or = exports.numeric = exports.number = exports.nthRoot = exports.not = exports.norm = exports.multiplyScalar = exports.multiply = exports.multinomial = void 0;
+exports.mod = exports.min = exports.median = exports.mean = exports.max = exports.matrix = exports.map = exports.mad = exports.log2 = exports.log1p = exports.log10 = exports.log = exports.lgamma = exports.leftShift = exports.lcm = exports.largerEq = exports.larger = exports.isZero = exports.isPrime = exports.isPositive = exports.isNumeric = exports.isNegative = exports.isNaN = exports.isInteger = exports.index = exports.hypot = exports.hasNumericValue = exports.gcd = exports.gamma = exports.format = exports.forEach = exports.floor = exports.fix = exports.filter = exports.factorial = exports.expm1 = exports.exp = exports.erf = exports.equalText = exports.equalScalar = exports.equal = exports.e = exports.divideScalar = exports.divide = exports.deepEqual = exports.cumsum = exports.cube = exports.csch = exports.csc = exports.coth = exports.cot = exports.cosh = exports.cos = exports.composition = exports.compareText = exports.compareNatural = exports.compare = exports.combinationsWithRep = exports.combinations = exports.clone = exports.ceil = exports.cbrt = exports.catalan = exports.boolean = exports.bitXor = exports.bitOr = exports.bitNot = exports.bitAnd = exports.bellNumbers = exports.atanh = exports.atan2 = exports.atan = exports.asinh = exports.asin = exports.asech = exports.asec = exports.apply = exports.and = exports.addScalar = exports.add = exports.acsch = exports.acsc = exports.acoth = exports.acot = exports.acosh = exports.acos = exports.abs = exports._true = exports._null = exports._false = exports._NaN = exports._Infinity = exports.SQRT2 = exports.SQRT1_2 = exports.ResultSet = exports.Range = exports.LOG2E = exports.LOG10E = exports.LN2 = exports.LN10 = void 0;
+exports.xor = exports.xgcd = exports.version = exports.variance = exports.unequal = exports.unaryPlus = exports.unaryMinus = exports.typed = exports.typeOf = exports.tau = exports.tanh = exports.tan = exports.sum = exports.subtract = exports.subset = exports.string = exports.stirlingS2 = exports.std = exports.square = exports.sqrt = exports.smallerEq = exports.smaller = exports.size = exports.sinh = exports.sin = exports.sign = exports.sech = exports.sec = exports.round = exports.rightLogShift = exports.rightArithShift = exports.replacer = exports.range = exports.randomInt = exports.random = exports.quantileSeq = exports.prod = exports.print = exports.pow = exports.pickRandom = exports.pi = exports.phi = exports.permutations = exports.partitionSelect = exports.or = exports.numeric = exports.number = exports.nthRoot = exports.not = exports.norm = exports.multiplyScalar = exports.multiply = exports.multinomial = exports.mode = void 0;
 
 var _configReadonly = require("./configReadonly.js");
 
@@ -233,14 +233,14 @@ var leftShift = /* #__PURE__ */(0, _factoriesNumber.createLeftShift)({
   typed: typed
 });
 exports.leftShift = leftShift;
-var log10 = /* #__PURE__ */(0, _factoriesNumber.createLog10)({
+var log = /* #__PURE__ */(0, _factoriesNumber.createLog)({
   typed: typed
 });
-exports.log10 = log10;
-var log2 = /* #__PURE__ */(0, _factoriesNumber.createLog2)({
+exports.log = log;
+var log1p = /* #__PURE__ */(0, _factoriesNumber.createLog1p)({
   typed: typed
 });
-exports.log2 = log2;
+exports.log1p = log1p;
 var map = /* #__PURE__ */(0, _factoriesNumber.createMap)({
   typed: typed
 });
@@ -398,10 +398,10 @@ var lcm = /* #__PURE__ */(0, _factoriesNumber.createLcm)({
   typed: typed
 });
 exports.lcm = lcm;
-var log1p = /* #__PURE__ */(0, _factoriesNumber.createLog1p)({
+var log10 = /* #__PURE__ */(0, _factoriesNumber.createLog10)({
   typed: typed
 });
-exports.log1p = log1p;
+exports.log10 = log10;
 var multiplyScalar = /* #__PURE__ */(0, _factoriesNumber.createMultiplyScalar)({
   typed: typed
 });
@@ -495,6 +495,10 @@ var larger = /* #__PURE__ */(0, _factoriesNumber.createLarger)({
   typed: typed
 });
 exports.larger = larger;
+var log2 = /* #__PURE__ */(0, _factoriesNumber.createLog2)({
+  typed: typed
+});
+exports.log2 = log2;
 var mode = /* #__PURE__ */(0, _factoriesNumber.createMode)({
   isNaN: isNaN,
   isNumeric: isNumeric,
@@ -610,10 +614,10 @@ var hypot = /* #__PURE__ */(0, _factoriesNumber.createHypot)({
   typed: typed
 });
 exports.hypot = hypot;
-var log = /* #__PURE__ */(0, _factoriesNumber.createLog)({
+var lgamma = /* #__PURE__ */(0, _factoriesNumber.createLgamma)({
   typed: typed
 });
-exports.log = log;
+exports.lgamma = lgamma;
 var median = /* #__PURE__ */(0, _factoriesNumber.createMedian)({
   add: add,
   compare: compare,

package/lib/cjs/expression/embeddedDocs/embeddedDocs.js

@@ -251,6 +251,8 @@ var _identity = require("./function/matrix/identity.js");
 
 var _inv = require("./function/matrix/inv.js");
 
+var _pinv = require("./function/matrix/pinv.js");
+
 var _kron = require("./function/matrix/kron.js");
 
 var _map = require("./function/matrix/map.js");
@@ -299,6 +301,8 @@ var _factorial = require("./function/probability/factorial.js");
 
 var _gamma = require("./function/probability/gamma.js");
 
+var _lgamma = require("./function/probability/lgamma.js");
+
 var _kldivergence = require("./function/probability/kldivergence.js");
 
 var _multinomial = require("./function/probability/multinomial.js");
@@ -804,6 +808,7 @@ var embeddedDocs = {
   flatten: _flatten.flattenDocs,
   forEach: _forEach.forEachDocs,
   inv: _inv.invDocs,
+  pinv: _pinv.pinvDocs,
   eigs: _eigs.eigsDocs,
   kron: _kron.kronDocs,
   matrixFromFunction: _matrixFromFunction.matrixFromFunctionDocs,
@@ -832,6 +837,7 @@ var embeddedDocs = {
   factorial: _factorial.factorialDocs,
   gamma: _gamma.gammaDocs,
   kldivergence: _kldivergence.kldivergenceDocs,
+  lgamma: _lgamma.lgammaDocs,
   multinomial: _multinomial.multinomialDocs,
   permutations: _permutations.permutationsDocs,
   pickRandom: _pickRandom.pickRandomDocs,

package/lib/cjs/expression/embeddedDocs/function/arithmetic/pow.js

@@ -9,7 +9,7 @@ var powDocs = {
   category: 'Operators',
   syntax: ['x ^ y', 'pow(x, y)'],
   description: 'Calculates the power of x to y, x^y.',
-  examples: ['2^3', '2*2*2', '1 + e ^ (pi * i)'],
+  examples: ['2^3', '2*2*2', '1 + e ^ (pi * i)', 'math.pow([[1, 2], [4, 3]], 2)', 'math.pow([[1, 2], [4, 3]], -1)'],
   seealso: ['multiply', 'nthRoot', 'nthRoots', 'sqrt']
 };
 exports.powDocs = powDocs;

package/lib/cjs/expression/embeddedDocs/function/matrix/pinv.js

@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.pinvDocs = void 0;
+var pinvDocs = {
+  name: 'pinv',
+  category: 'Matrix',
+  syntax: ['pinv(x)'],
+  description: 'Calculate the Moore–Penrose inverse of a matrix',
+  examples: ['pinv([1, 2; 3, 4])', 'pinv([[1, 0], [0, 1], [0, 1]])', 'pinv(4)'],
+  seealso: ['inv']
+};
+exports.pinvDocs = pinvDocs;

package/lib/cjs/expression/embeddedDocs/function/probability/lgamma.js

@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.lgammaDocs = void 0;
+var lgammaDocs = {
+  name: 'lgamma',
+  category: 'Probability',
+  syntax: ['lgamma(n)'],
+  description: 'Logarithm of the gamma function for real, positive numbers and complex numbers, ' + 'using Lanczos approximation for numbers and Stirling series for complex numbers.',
+  examples: ['lgamma(4)', 'lgamma(1/2)', 'lgamma(math.i)', 'lgamma(complex(1.1, 2))'],
+  seealso: ['gamma']
+};
+exports.lgammaDocs = lgammaDocs;

package/lib/cjs/factoriesAny.js

@@ -1011,6 +1011,12 @@ Object.defineProperty(exports, "createLeftShift", {
     return _leftShift.createLeftShift;
   }
 });
+Object.defineProperty(exports, "createLgamma", {
+  enumerable: true,
+  get: function get() {
+    return _lgamma.createLgamma;
+  }
+});
 Object.defineProperty(exports, "createLog", {
   enumerable: true,
   get: function get() {
@@ -1371,6 +1377,12 @@ Object.defineProperty(exports, "createPickRandom", {
     return _pickRandom.createPickRandom;
   }
 });
+Object.defineProperty(exports, "createPinv", {
+  enumerable: true,
+  get: function get() {
+    return _pinv.createPinv;
+  }
+});
 Object.defineProperty(exports, "createPlanckCharge", {
   enumerable: true,
   get: function get() {
@@ -2476,6 +2488,8 @@ var _det = require("./function/matrix/det.js");
 
 var _inv = require("./function/matrix/inv.js");
 
+var _pinv = require("./function/matrix/pinv.js");
+
 var _eigs = require("./function/matrix/eigs.js");
 
 var _expm2 = require("./function/matrix/expm.js");
@@ -2510,6 +2524,8 @@ var _combinationsWithRep = require("./function/probability/combinationsWithRep.j
 
 var _gamma = require("./function/probability/gamma.js");
 
+var _lgamma = require("./function/probability/lgamma.js");
+
 var _factorial = require("./function/probability/factorial.js");
 
 var _kldivergence = require("./function/probability/kldivergence.js");

package/lib/cjs/factoriesNumber.js

@@ -338,7 +338,7 @@ Object.defineProperty(exports, "createLargerEq", {
   }
 });
 exports.createLeftShift = exports.createLcm = void 0;
-exports.createLog2 = exports.createLog1p = exports.createLog10 = exports.createLog = void 0;
+exports.createLog2 = exports.createLog1p = exports.createLog10 = exports.createLog = exports.createLgamma = void 0;
 Object.defineProperty(exports, "createMad", {
   enumerable: true,
   get: function get() {
@@ -1097,6 +1097,8 @@ var createCombinations = createNumberFactory('combinations', _index.combinations
 exports.createCombinations = createCombinations;
 var createGamma = createNumberFactory('gamma', _index.gammaNumber);
 exports.createGamma = createGamma;
+var createLgamma = createNumberFactory('lgamma', _index.lgammaNumber);
+exports.createLgamma = createLgamma;
 // trigonometry
 var createAcos = /* #__PURE__ */createNumberFactory('acos', _index.acosNumber);
 exports.createAcos = createAcos;

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

@@ -14,21 +14,25 @@ var _array = require("../../utils/array.js");
 var _index = require("../../plain/number/index.js");
 
 var name = 'pow';
-var dependencies = ['typed', 'config', 'identity', 'multiply', 'matrix', 'fraction', 'number', 'Complex'];
+var dependencies = ['typed', 'config', 'identity', 'multiply', 'matrix', 'inv', 'fraction', 'number', 'Complex'];
 var createPow = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
   var typed = _ref.typed,
       config = _ref.config,
       identity = _ref.identity,
       multiply = _ref.multiply,
       matrix = _ref.matrix,
+      inv = _ref.inv,
       number = _ref.number,
       fraction = _ref.fraction,
       Complex = _ref.Complex;
 
   /**
    * Calculates the power of x to y, `x ^ y`.
-   * Matrix exponentiation is supported for square matrices `x`, and positive
-   * integer exponents `y`.
+   *
+   * Matrix exponentiation is supported for square matrices `x` and integers `y`:
+   * when `y` is nonnegative, `x` may be any square matrix; and when `y` is
+   * negative, `x` must be invertible, and then this function returns
+   * inv(x)^(-y).
    *
    * For cubic roots of negative numbers, the function returns the principal
    * root by default. In order to let the function return the real root,
@@ -49,6 +53,9 @@ var createPow = /* #__PURE__ */(0, _factory.factory)(name, dependencies, functio
    *    const b = [[1, 2], [4, 3]]
    *    math.pow(b, 2)               // returns Array [[9, 8], [16, 17]]
    *
+   *    const c = [[1, 2], [4, 3]]
+   *    math.pow(c, -1)               // returns Array [[-0.6, 0.4], [0.8, -0.2]]
+   *
    * See also:
    *
    *    multiply, sqrt, cbrt, nthRoot
@@ -144,15 +151,15 @@ var createPow = /* #__PURE__ */(0, _factory.factory)(name, dependencies, functio
   /**
    * Calculate the power of a 2d array
    * @param {Array} x     must be a 2 dimensional, square matrix
-   * @param {number} y    a positive, integer value
+   * @param {number} y    a integer value (positive if `x` is not invertible)
    * @returns {Array}
    * @private
    */
 
 
   function _powArray(x, y) {
-    if (!(0, _number.isInteger)(y) || y < 0) {
-      throw new TypeError('For A^b, b must be a positive integer (value is ' + y + ')');
+    if (!(0, _number.isInteger)(y)) {
+      throw new TypeError('For A^b, b must be an integer (value is ' + y + ')');
     } // verify that A is a 2 dimensional square matrix
 
 
@@ -166,6 +173,18 @@ var createPow = /* #__PURE__ */(0, _factory.factory)(name, dependencies, functio
       throw new Error('For A^b, A must be square (size is ' + s[0] + 'x' + s[1] + ')');
     }
 
+    if (y < 0) {
+      try {
+        return _powArray(inv(x), -y);
+      } catch (error) {
+        if (error.message === 'Cannot calculate inverse, determinant is zero') {
+          throw new TypeError('For A^b, when A is not invertible, b must be a positive integer (value is ' + y + ')');
+        }
+
+        throw error;
+      }
+    }
+
     var res = identity(s[0]).valueOf();
     var px = x;
 

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

@@ -14,14 +14,15 @@ var _string = require("../../utils/string.js");
 var _factory = require("../../utils/factory.js");
 
 var name = 'det';
-var dependencies = ['typed', 'matrix', 'subtract', 'multiply', 'unaryMinus', 'lup'];
+var dependencies = ['typed', 'matrix', 'subtract', 'multiply', 'divideScalar', 'isZero', 'unaryMinus'];
 var createDet = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
   var typed = _ref.typed,
       matrix = _ref.matrix,
       subtract = _ref.subtract,
       multiply = _ref.multiply,
-      unaryMinus = _ref.unaryMinus,
-      lup = _ref.lup;
+      divideScalar = _ref.divideScalar,
+      isZero = _ref.isZero,
+      unaryMinus = _ref.unaryMinus;
 
   /**
    * Calculate the determinant of a matrix.
@@ -115,42 +116,47 @@ var createDet = /* #__PURE__ */(0, _factory.factory)(name, dependencies, functio
       // the determinant of [a11,a12;a21,a22] is det = a11*a22-a21*a12
       return subtract(multiply(matrix[0][0], matrix[1][1]), multiply(matrix[1][0], matrix[0][1]));
     } else {
-      // Compute the LU decomposition
-      var decomp = lup(matrix); // The determinant is the product of the diagonal entries of U (and those of L, but they are all 1)
-
-      var det = decomp.U[0][0];
-
-      for (var _i = 1; _i < rows; _i++) {
-        det = multiply(det, decomp.U[_i][_i]);
-      } // The determinant will be multiplied by 1 or -1 depending on the parity of the permutation matrix.
-      // This can be determined by counting the cycles. This is roughly a linear time algorithm.
-
-
-      var evenCycles = 0;
-      var i = 0;
-      var visited = [];
+      // Bareiss algorithm
+      // this algorithm have same complexity as LUP decomposition (O(n^3))
+      // but it preserve precision of floating point more relative to the LUP decomposition
+      var negated = false;
+      var rowIndices = new Array(rows).fill(0).map(function (_, i) {
+        return i;
+      }); // matrix index of row i
+
+      for (var k = 0; k < rows; k++) {
+        var k_ = rowIndices[k];
+
+        if (isZero(matrix[k_][k])) {
+          var _k = void 0;
+
+          for (_k = k + 1; _k < rows; _k++) {
+            if (!isZero(matrix[rowIndices[_k]][k])) {
+              k_ = rowIndices[_k];
+              rowIndices[_k] = rowIndices[k];
+              rowIndices[k] = k_;
+              negated = !negated;
+              break;
+            }
+          }
 
-      while (true) {
-        while (visited[i]) {
-          i++;
+          if (_k === rows) return matrix[k_][k]; // some zero of the type
         }
 
-        if (i >= rows) break;
-        var j = i;
-        var cycleLen = 0;
+        var piv = matrix[k_][k];
+        var piv_ = k === 0 ? 1 : matrix[rowIndices[k - 1]][k - 1];
 
-        while (!visited[decomp.p[j]]) {
-          visited[decomp.p[j]] = true;
-          j = decomp.p[j];
-          cycleLen++;
-        }
+        for (var i = k + 1; i < rows; i++) {
+          var i_ = rowIndices[i];
 
-        if (cycleLen % 2 === 0) {
-          evenCycles++;
+          for (var j = k + 1; j < rows; j++) {
+            matrix[i_][j] = divideScalar(subtract(multiply(matrix[i_][j], piv), multiply(matrix[i_][k], matrix[k_][j])), piv_);
+          }
         }
       }
 
-      return evenCycles % 2 === 0 ? det : unaryMinus(det);
+      var det = matrix[rowIndices[rows - 1]][rows - 1];
+      return negated ? unaryMinus(det) : det;
     }
   }
 });

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

@@ -0,0 +1,223 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createPinv = void 0;
+
+var _is = require("../../utils/is.js");
+
+var _array = require("../../utils/array.js");
+
+var _factory = require("../../utils/factory.js");
+
+var _string = require("../../utils/string.js");
+
+var _object = require("../../utils/object.js");
+
+var name = 'pinv';
+var dependencies = ['typed', 'matrix', 'inv', 'deepEqual', 'equal', 'dotDivide', 'dot', 'ctranspose', 'divideScalar', 'multiply', 'add', 'Complex'];
+var createPinv = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      matrix = _ref.matrix,
+      inv = _ref.inv,
+      deepEqual = _ref.deepEqual,
+      equal = _ref.equal,
+      dotDivide = _ref.dotDivide,
+      dot = _ref.dot,
+      ctranspose = _ref.ctranspose,
+      divideScalar = _ref.divideScalar,
+      multiply = _ref.multiply,
+      add = _ref.add,
+      Complex = _ref.Complex;
+
+  /**
+   * Calculate the Moore–Penrose inverse of a matrix.
+   *
+   * Syntax:
+   *
+   *     math.pinv(x)
+   *
+   * Examples:
+   *
+   *     math.pinv([[1, 2], [3, 4]])          // returns [[-2, 1], [1.5, -0.5]]
+   *     math.pinv([[1, 0], [0, 1], [0, 1]])  // returns [[1, 0, 0], [0, 0.5, 0.5]]
+   *     math.pinv(4)                         // returns 0.25
+   *
+   * See also:
+   *
+   *     inv
+   *
+   * @param {number | Complex | Array | Matrix} x     Matrix to be inversed
+   * @return {number | Complex | Array | Matrix} The inverse of `x`.
+   */
+  return typed(name, {
+    'Array | Matrix': function ArrayMatrix(x) {
+      var size = (0, _is.isMatrix)(x) ? x.size() : (0, _array.arraySize)(x);
+
+      switch (size.length) {
+        case 1:
+          // vector
+          if (_isZeros(x)) return ctranspose(x); // null vector
+
+          if (size[0] === 1) {
+            return inv(x); // invertible matrix
+          } else {
+            return dotDivide(ctranspose(x), dot(x, x));
+          }
+
+        case 2:
+          // two dimensional array
+          {
+            if (_isZeros(x)) return ctranspose(x); // zero matrixx
+
+            var rows = size[0];
+            var cols = size[1];
+
+            if (rows === cols) {
+              try {
+                return inv(x); // invertible matrix
+              } catch (err) {
+                if (err instanceof Error && err.message.match(/Cannot calculate inverse, determinant is zero/)) {// Expected
+                } else {
+                  throw err;
+                }
+              }
+            }
+
+            if ((0, _is.isMatrix)(x)) {
+              return matrix(_pinv(x.valueOf(), rows, cols), x.storage());
+            } else {
+              // return an Array
+              return _pinv(x, rows, cols);
+            }
+          }
+
+        default:
+          // multi dimensional array
+          throw new RangeError('Matrix must be two dimensional ' + '(size: ' + (0, _string.format)(size) + ')');
+      }
+    },
+    any: function any(x) {
+      // scalar
+      if (equal(x, 0)) return (0, _object.clone)(x); // zero
+
+      return divideScalar(1, x);
+    }
+  });
+  /**
+   * Calculate the Moore–Penrose inverse of a matrix
+   * @param {Array[]} mat     A matrix
+   * @param {number} rows     Number of rows
+   * @param {number} cols     Number of columns
+   * @return {Array[]} pinv    Pseudoinverse matrix
+   * @private
+   */
+
+  function _pinv(mat, rows, cols) {
+    var _rankFact2 = _rankFact(mat, rows, cols),
+        C = _rankFact2.C,
+        F = _rankFact2.F; // TODO: Use SVD instead (may improve precision)
+
+
+    var Cpinv = multiply(inv(multiply(ctranspose(C), C)), ctranspose(C));
+    var Fpinv = multiply(ctranspose(F), inv(multiply(F, ctranspose(F))));
+    return multiply(Fpinv, Cpinv);
+  }
+  /**
+   * Calculate the reduced row echelon form of a matrix
+   *
+   * Modified from https://rosettacode.org/wiki/Reduced_row_echelon_form
+   *
+   * @param {Array[]} mat     A matrix
+   * @param {number} rows     Number of rows
+   * @param {number} cols     Number of columns
+   * @return {Array[]}        Reduced row echelon form
+   * @private
+   */
+
+
+  function _rref(mat, rows, cols) {
+    var M = (0, _object.clone)(mat);
+    var lead = 0;
+
+    for (var r = 0; r < rows; r++) {
+      if (cols <= lead) {
+        return M;
+      }
+
+      var i = r;
+
+      while (_isZero(M[i][lead])) {
+        i++;
+
+        if (rows === i) {
+          i = r;
+          lead++;
+
+          if (cols === lead) {
+            return M;
+          }
+        }
+      }
+
+      var _ref2 = [M[r], M[i]];
+      M[i] = _ref2[0];
+      M[r] = _ref2[1];
+      var val = M[r][lead];
+
+      for (var j = 0; j < cols; j++) {
+        M[r][j] = dotDivide(M[r][j], val);
+      }
+
+      for (var _i = 0; _i < rows; _i++) {
+        if (_i === r) continue;
+        val = M[_i][lead];
+
+        for (var _j = 0; _j < cols; _j++) {
+          M[_i][_j] = add(M[_i][_j], multiply(-1, multiply(val, M[r][_j])));
+        }
+      }
+
+      lead++;
+    }
+
+    return M;
+  }
+  /**
+   * Calculate the rank factorization of a matrix
+   *
+   * @param {Array[]} mat                  A matrix (M)
+   * @param {number} rows                  Number of rows
+   * @param {number} cols                  Number of columns
+   * @return {{C: Array, F: Array}}        rank factorization where M = C F
+   * @private
+   */
+
+
+  function _rankFact(mat, rows, cols) {
+    var rref = _rref(mat, rows, cols);
+
+    var C = mat.map(function (_, i) {
+      return _.filter(function (_, j) {
+        return j < rows && !_isZero(dot(rref[j], rref[j]));
+      });
+    });
+    var F = rref.filter(function (_, i) {
+      return !_isZero(dot(rref[i], rref[i]));
+    });
+    return {
+      C: C,
+      F: F
+    };
+  }
+
+  function _isZero(x) {
+    return equal(add(x, Complex(1, 1)), add(0, Complex(1, 1)));
+  }
+
+  function _isZeros(arr) {
+    return deepEqual(add(arr, Complex(1, 1)), add(multiply(arr, 0), Complex(1, 1)));
+  }
+});
+exports.createPinv = createPinv;