mathjs 10.0.0 → 10.0.1

package/lib/cjs/function/probability/gamma.js

@@ -49,44 +49,42 @@ var createGamma = /* #__PURE__ */(0, _factory.factory)(name, dependencies, funct
     Complex: function Complex(n) {
       if (n.im === 0) {
         return this(n.re);
-      }
+      } // Lanczos approximation doesn't work well with real part lower than 0.5
+      // So reflection formula is required
+
+
+      if (n.re < 0.5) {
+        // Euler's reflection formula
+        // gamma(1-z) * gamma(z) = PI / sin(PI * z)
+        // real part of Z should not be integer [sin(PI) == 0 -> 1/0 - undefined]
+        // thanks to imperfect sin implementation sin(PI * n) != 0
+        // we can safely use it anyway
+        var _t = new _Complex(1 - n.re, -n.im);
+
+        var r = new _Complex(Math.PI * n.re, Math.PI * n.im);
+        return new _Complex(Math.PI).div(r.sin()).div(this(_t));
+      } // Lanczos approximation
+      // z -= 1
+
 
-      n = new _Complex(n.re - 1, n.im);
-      var x = new _Complex(_index.gammaP[0], 0);
+      n = new _Complex(n.re - 1, n.im); // x = gammaPval[0]
+
+      var x = new _Complex(_index.gammaP[0], 0); // for (i, gammaPval) in enumerate(gammaP):
 
       for (var i = 1; i < _index.gammaP.length; ++i) {
-        var real = n.re + i; // x += p[i]/(n+i)
+        // x += gammaPval / (z + i)
+        var gammaPval = new _Complex(_index.gammaP[i], 0);
+        x = x.add(gammaPval.div(n.add(i)));
+      } // t = z + gammaG + 0.5
 
-        var den = real * real + n.im * n.im;
 
-        if (den !== 0) {
-          x.re += _index.gammaP[i] * real / den;
-          x.im += -(_index.gammaP[i] * n.im) / den;
-        } else {
-          x.re = _index.gammaP[i] < 0 ? -Infinity : Infinity;
-        }
-      }
+      var t = new _Complex(n.re + _index.gammaG + 0.5, n.im); // y = sqrt(2 * pi) * t ** (z + 0.5) * exp(-t) * x
 
-      var t = new _Complex(n.re + _index.gammaG + 0.5, n.im);
       var twoPiSqrt = Math.sqrt(2 * Math.PI);
-      n.re += 0.5;
-      var result = pow(t, n);
-
-      if (result.im === 0) {
-        // sqrt(2*PI)*result
-        result.re *= twoPiSqrt;
-      } else if (result.re === 0) {
-        result.im *= twoPiSqrt;
-      } else {
-        result.re *= twoPiSqrt;
-        result.im *= twoPiSqrt;
-      }
-
-      var r = Math.exp(-t.re); // exp(-t)
+      var tpow = t.pow(n.add(0.5));
+      var expt = t.neg().exp(); // y = [x] * [sqrt(2 * pi)] * [t ** (z + 0.5)] * [exp(-t)]
 
