Jmat.Real.lambertw, newton loop step

Percentage Accurate: 77.6% → 98.3%

Time: 8.8s

Alternatives: 13

Speedup: 55.2×

• could not determine a ground truth

  1. wj = 2.4328761757586566e+113
  2. x = -9.091798231570794e+123

Specification

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 77.6% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 98.3% accurate, 1.3× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 80.9%

   \[wj - \frac{wj \cdot e^{wj} - x}{e^{wj} + wj \cdot e^{wj}} \]
2. Add Preprocessing

3. Taylor expanded in x around inf

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

   1. *-commutative N/A

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

   2. lower-*.f64 N/A

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

5. Applied rewrites 90.2%

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

6. Taylor expanded in wj around 0

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

8. Applied rewrites 99.0%

   \[\leadsto \left(\frac{\mathsf{fma}\left({wj}^{3}, \mathsf{fma}\left(1 - wj, wj, -1\right), wj \cdot wj\right)}{x} + \frac{e^{-wj}}{1 + wj}\right) \cdot x \]

9. Final simplification 99.0%

   \[\leadsto \left(\frac{e^{-wj}}{1 + wj} + \frac{\mathsf{fma}\left({wj}^{3}, \mathsf{fma}\left(1 - wj, wj, -1\right), wj \cdot wj\right)}{x}\right) \cdot x \]
10. Add Preprocessing

Alternative 2: 98.2% accurate, 1.8× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 80.9%

   \[wj - \frac{wj \cdot e^{wj} - x}{e^{wj} + wj \cdot e^{wj}} \]
2. Add Preprocessing

3. Taylor expanded in x around inf

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

   1. *-commutative N/A

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

   2. lower-*.f64 N/A

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

5. Applied rewrites 90.2%

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

6. Taylor expanded in wj around 0

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

8. Applied rewrites 98.9%

   \[\leadsto \left(\left(\mathsf{fma}\left(\mathsf{fma}\left(\frac{1 - wj}{x}, wj, \frac{-1}{x}\right), wj, \frac{1}{x}\right) \cdot wj\right) \cdot wj + \frac{e^{-wj}}{1 + wj}\right) \cdot x \]
9. Add Preprocessing

Alternative 3: 98.3% accurate, 2.1× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 80.9%

   \[wj - \frac{wj \cdot e^{wj} - x}{e^{wj} + wj \cdot e^{wj}} \]
2. Add Preprocessing

3. Taylor expanded in x around inf

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

   1. *-commutative N/A

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

   2. lower-*.f64 N/A

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

5. Applied rewrites 90.2%

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

6. Taylor expanded in wj around 0

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

8. Applied rewrites 98.8%

   \[\leadsto \left(\frac{\left(\mathsf{fma}\left(wj - 1, wj, 1\right) \cdot wj\right) \cdot wj}{x} + \frac{e^{-wj}}{1 + wj}\right) \cdot x \]
9. Add Preprocessing

Alternative 4: 96.6% accurate, 2.2× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 80.9%

   \[wj - \frac{wj \cdot e^{wj} - x}{e^{wj} + wj \cdot e^{wj}} \]
2. Add Preprocessing

3. Taylor expanded in x around inf

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

   1. *-commutative N/A

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

   2. lower-*.f64 N/A

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

5. Applied rewrites 90.2%

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

6. Taylor expanded in wj around 0

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

8. Applied rewrites 99.0%

   \[\leadsto \left(\frac{\mathsf{fma}\left({wj}^{3}, \mathsf{fma}\left(1 - wj, wj, -1\right), wj \cdot wj\right)}{x} + \frac{e^{-wj}}{1 + wj}\right) \cdot x \]

9. Taylor expanded in wj around 0

   \[\leadsto \left(\frac{\mathsf{fma}\left({wj}^{3}, \mathsf{fma}\left(1 - wj, wj, -1\right), wj \cdot wj\right)}{x} + \left(1 + wj \cdot \left(\frac{5}{2} \cdot wj - 2\right)\right)\right) \cdot x \]
10. Step-by-step derivation

11. Applied rewrites 98.6%

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

12. Final simplification 98.6%

    \[\leadsto \left(\mathsf{fma}\left(\mathsf{fma}\left(2.5, wj, -2\right), wj, 1\right) + \frac{\mathsf{fma}\left({wj}^{3}, \mathsf{fma}\left(1 - wj, wj, -1\right), wj \cdot wj\right)}{x}\right) \cdot x \]
