Numeric.SpecFunctions:logGamma from math-functions-0.1.5.2, A

Percentage Accurate: 100.0% → 100.0%

Time: 3.8s

Alternatives: 4

Speedup: 1.2×

Specification

Math

\[\begin{array}{l} \\ \left(x \cdot \left(y - 1\right) - y \cdot 0.5\right) + 0.918938533204673 \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (+ (- (* x (- y 1.0)) (* y 0.5)) 0.918938533204673))

C

double code(double x, double y) {
	return ((x * (y - 1.0)) - (y * 0.5)) + 0.918938533204673;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = ((x * (y - 1.0d0)) - (y * 0.5d0)) + 0.918938533204673d0
end function

Java

public static double code(double x, double y) {
	return ((x * (y - 1.0)) - (y * 0.5)) + 0.918938533204673;
}

Python

def code(x, y):
	return ((x * (y - 1.0)) - (y * 0.5)) + 0.918938533204673

Julia

function code(x, y)
	return Float64(Float64(Float64(x * Float64(y - 1.0)) - Float64(y * 0.5)) + 0.918938533204673)
end

MATLAB

function tmp = code(x, y)
	tmp = ((x * (y - 1.0)) - (y * 0.5)) + 0.918938533204673;
end

Wolfram

code[x_, y_] := N[(N[(N[(x * N[(y - 1.0), $MachinePrecision]), $MachinePrecision] - N[(y * 0.5), $MachinePrecision]), $MachinePrecision] + 0.918938533204673), $MachinePrecision]

Initial Program: 100.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \left(x \cdot \left(y - 1\right) - y \cdot 0.5\right) + 0.918938533204673 \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (+ (- (* x (- y 1.0)) (* y 0.5)) 0.918938533204673))

C

