Jmat.Real.lambertw, newton loop step

Percentage Accurate: 77.8% → 96.6%

Time: 4.5s

Alternatives: 9

Speedup: 48.6×

• could not determine a ground truth

  1. wj = 4.118176269865806e+183
  2. x = -3.1763960998375676e+179

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: 77.8% 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.6% accurate, 1.5× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 77.8%

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

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

   1. +-commutative N/A

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

   2. *-commutative N/A

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

4. Applied rewrites 96.5%

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

5. Taylor expanded in x around inf

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

   1. *-commutative N/A

      \[\leadsto \left(1 + \left(wj \cdot \left(wj \cdot \left(\frac{5}{2} - \frac{8}{3} \cdot wj\right) - 2\right) + \frac{{wj}^{2} \cdot \left(1 - wj\right)}{x}\right)\right) \cdot x \]

   2. lower-*.f64 N/A

      \[\leadsto \left(1 + \left(wj \cdot \left(wj \cdot \left(\frac{5}{2} - \frac{8}{3} \cdot wj\right) - 2\right) + \frac{{wj}^{2} \cdot \left(1 - wj\right)}{x}\right)\right) \cdot x \]

7. Applied rewrites 96.6%

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

9. Applied rewrites 96.6%

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

Alternative 2: 96.5% accurate, 1.7× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 77.8%

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

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

   1. +-commutative N/A

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

   2. *-commutative N/A

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

4. Applied rewrites 96.5%

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

5. Taylor expanded in x around inf

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

   1. *-commutative N/A

      \[\leadsto \left(1 + \left(wj \cdot \left(wj \cdot \left(\frac{5}{2} - \frac{8}{3} \cdot wj\right) - 2\right) + \frac{{wj}^{2} \cdot \left(1 - wj\right)}{x}\right)\right) \cdot x \]

   2. lower-*.f64 N/A

      \[\leadsto \left(1 + \left(wj \cdot \left(wj \cdot \left(\frac{5}{2} - \frac{8}{3} \cdot wj\right) - 2\right) + \frac{{wj}^{2} \cdot \left(1 - wj\right)}{x}\right)\right) \cdot x \]

7. Applied rewrites 96.6%

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

8. Taylor expanded in wj around 0

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

10. Applied rewrites 96.5%

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

Alternative 3: 96.4% accurate, 2.1× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 77.8%

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

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

   1. +-commutative N/A

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

   2. *-commutative N/A

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

4. Applied rewrites 96.5%

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

5. Taylor expanded in x around inf

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

   1. *-commutative N/A

      \[\leadsto \left(1 + \left(wj \cdot \left(wj \cdot \left(\frac{5}{2} - \frac{8}{3} \cdot wj\right) - 2\right) + \frac{{wj}^{2} \cdot \left(1 - wj\right)}{x}\right)\right) \cdot x \]

   2. lower-*.f64 N/A

      \[\leadsto \left(1 + \left(wj \cdot \left(wj \cdot \left(\frac{5}{2} - \frac{8}{3} \cdot wj\right) - 2\right) + \frac{{wj}^{2} \cdot \left(1 - wj\right)}{x}\right)\right) \cdot x \]

7. Applied rewrites 96.6%

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

9. Applied rewrites 96.6%

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

10. Taylor expanded in wj around 0

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

12. Applied rewrites 96.4%

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

Alternative 4: 96.3% accurate, 2.9× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 77.8%

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

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

   1. +-commutative N/A

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

   2. *-commutative N/A

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

4. Applied rewrites 96.5%

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

5. Taylor expanded in x around 0

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

   1. lower--.f64 96.3

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

7. Applied rewrites 96.3%

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

Alternative 5: 95.9% accurate, 4.2× 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 77.8%

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

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

   1. +-commutative N/A

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

   2. *-commutative N/A

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

4. Applied rewrites 96.5%

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

5. Taylor expanded in x around 0

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

   1. *-commutative N/A

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

   2. lower-*.f64 N/A

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

   3. lower--.f64 95.9

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

7. Applied rewrites 95.9%

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

Alternative 6: 95.5% accurate, 8.2× 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.8%

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

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

   1. +-commutative N/A

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

   2. *-commutative N/A

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

4. Applied rewrites 96.5%

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

5. Taylor expanded in x around 0

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

   1. *-commutative N/A

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

   2. lower-*.f64 N/A

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

   3. lower--.f64 95.9

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

7. Applied rewrites 95.9%

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

8. Taylor expanded in wj around 0

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

10. Applied rewrites 95.5%

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

Alternative 7: 84.1% accurate, 6.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;wj \leq 2.05 \cdot 10^{-28}:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;wj \cdot wj\\ \end{array} \end{array} \]

FPCore

(FPCore (wj x) :precision binary64 (if (<= wj 2.05e-28) x (* wj wj)))

C

double code(double wj, double x) {
	double tmp;
	if (wj <= 2.05e-28) {
		tmp = x;
	} else {
		tmp = wj * wj;
	}
	return tmp;
}

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) :: tmp
    if (wj <= 2.05d-28) then
        tmp = x
    else
        tmp = wj * wj
    end if
    code = tmp
end function

Java

public static double code(double wj, double x) {
	double tmp;
	if (wj <= 2.05e-28) {
		tmp = x;
	} else {
		tmp = wj * wj;
	}
	return tmp;
}

Python

def code(wj, x):
	tmp = 0
	if wj <= 2.05e-28:
		tmp = x
	else:
		tmp = wj * wj
	return tmp

Julia

function code(wj, x)
	tmp = 0.0
	if (wj <= 2.05e-28)
		tmp = x;
	else
		tmp = Float64(wj * wj);
	end
	return tmp
end

MATLAB

function tmp_2 = code(wj, x)
	tmp = 0.0;
	if (wj <= 2.05e-28)
		tmp = x;
	else
		tmp = wj * wj;
	end
	tmp_2 = tmp;
end

Wolfram

code[wj_, x_] := If[LessEqual[wj, 2.05e-28], x, N[(wj * wj), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if wj < 2.0500000000000001e-28

   1. Initial program 78.9%

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

   2. Taylor expanded in wj around 0

      \[\leadsto \color{blue}{x} \]
   3. Step-by-step derivation

   4. Applied rewrites 87.2%

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

   if 2.0500000000000001e-28 < wj

   1. Initial program 58.6%

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

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

   4. Applied rewrites 67.2%

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

   5. Taylor expanded in x around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower--.f64 N/A

         \[\leadsto \left(1 - wj\right) \cdot {wj}^{2} \]

      4. unpow2 N/A

         \[\leadsto \left(1 - wj\right) \cdot \left(wj \cdot wj\right) \]

      5. lower-*.f64 32.0

         \[\leadsto \left(1 - wj\right) \cdot \left(wj \cdot wj\right) \]

   7. Applied rewrites 32.0%

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

   8. Taylor expanded in wj around 0

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

      1. pow2 N/A

         \[\leadsto wj \cdot wj \]

      2. lift-*.f64 30.3

         \[\leadsto wj \cdot wj \]

   10. Applied rewrites 30.3%

       \[\leadsto wj \cdot wj \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 8: 84.0% accurate, 48.6× 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

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 = 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.8%

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

2. Taylor expanded in wj around 0

   \[\leadsto \color{blue}{x} \]
3. Step-by-step derivation

4. Applied rewrites 84.1%

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

Alternative 9: 4.4% accurate, 48.6× 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

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
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.8%

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

2. Taylor expanded in wj around inf

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

4. Applied rewrites 4.4%

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

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

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

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