-      t.re = r * Math.cos(-t.im);
-      t.im = r * Math.sin(-t.im);
-      return multiplyScalar(multiplyScalar(result, t), x);
+      return x.mul(twoPiSqrt).mul(tpow).mul(expt);
     },
     BigNumber: function BigNumber(n) {
       if (n.isInteger()) {

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 10.0.0
- * @date    2021-11-03
+ * @version 10.0.1
+ * @date    2021-12-22
  *
  * @license
  * Copyright (C) 2013-2021 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 = '10.0.0'; // Note: This file is automatically generated when building math.js.
+var version = '10.0.1'; // Note: This file is automatically generated when building math.js.
 // Changes made in this file will be overwritten.
 
 exports.version = version;

package/lib/esm/function/probability/gamma.js

@@ -41,44 +41,42 @@ export var createGamma = /* #__PURE__ */factory(name, dependencies, _ref => {
     Complex: function Complex(n) {
       if (n.im === 0) {
         return this(n.re);
-      }
+      } // Lanczos approximation doesn't work well with real part lower than 0.5
+      // So reflection formula is required
+
+
+      if (n.re < 0.5) {
+        // Euler's reflection formula
+        // gamma(1-z) * gamma(z) = PI / sin(PI * z)
+        // real part of Z should not be integer [sin(PI) == 0 -> 1/0 - undefined]
+        // thanks to imperfect sin implementation sin(PI * n) != 0
+        // we can safely use it anyway
+        var _t = new _Complex(1 - n.re, -n.im);
+
+        var r = new _Complex(Math.PI * n.re, Math.PI * n.im);
+        return new _Complex(Math.PI).div(r.sin()).div(this(_t));
+      } // Lanczos approximation
+      // z -= 1
+
 
-      n = new _Complex(n.re - 1, n.im);
-      var x = new _Complex(gammaP[0], 0);
+      n = new _Complex(n.re - 1, n.im); // x = gammaPval[0]
+
+      var x = new _Complex(gammaP[0], 0); // for (i, gammaPval) in enumerate(gammaP):
 
       for (var i = 1; i < gammaP.length; ++i) {
-        var real = n.re + i; // x += p[i]/(n+i)
+        // x += gammaPval / (z + i)
+        var gammaPval = new _Complex(gammaP[i], 0);
+        x = x.add(gammaPval.div(n.add(i)));
+      } // t = z + gammaG + 0.5
 
-        var den = real * real + n.im * n.im;
 
-        if (den !== 0) {
-          x.re += gammaP[i] * real / den;
-          x.im += -(gammaP[i] * n.im) / den;
-        } else {
-          x.re = gammaP[i] < 0 ? -Infinity : Infinity;
-        }
-      }
+      var t = new _Complex(n.re + gammaG + 0.5, n.im); // y = sqrt(2 * pi) * t ** (z + 0.5) * exp(-t) * x
 
-      var t = new _Complex(n.re + gammaG + 0.5, n.im);
       var twoPiSqrt = Math.sqrt(2 * Math.PI);
-      n.re += 0.5;
-      var result = pow(t, n);
-
-      if (result.im === 0) {
-        // sqrt(2*PI)*result
-        result.re *= twoPiSqrt;
-      } else if (result.re === 0) {
-        result.im *= twoPiSqrt;
-      } else {
-        result.re *= twoPiSqrt;
-        result.im *= twoPiSqrt;
-      }
-
-      var r = Math.exp(-t.re); // exp(-t)
+      var tpow = t.pow(n.add(0.5));
+      var expt = t.neg().exp(); // y = [x] * [sqrt(2 * pi)] * [t ** (z + 0.5)] * [exp(-t)]
 
-      t.re = r * Math.cos(-t.im);
-      t.im = r * Math.sin(-t.im);
-      return multiplyScalar(multiplyScalar(result, t), x);
+      return x.mul(twoPiSqrt).mul(tpow).mul(expt);
     },
     BigNumber: function BigNumber(n) {
       if (n.isInteger()) {

package/lib/esm/version.js

@@ -1,2 +1,2 @@
-export var version = '10.0.0'; // Note: This file is automatically generated when building math.js.
+export var version = '10.0.1'; // Note: This file is automatically generated when building math.js.
 // Changes made in this file will be overwritten.

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "mathjs",
-  "version": "10.0.0",
+  "version": "10.0.1",
   "description": "Math.js is an extensive math library for JavaScript and Node.js. It features a flexible expression parser with support for symbolic computation, comes with a large set of built-in functions and constants, and offers an integrated solution to work with different data types like numbers, big numbers, complex numbers, fractions, units, and matrices.",
   "author": "Jos de Jong <wjosdejong@gmail.com> (https://github.com/josdejong)",
   "homepage": "https://mathjs.org",