13. Add Preprocessing

Alternative 5: 96.6% accurate, 4.2× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 80.9%

   \[wj - \frac{wj \cdot e^{wj} - x}{e^{wj} + wj \cdot e^{wj}} \]
2. Add Preprocessing

3. Taylor expanded in x around inf

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

   1. *-commutative N/A

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

   2. lower-*.f64 N/A

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

5. Applied rewrites 90.2%

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

6. Taylor expanded in wj around 0

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

8. Applied rewrites 98.9%

   \[\leadsto \left(\left(\mathsf{fma}\left(\mathsf{fma}\left(\frac{1 - wj}{x}, wj, \frac{-1}{x}\right), wj, \frac{1}{x}\right) \cdot wj\right) \cdot wj + \frac{e^{-wj}}{1 + wj}\right) \cdot x \]

9. Taylor expanded in wj around 0

   \[\leadsto \left(\left(\mathsf{fma}\left(\mathsf{fma}\left(\frac{1 - wj}{x}, wj, \frac{-1}{x}\right), wj, \frac{1}{x}\right) \cdot wj\right) \cdot wj + \left(1 + wj \cdot \left(\frac{5}{2} \cdot wj - 2\right)\right)\right) \cdot x \]
10. Step-by-step derivation

11. Applied rewrites 98.6%

    \[\leadsto \left(\left(\mathsf{fma}\left(\mathsf{fma}\left(\frac{1 - wj}{x}, wj, \frac{-1}{x}\right), wj, \frac{1}{x}\right) \cdot wj\right) \cdot wj + \mathsf{fma}\left(\mathsf{fma}\left(2.5, wj, -2\right), wj, 1\right)\right) \cdot x \]

12. Final simplification 98.6%

    \[\leadsto \left(\mathsf{fma}\left(\mathsf{fma}\left(2.5, wj, -2\right), wj, 1\right) + \left(\mathsf{fma}\left(\mathsf{fma}\left(\frac{1 - wj}{x}, wj, \frac{-1}{x}\right), wj, \frac{1}{x}\right) \cdot wj\right) \cdot wj\right) \cdot x \]
13. Add Preprocessing

Alternative 6: 96.4% accurate, 7.7× speedup

Math

\[\begin{array}{l} \\ \mathsf{fma}\left(\mathsf{fma}\left(\left(\frac{1 - wj}{x} - 2.6666666666666665 \cdot wj\right) + 2.5, wj, -2\right), wj, 1\right) \cdot x \end{array} \]

FPCore

(FPCore (wj x)
 :precision binary64
 (*
  (fma
   (fma (+ (- (/ (- 1.0 wj) x) (* 2.6666666666666665 wj)) 2.5) wj -2.0)
   wj
   1.0)
  x))

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 80.9%

   \[wj - \frac{wj \cdot e^{wj} - x}{e^{wj} + wj \cdot e^{wj}} \]
2. Add Preprocessing

3. Taylor expanded in x around inf

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

   1. *-commutative N/A

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

   2. lower-*.f64 N/A

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

5. Applied rewrites 90.2%

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

6. Taylor expanded in wj around 0

   \[\leadsto \left(1 + wj \cdot \left(wj \cdot \left(\frac{5}{2} + \left(-1 \cdot \left(wj \cdot \left(\frac{8}{3} + \frac{1}{x}\right)\right) + \frac{1}{x}\right)\right) - 2\right)\right) \cdot x \]
7. Step-by-step derivation

8. Applied rewrites 98.1%

   \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(\left(\frac{1 - wj}{x} - 2.6666666666666665 \cdot wj\right) + 2.5, wj, -2\right), wj, 1\right) \cdot x \]
9. Add Preprocessing

Alternative 7: 83.6% accurate, 12.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(\left(1 - wj\right) \cdot wj\right) \cdot wj\\ \mathbf{if}\;wj \leq -1.22 \cdot 10^{-29}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;wj \leq 3.6 \cdot 10^{-36}:\\ \;\;\;\;\mathsf{fma}\left(-2, wj, 1\right) \cdot x\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (wj x)
 :precision binary64
 (let* ((t_0 (* (* (- 1.0 wj) wj) wj)))
   (if (<= wj -1.22e-29)
     t_0
     (if (<= wj 3.6e-36) (* (fma -2.0 wj 1.0) x) t_0))))

