Jmat.Real.lambertw, newton loop step

Percentage Accurate: 78.1% → 98.8%

Time: 16.6s

Alternatives: 9

Speedup: 313.0×

• could not determine a ground truth

  1. wj = -1.2024655073235916e+253
  2. x = 5.284330945093561e+37

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: 78.1% 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.8% accurate, 0.4× 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 2 \cdot 10^{-14}:\\ \;\;\;\;\mathsf{fma}\left(-2, wj \cdot x, x\right) + \left({wj}^{2} \cdot \left(1 + x \cdot 2.5\right) + {wj}^{3} \cdot \left(-1 - \mathsf{fma}\left(x, -3, \mathsf{fma}\left(x, 0.6666666666666666, x \cdot 5\right)\right)\right)\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))) 2e-14)
     (+
      (fma -2.0 (* wj x) x)
      (+
       (* (pow wj 2.0) (+ 1.0 (* x 2.5)))
       (*
        (pow wj 3.0)
        (- -1.0 (fma x -3.0 (fma x 0.6666666666666666 (* x 5.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))) <= 2e-14) {
		tmp = fma(-2.0, (wj * x), x) + ((pow(wj, 2.0) * (1.0 + (x * 2.5))) + (pow(wj, 3.0) * (-1.0 - fma(x, -3.0, fma(x, 0.6666666666666666, (x * 5.0))))));
	} else {
		tmp = wj + (((x / 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))) <= 2e-14)
		tmp = Float64(fma(-2.0, Float64(wj * x), x) + Float64(Float64((wj ^ 2.0) * Float64(1.0 + Float64(x * 2.5))) + Float64((wj ^ 3.0) * Float64(-1.0 - fma(x, -3.0, fma(x, 0.6666666666666666, Float64(x * 5.0)))))));
	else
		tmp = Float64(wj + Float64(Float64(Float64(x / exp(wj)) - wj) / Float64(wj + 1.0)));
	end
	return 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], 2e-14], N[(N[(-2.0 * N[(wj * x), $MachinePrecision] + x), $MachinePrecision] + N[(N[(N[Power[wj, 2.0], $MachinePrecision] * N[(1.0 + N[(x * 2.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[Power[wj, 3.0], $MachinePrecision] * N[(-1.0 - N[(x * -3.0 + N[(x * 0.6666666666666666 + N[(x * 5.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $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))))) < 2e-14

   1. Initial program 71.9%

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

      1. distribute-rgt1-in 71.9%

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

      2. associate-/l/ 71.8%

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

      3. div-sub 71.8%

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

      4. associate-/l* 71.8%

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

      5. *-inverses 71.8%

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

      6. /-rgt-identity 71.8%

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

   3. Simplified 71.8%

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

   5. Taylor expanded in wj around 0 99.6%

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

      1. associate-+r+ 99.6%

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

      2. +-commutative 99.6%

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

      3. fma-def 99.6%

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

      4. *-commutative 99.6%

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

      5. +-commutative 99.6%

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

      6. mul-1-neg 99.6%

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

      7. unsub-neg 99.6%

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

   7. Simplified 99.6%

      \[\leadsto \color{blue}{\mathsf{fma}\left(-2, x \cdot wj, x\right) + \left({wj}^{2} \cdot \left(1 + x \cdot 2.5\right) - {wj}^{3} \cdot \left(1 + \mathsf{fma}\left(x, -3, \mathsf{fma}\left(x, 0.6666666666666666, x \cdot 5\right)\right)\right)\right)} \]

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

   1. Initial program 95.3%

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

      1. distribute-rgt1-in 98.3%

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

      2. associate-/l/ 98.3%

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

      3. div-sub 95.3%

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

      4. associate-/l* 95.3%

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

      5. *-inverses 99.8%

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

      6. /-rgt-identity 99.8%

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

   3. Simplified 99.8%

      \[\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.6%

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

Alternative 2: 98.8% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := x \cdot -4 + x \cdot 1.5\\ t_1 := wj \cdot e^{wj}\\ \mathbf{if}\;wj + \frac{x - t\_1}{e^{wj} + t\_1} \leq 2 \cdot 10^{-14}:\\ \;\;\;\;x + \left(-2 \cdot \left(wj \cdot x\right) + \left({wj}^{2} \cdot \left(1 - t\_0\right) - {wj}^{3} \cdot \left(1 + \left(x \cdot -3 + \left(-2 \cdot t\_0 + x \cdot 0.6666666666666666\right)\right)\right)\right)\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 (+ (* x -4.0) (* x 1.5))) (t_1 (* wj (exp wj))))
   (if (<= (+ wj (/ (- x t_1) (+ (exp wj) t_1))) 2e-14)
     (+
      x
      (+
       (* -2.0 (* wj x))
       (-
        (* (pow wj 2.0) (- 1.0 t_0))
        (*
         (pow wj 3.0)
         (+ 1.0 (+ (* x -3.0) (+ (* -2.0 t_0) (* x 0.6666666666666666))))))))
     (+ wj (/ (- (/ x (exp wj)) wj) (+ wj 1.0))))))

C

double code(double wj, double x) {
	double t_0 = (x * -4.0) + (x * 1.5);
	double t_1 = wj * exp(wj);
	double tmp;
	if ((wj + ((x - t_1) / (exp(wj) + t_1))) <= 2e-14) {
		tmp = x + ((-2.0 * (wj * x)) + ((pow(wj, 2.0) * (1.0 - t_0)) - (pow(wj, 3.0) * (1.0 + ((x * -3.0) + ((-2.0 * t_0) + (x * 0.6666666666666666)))))));
	} 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) :: t_1
    real(8) :: tmp
    t_0 = (x * (-4.0d0)) + (x * 1.5d0)
    t_1 = wj * exp(wj)
    if ((wj + ((x - t_1) / (exp(wj) + t_1))) <= 2d-14) then
        tmp = x + (((-2.0d0) * (wj * x)) + (((wj ** 2.0d0) * (1.0d0 - t_0)) - ((wj ** 3.0d0) * (1.0d0 + ((x * (-3.0d0)) + (((-2.0d0) * t_0) + (x * 0.6666666666666666d0)))))))
    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 = (x * -4.0) + (x * 1.5);
	double t_1 = wj * Math.exp(wj);
	double tmp;
	if ((wj + ((x - t_1) / (Math.exp(wj) + t_1))) <= 2e-14) {
		tmp = x + ((-2.0 * (wj * x)) + ((Math.pow(wj, 2.0) * (1.0 - t_0)) - (Math.pow(wj, 3.0) * (1.0 + ((x * -3.0) + ((-2.0 * t_0) + (x * 0.6666666666666666)))))));
	} else {
		tmp = wj + (((x / Math.exp(wj)) - wj) / (wj + 1.0));
	}
	return tmp;
}

Python

def code(wj, x):
	t_0 = (x * -4.0) + (x * 1.5)
	t_1 = wj * math.exp(wj)
	tmp = 0
	if (wj + ((x - t_1) / (math.exp(wj) + t_1))) <= 2e-14:
		tmp = x + ((-2.0 * (wj * x)) + ((math.pow(wj, 2.0) * (1.0 - t_0)) - (math.pow(wj, 3.0) * (1.0 + ((x * -3.0) + ((-2.0 * t_0) + (x * 0.6666666666666666)))))))
	else:
		tmp = wj + (((x / math.exp(wj)) - wj) / (wj + 1.0))
	return tmp

Julia

function code(wj, x)
	t_0 = Float64(Float64(x * -4.0) + Float64(x * 1.5))
	t_1 = Float64(wj * exp(wj))
	tmp = 0.0
	if (Float64(wj + Float64(Float64(x - t_1) / Float64(exp(wj) + t_1))) <= 2e-14)
		tmp = Float64(x + Float64(Float64(-2.0 * Float64(wj * x)) + Float64(Float64((wj ^ 2.0) * Float64(1.0 - t_0)) - Float64((wj ^ 3.0) * Float64(1.0 + Float64(Float64(x * -3.0) + Float64(Float64(-2.0 * t_0) + Float64(x * 0.6666666666666666))))))));
	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 = (x * -4.0) + (x * 1.5);
	t_1 = wj * exp(wj);
	tmp = 0.0;
	if ((wj + ((x - t_1) / (exp(wj) + t_1))) <= 2e-14)
		tmp = x + ((-2.0 * (wj * x)) + (((wj ^ 2.0) * (1.0 - t_0)) - ((wj ^ 3.0) * (1.0 + ((x * -3.0) + ((-2.0 * t_0) + (x * 0.6666666666666666)))))));
	else
		tmp = wj + (((x / exp(wj)) - wj) / (wj + 1.0));
	end
	tmp_2 = tmp;
end

Wolfram

code[wj_, x_] := Block[{t$95$0 = N[(N[(x * -4.0), $MachinePrecision] + N[(x * 1.5), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(wj * N[Exp[wj], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(wj + N[(N[(x - t$95$1), $MachinePrecision] / N[(N[Exp[wj], $MachinePrecision] + t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 2e-14], N[(x + N[(N[(-2.0 * N[(wj * x), $MachinePrecision]), $MachinePrecision] + N[(N[(N[Power[wj, 2.0], $MachinePrecision] * N[(1.0 - t$95$0), $MachinePrecision]), $MachinePrecision] - N[(N[Power[wj, 3.0], $MachinePrecision] * N[(1.0 + N[(N[(x * -3.0), $MachinePrecision] + N[(N[(-2.0 * t$95$0), $MachinePrecision] + N[(x * 0.6666666666666666), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $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))))) < 2e-14

   1. Initial program 71.9%

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

      1. distribute-rgt1-in 71.9%

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

      2. associate-/l/ 71.8%

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

      3. div-sub 71.8%

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

      4. associate-/l* 71.8%

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

      5. *-inverses 71.8%

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

      6. /-rgt-identity 71.8%

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

   3. Simplified 71.8%

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

   5. Taylor expanded in wj around 0 99.6%

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

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

   1. Initial program 95.3%

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

      1. distribute-rgt1-in 98.3%

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

      2. associate-/l/ 98.3%

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

      3. div-sub 95.3%

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

      4. associate-/l* 95.3%

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

      5. *-inverses 99.8%

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

      6. /-rgt-identity 99.8%

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

   3. Simplified 99.8%

      \[\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.6%

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

Alternative 3: 96.2% accurate, 1.4× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

public static double code(double wj, double x) {
	return x + ((-2.0 * (wj * x)) + ((Math.pow(wj, 2.0) * (1.0 - (x * -2.5))) - Math.pow(wj, 3.0)));
}

Python

def code(wj, x):
	return x + ((-2.0 * (wj * x)) + ((math.pow(wj, 2.0) * (1.0 - (x * -2.5))) - math.pow(wj, 3.0)))

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 77.9%

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

   1. distribute-rgt1-in 78.7%

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

   2. associate-/l/ 78.6%

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

   3. div-sub 77.8%

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

   4. associate-/l* 77.8%

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

   5. *-inverses 79.0%

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

   6. /-rgt-identity 79.0%

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

3. Simplified 79.0%

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

5. Taylor expanded in wj around 0 97.6%

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

6. Taylor expanded in x around 0 97.5%

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

7. Taylor expanded in x around 0 97.5%

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

   1. *-commutative 97.0%

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

9. Simplified 97.5%

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

10. Final simplification 97.5%

    \[\leadsto x + \left(-2 \cdot \left(wj \cdot x\right) + \left({wj}^{2} \cdot \left(1 - x \cdot -2.5\right) - {wj}^{3}\right)\right) \]
11. Add Preprocessing

Alternative 4: 99.2% accurate, 2.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;wj \leq -3.25 \cdot 10^{-15} \lor \neg \left(wj \leq 6.3 \cdot 10^{-12}\right):\\ \;\;\;\;wj + \frac{\frac{x}{e^{wj}} - wj}{wj + 1}\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(wj, wj, x\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (wj x)
 :precision binary64
 (if (or (<= wj -3.25e-15) (not (<= wj 6.3e-12)))
   (+ wj (/ (- (/ x (exp wj)) wj) (+ wj 1.0)))
   (fma wj wj x)))

C

double code(double wj, double x) {
	double tmp;
	if ((wj <= -3.25e-15) || !(wj <= 6.3e-12)) {
		tmp = wj + (((x / exp(wj)) - wj) / (wj + 1.0));
	} else {
		tmp = fma(wj, wj, x);
	}
	return tmp;
}

Julia

function code(wj, x)
	tmp = 0.0
	if ((wj <= -3.25e-15) || !(wj <= 6.3e-12))
		tmp = Float64(wj + Float64(Float64(Float64(x / exp(wj)) - wj) / Float64(wj + 1.0)));
	else
		tmp = fma(wj, wj, x);
	end
	return tmp
end

Wolfram

code[wj_, x_] := If[Or[LessEqual[wj, -3.25e-15], N[Not[LessEqual[wj, 6.3e-12]], $MachinePrecision]], N[(wj + N[(N[(N[(x / N[Exp[wj], $MachinePrecision]), $MachinePrecision] - wj), $MachinePrecision] / N[(wj + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(wj * wj + x), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if wj < -3.24999999999999996e-15 or 6.3000000000000002e-12 < wj

   1. Initial program 79.6%

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

      1. distribute-rgt1-in 90.0%

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

      2. associate-/l/ 89.4%

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

      3. div-sub 78.8%

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

      4. associate-/l* 78.8%

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

      5. *-inverses 94.6%

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

      6. /-rgt-identity 94.6%

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

   3. Simplified 94.6%

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

   if -3.24999999999999996e-15 < wj < 6.3000000000000002e-12

   1. Initial program 77.8%

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

      1. distribute-rgt1-in 77.8%

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

      2. associate-/l/ 77.8%

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

      3. div-sub 77.8%

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

      4. associate-/l* 77.8%

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

      5. *-inverses 77.8%

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

      6. /-rgt-identity 77.8%

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

   3. Simplified 77.8%

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

   5. Taylor expanded in wj around 0 99.7%

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

   6. Taylor expanded in wj around inf 99.7%

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

   7. Taylor expanded in x around 0 99.7%

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

   8. Taylor expanded in x around 0 99.7%

      \[\leadsto \color{blue}{x + {wj}^{2}} \]
   9. Step-by-step derivation

      1. +-commutative 99.7%

         \[\leadsto \color{blue}{{wj}^{2} + x} \]

      2. unpow2 99.7%

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

      3. fma-udef 99.7%

         \[\leadsto \color{blue}{\mathsf{fma}\left(wj, wj, x\right)} \]

   10. Simplified 99.7%

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

4. Final simplification 99.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;wj \leq -3.25 \cdot 10^{-15} \lor \neg \left(wj \leq 6.3 \cdot 10^{-12}\right):\\ \;\;\;\;wj + \frac{\frac{x}{e^{wj}} - wj}{wj + 1}\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(wj, wj, x\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 95.8% accurate, 2.7× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

def code(wj, x):
	return x + ((-2.0 * (wj * x)) + (math.pow(wj, 2.0) * (1.0 - (x * -2.5))))

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 77.9%

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

   1. distribute-rgt1-in 78.7%

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

   2. associate-/l/ 78.6%

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

   3. div-sub 77.8%

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

   4. associate-/l* 77.8%

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

   5. *-inverses 79.0%

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

   6. /-rgt-identity 79.0%

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

3. Simplified 79.0%

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

5. Taylor expanded in wj around 0 97.0%

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

6. Taylor expanded in x around 0 97.0%

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

   1. *-commutative 97.0%

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

8. Simplified 97.0%

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

9. Final simplification 97.0%

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

Alternative 6: 95.1% accurate, 3.0× speedup

Math

\[\begin{array}{l} \\ \mathsf{fma}\left(wj, wj, x\right) \end{array} \]

FPCore

(FPCore (wj x) :precision binary64 (fma wj wj x))

C

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

Julia

function code(wj, x)
	return fma(wj, wj, x)
end

Wolfram

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

Derivation

1. Initial program 77.9%

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

   1. distribute-rgt1-in 78.7%

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

   2. associate-/l/ 78.6%

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

   3. div-sub 77.8%

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

   4. associate-/l* 77.8%

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

   5. *-inverses 79.0%

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

   6. /-rgt-identity 79.0%

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

3. Simplified 79.0%

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

5. Taylor expanded in wj around 0 97.0%

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

6. Taylor expanded in wj around inf 95.7%

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

7. Taylor expanded in x around 0 95.7%

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

8. Taylor expanded in x around 0 95.7%

   \[\leadsto \color{blue}{x + {wj}^{2}} \]
9. Step-by-step derivation

   1. +-commutative 95.7%

      \[\leadsto \color{blue}{{wj}^{2} + x} \]

   2. unpow2 95.7%

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

   3. fma-udef 95.7%

      \[\leadsto \color{blue}{\mathsf{fma}\left(wj, wj, x\right)} \]

10. Simplified 95.7%

    \[\leadsto \color{blue}{\mathsf{fma}\left(wj, wj, x\right)} \]

11. Final simplification 95.7%

    \[\leadsto \mathsf{fma}\left(wj, wj, x\right) \]
12. Add Preprocessing

Alternative 7: 84.4% 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 77.9%

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

   1. distribute-rgt1-in 78.7%

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

   2. associate-/l/ 78.6%

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

   3. div-sub 77.8%

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

   4. associate-/l* 77.8%

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

   5. *-inverses 79.0%

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

   6. /-rgt-identity 79.0%

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

3. Simplified 79.0%

   \[\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: 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 77.9%

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

   1. distribute-rgt1-in 78.7%

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

   2. associate-/l/ 78.6%

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

   3. div-sub 77.8%

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

   4. associate-/l* 77.8%

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

   5. *-inverses 79.0%

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

   6. /-rgt-identity 79.0%

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

3. Simplified 79.0%

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

5. Taylor expanded in wj around inf 4.1%

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

6. Final simplification 4.1%

   \[\leadsto wj \]
7. Add Preprocessing

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

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

   1. distribute-rgt1-in 78.7%

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

   2. associate-/l/ 78.6%

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

   3. div-sub 77.8%

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

   4. associate-/l* 77.8%

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

   5. *-inverses 79.0%

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

   6. /-rgt-identity 79.0%

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

3. Simplified 79.0%

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

5. Taylor expanded in wj around 0 84.4%

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

6. Final simplification 84.4%

   \[\leadsto x \]
7. Add Preprocessing

Developer target: 79.0% 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 2024031 
(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))))))