Jmat.Real.lambertw, newton loop step

Percentage Accurate: 78.1% → 96.7%

Time: 8.5s

Alternatives: 8

Speedup: 1.0×

• could not determine a ground truth

  1. wj = 1.127014912971164e+179
  2. x = 3.7764136014889204e-139

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

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(wj, x)
use fmin_fmax_functions
    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

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(wj, x)
use fmin_fmax_functions
    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: 96.7% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := wj \cdot e^{wj}\\ \mathbf{if}\;wj - \frac{t\_0 - x}{e^{wj} + t\_0} \leq 10^{+301}:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(\left(1 - \mathsf{fma}\left(\mathsf{fma}\left(-3, x, \mathsf{fma}\left(0.6666666666666666, x, x \cdot 5\right)\right), wj, wj\right)\right) - -2.5 \cdot x, wj, -2 \cdot x\right), wj, x\right)\\ \mathbf{else}:\\ \;\;\;\;wj - \frac{wj}{wj - -1}\\ \end{array} \end{array} \]

FPCore

(FPCore (wj x)
 :precision binary64
 (let* ((t_0 (* wj (exp wj))))
   (if (<= (- wj (/ (- t_0 x) (+ (exp wj) t_0))) 1e+301)
     (fma
      (fma
       (-
        (- 1.0 (fma (fma -3.0 x (fma 0.6666666666666666 x (* x 5.0))) wj wj))
        (* -2.5 x))
       wj
       (* -2.0 x))
      wj
      x)
     (- wj (/ wj (- wj -1.0))))))

C

