Numeric.SpecFunctions.Extra:bd0 from math-functions-0.1.5.2

Percentage Accurate: 77.1% → 99.7%

Time: 8.7s

Alternatives: 7

Speedup: 0.5×

Specification

Math

\[\begin{array}{l} \\ x \cdot \log \left(\frac{x}{y}\right) - z \end{array} \]

FPCore

(FPCore (x y z) :precision binary64 (- (* x (log (/ x y))) z))

C

double code(double x, double y, double z) {
	return (x * log((x / y))) - z;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = (x * log((x / y))) - z
end function

Java

public static double code(double x, double y, double z) {
	return (x * Math.log((x / y))) - z;
}

Python

def code(x, y, z):
	return (x * math.log((x / y))) - z

Julia

function code(x, y, z)
	return Float64(Float64(x * log(Float64(x / y))) - z)
end

MATLAB

function tmp = code(x, y, z)
	tmp = (x * log((x / y))) - z;
end

Wolfram

code[x_, y_, z_] := N[(N[(x * N[Log[N[(x / y), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] - z), $MachinePrecision]

Initial Program: 77.1% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ x \cdot \log \left(\frac{x}{y}\right) - z \end{array} \]

FPCore

(FPCore (x y z) :precision binary64 (- (* x (log (/ x y))) z))

C

double code(double x, double y, double z) {
	return (x * log((x / y))) - z;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = (x * log((x / y))) - z
end function

Java

public static double code(double x, double y, double z) {
	return (x * Math.log((x / y))) - z;
}

Python

def code(x, y, z):
	return (x * math.log((x / y))) - z

Julia

function code(x, y, z)
	return Float64(Float64(x * log(Float64(x / y))) - z)
end

MATLAB

function tmp = code(x, y, z)
	tmp = (x * log((x / y))) - z;
end

Wolfram

code[x_, y_, z_] := N[(N[(x * N[Log[N[(x / y), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] - z), $MachinePrecision]

Alternative 1: 99.7% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ x \cdot \left(\log \left(\frac{\sqrt[3]{x}}{\sqrt[3]{y}}\right) \cdot 3\right) - z \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (- (* x (* (log (/ (cbrt x) (cbrt y))) 3.0)) z))

C

double code(double x, double y, double z) {
	return (x * (log((cbrt(x) / cbrt(y))) * 3.0)) - z;
}

Java

public static double code(double x, double y, double z) {
	return (x * (Math.log((Math.cbrt(x) / Math.cbrt(y))) * 3.0)) - z;
}

Julia

function code(x, y, z)
	return Float64(Float64(x * Float64(log(Float64(cbrt(x) / cbrt(y))) * 3.0)) - z)
end

Wolfram

code[x_, y_, z_] := N[(N[(x * N[(N[Log[N[(N[Power[x, 1/3], $MachinePrecision] / N[Power[y, 1/3], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * 3.0), $MachinePrecision]), $MachinePrecision] - z), $MachinePrecision]

Derivation

1. Initial program 80.6%

   \[x \cdot \log \left(\frac{x}{y}\right) - z \]
2. Step-by-step derivation

   1. add-cube-cbrt 80.6%

      \[\leadsto x \cdot \log \color{blue}{\left(\left(\sqrt[3]{\frac{x}{y}} \cdot \sqrt[3]{\frac{x}{y}}\right) \cdot \sqrt[3]{\frac{x}{y}}\right)} - z \]

   2. associate-*l* 80.6%

      \[\leadsto x \cdot \log \color{blue}{\left(\sqrt[3]{\frac{x}{y}} \cdot \left(\sqrt[3]{\frac{x}{y}} \cdot \sqrt[3]{\frac{x}{y}}\right)\right)} - z \]

   3. log-prod 80.5%

      \[\leadsto x \cdot \color{blue}{\left(\log \left(\sqrt[3]{\frac{x}{y}}\right) + \log \left(\sqrt[3]{\frac{x}{y}} \cdot \sqrt[3]{\frac{x}{y}}\right)\right)} - z \]

   4. pow2 80.5%

      \[\leadsto x \cdot \left(\log \left(\sqrt[3]{\frac{x}{y}}\right) + \log \color{blue}{\left({\left(\sqrt[3]{\frac{x}{y}}\right)}^{2}\right)}\right) - z \]

   5. metadata-eval 80.5%

      \[\leadsto x \cdot \left(\log \left(\sqrt[3]{\frac{x}{y}}\right) + \log \left({\left(\sqrt[3]{\frac{x}{y}}\right)}^{\color{blue}{\left(1 + 1\right)}}\right)\right) - z \]

   6. log-pow 80.5%

      \[\leadsto x \cdot \left(\log \left(\sqrt[3]{\frac{x}{y}}\right) + \color{blue}{\left(1 + 1\right) \cdot \log \left(\sqrt[3]{\frac{x}{y}}\right)}\right) - z \]

   7. metadata-eval 80.5%

      \[\leadsto x \cdot \left(\log \left(\sqrt[3]{\frac{x}{y}}\right) + \color{blue}{2} \cdot \log \left(\sqrt[3]{\frac{x}{y}}\right)\right) - z \]

3. Applied egg-rr 80.5%

   \[\leadsto x \cdot \color{blue}{\left(\log \left(\sqrt[3]{\frac{x}{y}}\right) + 2 \cdot \log \left(\sqrt[3]{\frac{x}{y}}\right)\right)} - z \]
4. Step-by-step derivation

   1. distribute-rgt1-in 80.5%

      \[\leadsto x \cdot \color{blue}{\left(\left(2 + 1\right) \cdot \log \left(\sqrt[3]{\frac{x}{y}}\right)\right)} - z \]

   2. metadata-eval 80.5%

      \[\leadsto x \cdot \left(\color{blue}{3} \cdot \log \left(\sqrt[3]{\frac{x}{y}}\right)\right) - z \]

   3. *-commutative 80.5%

      \[\leadsto x \cdot \color{blue}{\left(\log \left(\sqrt[3]{\frac{x}{y}}\right) \cdot 3\right)} - z \]

5. Simplified 80.5%

   \[\leadsto x \cdot \color{blue}{\left(\log \left(\sqrt[3]{\frac{x}{y}}\right) \cdot 3\right)} - z \]
6. Step-by-step derivation

   1. cbrt-div 99.7%

      \[\leadsto x \cdot \left(\log \color{blue}{\left(\frac{\sqrt[3]{x}}{\sqrt[3]{y}}\right)} \cdot 3\right) - z \]

   2. div-inv 99.7%

      \[\leadsto x \cdot \left(\log \color{blue}{\left(\sqrt[3]{x} \cdot \frac{1}{\sqrt[3]{y}}\right)} \cdot 3\right) - z \]

7. Applied egg-rr 99.7%

   \[\leadsto x \cdot \left(\log \color{blue}{\left(\sqrt[3]{x} \cdot \frac{1}{\sqrt[3]{y}}\right)} \cdot 3\right) - z \]
8. Step-by-step derivation

   1. associate-*r/ 99.7%

      \[\leadsto x \cdot \left(\log \color{blue}{\left(\frac{\sqrt[3]{x} \cdot 1}{\sqrt[3]{y}}\right)} \cdot 3\right) - z \]

   2. *-rgt-identity 99.7%

      \[\leadsto x \cdot \left(\log \left(\frac{\color{blue}{\sqrt[3]{x}}}{\sqrt[3]{y}}\right) \cdot 3\right) - z \]

9. Simplified 99.7%

   \[\leadsto x \cdot \left(\log \color{blue}{\left(\frac{\sqrt[3]{x}}{\sqrt[3]{y}}\right)} \cdot 3\right) - z \]

10. Final simplification 99.7%

    \[\leadsto x \cdot \left(\log \left(\frac{\sqrt[3]{x}}{\sqrt[3]{y}}\right) \cdot 3\right) - z \]

Alternative 2: 87.0% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \log \left(\frac{x}{y}\right)\\ t_1 := x \cdot t_0\\ \mathbf{if}\;t_1 \leq -\infty:\\ \;\;\;\;-z\\ \mathbf{elif}\;t_1 \leq 2 \cdot 10^{+306}:\\ \;\;\;\;\mathsf{fma}\left(t_0, x, -z\right)\\ \mathbf{else}:\\ \;\;\;\;-z\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (log (/ x y))) (t_1 (* x t_0)))
   (if (<= t_1 (- INFINITY))
     (- z)
     (if (<= t_1 2e+306) (fma t_0 x (- z)) (- z)))))

C

double code(double x, double y, double z) {
	double t_0 = log((x / y));
	double t_1 = x * t_0;
	double tmp;
	if (t_1 <= -((double) INFINITY)) {
		tmp = -z;
	} else if (t_1 <= 2e+306) {
		tmp = fma(t_0, x, -z);
	} else {
		tmp = -z;
	}
	return tmp;
}

Julia

function code(x, y, z)
	t_0 = log(Float64(x / y))
	t_1 = Float64(x * t_0)
	tmp = 0.0
	if (t_1 <= Float64(-Inf))
		tmp = Float64(-z);
	elseif (t_1 <= 2e+306)
		tmp = fma(t_0, x, Float64(-z));
	else
		tmp = Float64(-z);
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[Log[N[(x / y), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$1 = N[(x * t$95$0), $MachinePrecision]}, If[LessEqual[t$95$1, (-Infinity)], (-z), If[LessEqual[t$95$1, 2e+306], N[(t$95$0 * x + (-z)), $MachinePrecision], (-z)]]]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 x (log.f64 (/.f64 x y))) < -inf.0 or 2.00000000000000003e306 < (*.f64 x (log.f64 (/.f64 x y)))

   1. Initial program 8.5%

      \[x \cdot \log \left(\frac{x}{y}\right) - z \]

   2. Taylor expanded in x around 0 53.7%

      \[\leadsto \color{blue}{-1 \cdot z} \]
   3. Step-by-step derivation

      1. neg-mul-1 53.7%

         \[\leadsto \color{blue}{-z} \]

   4. Simplified 53.7%

      \[\leadsto \color{blue}{-z} \]

   if -inf.0 < (*.f64 x (log.f64 (/.f64 x y))) < 2.00000000000000003e306

   1. Initial program 99.4%

      \[x \cdot \log \left(\frac{x}{y}\right) - z \]
   2. Step-by-step derivation

      1. *-commutative 99.4%

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

      2. fma-neg 99.4%

         \[\leadsto \color{blue}{\mathsf{fma}\left(\log \left(\frac{x}{y}\right), x, -z\right)} \]

   3. Applied egg-rr 99.4%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\log \left(\frac{x}{y}\right), x, -z\right)} \]
3. Recombined 2 regimes into one program.

4. Final simplification 90.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \cdot \log \left(\frac{x}{y}\right) \leq -\infty:\\ \;\;\;\;-z\\ \mathbf{elif}\;x \cdot \log \left(\frac{x}{y}\right) \leq 2 \cdot 10^{+306}:\\ \;\;\;\;\mathsf{fma}\left(\log \left(\frac{x}{y}\right), x, -z\right)\\ \mathbf{else}:\\ \;\;\;\;-z\\ \end{array} \]

Alternative 3: 87.0% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := x \cdot \log \left(\frac{x}{y}\right)\\ \mathbf{if}\;t_0 \leq -\infty:\\ \;\;\;\;-z\\ \mathbf{elif}\;t_0 \leq 2 \cdot 10^{+306}:\\ \;\;\;\;t_0 - z\\ \mathbf{else}:\\ \;\;\;\;-z\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (* x (log (/ x y)))))
   (if (<= t_0 (- INFINITY)) (- z) (if (<= t_0 2e+306) (- t_0 z) (- z)))))

C

double code(double x, double y, double z) {
	double t_0 = x * log((x / y));
	double tmp;
	if (t_0 <= -((double) INFINITY)) {
		tmp = -z;
	} else if (t_0 <= 2e+306) {
		tmp = t_0 - z;
	} else {
		tmp = -z;
	}
	return tmp;
}

Java

public static double code(double x, double y, double z) {
	double t_0 = x * Math.log((x / y));
	double tmp;
	if (t_0 <= -Double.POSITIVE_INFINITY) {
		tmp = -z;
	} else if (t_0 <= 2e+306) {
		tmp = t_0 - z;
	} else {
		tmp = -z;
	}
	return tmp;
}

Python

def code(x, y, z):
	t_0 = x * math.log((x / y))
	tmp = 0
	if t_0 <= -math.inf:
		tmp = -z
	elif t_0 <= 2e+306:
		tmp = t_0 - z
	else:
		tmp = -z
	return tmp

Julia

function code(x, y, z)
	t_0 = Float64(x * log(Float64(x / y)))
	tmp = 0.0
	if (t_0 <= Float64(-Inf))
		tmp = Float64(-z);
	elseif (t_0 <= 2e+306)
		tmp = Float64(t_0 - z);
	else
		tmp = Float64(-z);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	t_0 = x * log((x / y));
	tmp = 0.0;
	if (t_0 <= -Inf)
		tmp = -z;
	elseif (t_0 <= 2e+306)
		tmp = t_0 - z;
	else
		tmp = -z;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(x * N[Log[N[(x / y), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, (-Infinity)], (-z), If[LessEqual[t$95$0, 2e+306], N[(t$95$0 - z), $MachinePrecision], (-z)]]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 x (log.f64 (/.f64 x y))) < -inf.0 or 2.00000000000000003e306 < (*.f64 x (log.f64 (/.f64 x y)))

   1. Initial program 8.5%

      \[x \cdot \log \left(\frac{x}{y}\right) - z \]

   2. Taylor expanded in x around 0 53.7%

      \[\leadsto \color{blue}{-1 \cdot z} \]
   3. Step-by-step derivation

      1. neg-mul-1 53.7%

         \[\leadsto \color{blue}{-z} \]

   4. Simplified 53.7%

      \[\leadsto \color{blue}{-z} \]

   if -inf.0 < (*.f64 x (log.f64 (/.f64 x y))) < 2.00000000000000003e306

   1. Initial program 99.4%

      \[x \cdot \log \left(\frac{x}{y}\right) - z \]
3. Recombined 2 regimes into one program.

4. Final simplification 89.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \cdot \log \left(\frac{x}{y}\right) \leq -\infty:\\ \;\;\;\;-z\\ \mathbf{elif}\;x \cdot \log \left(\frac{x}{y}\right) \leq 2 \cdot 10^{+306}:\\ \;\;\;\;x \cdot \log \left(\frac{x}{y}\right) - z\\ \mathbf{else}:\\ \;\;\;\;-z\\ \end{array} \]

Alternative 4: 92.2% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -3.25 \cdot 10^{+237}:\\ \;\;\;\;x \cdot \left(\log \left(-x\right) - \log \left(-y\right)\right)\\ \mathbf{elif}\;x \leq -5.5 \cdot 10^{-179}:\\ \;\;\;\;\mathsf{fma}\left(\log \left(\frac{x}{y}\right), x, -z\right)\\ \mathbf{elif}\;x \leq -2 \cdot 10^{-302}:\\ \;\;\;\;-z\\ \mathbf{else}:\\ \;\;\;\;x \cdot \left(\log x - \log y\right) - z\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= x -3.25e+237)
   (* x (- (log (- x)) (log (- y))))
   (if (<= x -5.5e-179)
     (fma (log (/ x y)) x (- z))
     (if (<= x -2e-302) (- z) (- (* x (- (log x) (log y))) z)))))