double code(double x, double y) {
	return ((x * (y - 1.0)) - (y * 0.5)) + 0.918938533204673;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = ((x * (y - 1.0d0)) - (y * 0.5d0)) + 0.918938533204673d0
end function

Java

public static double code(double x, double y) {
	return ((x * (y - 1.0)) - (y * 0.5)) + 0.918938533204673;
}

Python

def code(x, y):
	return ((x * (y - 1.0)) - (y * 0.5)) + 0.918938533204673

Julia

function code(x, y)
	return Float64(Float64(Float64(x * Float64(y - 1.0)) - Float64(y * 0.5)) + 0.918938533204673)
end

MATLAB

function tmp = code(x, y)
	tmp = ((x * (y - 1.0)) - (y * 0.5)) + 0.918938533204673;
end

Wolfram

code[x_, y_] := N[(N[(N[(x * N[(y - 1.0), $MachinePrecision]), $MachinePrecision] - N[(y * 0.5), $MachinePrecision]), $MachinePrecision] + 0.918938533204673), $MachinePrecision]

Alternative 1: 100.0% accurate, 1.2× speedup

Math

\[\begin{array}{l} \\ \left(y \cdot \left(x + -0.5\right) + 0.918938533204673\right) - x \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (- (+ (* y (+ x -0.5)) 0.918938533204673) x))

C

double code(double x, double y) {
	return ((y * (x + -0.5)) + 0.918938533204673) - x;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = ((y * (x + (-0.5d0))) + 0.918938533204673d0) - x
end function

Java

public static double code(double x, double y) {
	return ((y * (x + -0.5)) + 0.918938533204673) - x;
}

Python

def code(x, y):
	return ((y * (x + -0.5)) + 0.918938533204673) - x

Julia

function code(x, y)
	return Float64(Float64(Float64(y * Float64(x + -0.5)) + 0.918938533204673) - x)
end

MATLAB

function tmp = code(x, y)
	tmp = ((y * (x + -0.5)) + 0.918938533204673) - x;
end

Wolfram

code[x_, y_] := N[(N[(N[(y * N[(x + -0.5), $MachinePrecision]), $MachinePrecision] + 0.918938533204673), $MachinePrecision] - x), $MachinePrecision]

Derivation

1. Initial program 100.0%

   \[\left(x \cdot \left(y - 1\right) - y \cdot 0.5\right) + 0.918938533204673 \]
2. Step-by-step derivation

   1. cancel-sign-sub-inv 100.0%

      \[\leadsto \color{blue}{\left(x \cdot \left(y - 1\right) + \left(-y\right) \cdot 0.5\right)} + 0.918938533204673 \]

   2. +-commutative 100.0%

      \[\leadsto \color{blue}{\left(\left(-y\right) \cdot 0.5 + x \cdot \left(y - 1\right)\right)} + 0.918938533204673 \]

   3. sub-neg 100.0%

      \[\leadsto \left(\left(-y\right) \cdot 0.5 + x \cdot \color{blue}{\left(y + \left(-1\right)\right)}\right) + 0.918938533204673 \]

   4. distribute-rgt-in 100.0%

      \[\leadsto \left(\left(-y\right) \cdot 0.5 + \color{blue}{\left(y \cdot x + \left(-1\right) \cdot x\right)}\right) + 0.918938533204673 \]

   5. metadata-eval 100.0%

      \[\leadsto \left(\left(-y\right) \cdot 0.5 + \left(y \cdot x + \color{blue}{-1} \cdot x\right)\right) + 0.918938533204673 \]

   6. neg-mul-1 100.0%

      \[\leadsto \left(\left(-y\right) \cdot 0.5 + \left(y \cdot x + \color{blue}{\left(-x\right)}\right)\right) + 0.918938533204673 \]

   7. associate-+r+ 100.0%

      \[\leadsto \color{blue}{\left(\left(\left(-y\right) \cdot 0.5 + y \cdot x\right) + \left(-x\right)\right)} + 0.918938533204673 \]

   8. unsub-neg 100.0%

      \[\leadsto \color{blue}{\left(\left(\left(-y\right) \cdot 0.5 + y \cdot x\right) - x\right)} + 0.918938533204673 \]

   9. associate-+l- 100.0%

      \[\leadsto \color{blue}{\left(\left(-y\right) \cdot 0.5 + y \cdot x\right) - \left(x - 0.918938533204673\right)} \]

   10. distribute-lft-neg-out 100.0%

       \[\leadsto \left(\color{blue}{\left(-y \cdot 0.5\right)} + y \cdot x\right) - \left(x - 0.918938533204673\right) \]

   11. distribute-rgt-neg-in 100.0%

       \[\leadsto \left(\color{blue}{y \cdot \left(-0.5\right)} + y \cdot x\right) - \left(x - 0.918938533204673\right) \]

   12. distribute-lft-out 100.0%

       \[\leadsto \color{blue}{y \cdot \left(\left(-0.5\right) + x\right)} - \left(x - 0.918938533204673\right) \]

   13. fma-neg 100.0%

       \[\leadsto \color{blue}{\mathsf{fma}\left(y, \left(-0.5\right) + x, -\left(x - 0.918938533204673\right)\right)} \]

   14. +-commutative 100.0%

       \[\leadsto \mathsf{fma}\left(y, \color{blue}{x + \left(-0.5\right)}, -\left(x - 0.918938533204673\right)\right) \]

   15. metadata-eval 100.0%

       \[\leadsto \mathsf{fma}\left(y, x + \color{blue}{-0.5}, -\left(x - 0.918938533204673\right)\right) \]

   16. neg-sub0 100.0%

       \[\leadsto \mathsf{fma}\left(y, x + -0.5, \color{blue}{0 - \left(x - 0.918938533204673\right)}\right) \]

   17. associate-+l- 100.0%

       \[\leadsto \mathsf{fma}\left(y, x + -0.5, \color{blue}{\left(0 - x\right) + 0.918938533204673}\right) \]

   18. neg-sub0 100.0%

       \[\leadsto \mathsf{fma}\left(y, x + -0.5, \color{blue}{\left(-x\right)} + 0.918938533204673\right) \]

   19. +-commutative 100.0%

       \[\leadsto \mathsf{fma}\left(y, x + -0.5, \color{blue}{0.918938533204673 + \left(-x\right)}\right) \]

   20. unsub-neg 100.0%

       \[\leadsto \mathsf{fma}\left(y, x + -0.5, \color{blue}{0.918938533204673 - x}\right) \]

3. Simplified 100.0%

   \[\leadsto \color{blue}{\mathsf{fma}\left(y, x + -0.5, 0.918938533204673 - x\right)} \]
4. Add Preprocessing
5. Step-by-step derivation

   1. fma-undefine 100.0%

      \[\leadsto \color{blue}{y \cdot \left(x + -0.5\right) + \left(0.918938533204673 - x\right)} \]

   2. associate-+r- 100.0%

      \[\leadsto \color{blue}{\left(y \cdot \left(x + -0.5\right) + 0.918938533204673\right) - x} \]

6. Applied egg-rr 100.0%

   \[\leadsto \color{blue}{\left(y \cdot \left(x + -0.5\right) + 0.918938533204673\right) - x} \]
7. Add Preprocessing

Alternative 2: 97.6% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -1.4 \lor \neg \left(y \leq 1.45\right):\\ \;\;\;\;y \cdot \left(x - 0.5\right)\\ \mathbf{else}:\\ \;\;\;\;0.918938533204673 - x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (or (<= y -1.4) (not (<= y 1.45)))
   (* y (- x 0.5))
   (- 0.918938533204673 x)))