C

double code(double wj, double x) {
	double t_0 = ((1.0 - wj) * wj) * wj;
	double tmp;
	if (wj <= -1.22e-29) {
		tmp = t_0;
	} else if (wj <= 3.6e-36) {
		tmp = fma(-2.0, wj, 1.0) * x;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Julia

function code(wj, x)
	t_0 = Float64(Float64(Float64(1.0 - wj) * wj) * wj)
	tmp = 0.0
	if (wj <= -1.22e-29)
		tmp = t_0;
	elseif (wj <= 3.6e-36)
		tmp = Float64(fma(-2.0, wj, 1.0) * x);
	else
		tmp = t_0;
	end
	return tmp
end

Wolfram

code[wj_, x_] := Block[{t$95$0 = N[(N[(N[(1.0 - wj), $MachinePrecision] * wj), $MachinePrecision] * wj), $MachinePrecision]}, If[LessEqual[wj, -1.22e-29], t$95$0, If[LessEqual[wj, 3.6e-36], N[(N[(-2.0 * wj + 1.0), $MachinePrecision] * x), $MachinePrecision], t$95$0]]]

Derivation

1. Split input into 2 regimes

2. if wj < -1.21999999999999996e-29 or 3.60000000000000032e-36 < wj

   1. Initial program 46.2%

      \[wj - \frac{wj \cdot e^{wj} - x}{e^{wj} + wj \cdot e^{wj}} \]
   2. Add Preprocessing

   3. Taylor expanded in wj around 0

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

   5. Applied rewrites 83.4%

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

   6. Taylor expanded in x around 0

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

   8. Applied rewrites 63.7%

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

   if -1.21999999999999996e-29 < wj < 3.60000000000000032e-36

   1. Initial program 85.3%

      \[wj - \frac{wj \cdot e^{wj} - x}{e^{wj} + wj \cdot e^{wj}} \]
   2. Add Preprocessing

   3. Taylor expanded in wj around 0

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

   5. Applied rewrites 99.6%

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

   6. Taylor expanded in wj around 0

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

      1. associate-*r* N/A

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

      2. distribute-rgt1-in N/A

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

      3. +-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. +-commutative N/A

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

      6. lower-fma.f64 94.6

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

   8. Applied rewrites 94.6%

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

Alternative 8: 95.7% accurate, 22.1× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 80.9%

   \[wj - \frac{wj \cdot e^{wj} - x}{e^{wj} + wj \cdot e^{wj}} \]
2. Add Preprocessing

3. Taylor expanded in wj around 0

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

5. Applied rewrites 97.7%

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

6. Taylor expanded in x around 0

   \[\leadsto \mathsf{fma}\left(wj \cdot \left(1 - wj\right), wj, x\right) \]
7. Step-by-step derivation

8. Applied rewrites 97.8%

   \[\leadsto \mathsf{fma}\left(\left(1 - wj\right) \cdot wj, wj, x\right) \]
9. Add Preprocessing

Alternative 9: 84.8% accurate, 27.6× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 80.9%

   \[wj - \frac{wj \cdot e^{wj} - x}{e^{wj} + wj \cdot e^{wj}} \]
2. Add Preprocessing

3. Taylor expanded in wj around 0

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

   1. +-commutative N/A

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

   2. *-commutative N/A

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

   3. lower-fma.f64 N/A

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

   4. *-commutative N/A

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

   5. lower-*.f64 86.5

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

5. Applied rewrites 86.5%

   \[\leadsto \color{blue}{\mathsf{fma}\left(x \cdot wj, -2, x\right)} \]
6. Add Preprocessing

Alternative 10: 84.8% accurate, 27.6× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 80.9%

   \[wj - \frac{wj \cdot e^{wj} - x}{e^{wj} + wj \cdot e^{wj}} \]
2. Add Preprocessing

3. Taylor expanded in wj around 0

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

5. Applied rewrites 97.7%

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

6. Taylor expanded in wj around 0

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

   1. associate-*r* N/A

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

   2. distribute-rgt1-in N/A

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

   3. +-commutative N/A

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

   4. lower-*.f64 N/A

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

   5. +-commutative N/A

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

   6. lower-fma.f64 86.5

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

8. Applied rewrites 86.5%

   \[\leadsto \color{blue}{\mathsf{fma}\left(-2, wj, 1\right) \cdot x} \]
9. Add Preprocessing

Alternative 11: 84.2% accurate, 55.2× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 80.9%

   \[wj - \frac{wj \cdot e^{wj} - x}{e^{wj} + wj \cdot e^{wj}} \]
2. Add Preprocessing

3. Taylor expanded in x around inf

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

   1. *-commutative N/A

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

   2. lower-*.f64 N/A

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

5. Applied rewrites 90.2%

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

6. Taylor expanded in wj around 0

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

8. Applied rewrites 99.0%

   \[\leadsto \left(\frac{\mathsf{fma}\left({wj}^{3}, \mathsf{fma}\left(1 - wj, wj, -1\right), wj \cdot wj\right)}{x} + \frac{e^{-wj}}{1 + wj}\right) \cdot x \]

9. Taylor expanded in wj around 0

   \[\leadsto 1 \cdot x \]
10. Step-by-step derivation

11. Applied rewrites 86.2%

    \[\leadsto 1 \cdot x \]
12. Add Preprocessing

Alternative 12: 4.2% accurate, 82.8× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

def code(wj, x):
	return wj - 1.0

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 80.9%

   \[wj - \frac{wj \cdot e^{wj} - x}{e^{wj} + wj \cdot e^{wj}} \]
2. Add Preprocessing

3. Taylor expanded in wj around inf

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

   1. sub-neg N/A

      \[\leadsto wj \cdot \color{blue}{\left(1 + \left(\mathsf{neg}\left(\frac{1}{wj}\right)\right)\right)} \]

   2. +-commutative N/A

      \[\leadsto wj \cdot \color{blue}{\left(\left(\mathsf{neg}\left(\frac{1}{wj}\right)\right) + 1\right)} \]

   3. distribute-lft-in N/A

      \[\leadsto \color{blue}{wj \cdot \left(\mathsf{neg}\left(\frac{1}{wj}\right)\right) + wj \cdot 1} \]

   4. distribute-rgt-neg-out N/A

      \[\leadsto \color{blue}{\left(\mathsf{neg}\left(wj \cdot \frac{1}{wj}\right)\right)} + wj \cdot 1 \]

   5. rgt-mult-inverse N/A

      \[\leadsto \left(\mathsf{neg}\left(\color{blue}{1}\right)\right) + wj \cdot 1 \]

   6. metadata-eval N/A

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

   7. *-rgt-identity N/A

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

   8. lower-+.f64 3.4

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

5. Applied rewrites 3.4%

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

6. Final simplification 3.4%

   \[\leadsto wj - 1 \]
7. Add Preprocessing

Alternative 13: 3.4% accurate, 331.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 80.9%

   \[wj - \frac{wj \cdot e^{wj} - x}{e^{wj} + wj \cdot e^{wj}} \]
2. Add Preprocessing

3. Taylor expanded in wj around inf

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

   1. sub-neg N/A

      \[\leadsto wj \cdot \color{blue}{\left(1 + \left(\mathsf{neg}\left(\frac{1}{wj}\right)\right)\right)} \]

   2. +-commutative N/A

      \[\leadsto wj \cdot \color{blue}{\left(\left(\mathsf{neg}\left(\frac{1}{wj}\right)\right) + 1\right)} \]

   3. distribute-lft-in N/A

      \[\leadsto \color{blue}{wj \cdot \left(\mathsf{neg}\left(\frac{1}{wj}\right)\right) + wj \cdot 1} \]

   4. distribute-rgt-neg-out N/A

      \[\leadsto \color{blue}{\left(\mathsf{neg}\left(wj \cdot \frac{1}{wj}\right)\right)} + wj \cdot 1 \]

   5. rgt-mult-inverse N/A

      \[\leadsto \left(\mathsf{neg}\left(\color{blue}{1}\right)\right) + wj \cdot 1 \]

   6. metadata-eval N/A

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

   7. *-rgt-identity N/A

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

   8. lower-+.f64 3.4

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

5. Applied rewrites 3.4%

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

6. Taylor expanded in wj around 0

   \[\leadsto -1 \]
7. Step-by-step derivation

8. Applied rewrites 3.2%

   \[\leadsto -1 \]
9. Add Preprocessing

Developer Target 1: 78.5% accurate, 1.4× 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 2024325 
(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))))))