C

double code(double x, double y, double z) {
	double tmp;
	if (x <= -3.25e+237) {
		tmp = x * (log(-x) - log(-y));
	} else if (x <= -5.5e-179) {
		tmp = fma(log((x / y)), x, -z);
	} else if (x <= -2e-302) {
		tmp = -z;
	} else {
		tmp = (x * (log(x) - log(y))) - z;
	}
	return tmp;
}

Julia

function code(x, y, z)
	tmp = 0.0
	if (x <= -3.25e+237)
		tmp = Float64(x * Float64(log(Float64(-x)) - log(Float64(-y))));
	elseif (x <= -5.5e-179)
		tmp = fma(log(Float64(x / y)), x, Float64(-z));
	elseif (x <= -2e-302)
		tmp = Float64(-z);
	else
		tmp = Float64(Float64(x * Float64(log(x) - log(y))) - z);
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := If[LessEqual[x, -3.25e+237], N[(x * N[(N[Log[(-x)], $MachinePrecision] - N[Log[(-y)], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, -5.5e-179], N[(N[Log[N[(x / y), $MachinePrecision]], $MachinePrecision] * x + (-z)), $MachinePrecision], If[LessEqual[x, -2e-302], (-z), N[(N[(x * N[(N[Log[x], $MachinePrecision] - N[Log[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - z), $MachinePrecision]]]]

Derivation

1. Split input into 4 regimes

2. if x < -3.2499999999999999e237

   1. Initial program 61.4%

      \[x \cdot \log \left(\frac{x}{y}\right) - z \]

   2. Taylor expanded in z around 0 61.4%

      \[\leadsto \color{blue}{\log \left(\frac{x}{y}\right) \cdot x} \]
   3. Step-by-step derivation

      1. frac-2neg 61.4%

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

      2. log-div 92.2%

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

   4. Applied egg-rr 92.2%

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

   if -3.2499999999999999e237 < x < -5.5000000000000003e-179

   1. Initial program 96.2%

      \[x \cdot \log \left(\frac{x}{y}\right) - z \]
   2. Step-by-step derivation

      1. *-commutative 96.2%

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

      2. fma-neg 96.2%

         \[\leadsto \color{blue}{\mathsf{fma}\left(\log \left(\frac{x}{y}\right), x, -z\right)} \]

   3. Applied egg-rr 96.2%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\log \left(\frac{x}{y}\right), x, -z\right)} \]

   if -5.5000000000000003e-179 < x < -1.9999999999999999e-302

   1. Initial program 50.9%

      \[x \cdot \log \left(\frac{x}{y}\right) - z \]

   2. Taylor expanded in x around 0 85.3%

      \[\leadsto \color{blue}{-1 \cdot z} \]
   3. Step-by-step derivation

      1. neg-mul-1 85.3%

         \[\leadsto \color{blue}{-z} \]

   4. Simplified 85.3%

      \[\leadsto \color{blue}{-z} \]

   if -1.9999999999999999e-302 < x

   1. Initial program 79.2%

      \[x \cdot \log \left(\frac{x}{y}\right) - z \]
   2. Step-by-step derivation

      1. log-div 99.4%

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

   3. Applied egg-rr 99.4%

      \[\leadsto x \cdot \color{blue}{\left(\log x - \log y\right)} - z \]
3. Recombined 4 regimes into one program.

4. Final simplification 96.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -3.25 \cdot 10^{+237}:\\ \;\;\;\;x \cdot \left(\log \left(-x\right) - \log \left(-y\right)\right)\\ \mathbf{elif}\;x \leq -5.5 \cdot 10^{-179}:\\ \;\;\;\;\mathsf{fma}\left(\log \left(\frac{x}{y}\right), x, -z\right)\\ \mathbf{elif}\;x \leq -2 \cdot 10^{-302}:\\ \;\;\;\;-z\\ \mathbf{else}:\\ \;\;\;\;x \cdot \left(\log x - \log y\right) - z\\ \end{array} \]

Alternative 5: 99.5% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -5 \cdot 10^{-310}:\\ \;\;\;\;x \cdot \left(\log \left(-x\right) - \log \left(-y\right)\right) - z\\ \mathbf{else}:\\ \;\;\;\;x \cdot \left(\log x - \log y\right) - z\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= y -5e-310)
   (- (* x (- (log (- x)) (log (- y)))) z)
   (- (* x (- (log x) (log y))) z)))

C

double code(double x, double y, double z) {
	double tmp;
	if (y <= -5e-310) {
		tmp = (x * (log(-x) - log(-y))) - z;
	} else {
		tmp = (x * (log(x) - log(y))) - z;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if (y <= (-5d-310)) then
        tmp = (x * (log(-x) - log(-y))) - z
    else
        tmp = (x * (log(x) - log(y))) - z
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if (y <= -5e-310) {
		tmp = (x * (Math.log(-x) - Math.log(-y))) - z;
	} else {
		tmp = (x * (Math.log(x) - Math.log(y))) - z;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if y <= -5e-310:
		tmp = (x * (math.log(-x) - math.log(-y))) - z
	else:
		tmp = (x * (math.log(x) - math.log(y))) - z
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (y <= -5e-310)
		tmp = Float64(Float64(x * Float64(log(Float64(-x)) - log(Float64(-y)))) - z);
	else
		tmp = Float64(Float64(x * Float64(log(x) - log(y))) - z);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (y <= -5e-310)
		tmp = (x * (log(-x) - log(-y))) - z;
	else
		tmp = (x * (log(x) - log(y))) - z;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[y, -5e-310], N[(N[(x * N[(N[Log[(-x)], $MachinePrecision] - N[Log[(-y)], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - z), $MachinePrecision], N[(N[(x * N[(N[Log[x], $MachinePrecision] - N[Log[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - z), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -4.999999999999985e-310

   1. Initial program 82.1%

      \[x \cdot \log \left(\frac{x}{y}\right) - z \]
   2. Step-by-step derivation

      1. frac-2neg 43.6%

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

      2. log-div 48.9%

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

   3. Applied egg-rr 99.3%

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

   if -4.999999999999985e-310 < y

   1. Initial program 79.2%

      \[x \cdot \log \left(\frac{x}{y}\right) - z \]
   2. Step-by-step derivation

      1. log-div 99.4%

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

   3. Applied egg-rr 99.4%

      \[\leadsto x \cdot \color{blue}{\left(\log x - \log y\right)} - z \]
3. Recombined 2 regimes into one program.

4. Final simplification 99.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -5 \cdot 10^{-310}:\\ \;\;\;\;x \cdot \left(\log \left(-x\right) - \log \left(-y\right)\right) - z\\ \mathbf{else}:\\ \;\;\;\;x \cdot \left(\log x - \log y\right) - z\\ \end{array} \]

Alternative 6: 64.3% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -1.15 \cdot 10^{+146} \lor \neg \left(x \leq -1.26 \cdot 10^{+112}\right) \land \left(x \leq -1 \cdot 10^{-24} \lor \neg \left(x \leq 2.25 \cdot 10^{-55}\right)\right):\\ \;\;\;\;x \cdot \log \left(\frac{x}{y}\right)\\ \mathbf{else}:\\ \;\;\;\;-z\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= x -1.15e+146)
         (and (not (<= x -1.26e+112))
              (or (<= x -1e-24) (not (<= x 2.25e-55)))))
   (* x (log (/ x y)))
   (- z)))

C

double code(double x, double y, double z) {
	double tmp;
	if ((x <= -1.15e+146) || (!(x <= -1.26e+112) && ((x <= -1e-24) || !(x <= 2.25e-55)))) {
		tmp = x * log((x / y));
	} else {
		tmp = -z;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if ((x <= (-1.15d+146)) .or. (.not. (x <= (-1.26d+112))) .and. (x <= (-1d-24)) .or. (.not. (x <= 2.25d-55))) then
        tmp = x * log((x / y))
    else
        tmp = -z
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((x <= -1.15e+146) || (!(x <= -1.26e+112) && ((x <= -1e-24) || !(x <= 2.25e-55)))) {
		tmp = x * Math.log((x / y));
	} else {
		tmp = -z;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (x <= -1.15e+146) or (not (x <= -1.26e+112) and ((x <= -1e-24) or not (x <= 2.25e-55))):
		tmp = x * math.log((x / y))
	else:
		tmp = -z
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((x <= -1.15e+146) || (!(x <= -1.26e+112) && ((x <= -1e-24) || !(x <= 2.25e-55))))
		tmp = Float64(x * log(Float64(x / y)));
	else
		tmp = Float64(-z);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((x <= -1.15e+146) || (~((x <= -1.26e+112)) && ((x <= -1e-24) || ~((x <= 2.25e-55)))))
		tmp = x * log((x / y));
	else
		tmp = -z;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[x, -1.15e+146], And[N[Not[LessEqual[x, -1.26e+112]], $MachinePrecision], Or[LessEqual[x, -1e-24], N[Not[LessEqual[x, 2.25e-55]], $MachinePrecision]]]], N[(x * N[Log[N[(x / y), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], (-z)]

Derivation

1. Split input into 2 regimes

2. if x < -1.15e146 or -1.26e112 < x < -9.99999999999999924e-25 or 2.24999999999999985e-55 < x

   1. Initial program 83.9%

      \[x \cdot \log \left(\frac{x}{y}\right) - z \]

   2. Taylor expanded in z around 0 67.3%

      \[\leadsto \color{blue}{\log \left(\frac{x}{y}\right) \cdot x} \]

   if -1.15e146 < x < -1.26e112 or -9.99999999999999924e-25 < x < 2.24999999999999985e-55

   1. Initial program 77.5%

      \[x \cdot \log \left(\frac{x}{y}\right) - z \]

   2. Taylor expanded in x around 0 77.8%

      \[\leadsto \color{blue}{-1 \cdot z} \]
   3. Step-by-step derivation

      1. neg-mul-1 77.8%

         \[\leadsto \color{blue}{-z} \]

   4. Simplified 77.8%

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

4. Final simplification 72.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -1.15 \cdot 10^{+146} \lor \neg \left(x \leq -1.26 \cdot 10^{+112}\right) \land \left(x \leq -1 \cdot 10^{-24} \lor \neg \left(x \leq 2.25 \cdot 10^{-55}\right)\right):\\ \;\;\;\;x \cdot \log \left(\frac{x}{y}\right)\\ \mathbf{else}:\\ \;\;\;\;-z\\ \end{array} \]

Alternative 7: 48.9% accurate, 53.5× speedup

Math

\[\begin{array}{l} \\ -z \end{array} \]

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_] := (-z)

Derivation

1. Initial program 80.6%

   \[x \cdot \log \left(\frac{x}{y}\right) - z \]

2. Taylor expanded in x around 0 50.5%

   \[\leadsto \color{blue}{-1 \cdot z} \]
3. Step-by-step derivation

   1. neg-mul-1 50.5%

      \[\leadsto \color{blue}{-z} \]

4. Simplified 50.5%

   \[\leadsto \color{blue}{-z} \]

5. Final simplification 50.5%

   \[\leadsto -z \]

Developer target: 88.0% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y < 7.595077799083773 \cdot 10^{-308}:\\ \;\;\;\;x \cdot \log \left(\frac{x}{y}\right) - z\\ \mathbf{else}:\\ \;\;\;\;x \cdot \left(\log x - \log y\right) - z\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (< y 7.595077799083773e-308)
   (- (* x (log (/ x y))) z)
   (- (* x (- (log x) (log y))) z)))

C

double code(double x, double y, double z) {
	double tmp;
	if (y < 7.595077799083773e-308) {
		tmp = (x * log((x / y))) - z;
	} else {
		tmp = (x * (log(x) - log(y))) - z;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if (y < 7.595077799083773d-308) then
        tmp = (x * log((x / y))) - z
    else
        tmp = (x * (log(x) - log(y))) - z
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if (y < 7.595077799083773e-308) {
		tmp = (x * Math.log((x / y))) - z;
	} else {
		tmp = (x * (Math.log(x) - Math.log(y))) - z;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if y < 7.595077799083773e-308:
		tmp = (x * math.log((x / y))) - z
	else:
		tmp = (x * (math.log(x) - math.log(y))) - z
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (y < 7.595077799083773e-308)
		tmp = Float64(Float64(x * log(Float64(x / y))) - z);
	else
		tmp = Float64(Float64(x * Float64(log(x) - log(y))) - z);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (y < 7.595077799083773e-308)
		tmp = (x * log((x / y))) - z;
	else
		tmp = (x * (log(x) - log(y))) - z;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Less[y, 7.595077799083773e-308], N[(N[(x * N[Log[N[(x / y), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] - z), $MachinePrecision], N[(N[(x * N[(N[Log[x], $MachinePrecision] - N[Log[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - z), $MachinePrecision]]

Reproduce

herbie shell --seed 2023238 
(FPCore (x y z)
  :name "Numeric.SpecFunctions.Extra:bd0 from math-functions-0.1.5.2"
  :precision binary64

  :herbie-target
  (if (< y 7.595077799083773e-308) (- (* x (log (/ x y))) z) (- (* x (- (log x) (log y))) z))

  (- (* x (log (/ x y))) z))