Jmat.Real.lambertw, newton loop step

Percentage Accurate: 77.6% → 97.8%

Time: 7.9s

Alternatives: 7

Speedup: 313.0×

• could not determine a ground truth

  1. wj = -2.783343961200709e+149
  2. x = 1.3949503585562509e-127

Specification

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := wj \cdot e^{wj}\\ wj - \frac{t_0 - x}{e^{wj} + t_0} \end{array} \end{array} \]

FPCore

(FPCore (wj x)
 :precision binary64
 (let* ((t_0 (* wj (exp wj)))) (- wj (/ (- t_0 x) (+ (exp wj) t_0)))))

C

double code(double wj, double x) {
	double t_0 = wj * exp(wj);
	return wj - ((t_0 - x) / (exp(wj) + t_0));
}

Fortran

real(8) function code(wj, x)
    real(8), intent (in) :: wj
    real(8), intent (in) :: x
    real(8) :: t_0
    t_0 = wj * exp(wj)
    code = wj - ((t_0 - x) / (exp(wj) + t_0))
end function

Java

public static double code(double wj, double x) {
	double t_0 = wj * Math.exp(wj);
	return wj - ((t_0 - x) / (Math.exp(wj) + t_0));
}

Python

def code(wj, x):
	t_0 = wj * math.exp(wj)
	return wj - ((t_0 - x) / (math.exp(wj) + t_0))

Julia

function code(wj, x)
	t_0 = Float64(wj * exp(wj))
	return Float64(wj - Float64(Float64(t_0 - x) / Float64(exp(wj) + t_0)))
end

MATLAB

function tmp = code(wj, x)
	t_0 = wj * exp(wj);
	tmp = wj - ((t_0 - x) / (exp(wj) + t_0));
end

Wolfram