C

double code(double x, double y) {
	double tmp;
	if ((y <= -1.4) || !(y <= 1.45)) {
		tmp = y * (x - 0.5);
	} else {
		tmp = 0.918938533204673 - x;
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if ((y <= (-1.4d0)) .or. (.not. (y <= 1.45d0))) then
        tmp = y * (x - 0.5d0)
    else
        tmp = 0.918938533204673d0 - x
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if ((y <= -1.4) || !(y <= 1.45)) {
		tmp = y * (x - 0.5);
	} else {
		tmp = 0.918938533204673 - x;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if (y <= -1.4) or not (y <= 1.45):
		tmp = y * (x - 0.5)
	else:
		tmp = 0.918938533204673 - x
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if ((y <= -1.4) || !(y <= 1.45))
		tmp = Float64(y * Float64(x - 0.5));
	else
		tmp = Float64(0.918938533204673 - x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if ((y <= -1.4) || ~((y <= 1.45)))
		tmp = y * (x - 0.5);
	else
		tmp = 0.918938533204673 - x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[Or[LessEqual[y, -1.4], N[Not[LessEqual[y, 1.45]], $MachinePrecision]], N[(y * N[(x - 0.5), $MachinePrecision]), $MachinePrecision], N[(0.918938533204673 - x), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -1.3999999999999999 or 1.44999999999999996 < y

   1. Initial program 100.0%

      \[\left(x \cdot \left(y - 1\right) - y \cdot 0.5\right) + 0.918938533204673 \]
   2. Step-by-step derivation

      1. associate-+l- 100.0%

         \[\leadsto \color{blue}{x \cdot \left(y - 1\right) - \left(y \cdot 0.5 - 0.918938533204673\right)} \]

      2. sub-neg 100.0%

         \[\leadsto x \cdot \color{blue}{\left(y + \left(-1\right)\right)} - \left(y \cdot 0.5 - 0.918938533204673\right) \]

      3. metadata-eval 100.0%

         \[\leadsto x \cdot \left(y + \color{blue}{-1}\right) - \left(y \cdot 0.5 - 0.918938533204673\right) \]

   3. Simplified 100.0%

      \[\leadsto \color{blue}{x \cdot \left(y + -1\right) - \left(y \cdot 0.5 - 0.918938533204673\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in y around inf 97.7%

      \[\leadsto \color{blue}{y \cdot \left(x - 0.5\right)} \]

   if -1.3999999999999999 < y < 1.44999999999999996

   1. Initial program 100.0%

      \[\left(x \cdot \left(y - 1\right) - y \cdot 0.5\right) + 0.918938533204673 \]
   2. Step-by-step derivation

      1. associate-+l- 100.0%

         \[\leadsto \color{blue}{x \cdot \left(y - 1\right) - \left(y \cdot 0.5 - 0.918938533204673\right)} \]

      2. sub-neg 100.0%

         \[\leadsto x \cdot \color{blue}{\left(y + \left(-1\right)\right)} - \left(y \cdot 0.5 - 0.918938533204673\right) \]

      3. metadata-eval 100.0%

         \[\leadsto x \cdot \left(y + \color{blue}{-1}\right) - \left(y \cdot 0.5 - 0.918938533204673\right) \]

   3. Simplified 100.0%

      \[\leadsto \color{blue}{x \cdot \left(y + -1\right) - \left(y \cdot 0.5 - 0.918938533204673\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in y around 0 98.8%

      \[\leadsto \color{blue}{0.918938533204673 + -1 \cdot x} \]
   6. Step-by-step derivation

      1. neg-mul-1 98.8%

         \[\leadsto 0.918938533204673 + \color{blue}{\left(-x\right)} \]

      2. sub-neg 98.8%

         \[\leadsto \color{blue}{0.918938533204673 - x} \]

   7. Simplified 98.8%

      \[\leadsto \color{blue}{0.918938533204673 - x} \]
3. Recombined 2 regimes into one program.

4. Final simplification 98.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -1.4 \lor \neg \left(y \leq 1.45\right):\\ \;\;\;\;y \cdot \left(x - 0.5\right)\\ \mathbf{else}:\\ \;\;\;\;0.918938533204673 - x\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 74.8% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -2.8 \cdot 10^{-13} \lor \neg \left(y \leq 0.0225\right):\\ \;\;\;\;x \cdot \left(y + -1\right)\\ \mathbf{else}:\\ \;\;\;\;0.918938533204673 - x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (or (<= y -2.8e-13) (not (<= y 0.0225)))
   (* x (+ y -1.0))
   (- 0.918938533204673 x)))

C

double code(double x, double y) {
	double tmp;
	if ((y <= -2.8e-13) || !(y <= 0.0225)) {
		tmp = x * (y + -1.0);
	} else {
		tmp = 0.918938533204673 - x;
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if ((y <= (-2.8d-13)) .or. (.not. (y <= 0.0225d0))) then
        tmp = x * (y + (-1.0d0))
    else
        tmp = 0.918938533204673d0 - x
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if ((y <= -2.8e-13) || !(y <= 0.0225)) {
		tmp = x * (y + -1.0);
	} else {
		tmp = 0.918938533204673 - x;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if (y <= -2.8e-13) or not (y <= 0.0225):
		tmp = x * (y + -1.0)
	else:
		tmp = 0.918938533204673 - x
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if ((y <= -2.8e-13) || !(y <= 0.0225))
		tmp = Float64(x * Float64(y + -1.0));
	else
		tmp = Float64(0.918938533204673 - x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if ((y <= -2.8e-13) || ~((y <= 0.0225)))
		tmp = x * (y + -1.0);
	else
		tmp = 0.918938533204673 - x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[Or[LessEqual[y, -2.8e-13], N[Not[LessEqual[y, 0.0225]], $MachinePrecision]], N[(x * N[(y + -1.0), $MachinePrecision]), $MachinePrecision], N[(0.918938533204673 - x), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -2.8000000000000002e-13 or 0.022499999999999999 < y

   1. Initial program 100.0%

      \[\left(x \cdot \left(y - 1\right) - y \cdot 0.5\right) + 0.918938533204673 \]
   2. Step-by-step derivation

      1. associate-+l- 100.0%

         \[\leadsto \color{blue}{x \cdot \left(y - 1\right) - \left(y \cdot 0.5 - 0.918938533204673\right)} \]

      2. sub-neg 100.0%

         \[\leadsto x \cdot \color{blue}{\left(y + \left(-1\right)\right)} - \left(y \cdot 0.5 - 0.918938533204673\right) \]

      3. metadata-eval 100.0%

         \[\leadsto x \cdot \left(y + \color{blue}{-1}\right) - \left(y \cdot 0.5 - 0.918938533204673\right) \]

   3. Simplified 100.0%

      \[\leadsto \color{blue}{x \cdot \left(y + -1\right) - \left(y \cdot 0.5 - 0.918938533204673\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in x around inf 55.5%

      \[\leadsto \color{blue}{x \cdot \left(y - 1\right)} \]

   if -2.8000000000000002e-13 < y < 0.022499999999999999

   1. Initial program 100.0%

      \[\left(x \cdot \left(y - 1\right) - y \cdot 0.5\right) + 0.918938533204673 \]
   2. Step-by-step derivation

      1. associate-+l- 100.0%

         \[\leadsto \color{blue}{x \cdot \left(y - 1\right) - \left(y \cdot 0.5 - 0.918938533204673\right)} \]

      2. sub-neg 100.0%

         \[\leadsto x \cdot \color{blue}{\left(y + \left(-1\right)\right)} - \left(y \cdot 0.5 - 0.918938533204673\right) \]

      3. metadata-eval 100.0%

         \[\leadsto x \cdot \left(y + \color{blue}{-1}\right) - \left(y \cdot 0.5 - 0.918938533204673\right) \]

   3. Simplified 100.0%

      \[\leadsto \color{blue}{x \cdot \left(y + -1\right) - \left(y \cdot 0.5 - 0.918938533204673\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in y around 0 99.2%

      \[\leadsto \color{blue}{0.918938533204673 + -1 \cdot x} \]
   6. Step-by-step derivation

      1. neg-mul-1 99.2%

         \[\leadsto 0.918938533204673 + \color{blue}{\left(-x\right)} \]

      2. sub-neg 99.2%

         \[\leadsto \color{blue}{0.918938533204673 - x} \]

   7. Simplified 99.2%

      \[\leadsto \color{blue}{0.918938533204673 - x} \]
3. Recombined 2 regimes into one program.

4. Final simplification 78.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -2.8 \cdot 10^{-13} \lor \neg \left(y \leq 0.0225\right):\\ \;\;\;\;x \cdot \left(y + -1\right)\\ \mathbf{else}:\\ \;\;\;\;0.918938533204673 - x\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 50.2% accurate, 3.7× speedup

Math

\[\begin{array}{l} \\ 0.918938533204673 - x \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (- 0.918938533204673 x))

C

double code(double x, double y) {
	return 0.918938533204673 - x;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = 0.918938533204673d0 - x
end function

Java

public static double code(double x, double y) {
	return 0.918938533204673 - x;
}

Python

def code(x, y):
	return 0.918938533204673 - x

Julia

function code(x, y)
	return Float64(0.918938533204673 - x)
end

MATLAB

function tmp = code(x, y)
	tmp = 0.918938533204673 - x;
end

Wolfram

code[x_, y_] := N[(0.918938533204673 - x), $MachinePrecision]

Derivation

1. Initial program 100.0%

   \[\left(x \cdot \left(y - 1\right) - y \cdot 0.5\right) + 0.918938533204673 \]
2. Step-by-step derivation

   1. associate-+l- 100.0%

      \[\leadsto \color{blue}{x \cdot \left(y - 1\right) - \left(y \cdot 0.5 - 0.918938533204673\right)} \]

   2. sub-neg 100.0%

      \[\leadsto x \cdot \color{blue}{\left(y + \left(-1\right)\right)} - \left(y \cdot 0.5 - 0.918938533204673\right) \]

   3. metadata-eval 100.0%

      \[\leadsto x \cdot \left(y + \color{blue}{-1}\right) - \left(y \cdot 0.5 - 0.918938533204673\right) \]

3. Simplified 100.0%

   \[\leadsto \color{blue}{x \cdot \left(y + -1\right) - \left(y \cdot 0.5 - 0.918938533204673\right)} \]
4. Add Preprocessing

5. Taylor expanded in y around 0 54.1%

   \[\leadsto \color{blue}{0.918938533204673 + -1 \cdot x} \]
6. Step-by-step derivation

   1. neg-mul-1 54.1%

      \[\leadsto 0.918938533204673 + \color{blue}{\left(-x\right)} \]

   2. sub-neg 54.1%

      \[\leadsto \color{blue}{0.918938533204673 - x} \]

7. Simplified 54.1%

   \[\leadsto \color{blue}{0.918938533204673 - x} \]
8. Add Preprocessing

Reproduce

herbie shell --seed 2024106 
(FPCore (x y)
  :name "Numeric.SpecFunctions:logGamma from math-functions-0.1.5.2, A"
  :precision binary64
  (+ (- (* x (- y 1.0)) (* y 0.5)) 0.918938533204673))