double code(double wj, double x) {
	double t_0 = wj * exp(wj);
	double tmp;
	if ((wj - ((t_0 - x) / (exp(wj) + t_0))) <= 1e+301) {
		tmp = fma(fma(((1.0 - fma(fma(-3.0, x, fma(0.6666666666666666, x, (x * 5.0))), wj, wj)) - (-2.5 * x)), wj, (-2.0 * x)), wj, x);
	} else {
		tmp = 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(t_0 - x) / Float64(exp(wj) + t_0))) <= 1e+301)
		tmp = fma(fma(Float64(Float64(1.0 - fma(fma(-3.0, x, fma(0.6666666666666666, x, Float64(x * 5.0))), wj, wj)) - Float64(-2.5 * x)), wj, Float64(-2.0 * x)), wj, x);
	else
		tmp = Float64(wj - Float64(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[(t$95$0 - x), $MachinePrecision] / N[(N[Exp[wj], $MachinePrecision] + t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 1e+301], N[(N[(N[(N[(1.0 - N[(N[(-3.0 * x + N[(0.6666666666666666 * x + N[(x * 5.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * wj + wj), $MachinePrecision]), $MachinePrecision] - N[(-2.5 * x), $MachinePrecision]), $MachinePrecision] * wj + N[(-2.0 * x), $MachinePrecision]), $MachinePrecision] * wj + x), $MachinePrecision], N[(wj - N[(wj / 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.00000000000000005e301

   1. Initial program 79.6%

      \[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)} \]
   4. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto \color{blue}{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) + x} \]

      2. *-commutative N/A

         \[\leadsto \color{blue}{\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) \cdot wj} + x \]

      3. lower-fma.f64 N/A

         \[\leadsto \color{blue}{\mathsf{fma}\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, wj, x\right)} \]

   5. Applied rewrites 99.3%

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

   if 1.00000000000000005e301 < (-.f64 wj (/.f64 (-.f64 (*.f64 wj (exp.f64 wj)) x) (+.f64 (exp.f64 wj) (*.f64 wj (exp.f64 wj)))))

   1. Initial program 0.0%

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

   3. Taylor expanded in x around 0

      \[\leadsto wj - \color{blue}{\frac{wj \cdot e^{wj}}{e^{wj} + wj \cdot e^{wj}}} \]
   4. Step-by-step derivation

      1. *-commutative N/A

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

      2. distribute-rgt1-in N/A

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

      3. +-commutative N/A

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

      4. *-commutative N/A

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

      5. times-frac N/A

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

      6. lower-*.f64 N/A

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

      7. div-exp N/A

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

      8. lower-exp.f64 N/A

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

      9. lower--.f64 N/A

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

      10. lower-/.f64 N/A

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

      11. lower-+.f64 83.9

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

   5. Applied rewrites 83.9%

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

   7. Applied rewrites 83.9%

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

Alternative 2: 96.5% accurate, 0.9× speedup

Math

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

FPCore

(FPCore (wj x)
 :precision binary64
 (let* ((t_0 (* wj (exp wj))))
   (if (<= (- wj (/ (- t_0 x) (+ (exp wj) t_0))) 1e+301)
     (fma (fma (- 1.0 wj) wj (* -2.0 x)) wj x)
     (- wj (/ wj (- wj -1.0))))))

C

double code(double wj, double x) {
	double t_0 = wj * exp(wj);
	double tmp;
	if ((wj - ((t_0 - x) / (exp(wj) + t_0))) <= 1e+301) {
		tmp = fma(fma((1.0 - wj), wj, (-2.0 * x)), wj, x);
	} else {
		tmp = 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(t_0 - x) / Float64(exp(wj) + t_0))) <= 1e+301)
		tmp = fma(fma(Float64(1.0 - wj), wj, Float64(-2.0 * x)), wj, x);
	else
		tmp = Float64(wj - Float64(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[(t$95$0 - x), $MachinePrecision] / N[(N[Exp[wj], $MachinePrecision] + t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 1e+301], N[(N[(N[(1.0 - wj), $MachinePrecision] * wj + N[(-2.0 * x), $MachinePrecision]), $MachinePrecision] * wj + x), $MachinePrecision], N[(wj - N[(wj / 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.00000000000000005e301

   1. Initial program 79.6%

      \[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)} \]
   4. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto \color{blue}{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) + x} \]

      2. *-commutative N/A

         \[\leadsto \color{blue}{\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) \cdot wj} + x \]

      3. lower-fma.f64 N/A

         \[\leadsto \color{blue}{\mathsf{fma}\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, wj, x\right)} \]

   5. Applied rewrites 99.3%

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

   6. Taylor expanded in x around 0

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

   8. Applied rewrites 99.0%

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

   if 1.00000000000000005e301 < (-.f64 wj (/.f64 (-.f64 (*.f64 wj (exp.f64 wj)) x) (+.f64 (exp.f64 wj) (*.f64 wj (exp.f64 wj)))))

   1. Initial program 0.0%

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

   3. Taylor expanded in x around 0

      \[\leadsto wj - \color{blue}{\frac{wj \cdot e^{wj}}{e^{wj} + wj \cdot e^{wj}}} \]
   4. Step-by-step derivation

      1. *-commutative N/A

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

      2. distribute-rgt1-in N/A

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

      3. +-commutative N/A

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

      4. *-commutative N/A

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

      5. times-frac N/A

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

      6. lower-*.f64 N/A

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

      7. div-exp N/A

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

      8. lower-exp.f64 N/A

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

      9. lower--.f64 N/A

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

      10. lower-/.f64 N/A

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

      11. lower-+.f64 83.9

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

   5. Applied rewrites 83.9%

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

   7. Applied rewrites 83.9%

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

Alternative 3: 96.1% accurate, 0.9× speedup

Math

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

FPCore

(FPCore (wj x)
 :precision binary64
 (let* ((t_0 (* wj (exp wj))))
   (if (<= (- wj (/ (- t_0 x) (+ (exp wj) t_0))) 1e+301)
     (fma (* (- 1.0 wj) wj) wj x)
     (- wj (/ wj (- wj -1.0))))))

C

double code(double wj, double x) {
	double t_0 = wj * exp(wj);
	double tmp;
	if ((wj - ((t_0 - x) / (exp(wj) + t_0))) <= 1e+301) {
		tmp = fma(((1.0 - wj) * wj), wj, x);
	} else {
		tmp = 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(t_0 - x) / Float64(exp(wj) + t_0))) <= 1e+301)
		tmp = fma(Float64(Float64(1.0 - wj) * wj), wj, x);
	else
		tmp = Float64(wj - Float64(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[(t$95$0 - x), $MachinePrecision] / N[(N[Exp[wj], $MachinePrecision] + t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 1e+301], N[(N[(N[(1.0 - wj), $MachinePrecision] * wj), $MachinePrecision] * wj + x), $MachinePrecision], N[(wj - N[(wj / 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.00000000000000005e301

   1. Initial program 79.6%

      \[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)} \]
   4. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto \color{blue}{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) + x} \]

      2. *-commutative N/A

         \[\leadsto \color{blue}{\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) \cdot wj} + x \]

      3. lower-fma.f64 N/A

         \[\leadsto \color{blue}{\mathsf{fma}\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, wj, x\right)} \]

   5. Applied rewrites 99.3%

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

   6. Taylor expanded in x around 0

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

   8. Applied rewrites 99.0%

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

   9. Taylor expanded in x around 0

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

   11. Applied rewrites 98.3%

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

   if 1.00000000000000005e301 < (-.f64 wj (/.f64 (-.f64 (*.f64 wj (exp.f64 wj)) x) (+.f64 (exp.f64 wj) (*.f64 wj (exp.f64 wj)))))

   1. Initial program 0.0%

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

   3. Taylor expanded in x around 0

      \[\leadsto wj - \color{blue}{\frac{wj \cdot e^{wj}}{e^{wj} + wj \cdot e^{wj}}} \]
   4. Step-by-step derivation

      1. *-commutative N/A

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

      2. distribute-rgt1-in N/A

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

      3. +-commutative N/A

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

      4. *-commutative N/A

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

      5. times-frac N/A

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

      6. lower-*.f64 N/A

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

      7. div-exp N/A

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

      8. lower-exp.f64 N/A

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

      9. lower--.f64 N/A

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

      10. lower-/.f64 N/A

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

      11. lower-+.f64 83.9

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

   5. Applied rewrites 83.9%

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

   7. Applied rewrites 83.9%

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

Alternative 4: 95.9% accurate, 0.9× speedup

Math

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

FPCore

(FPCore (wj x)
 :precision binary64
 (let* ((t_0 (* wj (exp wj))))
   (if (<= (- wj (/ (- t_0 x) (+ (exp wj) t_0))) 1e+301)
     (fma (* (- 1.0 wj) wj) wj x)
     (- wj 1.0))))

C

double code(double wj, double x) {
	double t_0 = wj * exp(wj);
	double tmp;
	if ((wj - ((t_0 - x) / (exp(wj) + t_0))) <= 1e+301) {
		tmp = fma(((1.0 - wj) * wj), wj, x);
	} else {
		tmp = wj - 1.0;
	}
	return tmp;
}

Julia

function code(wj, x)
	t_0 = Float64(wj * exp(wj))
	tmp = 0.0
	if (Float64(wj - Float64(Float64(t_0 - x) / Float64(exp(wj) + t_0))) <= 1e+301)
		tmp = fma(Float64(Float64(1.0 - wj) * wj), wj, x);
	else
		tmp = 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[(t$95$0 - x), $MachinePrecision] / N[(N[Exp[wj], $MachinePrecision] + t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 1e+301], N[(N[(N[(1.0 - wj), $MachinePrecision] * wj), $MachinePrecision] * wj + x), $MachinePrecision], N[(wj - 1.0), $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.00000000000000005e301

   1. Initial program 79.6%

      \[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)} \]
   4. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto \color{blue}{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) + x} \]

      2. *-commutative N/A

         \[\leadsto \color{blue}{\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) \cdot wj} + x \]

      3. lower-fma.f64 N/A

         \[\leadsto \color{blue}{\mathsf{fma}\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, wj, x\right)} \]

   5. Applied rewrites 99.3%

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

   6. Taylor expanded in x around 0

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

   8. Applied rewrites 99.0%

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

   9. Taylor expanded in x around 0

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

   11. Applied rewrites 98.3%

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

   if 1.00000000000000005e301 < (-.f64 wj (/.f64 (-.f64 (*.f64 wj (exp.f64 wj)) x) (+.f64 (exp.f64 wj) (*.f64 wj (exp.f64 wj)))))

   1. Initial program 0.0%

      \[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. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower--.f64 N/A

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

      4. lower-/.f64 69.2

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

   5. Applied rewrites 69.2%

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

   6. Taylor expanded in wj around 0

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

   8. Applied rewrites 69.2%

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

Alternative 5: 85.5% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (wj x)
 :precision binary64
 (let* ((t_0 (* wj (exp wj))))
   (if (<= (- wj (/ (- t_0 x) (+ (exp wj) t_0))) 1e+301)
     (fma (* x wj) -2.0 x)
     (- wj 1.0))))

C

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

Julia

function code(wj, x)
	t_0 = Float64(wj * exp(wj))
	tmp = 0.0
	if (Float64(wj - Float64(Float64(t_0 - x) / Float64(exp(wj) + t_0))) <= 1e+301)
		tmp = fma(Float64(x * wj), -2.0, x);
	else
		tmp = 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[(t$95$0 - x), $MachinePrecision] / N[(N[Exp[wj], $MachinePrecision] + t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 1e+301], N[(N[(x * wj), $MachinePrecision] * -2.0 + x), $MachinePrecision], N[(wj - 1.0), $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.00000000000000005e301

   1. Initial program 79.6%

      \[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 89.2

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

   5. Applied rewrites 89.2%

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

   if 1.00000000000000005e301 < (-.f64 wj (/.f64 (-.f64 (*.f64 wj (exp.f64 wj)) x) (+.f64 (exp.f64 wj) (*.f64 wj (exp.f64 wj)))))

   1. Initial program 0.0%

      \[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. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower--.f64 N/A

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

      4. lower-/.f64 69.2

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

   5. Applied rewrites 69.2%

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

   6. Taylor expanded in wj around 0

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

   8. Applied rewrites 69.2%

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

Alternative 6: 73.0% accurate, 55.2× speedup

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 77.7%

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

3. Taylor expanded in wj around 0

   \[\leadsto wj - \color{blue}{-1 \cdot x} \]
4. Step-by-step derivation

   1. mul-1-neg N/A

      \[\leadsto wj - \color{blue}{\left(\mathsf{neg}\left(x\right)\right)} \]

   2. lower-neg.f64 73.4

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

5. Applied rewrites 73.4%

   \[\leadsto wj - \color{blue}{\left(-x\right)} \]
6. Add Preprocessing

Alternative 7: 4.0% 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

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(wj, x)
use fmin_fmax_functions
    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 77.7%

   \[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. *-commutative N/A

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

   2. lower-*.f64 N/A

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

   3. lower--.f64 N/A

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

   4. lower-/.f64 4.9

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

5. Applied rewrites 4.9%

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

6. Taylor expanded in wj around 0

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

8. Applied rewrites 4.9%

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

Alternative 8: 3.3% 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

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(wj, x)
use fmin_fmax_functions
    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 77.7%

   \[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. *-commutative N/A

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

   2. lower-*.f64 N/A

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

   3. lower--.f64 N/A

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

   4. lower-/.f64 4.9

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

5. Applied rewrites 4.9%

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

6. Taylor expanded in wj around 0

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

8. Applied rewrites 3.3%

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

Developer Target 1: 78.9% 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

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(wj, x)
use fmin_fmax_functions
    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 2024362 
(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))))))