code[wj_, x_] := Block[{t$95$0 = N[(wj * N[Exp[wj], $MachinePrecision]), $MachinePrecision]}, N[(wj - N[(N[(t$95$0 - x), $MachinePrecision] / N[(N[Exp[wj], $MachinePrecision] + t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Initial Program: 77.6% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := wj \cdot e^{wj}\\ wj - \frac{t_0 - x}{e^{wj} + t_0} \end{array} \end{array} \]

FPCore

(FPCore (wj x)
 :precision binary64
 (let* ((t_0 (* wj (exp wj)))) (- wj (/ (- t_0 x) (+ (exp wj) t_0)))))

C

double code(double wj, double x) {
	double t_0 = wj * exp(wj);
	return wj - ((t_0 - x) / (exp(wj) + t_0));
}

Fortran

real(8) function code(wj, x)
    real(8), intent (in) :: wj
    real(8), intent (in) :: x
    real(8) :: t_0
    t_0 = wj * exp(wj)
    code = wj - ((t_0 - x) / (exp(wj) + t_0))
end function

Java

public static double code(double wj, double x) {
	double t_0 = wj * Math.exp(wj);
	return wj - ((t_0 - x) / (Math.exp(wj) + t_0));
}

Python

def code(wj, x):
	t_0 = wj * math.exp(wj)
	return wj - ((t_0 - x) / (math.exp(wj) + t_0))

Julia

function code(wj, x)
	t_0 = Float64(wj * exp(wj))
	return Float64(wj - Float64(Float64(t_0 - x) / Float64(exp(wj) + t_0)))
end

MATLAB

function tmp = code(wj, x)
	t_0 = wj * exp(wj);
	tmp = wj - ((t_0 - x) / (exp(wj) + t_0));
end

Wolfram

code[wj_, x_] := Block[{t$95$0 = N[(wj * N[Exp[wj], $MachinePrecision]), $MachinePrecision]}, N[(wj - N[(N[(t$95$0 - x), $MachinePrecision] / N[(N[Exp[wj], $MachinePrecision] + t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Alternative 1: 97.8% accurate, 2.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;wj \leq 1.1 \cdot 10^{-13}:\\ \;\;\;\;\left(1 - \left(x \cdot -4 + x \cdot 1.5\right)\right) \cdot {wj}^{2} + \left(x + -2 \cdot \left(x \cdot wj\right)\right)\\ \mathbf{else}:\\ \;\;\;\;wj + \frac{\frac{x}{e^{wj}} - wj}{1 + wj}\\ \end{array} \end{array} \]

FPCore

(FPCore (wj x)
 :precision binary64
 (if (<= wj 1.1e-13)
   (+
    (* (- 1.0 (+ (* x -4.0) (* x 1.5))) (pow wj 2.0))
    (+ x (* -2.0 (* x wj))))
   (+ wj (/ (- (/ x (exp wj)) wj) (+ 1.0 wj)))))

C

double code(double wj, double x) {
	double tmp;
	if (wj <= 1.1e-13) {
		tmp = ((1.0 - ((x * -4.0) + (x * 1.5))) * pow(wj, 2.0)) + (x + (-2.0 * (x * wj)));
	} else {
		tmp = wj + (((x / exp(wj)) - wj) / (1.0 + wj));
	}
	return tmp;
}

Fortran

real(8) function code(wj, x)
    real(8), intent (in) :: wj
    real(8), intent (in) :: x
    real(8) :: tmp
    if (wj <= 1.1d-13) then
        tmp = ((1.0d0 - ((x * (-4.0d0)) + (x * 1.5d0))) * (wj ** 2.0d0)) + (x + ((-2.0d0) * (x * wj)))
    else
        tmp = wj + (((x / exp(wj)) - wj) / (1.0d0 + wj))
    end if
    code = tmp
end function

Java

public static double code(double wj, double x) {
	double tmp;
	if (wj <= 1.1e-13) {
		tmp = ((1.0 - ((x * -4.0) + (x * 1.5))) * Math.pow(wj, 2.0)) + (x + (-2.0 * (x * wj)));
	} else {
		tmp = wj + (((x / Math.exp(wj)) - wj) / (1.0 + wj));
	}
	return tmp;
}

Python

def code(wj, x):
	tmp = 0
	if wj <= 1.1e-13:
		tmp = ((1.0 - ((x * -4.0) + (x * 1.5))) * math.pow(wj, 2.0)) + (x + (-2.0 * (x * wj)))
	else:
		tmp = wj + (((x / math.exp(wj)) - wj) / (1.0 + wj))
	return tmp

Julia

function code(wj, x)
	tmp = 0.0
	if (wj <= 1.1e-13)
		tmp = Float64(Float64(Float64(1.0 - Float64(Float64(x * -4.0) + Float64(x * 1.5))) * (wj ^ 2.0)) + Float64(x + Float64(-2.0 * Float64(x * wj))));
	else
		tmp = Float64(wj + Float64(Float64(Float64(x / exp(wj)) - wj) / Float64(1.0 + wj)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(wj, x)
	tmp = 0.0;
	if (wj <= 1.1e-13)
		tmp = ((1.0 - ((x * -4.0) + (x * 1.5))) * (wj ^ 2.0)) + (x + (-2.0 * (x * wj)));
	else
		tmp = wj + (((x / exp(wj)) - wj) / (1.0 + wj));
	end
	tmp_2 = tmp;
end

Wolfram

code[wj_, x_] := If[LessEqual[wj, 1.1e-13], N[(N[(N[(1.0 - N[(N[(x * -4.0), $MachinePrecision] + N[(x * 1.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[Power[wj, 2.0], $MachinePrecision]), $MachinePrecision] + N[(x + N[(-2.0 * N[(x * wj), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(wj + N[(N[(N[(x / N[Exp[wj], $MachinePrecision]), $MachinePrecision] - wj), $MachinePrecision] / N[(1.0 + wj), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if wj < 1.09999999999999998e-13

   1. Initial program 80.1%

      \[wj - \frac{wj \cdot e^{wj} - x}{e^{wj} + wj \cdot e^{wj}} \]
   2. Step-by-step derivation

      1. sub-neg 80.1%

         \[\leadsto \color{blue}{wj + \left(-\frac{wj \cdot e^{wj} - x}{e^{wj} + wj \cdot e^{wj}}\right)} \]

      2. div-sub 80.1%

         \[\leadsto wj + \left(-\color{blue}{\left(\frac{wj \cdot e^{wj}}{e^{wj} + wj \cdot e^{wj}} - \frac{x}{e^{wj} + wj \cdot e^{wj}}\right)}\right) \]

      3. sub-neg 80.1%

         \[\leadsto wj + \left(-\color{blue}{\left(\frac{wj \cdot e^{wj}}{e^{wj} + wj \cdot e^{wj}} + \left(-\frac{x}{e^{wj} + wj \cdot e^{wj}}\right)\right)}\right) \]

      4. +-commutative 80.1%

         \[\leadsto wj + \left(-\color{blue}{\left(\left(-\frac{x}{e^{wj} + wj \cdot e^{wj}}\right) + \frac{wj \cdot e^{wj}}{e^{wj} + wj \cdot e^{wj}}\right)}\right) \]

      5. distribute-neg-in 80.1%

         \[\leadsto wj + \color{blue}{\left(\left(-\left(-\frac{x}{e^{wj} + wj \cdot e^{wj}}\right)\right) + \left(-\frac{wj \cdot e^{wj}}{e^{wj} + wj \cdot e^{wj}}\right)\right)} \]

      6. remove-double-neg 80.1%

         \[\leadsto wj + \left(\color{blue}{\frac{x}{e^{wj} + wj \cdot e^{wj}}} + \left(-\frac{wj \cdot e^{wj}}{e^{wj} + wj \cdot e^{wj}}\right)\right) \]

      7. sub-neg 80.1%

         \[\leadsto wj + \color{blue}{\left(\frac{x}{e^{wj} + wj \cdot e^{wj}} - \frac{wj \cdot e^{wj}}{e^{wj} + wj \cdot e^{wj}}\right)} \]

      8. div-sub 80.1%

         \[\leadsto wj + \color{blue}{\frac{x - wj \cdot e^{wj}}{e^{wj} + wj \cdot e^{wj}}} \]

      9. distribute-rgt1-in 81.4%

         \[\leadsto wj + \frac{x - wj \cdot e^{wj}}{\color{blue}{\left(wj + 1\right) \cdot e^{wj}}} \]

      10. associate-/l/ 81.4%

          \[\leadsto wj + \color{blue}{\frac{\frac{x - wj \cdot e^{wj}}{e^{wj}}}{wj + 1}} \]

   3. Simplified 81.4%

      \[\leadsto \color{blue}{wj + \frac{\frac{x}{e^{wj}} - wj}{wj + 1}} \]

   4. Taylor expanded in wj around 0 98.5%

      \[\leadsto \color{blue}{\left(1 - \left(-4 \cdot x + 1.5 \cdot x\right)\right) \cdot {wj}^{2} + \left(-2 \cdot \left(wj \cdot x\right) + x\right)} \]

   if 1.09999999999999998e-13 < wj

   1. Initial program 87.3%

      \[wj - \frac{wj \cdot e^{wj} - x}{e^{wj} + wj \cdot e^{wj}} \]
   2. Step-by-step derivation

      1. sub-neg 87.3%

         \[\leadsto \color{blue}{wj + \left(-\frac{wj \cdot e^{wj} - x}{e^{wj} + wj \cdot e^{wj}}\right)} \]

      2. div-sub 87.3%

         \[\leadsto wj + \left(-\color{blue}{\left(\frac{wj \cdot e^{wj}}{e^{wj} + wj \cdot e^{wj}} - \frac{x}{e^{wj} + wj \cdot e^{wj}}\right)}\right) \]

      3. sub-neg 87.3%

         \[\leadsto wj + \left(-\color{blue}{\left(\frac{wj \cdot e^{wj}}{e^{wj} + wj \cdot e^{wj}} + \left(-\frac{x}{e^{wj} + wj \cdot e^{wj}}\right)\right)}\right) \]

      4. +-commutative 87.3%

         \[\leadsto wj + \left(-\color{blue}{\left(\left(-\frac{x}{e^{wj} + wj \cdot e^{wj}}\right) + \frac{wj \cdot e^{wj}}{e^{wj} + wj \cdot e^{wj}}\right)}\right) \]

      5. distribute-neg-in 87.3%

         \[\leadsto wj + \color{blue}{\left(\left(-\left(-\frac{x}{e^{wj} + wj \cdot e^{wj}}\right)\right) + \left(-\frac{wj \cdot e^{wj}}{e^{wj} + wj \cdot e^{wj}}\right)\right)} \]

      6. remove-double-neg 87.3%

         \[\leadsto wj + \left(\color{blue}{\frac{x}{e^{wj} + wj \cdot e^{wj}}} + \left(-\frac{wj \cdot e^{wj}}{e^{wj} + wj \cdot e^{wj}}\right)\right) \]

      7. sub-neg 87.3%

         \[\leadsto wj + \color{blue}{\left(\frac{x}{e^{wj} + wj \cdot e^{wj}} - \frac{wj \cdot e^{wj}}{e^{wj} + wj \cdot e^{wj}}\right)} \]

      8. div-sub 87.3%

         \[\leadsto wj + \color{blue}{\frac{x - wj \cdot e^{wj}}{e^{wj} + wj \cdot e^{wj}}} \]

      9. distribute-rgt1-in 87.9%

         \[\leadsto wj + \frac{x - wj \cdot e^{wj}}{\color{blue}{\left(wj + 1\right) \cdot e^{wj}}} \]

      10. associate-/l/ 87.9%

          \[\leadsto wj + \color{blue}{\frac{\frac{x - wj \cdot e^{wj}}{e^{wj}}}{wj + 1}} \]

   3. Simplified 99.0%

      \[\leadsto \color{blue}{wj + \frac{\frac{x}{e^{wj}} - wj}{wj + 1}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 98.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;wj \leq 1.1 \cdot 10^{-13}:\\ \;\;\;\;\left(1 - \left(x \cdot -4 + x \cdot 1.5\right)\right) \cdot {wj}^{2} + \left(x + -2 \cdot \left(x \cdot wj\right)\right)\\ \mathbf{else}:\\ \;\;\;\;wj + \frac{\frac{x}{e^{wj}} - wj}{1 + wj}\\ \end{array} \]

Alternative 2: 96.5% accurate, 1.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := x \cdot -4 + x \cdot 1.5\\ {wj}^{3} \cdot \left(\left(\left(-1 - -2 \cdot t_0\right) - x \cdot -3\right) - 0.6666666666666666 \cdot x\right) + \left(\left(1 - t_0\right) \cdot {wj}^{2} + \left(x + -2 \cdot \left(x \cdot wj\right)\right)\right) \end{array} \end{array} \]

FPCore

(FPCore (wj x)
 :precision binary64
 (let* ((t_0 (+ (* x -4.0) (* x 1.5))))
   (+
    (*
     (pow wj 3.0)
     (- (- (- -1.0 (* -2.0 t_0)) (* x -3.0)) (* 0.6666666666666666 x)))
    (+ (* (- 1.0 t_0) (pow wj 2.0)) (+ x (* -2.0 (* x wj)))))))

C

double code(double wj, double x) {
	double t_0 = (x * -4.0) + (x * 1.5);
	return (pow(wj, 3.0) * (((-1.0 - (-2.0 * t_0)) - (x * -3.0)) - (0.6666666666666666 * x))) + (((1.0 - t_0) * pow(wj, 2.0)) + (x + (-2.0 * (x * wj))));
}

Fortran

real(8) function code(wj, x)
    real(8), intent (in) :: wj
    real(8), intent (in) :: x
    real(8) :: t_0
    t_0 = (x * (-4.0d0)) + (x * 1.5d0)
    code = ((wj ** 3.0d0) * ((((-1.0d0) - ((-2.0d0) * t_0)) - (x * (-3.0d0))) - (0.6666666666666666d0 * x))) + (((1.0d0 - t_0) * (wj ** 2.0d0)) + (x + ((-2.0d0) * (x * wj))))
end function

Java

public static double code(double wj, double x) {
	double t_0 = (x * -4.0) + (x * 1.5);
	return (Math.pow(wj, 3.0) * (((-1.0 - (-2.0 * t_0)) - (x * -3.0)) - (0.6666666666666666 * x))) + (((1.0 - t_0) * Math.pow(wj, 2.0)) + (x + (-2.0 * (x * wj))));
}

Python

def code(wj, x):
	t_0 = (x * -4.0) + (x * 1.5)
	return (math.pow(wj, 3.0) * (((-1.0 - (-2.0 * t_0)) - (x * -3.0)) - (0.6666666666666666 * x))) + (((1.0 - t_0) * math.pow(wj, 2.0)) + (x + (-2.0 * (x * wj))))

Julia

function code(wj, x)
	t_0 = Float64(Float64(x * -4.0) + Float64(x * 1.5))
	return Float64(Float64((wj ^ 3.0) * Float64(Float64(Float64(-1.0 - Float64(-2.0 * t_0)) - Float64(x * -3.0)) - Float64(0.6666666666666666 * x))) + Float64(Float64(Float64(1.0 - t_0) * (wj ^ 2.0)) + Float64(x + Float64(-2.0 * Float64(x * wj)))))
end

MATLAB

function tmp = code(wj, x)
	t_0 = (x * -4.0) + (x * 1.5);
	tmp = ((wj ^ 3.0) * (((-1.0 - (-2.0 * t_0)) - (x * -3.0)) - (0.6666666666666666 * x))) + (((1.0 - t_0) * (wj ^ 2.0)) + (x + (-2.0 * (x * wj))));
end

Wolfram

code[wj_, x_] := Block[{t$95$0 = N[(N[(x * -4.0), $MachinePrecision] + N[(x * 1.5), $MachinePrecision]), $MachinePrecision]}, N[(N[(N[Power[wj, 3.0], $MachinePrecision] * N[(N[(N[(-1.0 - N[(-2.0 * t$95$0), $MachinePrecision]), $MachinePrecision] - N[(x * -3.0), $MachinePrecision]), $MachinePrecision] - N[(0.6666666666666666 * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[(N[(1.0 - t$95$0), $MachinePrecision] * N[Power[wj, 2.0], $MachinePrecision]), $MachinePrecision] + N[(x + N[(-2.0 * N[(x * wj), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Initial program 80.4%

   \[wj - \frac{wj \cdot e^{wj} - x}{e^{wj} + wj \cdot e^{wj}} \]
2. Step-by-step derivation

   1. sub-neg 80.4%

      \[\leadsto \color{blue}{wj + \left(-\frac{wj \cdot e^{wj} - x}{e^{wj} + wj \cdot e^{wj}}\right)} \]

   2. div-sub 80.4%

      \[\leadsto wj + \left(-\color{blue}{\left(\frac{wj \cdot e^{wj}}{e^{wj} + wj \cdot e^{wj}} - \frac{x}{e^{wj} + wj \cdot e^{wj}}\right)}\right) \]

   3. sub-neg 80.4%

      \[\leadsto wj + \left(-\color{blue}{\left(\frac{wj \cdot e^{wj}}{e^{wj} + wj \cdot e^{wj}} + \left(-\frac{x}{e^{wj} + wj \cdot e^{wj}}\right)\right)}\right) \]

   4. +-commutative 80.4%

      \[\leadsto wj + \left(-\color{blue}{\left(\left(-\frac{x}{e^{wj} + wj \cdot e^{wj}}\right) + \frac{wj \cdot e^{wj}}{e^{wj} + wj \cdot e^{wj}}\right)}\right) \]

   5. distribute-neg-in 80.4%

      \[\leadsto wj + \color{blue}{\left(\left(-\left(-\frac{x}{e^{wj} + wj \cdot e^{wj}}\right)\right) + \left(-\frac{wj \cdot e^{wj}}{e^{wj} + wj \cdot e^{wj}}\right)\right)} \]

   6. remove-double-neg 80.4%

      \[\leadsto wj + \left(\color{blue}{\frac{x}{e^{wj} + wj \cdot e^{wj}}} + \left(-\frac{wj \cdot e^{wj}}{e^{wj} + wj \cdot e^{wj}}\right)\right) \]

   7. sub-neg 80.4%

      \[\leadsto wj + \color{blue}{\left(\frac{x}{e^{wj} + wj \cdot e^{wj}} - \frac{wj \cdot e^{wj}}{e^{wj} + wj \cdot e^{wj}}\right)} \]

   8. div-sub 80.4%

      \[\leadsto wj + \color{blue}{\frac{x - wj \cdot e^{wj}}{e^{wj} + wj \cdot e^{wj}}} \]

   9. distribute-rgt1-in 81.6%

      \[\leadsto wj + \frac{x - wj \cdot e^{wj}}{\color{blue}{\left(wj + 1\right) \cdot e^{wj}}} \]

   10. associate-/l/ 81.6%

       \[\leadsto wj + \color{blue}{\frac{\frac{x - wj \cdot e^{wj}}{e^{wj}}}{wj + 1}} \]

3. Simplified 82.0%

   \[\leadsto \color{blue}{wj + \frac{\frac{x}{e^{wj}} - wj}{wj + 1}} \]

4. Taylor expanded in wj around 0 97.1%

   \[\leadsto \color{blue}{-1 \cdot \left(\left(0.6666666666666666 \cdot x + \left(-3 \cdot x + \left(1 + -2 \cdot \left(-4 \cdot x + 1.5 \cdot x\right)\right)\right)\right) \cdot {wj}^{3}\right) + \left(\left(1 - \left(-4 \cdot x + 1.5 \cdot x\right)\right) \cdot {wj}^{2} + \left(-2 \cdot \left(wj \cdot x\right) + x\right)\right)} \]

5. Final simplification 97.1%

   \[\leadsto {wj}^{3} \cdot \left(\left(\left(-1 - -2 \cdot \left(x \cdot -4 + x \cdot 1.5\right)\right) - x \cdot -3\right) - 0.6666666666666666 \cdot x\right) + \left(\left(1 - \left(x \cdot -4 + x \cdot 1.5\right)\right) \cdot {wj}^{2} + \left(x + -2 \cdot \left(x \cdot wj\right)\right)\right) \]

Alternative 3: 97.7% accurate, 2.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;wj \leq 1.1 \cdot 10^{-13}:\\ \;\;\;\;\left(x + -2 \cdot \left(x \cdot wj\right)\right) + wj \cdot wj\\ \mathbf{else}:\\ \;\;\;\;wj + \frac{\frac{x}{e^{wj}} - wj}{1 + wj}\\ \end{array} \end{array} \]

FPCore

(FPCore (wj x)
 :precision binary64
 (if (<= wj 1.1e-13)
   (+ (+ x (* -2.0 (* x wj))) (* wj wj))
   (+ wj (/ (- (/ x (exp wj)) wj) (+ 1.0 wj)))))

C

double code(double wj, double x) {
	double tmp;
	if (wj <= 1.1e-13) {
		tmp = (x + (-2.0 * (x * wj))) + (wj * wj);
	} else {
		tmp = wj + (((x / exp(wj)) - wj) / (1.0 + wj));
	}
	return tmp;
}

Fortran

real(8) function code(wj, x)
    real(8), intent (in) :: wj
    real(8), intent (in) :: x
    real(8) :: tmp
    if (wj <= 1.1d-13) then
        tmp = (x + ((-2.0d0) * (x * wj))) + (wj * wj)
    else
        tmp = wj + (((x / exp(wj)) - wj) / (1.0d0 + wj))
    end if
    code = tmp
end function

Java

public static double code(double wj, double x) {
	double tmp;
	if (wj <= 1.1e-13) {
		tmp = (x + (-2.0 * (x * wj))) + (wj * wj);
	} else {
		tmp = wj + (((x / Math.exp(wj)) - wj) / (1.0 + wj));
	}
	return tmp;
}

Python

def code(wj, x):
	tmp = 0
	if wj <= 1.1e-13:
		tmp = (x + (-2.0 * (x * wj))) + (wj * wj)
	else:
		tmp = wj + (((x / math.exp(wj)) - wj) / (1.0 + wj))
	return tmp

Julia

function code(wj, x)
	tmp = 0.0
	if (wj <= 1.1e-13)
		tmp = Float64(Float64(x + Float64(-2.0 * Float64(x * wj))) + Float64(wj * wj));
	else
		tmp = Float64(wj + Float64(Float64(Float64(x / exp(wj)) - wj) / Float64(1.0 + wj)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(wj, x)
	tmp = 0.0;
	if (wj <= 1.1e-13)
		tmp = (x + (-2.0 * (x * wj))) + (wj * wj);
	else
		tmp = wj + (((x / exp(wj)) - wj) / (1.0 + wj));
	end
	tmp_2 = tmp;
end

Wolfram

code[wj_, x_] := If[LessEqual[wj, 1.1e-13], N[(N[(x + N[(-2.0 * N[(x * wj), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(wj * wj), $MachinePrecision]), $MachinePrecision], N[(wj + N[(N[(N[(x / N[Exp[wj], $MachinePrecision]), $MachinePrecision] - wj), $MachinePrecision] / N[(1.0 + wj), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if wj < 1.09999999999999998e-13

   1. Initial program 80.1%

      \[wj - \frac{wj \cdot e^{wj} - x}{e^{wj} + wj \cdot e^{wj}} \]
   2. Step-by-step derivation

      1. sub-neg 80.1%

         \[\leadsto \color{blue}{wj + \left(-\frac{wj \cdot e^{wj} - x}{e^{wj} + wj \cdot e^{wj}}\right)} \]

      2. div-sub 80.1%

         \[\leadsto wj + \left(-\color{blue}{\left(\frac{wj \cdot e^{wj}}{e^{wj} + wj \cdot e^{wj}} - \frac{x}{e^{wj} + wj \cdot e^{wj}}\right)}\right) \]

      3. sub-neg 80.1%

         \[\leadsto wj + \left(-\color{blue}{\left(\frac{wj \cdot e^{wj}}{e^{wj} + wj \cdot e^{wj}} + \left(-\frac{x}{e^{wj} + wj \cdot e^{wj}}\right)\right)}\right) \]

      4. +-commutative 80.1%

         \[\leadsto wj + \left(-\color{blue}{\left(\left(-\frac{x}{e^{wj} + wj \cdot e^{wj}}\right) + \frac{wj \cdot e^{wj}}{e^{wj} + wj \cdot e^{wj}}\right)}\right) \]

      5. distribute-neg-in 80.1%

         \[\leadsto wj + \color{blue}{\left(\left(-\left(-\frac{x}{e^{wj} + wj \cdot e^{wj}}\right)\right) + \left(-\frac{wj \cdot e^{wj}}{e^{wj} + wj \cdot e^{wj}}\right)\right)} \]

      6. remove-double-neg 80.1%

         \[\leadsto wj + \left(\color{blue}{\frac{x}{e^{wj} + wj \cdot e^{wj}}} + \left(-\frac{wj \cdot e^{wj}}{e^{wj} + wj \cdot e^{wj}}\right)\right) \]

      7. sub-neg 80.1%

         \[\leadsto wj + \color{blue}{\left(\frac{x}{e^{wj} + wj \cdot e^{wj}} - \frac{wj \cdot e^{wj}}{e^{wj} + wj \cdot e^{wj}}\right)} \]

      8. div-sub 80.1%

         \[\leadsto wj + \color{blue}{\frac{x - wj \cdot e^{wj}}{e^{wj} + wj \cdot e^{wj}}} \]

      9. distribute-rgt1-in 81.4%

         \[\leadsto wj + \frac{x - wj \cdot e^{wj}}{\color{blue}{\left(wj + 1\right) \cdot e^{wj}}} \]

      10. associate-/l/ 81.4%

          \[\leadsto wj + \color{blue}{\frac{\frac{x - wj \cdot e^{wj}}{e^{wj}}}{wj + 1}} \]

   3. Simplified 81.4%

      \[\leadsto \color{blue}{wj + \frac{\frac{x}{e^{wj}} - wj}{wj + 1}} \]

   4. Taylor expanded in wj around 0 98.5%

      \[\leadsto \color{blue}{\left(1 - \left(-4 \cdot x + 1.5 \cdot x\right)\right) \cdot {wj}^{2} + \left(-2 \cdot \left(wj \cdot x\right) + x\right)} \]

   5. Taylor expanded in x around 0 98.4%

      \[\leadsto \color{blue}{{wj}^{2}} + \left(-2 \cdot \left(wj \cdot x\right) + x\right) \]
   6. Step-by-step derivation

      1. unpow2 98.4%

         \[\leadsto \color{blue}{wj \cdot wj} + \left(-2 \cdot \left(wj \cdot x\right) + x\right) \]

   7. Simplified 98.4%

      \[\leadsto \color{blue}{wj \cdot wj} + \left(-2 \cdot \left(wj \cdot x\right) + x\right) \]

   if 1.09999999999999998e-13 < wj

   1. Initial program 87.3%

      \[wj - \frac{wj \cdot e^{wj} - x}{e^{wj} + wj \cdot e^{wj}} \]
   2. Step-by-step derivation

      1. sub-neg 87.3%

         \[\leadsto \color{blue}{wj + \left(-\frac{wj \cdot e^{wj} - x}{e^{wj} + wj \cdot e^{wj}}\right)} \]

      2. div-sub 87.3%

         \[\leadsto wj + \left(-\color{blue}{\left(\frac{wj \cdot e^{wj}}{e^{wj} + wj \cdot e^{wj}} - \frac{x}{e^{wj} + wj \cdot e^{wj}}\right)}\right) \]

      3. sub-neg 87.3%

         \[\leadsto wj + \left(-\color{blue}{\left(\frac{wj \cdot e^{wj}}{e^{wj} + wj \cdot e^{wj}} + \left(-\frac{x}{e^{wj} + wj \cdot e^{wj}}\right)\right)}\right) \]

      4. +-commutative 87.3%

         \[\leadsto wj + \left(-\color{blue}{\left(\left(-\frac{x}{e^{wj} + wj \cdot e^{wj}}\right) + \frac{wj \cdot e^{wj}}{e^{wj} + wj \cdot e^{wj}}\right)}\right) \]

      5. distribute-neg-in 87.3%

         \[\leadsto wj + \color{blue}{\left(\left(-\left(-\frac{x}{e^{wj} + wj \cdot e^{wj}}\right)\right) + \left(-\frac{wj \cdot e^{wj}}{e^{wj} + wj \cdot e^{wj}}\right)\right)} \]

      6. remove-double-neg 87.3%

         \[\leadsto wj + \left(\color{blue}{\frac{x}{e^{wj} + wj \cdot e^{wj}}} + \left(-\frac{wj \cdot e^{wj}}{e^{wj} + wj \cdot e^{wj}}\right)\right) \]

      7. sub-neg 87.3%

         \[\leadsto wj + \color{blue}{\left(\frac{x}{e^{wj} + wj \cdot e^{wj}} - \frac{wj \cdot e^{wj}}{e^{wj} + wj \cdot e^{wj}}\right)} \]

      8. div-sub 87.3%

         \[\leadsto wj + \color{blue}{\frac{x - wj \cdot e^{wj}}{e^{wj} + wj \cdot e^{wj}}} \]

      9. distribute-rgt1-in 87.9%

         \[\leadsto wj + \frac{x - wj \cdot e^{wj}}{\color{blue}{\left(wj + 1\right) \cdot e^{wj}}} \]

      10. associate-/l/ 87.9%

          \[\leadsto wj + \color{blue}{\frac{\frac{x - wj \cdot e^{wj}}{e^{wj}}}{wj + 1}} \]

   3. Simplified 99.0%

      \[\leadsto \color{blue}{wj + \frac{\frac{x}{e^{wj}} - wj}{wj + 1}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 98.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;wj \leq 1.1 \cdot 10^{-13}:\\ \;\;\;\;\left(x + -2 \cdot \left(x \cdot wj\right)\right) + wj \cdot wj\\ \mathbf{else}:\\ \;\;\;\;wj + \frac{\frac{x}{e^{wj}} - wj}{1 + wj}\\ \end{array} \]

Alternative 4: 95.9% accurate, 28.5× speedup

Math

\[\begin{array}{l} \\ \left(x + -2 \cdot \left(x \cdot wj\right)\right) + wj \cdot wj \end{array} \]

FPCore

(FPCore (wj x) :precision binary64 (+ (+ x (* -2.0 (* x wj))) (* wj wj)))

C

double code(double wj, double x) {
	return (x + (-2.0 * (x * wj))) + (wj * wj);
}

Fortran

real(8) function code(wj, x)
    real(8), intent (in) :: wj
    real(8), intent (in) :: x
    code = (x + ((-2.0d0) * (x * wj))) + (wj * wj)
end function

Java

public static double code(double wj, double x) {
	return (x + (-2.0 * (x * wj))) + (wj * wj);
}

Python

def code(wj, x):
	return (x + (-2.0 * (x * wj))) + (wj * wj)

Julia

function code(wj, x)
	return Float64(Float64(x + Float64(-2.0 * Float64(x * wj))) + Float64(wj * wj))
end

MATLAB

function tmp = code(wj, x)
	tmp = (x + (-2.0 * (x * wj))) + (wj * wj);
end

Wolfram

code[wj_, x_] := N[(N[(x + N[(-2.0 * N[(x * wj), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(wj * wj), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 80.4%

   \[wj - \frac{wj \cdot e^{wj} - x}{e^{wj} + wj \cdot e^{wj}} \]
2. Step-by-step derivation

   1. sub-neg 80.4%

      \[\leadsto \color{blue}{wj + \left(-\frac{wj \cdot e^{wj} - x}{e^{wj} + wj \cdot e^{wj}}\right)} \]

   2. div-sub 80.4%

      \[\leadsto wj + \left(-\color{blue}{\left(\frac{wj \cdot e^{wj}}{e^{wj} + wj \cdot e^{wj}} - \frac{x}{e^{wj} + wj \cdot e^{wj}}\right)}\right) \]

   3. sub-neg 80.4%

      \[\leadsto wj + \left(-\color{blue}{\left(\frac{wj \cdot e^{wj}}{e^{wj} + wj \cdot e^{wj}} + \left(-\frac{x}{e^{wj} + wj \cdot e^{wj}}\right)\right)}\right) \]

   4. +-commutative 80.4%

      \[\leadsto wj + \left(-\color{blue}{\left(\left(-\frac{x}{e^{wj} + wj \cdot e^{wj}}\right) + \frac{wj \cdot e^{wj}}{e^{wj} + wj \cdot e^{wj}}\right)}\right) \]

   5. distribute-neg-in 80.4%

      \[\leadsto wj + \color{blue}{\left(\left(-\left(-\frac{x}{e^{wj} + wj \cdot e^{wj}}\right)\right) + \left(-\frac{wj \cdot e^{wj}}{e^{wj} + wj \cdot e^{wj}}\right)\right)} \]

   6. remove-double-neg 80.4%

      \[\leadsto wj + \left(\color{blue}{\frac{x}{e^{wj} + wj \cdot e^{wj}}} + \left(-\frac{wj \cdot e^{wj}}{e^{wj} + wj \cdot e^{wj}}\right)\right) \]

   7. sub-neg 80.4%

      \[\leadsto wj + \color{blue}{\left(\frac{x}{e^{wj} + wj \cdot e^{wj}} - \frac{wj \cdot e^{wj}}{e^{wj} + wj \cdot e^{wj}}\right)} \]

   8. div-sub 80.4%

      \[\leadsto wj + \color{blue}{\frac{x - wj \cdot e^{wj}}{e^{wj} + wj \cdot e^{wj}}} \]

   9. distribute-rgt1-in 81.6%

      \[\leadsto wj + \frac{x - wj \cdot e^{wj}}{\color{blue}{\left(wj + 1\right) \cdot e^{wj}}} \]

   10. associate-/l/ 81.6%

       \[\leadsto wj + \color{blue}{\frac{\frac{x - wj \cdot e^{wj}}{e^{wj}}}{wj + 1}} \]

3. Simplified 82.0%

   \[\leadsto \color{blue}{wj + \frac{\frac{x}{e^{wj}} - wj}{wj + 1}} \]

4. Taylor expanded in wj around 0 96.9%

   \[\leadsto \color{blue}{\left(1 - \left(-4 \cdot x + 1.5 \cdot x\right)\right) \cdot {wj}^{2} + \left(-2 \cdot \left(wj \cdot x\right) + x\right)} \]

5. Taylor expanded in x around 0 96.5%

   \[\leadsto \color{blue}{{wj}^{2}} + \left(-2 \cdot \left(wj \cdot x\right) + x\right) \]
6. Step-by-step derivation

   1. unpow2 96.5%

      \[\leadsto \color{blue}{wj \cdot wj} + \left(-2 \cdot \left(wj \cdot x\right) + x\right) \]

7. Simplified 96.5%

   \[\leadsto \color{blue}{wj \cdot wj} + \left(-2 \cdot \left(wj \cdot x\right) + x\right) \]

8. Final simplification 96.5%

   \[\leadsto \left(x + -2 \cdot \left(x \cdot wj\right)\right) + wj \cdot wj \]

Alternative 5: 95.3% accurate, 62.6× speedup

Math

\[\begin{array}{l} \\ x + wj \cdot wj \end{array} \]

FPCore

(FPCore (wj x) :precision binary64 (+ x (* wj wj)))

C

double code(double wj, double x) {
	return x + (wj * wj);
}

Fortran

real(8) function code(wj, x)
    real(8), intent (in) :: wj
    real(8), intent (in) :: x
    code = x + (wj * wj)
end function

Java

public static double code(double wj, double x) {
	return x + (wj * wj);
}

Python

def code(wj, x):
	return x + (wj * wj)

Julia

function code(wj, x)
	return Float64(x + Float64(wj * wj))
end

MATLAB

function tmp = code(wj, x)
	tmp = x + (wj * wj);
end

Wolfram

code[wj_, x_] := N[(x + N[(wj * wj), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 80.4%

   \[wj - \frac{wj \cdot e^{wj} - x}{e^{wj} + wj \cdot e^{wj}} \]
2. Step-by-step derivation

   1. sub-neg 80.4%

      \[\leadsto \color{blue}{wj + \left(-\frac{wj \cdot e^{wj} - x}{e^{wj} + wj \cdot e^{wj}}\right)} \]

   2. div-sub 80.4%

      \[\leadsto wj + \left(-\color{blue}{\left(\frac{wj \cdot e^{wj}}{e^{wj} + wj \cdot e^{wj}} - \frac{x}{e^{wj} + wj \cdot e^{wj}}\right)}\right) \]

   3. sub-neg 80.4%

      \[\leadsto wj + \left(-\color{blue}{\left(\frac{wj \cdot e^{wj}}{e^{wj} + wj \cdot e^{wj}} + \left(-\frac{x}{e^{wj} + wj \cdot e^{wj}}\right)\right)}\right) \]

   4. +-commutative 80.4%

      \[\leadsto wj + \left(-\color{blue}{\left(\left(-\frac{x}{e^{wj} + wj \cdot e^{wj}}\right) + \frac{wj \cdot e^{wj}}{e^{wj} + wj \cdot e^{wj}}\right)}\right) \]

   5. distribute-neg-in 80.4%

      \[\leadsto wj + \color{blue}{\left(\left(-\left(-\frac{x}{e^{wj} + wj \cdot e^{wj}}\right)\right) + \left(-\frac{wj \cdot e^{wj}}{e^{wj} + wj \cdot e^{wj}}\right)\right)} \]

   6. remove-double-neg 80.4%

      \[\leadsto wj + \left(\color{blue}{\frac{x}{e^{wj} + wj \cdot e^{wj}}} + \left(-\frac{wj \cdot e^{wj}}{e^{wj} + wj \cdot e^{wj}}\right)\right) \]

   7. sub-neg 80.4%

      \[\leadsto wj + \color{blue}{\left(\frac{x}{e^{wj} + wj \cdot e^{wj}} - \frac{wj \cdot e^{wj}}{e^{wj} + wj \cdot e^{wj}}\right)} \]

   8. div-sub 80.4%

      \[\leadsto wj + \color{blue}{\frac{x - wj \cdot e^{wj}}{e^{wj} + wj \cdot e^{wj}}} \]

   9. distribute-rgt1-in 81.6%

      \[\leadsto wj + \frac{x - wj \cdot e^{wj}}{\color{blue}{\left(wj + 1\right) \cdot e^{wj}}} \]

   10. associate-/l/ 81.6%

       \[\leadsto wj + \color{blue}{\frac{\frac{x - wj \cdot e^{wj}}{e^{wj}}}{wj + 1}} \]

3. Simplified 82.0%

   \[\leadsto \color{blue}{wj + \frac{\frac{x}{e^{wj}} - wj}{wj + 1}} \]

4. Taylor expanded in wj around 0 96.9%

   \[\leadsto \color{blue}{\left(1 - \left(-4 \cdot x + 1.5 \cdot x\right)\right) \cdot {wj}^{2} + \left(-2 \cdot \left(wj \cdot x\right) + x\right)} \]

5. Taylor expanded in x around 0 96.5%

   \[\leadsto \color{blue}{{wj}^{2}} + \left(-2 \cdot \left(wj \cdot x\right) + x\right) \]
6. Step-by-step derivation

   1. unpow2 96.5%

      \[\leadsto \color{blue}{wj \cdot wj} + \left(-2 \cdot \left(wj \cdot x\right) + x\right) \]

7. Simplified 96.5%

   \[\leadsto \color{blue}{wj \cdot wj} + \left(-2 \cdot \left(wj \cdot x\right) + x\right) \]

8. Taylor expanded in wj around 0 95.8%

   \[\leadsto wj \cdot wj + \color{blue}{x} \]

9. Final simplification 95.8%

   \[\leadsto x + wj \cdot wj \]

Alternative 6: 4.4% accurate, 313.0× speedup

Math

\[\begin{array}{l} \\ wj \end{array} \]

FPCore

(FPCore (wj x) :precision binary64 wj)

C

double code(double wj, double x) {
	return wj;
}

Fortran

real(8) function code(wj, x)
    real(8), intent (in) :: wj
    real(8), intent (in) :: x
    code = wj
end function

Java

public static double code(double wj, double x) {
	return wj;
}

Python

def code(wj, x):
	return wj

Julia

function code(wj, x)
	return wj
end

MATLAB

function tmp = code(wj, x)
	tmp = wj;
end

Wolfram

code[wj_, x_] := wj

Derivation

1. Initial program 80.4%

   \[wj - \frac{wj \cdot e^{wj} - x}{e^{wj} + wj \cdot e^{wj}} \]
2. Step-by-step derivation

   1. sub-neg 80.4%

      \[\leadsto \color{blue}{wj + \left(-\frac{wj \cdot e^{wj} - x}{e^{wj} + wj \cdot e^{wj}}\right)} \]

   2. div-sub 80.4%

      \[\leadsto wj + \left(-\color{blue}{\left(\frac{wj \cdot e^{wj}}{e^{wj} + wj \cdot e^{wj}} - \frac{x}{e^{wj} + wj \cdot e^{wj}}\right)}\right) \]

   3. sub-neg 80.4%

      \[\leadsto wj + \left(-\color{blue}{\left(\frac{wj \cdot e^{wj}}{e^{wj} + wj \cdot e^{wj}} + \left(-\frac{x}{e^{wj} + wj \cdot e^{wj}}\right)\right)}\right) \]

   4. +-commutative 80.4%

      \[\leadsto wj + \left(-\color{blue}{\left(\left(-\frac{x}{e^{wj} + wj \cdot e^{wj}}\right) + \frac{wj \cdot e^{wj}}{e^{wj} + wj \cdot e^{wj}}\right)}\right) \]

   5. distribute-neg-in 80.4%

      \[\leadsto wj + \color{blue}{\left(\left(-\left(-\frac{x}{e^{wj} + wj \cdot e^{wj}}\right)\right) + \left(-\frac{wj \cdot e^{wj}}{e^{wj} + wj \cdot e^{wj}}\right)\right)} \]

   6. remove-double-neg 80.4%

      \[\leadsto wj + \left(\color{blue}{\frac{x}{e^{wj} + wj \cdot e^{wj}}} + \left(-\frac{wj \cdot e^{wj}}{e^{wj} + wj \cdot e^{wj}}\right)\right) \]

   7. sub-neg 80.4%

      \[\leadsto wj + \color{blue}{\left(\frac{x}{e^{wj} + wj \cdot e^{wj}} - \frac{wj \cdot e^{wj}}{e^{wj} + wj \cdot e^{wj}}\right)} \]

   8. div-sub 80.4%

      \[\leadsto wj + \color{blue}{\frac{x - wj \cdot e^{wj}}{e^{wj} + wj \cdot e^{wj}}} \]

   9. distribute-rgt1-in 81.6%

      \[\leadsto wj + \frac{x - wj \cdot e^{wj}}{\color{blue}{\left(wj + 1\right) \cdot e^{wj}}} \]

   10. associate-/l/ 81.6%

       \[\leadsto wj + \color{blue}{\frac{\frac{x - wj \cdot e^{wj}}{e^{wj}}}{wj + 1}} \]

3. Simplified 82.0%

   \[\leadsto \color{blue}{wj + \frac{\frac{x}{e^{wj}} - wj}{wj + 1}} \]

4. Taylor expanded in wj around inf 3.8%

   \[\leadsto \color{blue}{wj} \]

5. Final simplification 3.8%

   \[\leadsto wj \]

Alternative 7: 83.9% accurate, 313.0× speedup

Math

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

FPCore

(FPCore (wj x) :precision binary64 x)

C

double code(double wj, double x) {
	return x;
}

Fortran

real(8) function code(wj, x)
    real(8), intent (in) :: wj
    real(8), intent (in) :: x
    code = x
end function

Java

public static double code(double wj, double x) {
	return x;
}

Python

def code(wj, x):
	return x

Julia

function code(wj, x)
	return x
end

MATLAB

function tmp = code(wj, x)
	tmp = x;
end

Wolfram

code[wj_, x_] := x

Derivation

1. Initial program 80.4%

   \[wj - \frac{wj \cdot e^{wj} - x}{e^{wj} + wj \cdot e^{wj}} \]
2. Step-by-step derivation

   1. sub-neg 80.4%

      \[\leadsto \color{blue}{wj + \left(-\frac{wj \cdot e^{wj} - x}{e^{wj} + wj \cdot e^{wj}}\right)} \]

   2. div-sub 80.4%

      \[\leadsto wj + \left(-\color{blue}{\left(\frac{wj \cdot e^{wj}}{e^{wj} + wj \cdot e^{wj}} - \frac{x}{e^{wj} + wj \cdot e^{wj}}\right)}\right) \]

   3. sub-neg 80.4%

      \[\leadsto wj + \left(-\color{blue}{\left(\frac{wj \cdot e^{wj}}{e^{wj} + wj \cdot e^{wj}} + \left(-\frac{x}{e^{wj} + wj \cdot e^{wj}}\right)\right)}\right) \]

   4. +-commutative 80.4%

      \[\leadsto wj + \left(-\color{blue}{\left(\left(-\frac{x}{e^{wj} + wj \cdot e^{wj}}\right) + \frac{wj \cdot e^{wj}}{e^{wj} + wj \cdot e^{wj}}\right)}\right) \]

   5. distribute-neg-in 80.4%

      \[\leadsto wj + \color{blue}{\left(\left(-\left(-\frac{x}{e^{wj} + wj \cdot e^{wj}}\right)\right) + \left(-\frac{wj \cdot e^{wj}}{e^{wj} + wj \cdot e^{wj}}\right)\right)} \]

   6. remove-double-neg 80.4%

      \[\leadsto wj + \left(\color{blue}{\frac{x}{e^{wj} + wj \cdot e^{wj}}} + \left(-\frac{wj \cdot e^{wj}}{e^{wj} + wj \cdot e^{wj}}\right)\right) \]

   7. sub-neg 80.4%

      \[\leadsto wj + \color{blue}{\left(\frac{x}{e^{wj} + wj \cdot e^{wj}} - \frac{wj \cdot e^{wj}}{e^{wj} + wj \cdot e^{wj}}\right)} \]

   8. div-sub 80.4%

      \[\leadsto wj + \color{blue}{\frac{x - wj \cdot e^{wj}}{e^{wj} + wj \cdot e^{wj}}} \]

   9. distribute-rgt1-in 81.6%

      \[\leadsto wj + \frac{x - wj \cdot e^{wj}}{\color{blue}{\left(wj + 1\right) \cdot e^{wj}}} \]

   10. associate-/l/ 81.6%

       \[\leadsto wj + \color{blue}{\frac{\frac{x - wj \cdot e^{wj}}{e^{wj}}}{wj + 1}} \]

3. Simplified 82.0%

   \[\leadsto \color{blue}{wj + \frac{\frac{x}{e^{wj}} - wj}{wj + 1}} \]

4. Taylor expanded in wj around 0 84.1%

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

5. Final simplification 84.1%

   \[\leadsto x \]

Developer target: 78.7% accurate, 1.5× speedup

Math

\[\begin{array}{l} \\ wj - \left(\frac{wj}{wj + 1} - \frac{x}{e^{wj} + wj \cdot e^{wj}}\right) \end{array} \]

FPCore

(FPCore (wj x)
 :precision binary64
 (- wj (- (/ wj (+ wj 1.0)) (/ x (+ (exp wj) (* wj (exp wj)))))))

C

double code(double wj, double x) {
	return wj - ((wj / (wj + 1.0)) - (x / (exp(wj) + (wj * exp(wj)))));
}

Fortran

real(8) function code(wj, x)
    real(8), intent (in) :: wj
    real(8), intent (in) :: x
    code = wj - ((wj / (wj + 1.0d0)) - (x / (exp(wj) + (wj * exp(wj)))))
end function

Java

public static double code(double wj, double x) {
	return wj - ((wj / (wj + 1.0)) - (x / (Math.exp(wj) + (wj * Math.exp(wj)))));
}

Python

def code(wj, x):
	return wj - ((wj / (wj + 1.0)) - (x / (math.exp(wj) + (wj * math.exp(wj)))))

Julia

function code(wj, x)
	return Float64(wj - Float64(Float64(wj / Float64(wj + 1.0)) - Float64(x / Float64(exp(wj) + Float64(wj * exp(wj))))))
end

MATLAB

function tmp = code(wj, x)
	tmp = wj - ((wj / (wj + 1.0)) - (x / (exp(wj) + (wj * exp(wj)))));
end

Wolfram

code[wj_, x_] := N[(wj - N[(N[(wj / N[(wj + 1.0), $MachinePrecision]), $MachinePrecision] - N[(x / N[(N[Exp[wj], $MachinePrecision] + N[(wj * N[Exp[wj], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Reproduce

herbie shell --seed 2023178 
(FPCore (wj x)
  :name "Jmat.Real.lambertw, newton loop step"
  :precision binary64

  :herbie-target
  (- wj (- (/ wj (+ wj 1.0)) (/ x (+ (exp wj) (* wj (exp wj))))))

  (- wj (/ (- (* wj (exp wj)) x) (+ (exp wj) (* wj (exp wj))))))