Jmat.Real.lambertw, newton loop step

Percentage Accurate: 77.7% → 98.4%

Time: 11.5s

Alternatives: 11

Speedup: 313.0×

• could not determine a ground truth

  1. wj = -3.841661781898993e+211
  2. x = 3.342415638758805e-114

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.7% 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: 98.4% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := wj \cdot e^{wj}\\ \mathbf{if}\;wj + \frac{x - t\_0}{e^{wj} + t\_0} \leq 1.5 \cdot 10^{-22}:\\ \;\;\;\;x + wj \cdot \left(wj \cdot \left(\left(1 - wj\right) + x \cdot \left(2.5 + wj \cdot -2.5\right)\right) - x \cdot 2\right)\\ \mathbf{else}:\\ \;\;\;\;wj + \frac{\frac{x}{e^{wj}} - wj}{wj + 1}\\ \end{array} \end{array} \]

FPCore

(FPCore (wj x)
 :precision binary64
 (let* ((t_0 (* wj (exp wj))))
   (if (<= (+ wj (/ (- x t_0) (+ (exp wj) t_0))) 1.5e-22)
     (+ x (* wj (- (* wj (+ (- 1.0 wj) (* x (+ 2.5 (* wj -2.5))))) (* x 2.0))))
     (+ wj (/ (- (/ x (exp wj)) wj) (+ wj 1.0))))))

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[wj_, x_] := Block[{t$95$0 = N[(wj * N[Exp[wj], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(wj + N[(N[(x - t$95$0), $MachinePrecision] / N[(N[Exp[wj], $MachinePrecision] + t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 1.5e-22], N[(x + N[(wj * N[(N[(wj * N[(N[(1.0 - wj), $MachinePrecision] + N[(x * N[(2.5 + N[(wj * -2.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(x * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(wj + N[(N[(N[(x / N[Exp[wj], $MachinePrecision]), $MachinePrecision] - wj), $MachinePrecision] / N[(wj + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (-.f64 wj (/.f64 (-.f64 (*.f64 wj (exp.f64 wj)) x) (+.f64 (exp.f64 wj) (*.f64 wj (exp.f64 wj))))) < 1.5e-22

   1. Initial program 73.2%

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

      1. distribute-rgt1-in 73.8%

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

      2. associate-/l/ 73.8%

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

      3. div-sub 73.2%

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

      4. associate-/l* 73.2%

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

      5. *-inverses 73.8%

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

      6. *-rgt-identity 73.8%

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

   3. Simplified 73.8%

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

   5. Taylor expanded in wj around 0 73.3%

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

      1. distribute-rgt-out 73.3%

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

      2. metadata-eval 73.3%

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

   7. Simplified 73.3%

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

   8. Taylor expanded in wj around 0 98.9%

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

   9. Taylor expanded in x around 0 98.9%

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

       1. neg-mul-1 98.9%

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

       2. associate-+r+ 98.9%

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

       3. sub-neg 98.9%

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

       4. *-commutative 98.9%

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

   11. Simplified 98.9%

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

   if 1.5e-22 < (-.f64 wj (/.f64 (-.f64 (*.f64 wj (exp.f64 wj)) x) (+.f64 (exp.f64 wj) (*.f64 wj (exp.f64 wj)))))

   1. Initial program 91.7%

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

      1. distribute-rgt1-in 93.1%

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

      2. associate-/l/ 93.1%

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

      3. div-sub 91.7%

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

      4. associate-/l* 91.7%

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

      5. *-inverses 100.0%

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

      6. *-rgt-identity 100.0%

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

   3. Simplified 100.0%

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

4. Final simplification 99.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;wj + \frac{x - wj \cdot e^{wj}}{e^{wj} + wj \cdot e^{wj}} \leq 1.5 \cdot 10^{-22}:\\ \;\;\;\;x + wj \cdot \left(wj \cdot \left(\left(1 - wj\right) + x \cdot \left(2.5 + wj \cdot -2.5\right)\right) - x \cdot 2\right)\\ \mathbf{else}:\\ \;\;\;\;wj + \frac{\frac{x}{e^{wj}} - wj}{wj + 1}\\ \end{array} \]
5. Add Preprocessing

Alternative 2: 97.8% accurate, 12.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;wj \leq 0.015:\\ \;\;\;\;x + wj \cdot \left(wj \cdot \left(\left(1 - wj\right) + x \cdot \left(2.5 + wj \cdot -2.5\right)\right) - x \cdot 2\right)\\ \mathbf{else}:\\ \;\;\;\;wj + \frac{wj}{-1 - wj}\\ \end{array} \end{array} \]

FPCore

(FPCore (wj x)
 :precision binary64
 (if (<= wj 0.015)
   (+ x (* wj (- (* wj (+ (- 1.0 wj) (* x (+ 2.5 (* wj -2.5))))) (* x 2.0))))
   (+ wj (/ wj (- -1.0 wj)))))

C

double code(double wj, double x) {
	double tmp;
	if (wj <= 0.015) {
		tmp = x + (wj * ((wj * ((1.0 - wj) + (x * (2.5 + (wj * -2.5))))) - (x * 2.0)));
	} else {
		tmp = 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 <= 0.015d0) then
        tmp = x + (wj * ((wj * ((1.0d0 - wj) + (x * (2.5d0 + (wj * (-2.5d0)))))) - (x * 2.0d0)))
    else
        tmp = wj + (wj / ((-1.0d0) - wj))
    end if
    code = tmp
end function

Java

public static double code(double wj, double x) {
	double tmp;
	if (wj <= 0.015) {
		tmp = x + (wj * ((wj * ((1.0 - wj) + (x * (2.5 + (wj * -2.5))))) - (x * 2.0)));
	} else {
		tmp = wj + (wj / (-1.0 - wj));
	}
	return tmp;
}

Python

def code(wj, x):
	tmp = 0
	if wj <= 0.015:
		tmp = x + (wj * ((wj * ((1.0 - wj) + (x * (2.5 + (wj * -2.5))))) - (x * 2.0)))
	else:
		tmp = wj + (wj / (-1.0 - wj))
	return tmp

Julia

function code(wj, x)
	tmp = 0.0
	if (wj <= 0.015)
		tmp = Float64(x + Float64(wj * Float64(Float64(wj * Float64(Float64(1.0 - wj) + Float64(x * Float64(2.5 + Float64(wj * -2.5))))) - Float64(x * 2.0))));
	else
		tmp = Float64(wj + Float64(wj / Float64(-1.0 - wj)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(wj, x)
	tmp = 0.0;
	if (wj <= 0.015)
		tmp = x + (wj * ((wj * ((1.0 - wj) + (x * (2.5 + (wj * -2.5))))) - (x * 2.0)));
	else
		tmp = wj + (wj / (-1.0 - wj));
	end
	tmp_2 = tmp;
end

Wolfram

code[wj_, x_] := If[LessEqual[wj, 0.015], N[(x + N[(wj * N[(N[(wj * N[(N[(1.0 - wj), $MachinePrecision] + N[(x * N[(2.5 + N[(wj * -2.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(x * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(wj + N[(wj / N[(-1.0 - wj), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if wj < 0.014999999999999999

   1. Initial program 80.0%

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

      1. distribute-rgt1-in 80.8%

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

      2. associate-/l/ 80.8%

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

      3. div-sub 80.0%

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

      4. associate-/l* 80.0%

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

      5. *-inverses 80.8%

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

      6. *-rgt-identity 80.8%

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

   3. Simplified 80.8%

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

   5. Taylor expanded in wj around 0 79.4%

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

      1. distribute-rgt-out 79.4%

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

      2. metadata-eval 79.4%

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

   7. Simplified 79.4%

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

   8. Taylor expanded in wj around 0 98.1%

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

   9. Taylor expanded in x around 0 98.1%

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

       1. neg-mul-1 98.1%

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

       2. associate-+r+ 98.1%

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

       3. sub-neg 98.1%

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

       4. *-commutative 98.1%

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

   11. Simplified 98.1%

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

   if 0.014999999999999999 < wj

   1. Initial program 16.7%

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

      1. distribute-rgt1-in 16.7%

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

      2. associate-/l/ 16.7%

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

      3. div-sub 16.7%

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

      4. associate-/l* 16.7%

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

      5. *-inverses 100.0%

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

      6. *-rgt-identity 100.0%

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

   3. Simplified 100.0%

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

   5. Taylor expanded in x around 0 100.0%

      \[\leadsto \color{blue}{wj - \frac{wj}{1 + wj}} \]
   6. Step-by-step derivation

      1. +-commutative 100.0%

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

   7. Simplified 100.0%

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

4. Final simplification 98.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;wj \leq 0.015:\\ \;\;\;\;x + wj \cdot \left(wj \cdot \left(\left(1 - wj\right) + x \cdot \left(2.5 + wj \cdot -2.5\right)\right) - x \cdot 2\right)\\ \mathbf{else}:\\ \;\;\;\;wj + \frac{wj}{-1 - wj}\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 97.3% accurate, 15.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;wj \leq 0.026:\\ \;\;\;\;x + wj \cdot \left(wj \cdot \left(1 - x \cdot -2.5\right) + x \cdot -2\right)\\ \mathbf{else}:\\ \;\;\;\;wj + \frac{wj}{-1 - wj}\\ \end{array} \end{array} \]

FPCore

(FPCore (wj x)
 :precision binary64
 (if (<= wj 0.026)
   (+ x (* wj (+ (* wj (- 1.0 (* x -2.5))) (* x -2.0))))
   (+ wj (/ wj (- -1.0 wj)))))

C

double code(double wj, double x) {
	double tmp;
	if (wj <= 0.026) {
		tmp = x + (wj * ((wj * (1.0 - (x * -2.5))) + (x * -2.0)));
	} else {
		tmp = 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 <= 0.026d0) then
        tmp = x + (wj * ((wj * (1.0d0 - (x * (-2.5d0)))) + (x * (-2.0d0))))
    else
        tmp = wj + (wj / ((-1.0d0) - wj))
    end if
    code = tmp
end function

Java

public static double code(double wj, double x) {
	double tmp;
	if (wj <= 0.026) {
		tmp = x + (wj * ((wj * (1.0 - (x * -2.5))) + (x * -2.0)));
	} else {
		tmp = wj + (wj / (-1.0 - wj));
	}
	return tmp;
}

Python

def code(wj, x):
	tmp = 0
	if wj <= 0.026:
		tmp = x + (wj * ((wj * (1.0 - (x * -2.5))) + (x * -2.0)))
	else:
		tmp = wj + (wj / (-1.0 - wj))
	return tmp

Julia

function code(wj, x)
	tmp = 0.0
	if (wj <= 0.026)
		tmp = Float64(x + Float64(wj * Float64(Float64(wj * Float64(1.0 - Float64(x * -2.5))) + Float64(x * -2.0))));
	else
		tmp = Float64(wj + Float64(wj / Float64(-1.0 - wj)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(wj, x)
	tmp = 0.0;
	if (wj <= 0.026)
		tmp = x + (wj * ((wj * (1.0 - (x * -2.5))) + (x * -2.0)));
	else
		tmp = wj + (wj / (-1.0 - wj));
	end
	tmp_2 = tmp;
end

Wolfram

code[wj_, x_] := If[LessEqual[wj, 0.026], N[(x + N[(wj * N[(N[(wj * N[(1.0 - N[(x * -2.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(x * -2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(wj + N[(wj / N[(-1.0 - wj), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if wj < 0.0259999999999999988

   1. Initial program 80.0%

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

      1. distribute-rgt1-in 80.8%

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

      2. associate-/l/ 80.8%

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

      3. div-sub 80.0%

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

      4. associate-/l* 80.0%

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

      5. *-inverses 80.8%

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

      6. *-rgt-identity 80.8%

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

   3. Simplified 80.8%

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

   5. Taylor expanded in wj around 0 97.9%

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

      1. cancel-sign-sub-inv 97.9%

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

      2. distribute-rgt-out 97.9%

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

      3. metadata-eval 97.9%

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

      4. metadata-eval 97.9%

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

      5. *-commutative 97.9%

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

   7. Simplified 97.9%

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

   if 0.0259999999999999988 < wj

   1. Initial program 16.7%

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

      1. distribute-rgt1-in 16.7%

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

      2. associate-/l/ 16.7%

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

      3. div-sub 16.7%

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

      4. associate-/l* 16.7%

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

      5. *-inverses 100.0%

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

      6. *-rgt-identity 100.0%

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

   3. Simplified 100.0%

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

   5. Taylor expanded in x around 0 100.0%

      \[\leadsto \color{blue}{wj - \frac{wj}{1 + wj}} \]
   6. Step-by-step derivation

      1. +-commutative 100.0%

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

   7. Simplified 100.0%

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

4. Final simplification 97.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;wj \leq 0.026:\\ \;\;\;\;x + wj \cdot \left(wj \cdot \left(1 - x \cdot -2.5\right) + x \cdot -2\right)\\ \mathbf{else}:\\ \;\;\;\;wj + \frac{wj}{-1 - wj}\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 97.6% accurate, 17.4× speedup

Math

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

FPCore

(FPCore (wj x)
 :precision binary64
 (if (<= wj 0.00023)
   (+ x (* wj (- (* wj (- 1.0 wj)) (* x 2.0))))
   (+ wj (/ wj (- -1.0 wj)))))

C

double code(double wj, double x) {
	double tmp;
	if (wj <= 0.00023) {
		tmp = x + (wj * ((wj * (1.0 - wj)) - (x * 2.0)));
	} else {
		tmp = 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 <= 0.00023d0) then
        tmp = x + (wj * ((wj * (1.0d0 - wj)) - (x * 2.0d0)))
    else
        tmp = wj + (wj / ((-1.0d0) - wj))
    end if
    code = tmp
end function

Java

public static double code(double wj, double x) {
	double tmp;
	if (wj <= 0.00023) {
		tmp = x + (wj * ((wj * (1.0 - wj)) - (x * 2.0)));
	} else {
		tmp = wj + (wj / (-1.0 - wj));
	}
	return tmp;
}

Python

def code(wj, x):
	tmp = 0
	if wj <= 0.00023:
		tmp = x + (wj * ((wj * (1.0 - wj)) - (x * 2.0)))
	else:
		tmp = wj + (wj / (-1.0 - wj))
	return tmp

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if wj < 2.3000000000000001e-4

   1. Initial program 80.0%

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

      1. distribute-rgt1-in 80.8%

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

      2. associate-/l/ 80.8%

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

      3. div-sub 80.0%

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

      4. associate-/l* 80.0%

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

      5. *-inverses 80.8%

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

      6. *-rgt-identity 80.8%

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

   3. Simplified 80.8%

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

   5. Taylor expanded in wj around 0 79.4%

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

      1. distribute-rgt-out 79.4%

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

      2. metadata-eval 79.4%

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

   7. Simplified 79.4%

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

   8. Taylor expanded in wj around 0 98.1%

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

   9. Taylor expanded in x around 0 98.1%

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

       1. neg-mul-1 98.1%

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

       2. associate-+r+ 98.1%

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

       3. sub-neg 98.1%

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

       4. *-commutative 98.1%

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

   11. Simplified 98.1%

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

   12. Taylor expanded in x around 0 97.9%

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

   if 2.3000000000000001e-4 < wj

   1. Initial program 16.7%

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

      1. distribute-rgt1-in 16.7%

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

      2. associate-/l/ 16.7%

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

      3. div-sub 16.7%

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

      4. associate-/l* 16.7%

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

      5. *-inverses 100.0%

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

      6. *-rgt-identity 100.0%

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

   3. Simplified 100.0%

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

   5. Taylor expanded in x around 0 100.0%

      \[\leadsto \color{blue}{wj - \frac{wj}{1 + wj}} \]
   6. Step-by-step derivation

      1. +-commutative 100.0%

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

   7. Simplified 100.0%

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

4. Final simplification 97.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;wj \leq 0.00023:\\ \;\;\;\;x + wj \cdot \left(wj \cdot \left(1 - wj\right) - x \cdot 2\right)\\ \mathbf{else}:\\ \;\;\;\;wj + \frac{wj}{-1 - wj}\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 97.2% accurate, 22.3× speedup

Math

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

FPCore

(FPCore (wj x)
 :precision binary64
 (if (<= wj 0.0014) (+ x (* wj (+ wj (* x -2.0)))) (+ wj (/ wj (- -1.0 wj)))))

C

double code(double wj, double x) {
	double tmp;
	if (wj <= 0.0014) {
		tmp = x + (wj * (wj + (x * -2.0)));
	} else {
		tmp = 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 <= 0.0014d0) then
        tmp = x + (wj * (wj + (x * (-2.0d0))))
    else
        tmp = wj + (wj / ((-1.0d0) - wj))
    end if
    code = tmp
end function

Java

public static double code(double wj, double x) {
	double tmp;
	if (wj <= 0.0014) {
		tmp = x + (wj * (wj + (x * -2.0)));
	} else {
		tmp = wj + (wj / (-1.0 - wj));
	}
	return tmp;
}

Python

def code(wj, x):
	tmp = 0
	if wj <= 0.0014:
		tmp = x + (wj * (wj + (x * -2.0)))
	else:
		tmp = wj + (wj / (-1.0 - wj))
	return tmp

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if wj < 0.00139999999999999999

   1. Initial program 80.0%

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

      1. distribute-rgt1-in 80.8%

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

      2. associate-/l/ 80.8%

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

      3. div-sub 80.0%

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

      4. associate-/l* 80.0%

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

      5. *-inverses 80.8%

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

      6. *-rgt-identity 80.8%

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

   3. Simplified 80.8%

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

   5. Taylor expanded in wj around 0 97.9%

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

      1. cancel-sign-sub-inv 97.9%

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

      2. distribute-rgt-out 97.9%

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

      3. metadata-eval 97.9%

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

      4. metadata-eval 97.9%

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

      5. *-commutative 97.9%

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

   7. Simplified 97.9%

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

   8. Taylor expanded in x around 0 97.8%

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

   if 0.00139999999999999999 < wj

   1. Initial program 16.7%

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

      1. distribute-rgt1-in 16.7%

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

      2. associate-/l/ 16.7%

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

      3. div-sub 16.7%

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

      4. associate-/l* 16.7%

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

      5. *-inverses 100.0%

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

      6. *-rgt-identity 100.0%

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

   3. Simplified 100.0%

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

   5. Taylor expanded in x around 0 100.0%

      \[\leadsto \color{blue}{wj - \frac{wj}{1 + wj}} \]
   6. Step-by-step derivation

      1. +-commutative 100.0%

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

   7. Simplified 100.0%

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

4. Final simplification 97.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;wj \leq 0.0014:\\ \;\;\;\;x + wj \cdot \left(wj + x \cdot -2\right)\\ \mathbf{else}:\\ \;\;\;\;wj + \frac{wj}{-1 - wj}\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 85.6% accurate, 26.0× speedup

Math

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

FPCore

(FPCore (wj x)
 :precision binary64
 (if (<= wj 1.8e-7) (+ x (* -2.0 (* wj x))) (+ wj (/ wj (- -1.0 wj)))))

C

double code(double wj, double x) {
	double tmp;
	if (wj <= 1.8e-7) {
		tmp = x + (-2.0 * (wj * x));
	} else {
		tmp = 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.8d-7) then
        tmp = x + ((-2.0d0) * (wj * x))
    else
        tmp = 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.8e-7) {
		tmp = x + (-2.0 * (wj * x));
	} else {
		tmp = wj + (wj / (-1.0 - wj));
	}
	return tmp;
}

Python

def code(wj, x):
	tmp = 0
	if wj <= 1.8e-7:
		tmp = x + (-2.0 * (wj * x))
	else:
		tmp = wj + (wj / (-1.0 - wj))
	return tmp

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if wj < 1.79999999999999997e-7

   1. Initial program 80.0%

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

      1. distribute-rgt1-in 80.8%

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

      2. associate-/l/ 80.8%

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

      3. div-sub 80.0%

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

      4. associate-/l* 80.0%

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

      5. *-inverses 80.8%

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

      6. *-rgt-identity 80.8%

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

   3. Simplified 80.8%

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

   5. Taylor expanded in wj around 0 87.4%

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

      1. *-commutative 87.4%

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

   7. Simplified 87.4%

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

   if 1.79999999999999997e-7 < wj

   1. Initial program 16.7%

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

      1. distribute-rgt1-in 16.7%

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

      2. associate-/l/ 16.7%

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

      3. div-sub 16.7%

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

      4. associate-/l* 16.7%

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

      5. *-inverses 100.0%

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

      6. *-rgt-identity 100.0%

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

   3. Simplified 100.0%

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

   5. Taylor expanded in x around 0 100.0%

      \[\leadsto \color{blue}{wj - \frac{wj}{1 + wj}} \]
   6. Step-by-step derivation

      1. +-commutative 100.0%

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

   7. Simplified 100.0%

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

4. Final simplification 87.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;wj \leq 1.8 \cdot 10^{-7}:\\ \;\;\;\;x + -2 \cdot \left(wj \cdot x\right)\\ \mathbf{else}:\\ \;\;\;\;wj + \frac{wj}{-1 - wj}\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 84.3% accurate, 44.7× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 78.5%

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

   1. distribute-rgt1-in 79.3%

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

   2. associate-/l/ 79.3%

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

   3. div-sub 78.5%

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

   4. associate-/l* 78.5%

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

   5. *-inverses 81.2%

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

   6. *-rgt-identity 81.2%

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

3. Simplified 81.2%

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

5. Taylor expanded in wj around 0 85.4%

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

   1. *-commutative 85.4%

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

7. Simplified 85.4%

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

8. Final simplification 85.4%

   \[\leadsto x + -2 \cdot \left(wj \cdot x\right) \]
9. Add Preprocessing

Alternative 8: 84.2% accurate, 44.7× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 78.5%

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

   1. distribute-rgt1-in 79.3%

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

   2. associate-/l/ 79.3%

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

   3. div-sub 78.5%

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

   4. associate-/l* 78.5%

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

   5. *-inverses 81.2%

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

   6. *-rgt-identity 81.2%

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

3. Simplified 81.2%

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

5. Taylor expanded in wj around 0 79.2%

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

6. Taylor expanded in x around inf 85.7%

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

7. Taylor expanded in wj around 0 85.4%

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

   1. *-commutative 85.4%

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

9. Simplified 85.4%

   \[\leadsto x \cdot \color{blue}{\left(1 + wj \cdot -2\right)} \]
10. Add Preprocessing

Alternative 9: 83.8% 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 78.5%

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

   1. distribute-rgt1-in 79.3%

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

   2. associate-/l/ 79.3%

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

   3. div-sub 78.5%

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

   4. associate-/l* 78.5%

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

   5. *-inverses 81.2%

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

   6. *-rgt-identity 81.2%

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

3. Simplified 81.2%

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

5. Taylor expanded in wj around 0 84.9%

   \[\leadsto \color{blue}{x} \]
6. Add Preprocessing

Alternative 10: 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 78.5%

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

   1. distribute-rgt1-in 79.3%

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

   2. associate-/l/ 79.3%

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

   3. div-sub 78.5%

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

   4. associate-/l* 78.5%

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

   5. *-inverses 81.2%

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

   6. *-rgt-identity 81.2%

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

3. Simplified 81.2%

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

5. Taylor expanded in wj around inf 4.9%

   \[\leadsto \color{blue}{wj} \]
6. Add Preprocessing

Alternative 11: 3.3% accurate, 313.0× speedup

Math

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

FPCore

(FPCore (wj x) :precision binary64 -1.0)

C

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

Fortran

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

Java

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

Python

def code(wj, x):
	return -1.0

Julia

function code(wj, x)
	return -1.0
end

MATLAB

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

Wolfram

code[wj_, x_] := -1.0

Derivation

1. Initial program 78.5%

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

   1. distribute-rgt1-in 79.3%

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

   2. associate-/l/ 79.3%

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

   3. div-sub 78.5%

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

   4. associate-/l* 78.5%

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

   5. *-inverses 81.2%

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

   6. *-rgt-identity 81.2%

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

3. Simplified 81.2%

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

5. Taylor expanded in wj around inf 4.7%

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

6. Taylor expanded in wj around 0 3.3%

   \[\leadsto \color{blue}{-1} \]
7. Add Preprocessing

Developer Target 1: 78.6% 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 2024145 
(FPCore (wj x)
  :name "Jmat.Real.lambertw, newton loop step"
  :precision binary64

  :alt
  (! :herbie-platform default (let ((ew (exp wj))) (- wj (- (/ wj (+ wj 1)) (/ x (+ ew (* wj ew)))))))

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