ENA, Section 1.4, Exercise 4b, n=5

Percentage Accurate: 88.2% → 98.4%

Time: 6.2s

Alternatives: 12

Speedup: 0.5×

Specification

\[\left(-1000000000 \leq x \land x \leq 1000000000\right) \land \left(-1 \leq \varepsilon \land \varepsilon \leq 1\right)\]

Math

\[\begin{array}{l} \\ {\left(x + \varepsilon\right)}^{5} - {x}^{5} \end{array} \]

FPCore

(FPCore (x eps) :precision binary64 (- (pow (+ x eps) 5.0) (pow x 5.0)))

C

double code(double x, double eps) {
	return pow((x + eps), 5.0) - pow(x, 5.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(x, eps)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: eps
    code = ((x + eps) ** 5.0d0) - (x ** 5.0d0)
end function

Java

public static double code(double x, double eps) {
	return Math.pow((x + eps), 5.0) - Math.pow(x, 5.0);
}

Python

def code(x, eps):
	return math.pow((x + eps), 5.0) - math.pow(x, 5.0)

Julia

function code(x, eps)
	return Float64((Float64(x + eps) ^ 5.0) - (x ^ 5.0))
end

MATLAB

function tmp = code(x, eps)
	tmp = ((x + eps) ^ 5.0) - (x ^ 5.0);
end

Wolfram

code[x_, eps_] := N[(N[Power[N[(x + eps), $MachinePrecision], 5.0], $MachinePrecision] - N[Power[x, 5.0], $MachinePrecision]), $MachinePrecision]

Initial Program: 88.2% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ {\left(x + \varepsilon\right)}^{5} - {x}^{5} \end{array} \]

FPCore

(FPCore (x eps) :precision binary64 (- (pow (+ x eps) 5.0) (pow x 5.0)))

C

double code(double x, double eps) {
	return pow((x + eps), 5.0) - pow(x, 5.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(x, eps)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: eps
    code = ((x + eps) ** 5.0d0) - (x ** 5.0d0)
end function

Java

public static double code(double x, double eps) {
	return Math.pow((x + eps), 5.0) - Math.pow(x, 5.0);
}

Python

def code(x, eps):
	return math.pow((x + eps), 5.0) - math.pow(x, 5.0)

Julia

function code(x, eps)
	return Float64((Float64(x + eps) ^ 5.0) - (x ^ 5.0))
end

MATLAB

function tmp = code(x, eps)
	tmp = ((x + eps) ^ 5.0) - (x ^ 5.0);
end

Wolfram

code[x_, eps_] := N[(N[Power[N[(x + eps), $MachinePrecision], 5.0], $MachinePrecision] - N[Power[x, 5.0], $MachinePrecision]), $MachinePrecision]

Alternative 1: 98.4% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := {\left(x + \varepsilon\right)}^{5} - {x}^{5}\\ \mathbf{if}\;t\_0 \leq -2 \cdot 10^{-293}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;t\_0 \leq 0:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left({x}^{3}, 6, {x}^{3} \cdot 4\right), \varepsilon, {x}^{4} \cdot 5\right) \cdot \varepsilon\\ \mathbf{else}:\\ \;\;\;\;\left(-\mathsf{fma}\left(\frac{\mathsf{fma}\left(5, x, \frac{\mathsf{fma}\left(x \cdot x, 10, \frac{10 \cdot {x}^{3}}{\varepsilon}\right)}{\varepsilon}\right)}{\varepsilon}, -1, -1\right)\right) \cdot {\varepsilon}^{5}\\ \end{array} \end{array} \]

FPCore

(FPCore (x eps)
 :precision binary64
 (let* ((t_0 (- (pow (+ x eps) 5.0) (pow x 5.0))))
   (if (<= t_0 -2e-293)
     t_0
     (if (<= t_0 0.0)
       (*
        (fma (fma (pow x 3.0) 6.0 (* (pow x 3.0) 4.0)) eps (* (pow x 4.0) 5.0))
        eps)
       (*
        (-
         (fma
          (/
           (fma 5.0 x (/ (fma (* x x) 10.0 (/ (* 10.0 (pow x 3.0)) eps)) eps))
           eps)
          -1.0
          -1.0))
        (pow eps 5.0))))))

C

double code(double x, double eps) {
	double t_0 = pow((x + eps), 5.0) - pow(x, 5.0);
	double tmp;
	if (t_0 <= -2e-293) {
		tmp = t_0;
	} else if (t_0 <= 0.0) {
		tmp = fma(fma(pow(x, 3.0), 6.0, (pow(x, 3.0) * 4.0)), eps, (pow(x, 4.0) * 5.0)) * eps;
	} else {
		tmp = -fma((fma(5.0, x, (fma((x * x), 10.0, ((10.0 * pow(x, 3.0)) / eps)) / eps)) / eps), -1.0, -1.0) * pow(eps, 5.0);
	}
	return tmp;
}

Julia

function code(x, eps)
	t_0 = Float64((Float64(x + eps) ^ 5.0) - (x ^ 5.0))
	tmp = 0.0
	if (t_0 <= -2e-293)
		tmp = t_0;
	elseif (t_0 <= 0.0)
		tmp = Float64(fma(fma((x ^ 3.0), 6.0, Float64((x ^ 3.0) * 4.0)), eps, Float64((x ^ 4.0) * 5.0)) * eps);
	else
		tmp = Float64(Float64(-fma(Float64(fma(5.0, x, Float64(fma(Float64(x * x), 10.0, Float64(Float64(10.0 * (x ^ 3.0)) / eps)) / eps)) / eps), -1.0, -1.0)) * (eps ^ 5.0));
	end
	return tmp
end

Wolfram

code[x_, eps_] := Block[{t$95$0 = N[(N[Power[N[(x + eps), $MachinePrecision], 5.0], $MachinePrecision] - N[Power[x, 5.0], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, -2e-293], t$95$0, If[LessEqual[t$95$0, 0.0], N[(N[(N[(N[Power[x, 3.0], $MachinePrecision] * 6.0 + N[(N[Power[x, 3.0], $MachinePrecision] * 4.0), $MachinePrecision]), $MachinePrecision] * eps + N[(N[Power[x, 4.0], $MachinePrecision] * 5.0), $MachinePrecision]), $MachinePrecision] * eps), $MachinePrecision], N[((-N[(N[(N[(5.0 * x + N[(N[(N[(x * x), $MachinePrecision] * 10.0 + N[(N[(10.0 * N[Power[x, 3.0], $MachinePrecision]), $MachinePrecision] / eps), $MachinePrecision]), $MachinePrecision] / eps), $MachinePrecision]), $MachinePrecision] / eps), $MachinePrecision] * -1.0 + -1.0), $MachinePrecision]) * N[Power[eps, 5.0], $MachinePrecision]), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if (-.f64 (pow.f64 (+.f64 x eps) #s(literal 5 binary64)) (pow.f64 x #s(literal 5 binary64))) < -2.0000000000000001e-293

   1. Initial program 94.4%

      \[{\left(x + \varepsilon\right)}^{5} - {x}^{5} \]
   2. Add Preprocessing

   if -2.0000000000000001e-293 < (-.f64 (pow.f64 (+.f64 x eps) #s(literal 5 binary64)) (pow.f64 x #s(literal 5 binary64))) < 0.0

   1. Initial program 86.2%

      \[{\left(x + \varepsilon\right)}^{5} - {x}^{5} \]
   2. Add Preprocessing

   3. Taylor expanded in eps around 0

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

   5. Applied rewrites 99.9%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left({x}^{3}, 6, {x}^{3} \cdot 4\right), \varepsilon, {x}^{4} \cdot 5\right) \cdot \varepsilon} \]

   if 0.0 < (-.f64 (pow.f64 (+.f64 x eps) #s(literal 5 binary64)) (pow.f64 x #s(literal 5 binary64)))

   1. Initial program 99.8%

      \[{\left(x + \varepsilon\right)}^{5} - {x}^{5} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

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

   5. Applied rewrites 98.9%

      \[\leadsto \color{blue}{\mathsf{fma}\left({\varepsilon}^{4} \cdot 5, x, {\varepsilon}^{5}\right)} \]

   6. Taylor expanded in eps around -inf

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

   8. Applied rewrites 100.0%

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

Alternative 2: 98.4% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := {\left(x + \varepsilon\right)}^{5} - {x}^{5}\\ \mathbf{if}\;t\_0 \leq -2 \cdot 10^{-293}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;t\_0 \leq 0:\\ \;\;\;\;\left({x}^{4} \cdot 5\right) \cdot \varepsilon\\ \mathbf{else}:\\ \;\;\;\;\left(-\mathsf{fma}\left(\frac{\mathsf{fma}\left(5, x, \frac{\mathsf{fma}\left(x \cdot x, 10, \frac{10 \cdot {x}^{3}}{\varepsilon}\right)}{\varepsilon}\right)}{\varepsilon}, -1, -1\right)\right) \cdot {\varepsilon}^{5}\\ \end{array} \end{array} \]

FPCore

(FPCore (x eps)
 :precision binary64
 (let* ((t_0 (- (pow (+ x eps) 5.0) (pow x 5.0))))
   (if (<= t_0 -2e-293)
     t_0
     (if (<= t_0 0.0)
       (* (* (pow x 4.0) 5.0) eps)
       (*
        (-
         (fma
          (/
           (fma 5.0 x (/ (fma (* x x) 10.0 (/ (* 10.0 (pow x 3.0)) eps)) eps))
           eps)
          -1.0
          -1.0))
        (pow eps 5.0))))))

C

double code(double x, double eps) {
	double t_0 = pow((x + eps), 5.0) - pow(x, 5.0);
	double tmp;
	if (t_0 <= -2e-293) {
		tmp = t_0;
	} else if (t_0 <= 0.0) {
		tmp = (pow(x, 4.0) * 5.0) * eps;
	} else {
		tmp = -fma((fma(5.0, x, (fma((x * x), 10.0, ((10.0 * pow(x, 3.0)) / eps)) / eps)) / eps), -1.0, -1.0) * pow(eps, 5.0);
	}
	return tmp;
}

Julia

function code(x, eps)
	t_0 = Float64((Float64(x + eps) ^ 5.0) - (x ^ 5.0))
	tmp = 0.0
	if (t_0 <= -2e-293)
		tmp = t_0;
	elseif (t_0 <= 0.0)
		tmp = Float64(Float64((x ^ 4.0) * 5.0) * eps);
	else
		tmp = Float64(Float64(-fma(Float64(fma(5.0, x, Float64(fma(Float64(x * x), 10.0, Float64(Float64(10.0 * (x ^ 3.0)) / eps)) / eps)) / eps), -1.0, -1.0)) * (eps ^ 5.0));
	end
	return tmp
end

Wolfram

code[x_, eps_] := Block[{t$95$0 = N[(N[Power[N[(x + eps), $MachinePrecision], 5.0], $MachinePrecision] - N[Power[x, 5.0], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, -2e-293], t$95$0, If[LessEqual[t$95$0, 0.0], N[(N[(N[Power[x, 4.0], $MachinePrecision] * 5.0), $MachinePrecision] * eps), $MachinePrecision], N[((-N[(N[(N[(5.0 * x + N[(N[(N[(x * x), $MachinePrecision] * 10.0 + N[(N[(10.0 * N[Power[x, 3.0], $MachinePrecision]), $MachinePrecision] / eps), $MachinePrecision]), $MachinePrecision] / eps), $MachinePrecision]), $MachinePrecision] / eps), $MachinePrecision] * -1.0 + -1.0), $MachinePrecision]) * N[Power[eps, 5.0], $MachinePrecision]), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if (-.f64 (pow.f64 (+.f64 x eps) #s(literal 5 binary64)) (pow.f64 x #s(literal 5 binary64))) < -2.0000000000000001e-293

   1. Initial program 94.4%

      \[{\left(x + \varepsilon\right)}^{5} - {x}^{5} \]
   2. Add Preprocessing

   if -2.0000000000000001e-293 < (-.f64 (pow.f64 (+.f64 x eps) #s(literal 5 binary64)) (pow.f64 x #s(literal 5 binary64))) < 0.0

   1. Initial program 86.2%

      \[{\left(x + \varepsilon\right)}^{5} - {x}^{5} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

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

   5. Applied rewrites 99.9%

      \[\leadsto \color{blue}{\left({x}^{4} \cdot 5\right) \cdot \varepsilon} \]

   if 0.0 < (-.f64 (pow.f64 (+.f64 x eps) #s(literal 5 binary64)) (pow.f64 x #s(literal 5 binary64)))

   1. Initial program 99.8%

      \[{\left(x + \varepsilon\right)}^{5} - {x}^{5} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

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

   5. Applied rewrites 98.9%

      \[\leadsto \color{blue}{\mathsf{fma}\left({\varepsilon}^{4} \cdot 5, x, {\varepsilon}^{5}\right)} \]

   6. Taylor expanded in eps around -inf

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

   8. Applied rewrites 100.0%

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

Alternative 3: 98.1% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := {\left(x + \varepsilon\right)}^{5} - {x}^{5}\\ \mathbf{if}\;t\_0 \leq -2 \cdot 10^{-293} \lor \neg \left(t\_0 \leq 0\right):\\ \;\;\;\;\left(-\mathsf{fma}\left(\frac{\mathsf{fma}\left(5, x, \frac{\left(x \cdot x\right) \cdot 10}{\varepsilon}\right)}{\varepsilon}, -1, -1\right)\right) \cdot {\varepsilon}^{5}\\ \mathbf{else}:\\ \;\;\;\;\left({x}^{4} \cdot 5\right) \cdot \varepsilon\\ \end{array} \end{array} \]

FPCore

(FPCore (x eps)
 :precision binary64
 (let* ((t_0 (- (pow (+ x eps) 5.0) (pow x 5.0))))
   (if (or (<= t_0 -2e-293) (not (<= t_0 0.0)))
     (*
      (- (fma (/ (fma 5.0 x (/ (* (* x x) 10.0) eps)) eps) -1.0 -1.0))
      (pow eps 5.0))
     (* (* (pow x 4.0) 5.0) eps))))

C

double code(double x, double eps) {
	double t_0 = pow((x + eps), 5.0) - pow(x, 5.0);
	double tmp;
	if ((t_0 <= -2e-293) || !(t_0 <= 0.0)) {
		tmp = -fma((fma(5.0, x, (((x * x) * 10.0) / eps)) / eps), -1.0, -1.0) * pow(eps, 5.0);
	} else {
		tmp = (pow(x, 4.0) * 5.0) * eps;
	}
	return tmp;
}

Julia

function code(x, eps)
	t_0 = Float64((Float64(x + eps) ^ 5.0) - (x ^ 5.0))
	tmp = 0.0
	if ((t_0 <= -2e-293) || !(t_0 <= 0.0))
		tmp = Float64(Float64(-fma(Float64(fma(5.0, x, Float64(Float64(Float64(x * x) * 10.0) / eps)) / eps), -1.0, -1.0)) * (eps ^ 5.0));
	else
		tmp = Float64(Float64((x ^ 4.0) * 5.0) * eps);
	end
	return tmp
end

Wolfram

code[x_, eps_] := Block[{t$95$0 = N[(N[Power[N[(x + eps), $MachinePrecision], 5.0], $MachinePrecision] - N[Power[x, 5.0], $MachinePrecision]), $MachinePrecision]}, If[Or[LessEqual[t$95$0, -2e-293], N[Not[LessEqual[t$95$0, 0.0]], $MachinePrecision]], N[((-N[(N[(N[(5.0 * x + N[(N[(N[(x * x), $MachinePrecision] * 10.0), $MachinePrecision] / eps), $MachinePrecision]), $MachinePrecision] / eps), $MachinePrecision] * -1.0 + -1.0), $MachinePrecision]) * N[Power[eps, 5.0], $MachinePrecision]), $MachinePrecision], N[(N[(N[Power[x, 4.0], $MachinePrecision] * 5.0), $MachinePrecision] * eps), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (-.f64 (pow.f64 (+.f64 x eps) #s(literal 5 binary64)) (pow.f64 x #s(literal 5 binary64))) < -2.0000000000000001e-293 or 0.0 < (-.f64 (pow.f64 (+.f64 x eps) #s(literal 5 binary64)) (pow.f64 x #s(literal 5 binary64)))

   1. Initial program 97.7%

      \[{\left(x + \varepsilon\right)}^{5} - {x}^{5} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

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

   5. Applied rewrites 95.3%

      \[\leadsto \color{blue}{\mathsf{fma}\left({\varepsilon}^{4} \cdot 5, x, {\varepsilon}^{5}\right)} \]

   6. Taylor expanded in eps around -inf

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

   8. Applied rewrites 95.9%

      \[\leadsto \color{blue}{\left(-\mathsf{fma}\left(\frac{\mathsf{fma}\left(5, x, \frac{\left(x \cdot x\right) \cdot 10}{\varepsilon}\right)}{\varepsilon}, -1, -1\right)\right) \cdot {\varepsilon}^{5}} \]

   if -2.0000000000000001e-293 < (-.f64 (pow.f64 (+.f64 x eps) #s(literal 5 binary64)) (pow.f64 x #s(literal 5 binary64))) < 0.0

   1. Initial program 86.2%

      \[{\left(x + \varepsilon\right)}^{5} - {x}^{5} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

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

   5. Applied rewrites 99.9%

      \[\leadsto \color{blue}{\left({x}^{4} \cdot 5\right) \cdot \varepsilon} \]
3. Recombined 2 regimes into one program.

4. Final simplification 99.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;{\left(x + \varepsilon\right)}^{5} - {x}^{5} \leq -2 \cdot 10^{-293} \lor \neg \left({\left(x + \varepsilon\right)}^{5} - {x}^{5} \leq 0\right):\\ \;\;\;\;\left(-\mathsf{fma}\left(\frac{\mathsf{fma}\left(5, x, \frac{\left(x \cdot x\right) \cdot 10}{\varepsilon}\right)}{\varepsilon}, -1, -1\right)\right) \cdot {\varepsilon}^{5}\\ \mathbf{else}:\\ \;\;\;\;\left({x}^{4} \cdot 5\right) \cdot \varepsilon\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 98.4% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := {\left(x + \varepsilon\right)}^{5} - {x}^{5}\\ \mathbf{if}\;t\_0 \leq -2 \cdot 10^{-293}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;t\_0 \leq 0:\\ \;\;\;\;\left({x}^{4} \cdot 5\right) \cdot \varepsilon\\ \mathbf{else}:\\ \;\;\;\;\left(-\mathsf{fma}\left(\frac{\mathsf{fma}\left(5, x, \frac{\left(x \cdot x\right) \cdot 10}{\varepsilon}\right)}{\varepsilon}, -1, -1\right)\right) \cdot {\varepsilon}^{5}\\ \end{array} \end{array} \]

FPCore

(FPCore (x eps)
 :precision binary64
 (let* ((t_0 (- (pow (+ x eps) 5.0) (pow x 5.0))))
   (if (<= t_0 -2e-293)
     t_0
     (if (<= t_0 0.0)
       (* (* (pow x 4.0) 5.0) eps)
       (*
        (- (fma (/ (fma 5.0 x (/ (* (* x x) 10.0) eps)) eps) -1.0 -1.0))
        (pow eps 5.0))))))

C

double code(double x, double eps) {
	double t_0 = pow((x + eps), 5.0) - pow(x, 5.0);
	double tmp;
	if (t_0 <= -2e-293) {
		tmp = t_0;
	} else if (t_0 <= 0.0) {
		tmp = (pow(x, 4.0) * 5.0) * eps;
	} else {
		tmp = -fma((fma(5.0, x, (((x * x) * 10.0) / eps)) / eps), -1.0, -1.0) * pow(eps, 5.0);
	}
	return tmp;
}

Julia

function code(x, eps)
	t_0 = Float64((Float64(x + eps) ^ 5.0) - (x ^ 5.0))
	tmp = 0.0
	if (t_0 <= -2e-293)
		tmp = t_0;
	elseif (t_0 <= 0.0)
		tmp = Float64(Float64((x ^ 4.0) * 5.0) * eps);
	else
		tmp = Float64(Float64(-fma(Float64(fma(5.0, x, Float64(Float64(Float64(x * x) * 10.0) / eps)) / eps), -1.0, -1.0)) * (eps ^ 5.0));
	end
	return tmp
end

Wolfram

code[x_, eps_] := Block[{t$95$0 = N[(N[Power[N[(x + eps), $MachinePrecision], 5.0], $MachinePrecision] - N[Power[x, 5.0], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, -2e-293], t$95$0, If[LessEqual[t$95$0, 0.0], N[(N[(N[Power[x, 4.0], $MachinePrecision] * 5.0), $MachinePrecision] * eps), $MachinePrecision], N[((-N[(N[(N[(5.0 * x + N[(N[(N[(x * x), $MachinePrecision] * 10.0), $MachinePrecision] / eps), $MachinePrecision]), $MachinePrecision] / eps), $MachinePrecision] * -1.0 + -1.0), $MachinePrecision]) * N[Power[eps, 5.0], $MachinePrecision]), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if (-.f64 (pow.f64 (+.f64 x eps) #s(literal 5 binary64)) (pow.f64 x #s(literal 5 binary64))) < -2.0000000000000001e-293

   1. Initial program 94.4%

      \[{\left(x + \varepsilon\right)}^{5} - {x}^{5} \]
   2. Add Preprocessing

   if -2.0000000000000001e-293 < (-.f64 (pow.f64 (+.f64 x eps) #s(literal 5 binary64)) (pow.f64 x #s(literal 5 binary64))) < 0.0

   1. Initial program 86.2%

      \[{\left(x + \varepsilon\right)}^{5} - {x}^{5} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

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

   5. Applied rewrites 99.9%

      \[\leadsto \color{blue}{\left({x}^{4} \cdot 5\right) \cdot \varepsilon} \]

   if 0.0 < (-.f64 (pow.f64 (+.f64 x eps) #s(literal 5 binary64)) (pow.f64 x #s(literal 5 binary64)))

   1. Initial program 99.8%

      \[{\left(x + \varepsilon\right)}^{5} - {x}^{5} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

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

   5. Applied rewrites 98.9%

      \[\leadsto \color{blue}{\mathsf{fma}\left({\varepsilon}^{4} \cdot 5, x, {\varepsilon}^{5}\right)} \]

   6. Taylor expanded in eps around -inf

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

   8. Applied rewrites 99.9%

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

Alternative 5: 98.0% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := {\left(x + \varepsilon\right)}^{5} - {x}^{5}\\ \mathbf{if}\;t\_0 \leq -2 \cdot 10^{-293} \lor \neg \left(t\_0 \leq 0\right):\\ \;\;\;\;\mathsf{fma}\left(\frac{x}{\varepsilon}, 5, 1\right) \cdot {\varepsilon}^{5}\\ \mathbf{else}:\\ \;\;\;\;\left({x}^{4} \cdot 5\right) \cdot \varepsilon\\ \end{array} \end{array} \]

FPCore

(FPCore (x eps)
 :precision binary64
 (let* ((t_0 (- (pow (+ x eps) 5.0) (pow x 5.0))))
   (if (or (<= t_0 -2e-293) (not (<= t_0 0.0)))
     (* (fma (/ x eps) 5.0 1.0) (pow eps 5.0))
     (* (* (pow x 4.0) 5.0) eps))))

C

double code(double x, double eps) {
	double t_0 = pow((x + eps), 5.0) - pow(x, 5.0);
	double tmp;
	if ((t_0 <= -2e-293) || !(t_0 <= 0.0)) {
		tmp = fma((x / eps), 5.0, 1.0) * pow(eps, 5.0);
	} else {
		tmp = (pow(x, 4.0) * 5.0) * eps;
	}
	return tmp;
}

Julia

function code(x, eps)
	t_0 = Float64((Float64(x + eps) ^ 5.0) - (x ^ 5.0))
	tmp = 0.0
	if ((t_0 <= -2e-293) || !(t_0 <= 0.0))
		tmp = Float64(fma(Float64(x / eps), 5.0, 1.0) * (eps ^ 5.0));
	else
		tmp = Float64(Float64((x ^ 4.0) * 5.0) * eps);
	end
	return tmp
end

Wolfram

code[x_, eps_] := Block[{t$95$0 = N[(N[Power[N[(x + eps), $MachinePrecision], 5.0], $MachinePrecision] - N[Power[x, 5.0], $MachinePrecision]), $MachinePrecision]}, If[Or[LessEqual[t$95$0, -2e-293], N[Not[LessEqual[t$95$0, 0.0]], $MachinePrecision]], N[(N[(N[(x / eps), $MachinePrecision] * 5.0 + 1.0), $MachinePrecision] * N[Power[eps, 5.0], $MachinePrecision]), $MachinePrecision], N[(N[(N[Power[x, 4.0], $MachinePrecision] * 5.0), $MachinePrecision] * eps), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (-.f64 (pow.f64 (+.f64 x eps) #s(literal 5 binary64)) (pow.f64 x #s(literal 5 binary64))) < -2.0000000000000001e-293 or 0.0 < (-.f64 (pow.f64 (+.f64 x eps) #s(literal 5 binary64)) (pow.f64 x #s(literal 5 binary64)))

   1. Initial program 97.7%

      \[{\left(x + \varepsilon\right)}^{5} - {x}^{5} \]
   2. Add Preprocessing

   3. Taylor expanded in eps around inf

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

   5. Applied rewrites 95.2%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\frac{x}{\varepsilon}, 5, 1\right) \cdot {\varepsilon}^{5}} \]

   if -2.0000000000000001e-293 < (-.f64 (pow.f64 (+.f64 x eps) #s(literal 5 binary64)) (pow.f64 x #s(literal 5 binary64))) < 0.0

   1. Initial program 86.2%

      \[{\left(x + \varepsilon\right)}^{5} - {x}^{5} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

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

   5. Applied rewrites 99.9%

      \[\leadsto \color{blue}{\left({x}^{4} \cdot 5\right) \cdot \varepsilon} \]
3. Recombined 2 regimes into one program.

4. Final simplification 99.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;{\left(x + \varepsilon\right)}^{5} - {x}^{5} \leq -2 \cdot 10^{-293} \lor \neg \left({\left(x + \varepsilon\right)}^{5} - {x}^{5} \leq 0\right):\\ \;\;\;\;\mathsf{fma}\left(\frac{x}{\varepsilon}, 5, 1\right) \cdot {\varepsilon}^{5}\\ \mathbf{else}:\\ \;\;\;\;\left({x}^{4} \cdot 5\right) \cdot \varepsilon\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 98.0% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := {\left(x + \varepsilon\right)}^{5} - {x}^{5}\\ \mathbf{if}\;t\_0 \leq -2 \cdot 10^{-293} \lor \neg \left(t\_0 \leq 0\right):\\ \;\;\;\;\mathsf{fma}\left(5, x, \varepsilon\right) \cdot {\varepsilon}^{4}\\ \mathbf{else}:\\ \;\;\;\;\left({x}^{4} \cdot 5\right) \cdot \varepsilon\\ \end{array} \end{array} \]

FPCore

(FPCore (x eps)
 :precision binary64
 (let* ((t_0 (- (pow (+ x eps) 5.0) (pow x 5.0))))
   (if (or (<= t_0 -2e-293) (not (<= t_0 0.0)))
     (* (fma 5.0 x eps) (pow eps 4.0))
     (* (* (pow x 4.0) 5.0) eps))))

C

double code(double x, double eps) {
	double t_0 = pow((x + eps), 5.0) - pow(x, 5.0);
	double tmp;
	if ((t_0 <= -2e-293) || !(t_0 <= 0.0)) {
		tmp = fma(5.0, x, eps) * pow(eps, 4.0);
	} else {
		tmp = (pow(x, 4.0) * 5.0) * eps;
	}
	return tmp;
}

Julia

function code(x, eps)
	t_0 = Float64((Float64(x + eps) ^ 5.0) - (x ^ 5.0))
	tmp = 0.0
	if ((t_0 <= -2e-293) || !(t_0 <= 0.0))
		tmp = Float64(fma(5.0, x, eps) * (eps ^ 4.0));
	else
		tmp = Float64(Float64((x ^ 4.0) * 5.0) * eps);
	end
	return tmp
end

Wolfram

code[x_, eps_] := Block[{t$95$0 = N[(N[Power[N[(x + eps), $MachinePrecision], 5.0], $MachinePrecision] - N[Power[x, 5.0], $MachinePrecision]), $MachinePrecision]}, If[Or[LessEqual[t$95$0, -2e-293], N[Not[LessEqual[t$95$0, 0.0]], $MachinePrecision]], N[(N[(5.0 * x + eps), $MachinePrecision] * N[Power[eps, 4.0], $MachinePrecision]), $MachinePrecision], N[(N[(N[Power[x, 4.0], $MachinePrecision] * 5.0), $MachinePrecision] * eps), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (-.f64 (pow.f64 (+.f64 x eps) #s(literal 5 binary64)) (pow.f64 x #s(literal 5 binary64))) < -2.0000000000000001e-293 or 0.0 < (-.f64 (pow.f64 (+.f64 x eps) #s(literal 5 binary64)) (pow.f64 x #s(literal 5 binary64)))

   1. Initial program 97.7%

      \[{\left(x + \varepsilon\right)}^{5} - {x}^{5} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

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

   5. Applied rewrites 95.3%

      \[\leadsto \color{blue}{\mathsf{fma}\left({\varepsilon}^{4} \cdot 5, x, {\varepsilon}^{5}\right)} \]

   6. Taylor expanded in x around 0

      \[\leadsto \color{blue}{x \cdot \left(4 \cdot {\varepsilon}^{4} + {\varepsilon}^{4}\right) + {\varepsilon}^{5}} \]
   7. Step-by-step derivation

   8. Applied rewrites 94.9%

      \[\leadsto \color{blue}{\mathsf{fma}\left(5, x, \varepsilon\right) \cdot {\varepsilon}^{4}} \]

   if -2.0000000000000001e-293 < (-.f64 (pow.f64 (+.f64 x eps) #s(literal 5 binary64)) (pow.f64 x #s(literal 5 binary64))) < 0.0

   1. Initial program 86.2%

      \[{\left(x + \varepsilon\right)}^{5} - {x}^{5} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

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

   5. Applied rewrites 99.9%

      \[\leadsto \color{blue}{\left({x}^{4} \cdot 5\right) \cdot \varepsilon} \]
3. Recombined 2 regimes into one program.

4. Final simplification 99.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;{\left(x + \varepsilon\right)}^{5} - {x}^{5} \leq -2 \cdot 10^{-293} \lor \neg \left({\left(x + \varepsilon\right)}^{5} - {x}^{5} \leq 0\right):\\ \;\;\;\;\mathsf{fma}\left(5, x, \varepsilon\right) \cdot {\varepsilon}^{4}\\ \mathbf{else}:\\ \;\;\;\;\left({x}^{4} \cdot 5\right) \cdot \varepsilon\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 97.9% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := {\left(x + \varepsilon\right)}^{5} - {x}^{5}\\ \mathbf{if}\;t\_0 \leq -2 \cdot 10^{-293} \lor \neg \left(t\_0 \leq 0\right):\\ \;\;\;\;\left(\left(\left(\mathsf{fma}\left(5, x, \varepsilon\right) \cdot \varepsilon\right) \cdot \varepsilon\right) \cdot \varepsilon\right) \cdot \varepsilon\\ \mathbf{else}:\\ \;\;\;\;\left({x}^{4} \cdot 5\right) \cdot \varepsilon\\ \end{array} \end{array} \]

FPCore

(FPCore (x eps)
 :precision binary64
 (let* ((t_0 (- (pow (+ x eps) 5.0) (pow x 5.0))))
   (if (or (<= t_0 -2e-293) (not (<= t_0 0.0)))
     (* (* (* (* (fma 5.0 x eps) eps) eps) eps) eps)
     (* (* (pow x 4.0) 5.0) eps))))

C

double code(double x, double eps) {
	double t_0 = pow((x + eps), 5.0) - pow(x, 5.0);
	double tmp;
	if ((t_0 <= -2e-293) || !(t_0 <= 0.0)) {
		tmp = (((fma(5.0, x, eps) * eps) * eps) * eps) * eps;
	} else {
		tmp = (pow(x, 4.0) * 5.0) * eps;
	}
	return tmp;
}

Julia

function code(x, eps)
	t_0 = Float64((Float64(x + eps) ^ 5.0) - (x ^ 5.0))
	tmp = 0.0
	if ((t_0 <= -2e-293) || !(t_0 <= 0.0))
		tmp = Float64(Float64(Float64(Float64(fma(5.0, x, eps) * eps) * eps) * eps) * eps);
	else
		tmp = Float64(Float64((x ^ 4.0) * 5.0) * eps);
	end
	return tmp
end

Wolfram

code[x_, eps_] := Block[{t$95$0 = N[(N[Power[N[(x + eps), $MachinePrecision], 5.0], $MachinePrecision] - N[Power[x, 5.0], $MachinePrecision]), $MachinePrecision]}, If[Or[LessEqual[t$95$0, -2e-293], N[Not[LessEqual[t$95$0, 0.0]], $MachinePrecision]], N[(N[(N[(N[(N[(5.0 * x + eps), $MachinePrecision] * eps), $MachinePrecision] * eps), $MachinePrecision] * eps), $MachinePrecision] * eps), $MachinePrecision], N[(N[(N[Power[x, 4.0], $MachinePrecision] * 5.0), $MachinePrecision] * eps), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (-.f64 (pow.f64 (+.f64 x eps) #s(literal 5 binary64)) (pow.f64 x #s(literal 5 binary64))) < -2.0000000000000001e-293 or 0.0 < (-.f64 (pow.f64 (+.f64 x eps) #s(literal 5 binary64)) (pow.f64 x #s(literal 5 binary64)))

   1. Initial program 97.7%

      \[{\left(x + \varepsilon\right)}^{5} - {x}^{5} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

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

   5. Applied rewrites 95.3%

      \[\leadsto \color{blue}{\mathsf{fma}\left({\varepsilon}^{4} \cdot 5, x, {\varepsilon}^{5}\right)} \]

   6. Taylor expanded in x around 0

      \[\leadsto \color{blue}{x \cdot \left(4 \cdot {\varepsilon}^{4} + {\varepsilon}^{4}\right) + {\varepsilon}^{5}} \]
   7. Step-by-step derivation

   8. Applied rewrites 94.9%

      \[\leadsto \color{blue}{\mathsf{fma}\left(5, x, \varepsilon\right) \cdot {\varepsilon}^{4}} \]
   9. Step-by-step derivation

   10. Applied rewrites 94.6%

       \[\leadsto \mathsf{fma}\left(5, x, \varepsilon\right) \cdot \left(\left(\varepsilon \cdot \varepsilon\right) \cdot \color{blue}{\left(\varepsilon \cdot \varepsilon\right)}\right) \]
   11. Step-by-step derivation

   12. Applied rewrites 94.7%

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

   if -2.0000000000000001e-293 < (-.f64 (pow.f64 (+.f64 x eps) #s(literal 5 binary64)) (pow.f64 x #s(literal 5 binary64))) < 0.0

   1. Initial program 86.2%

      \[{\left(x + \varepsilon\right)}^{5} - {x}^{5} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

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

   5. Applied rewrites 99.9%

      \[\leadsto \color{blue}{\left({x}^{4} \cdot 5\right) \cdot \varepsilon} \]
3. Recombined 2 regimes into one program.

4. Final simplification 99.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;{\left(x + \varepsilon\right)}^{5} - {x}^{5} \leq -2 \cdot 10^{-293} \lor \neg \left({\left(x + \varepsilon\right)}^{5} - {x}^{5} \leq 0\right):\\ \;\;\;\;\left(\left(\left(\mathsf{fma}\left(5, x, \varepsilon\right) \cdot \varepsilon\right) \cdot \varepsilon\right) \cdot \varepsilon\right) \cdot \varepsilon\\ \mathbf{else}:\\ \;\;\;\;\left({x}^{4} \cdot 5\right) \cdot \varepsilon\\ \end{array} \]
5. Add Preprocessing

Alternative 8: 97.9% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := {\left(x + \varepsilon\right)}^{5} - {x}^{5}\\ \mathbf{if}\;t\_0 \leq -2 \cdot 10^{-293} \lor \neg \left(t\_0 \leq 0\right):\\ \;\;\;\;\left(\left(\left(\mathsf{fma}\left(5, x, \varepsilon\right) \cdot \varepsilon\right) \cdot \varepsilon\right) \cdot \varepsilon\right) \cdot \varepsilon\\ \mathbf{else}:\\ \;\;\;\;\left(5 \cdot \varepsilon\right) \cdot {x}^{4}\\ \end{array} \end{array} \]

FPCore

(FPCore (x eps)
 :precision binary64
 (let* ((t_0 (- (pow (+ x eps) 5.0) (pow x 5.0))))
   (if (or (<= t_0 -2e-293) (not (<= t_0 0.0)))
     (* (* (* (* (fma 5.0 x eps) eps) eps) eps) eps)
     (* (* 5.0 eps) (pow x 4.0)))))

C

double code(double x, double eps) {
	double t_0 = pow((x + eps), 5.0) - pow(x, 5.0);
	double tmp;
	if ((t_0 <= -2e-293) || !(t_0 <= 0.0)) {
		tmp = (((fma(5.0, x, eps) * eps) * eps) * eps) * eps;
	} else {
		tmp = (5.0 * eps) * pow(x, 4.0);
	}
	return tmp;
}

Julia

function code(x, eps)
	t_0 = Float64((Float64(x + eps) ^ 5.0) - (x ^ 5.0))
	tmp = 0.0
	if ((t_0 <= -2e-293) || !(t_0 <= 0.0))
		tmp = Float64(Float64(Float64(Float64(fma(5.0, x, eps) * eps) * eps) * eps) * eps);
	else
		tmp = Float64(Float64(5.0 * eps) * (x ^ 4.0));
	end
	return tmp
end

Wolfram

code[x_, eps_] := Block[{t$95$0 = N[(N[Power[N[(x + eps), $MachinePrecision], 5.0], $MachinePrecision] - N[Power[x, 5.0], $MachinePrecision]), $MachinePrecision]}, If[Or[LessEqual[t$95$0, -2e-293], N[Not[LessEqual[t$95$0, 0.0]], $MachinePrecision]], N[(N[(N[(N[(N[(5.0 * x + eps), $MachinePrecision] * eps), $MachinePrecision] * eps), $MachinePrecision] * eps), $MachinePrecision] * eps), $MachinePrecision], N[(N[(5.0 * eps), $MachinePrecision] * N[Power[x, 4.0], $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (-.f64 (pow.f64 (+.f64 x eps) #s(literal 5 binary64)) (pow.f64 x #s(literal 5 binary64))) < -2.0000000000000001e-293 or 0.0 < (-.f64 (pow.f64 (+.f64 x eps) #s(literal 5 binary64)) (pow.f64 x #s(literal 5 binary64)))

   1. Initial program 97.7%

      \[{\left(x + \varepsilon\right)}^{5} - {x}^{5} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

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

   5. Applied rewrites 95.3%

      \[\leadsto \color{blue}{\mathsf{fma}\left({\varepsilon}^{4} \cdot 5, x, {\varepsilon}^{5}\right)} \]

   6. Taylor expanded in x around 0

      \[\leadsto \color{blue}{x \cdot \left(4 \cdot {\varepsilon}^{4} + {\varepsilon}^{4}\right) + {\varepsilon}^{5}} \]
   7. Step-by-step derivation

   8. Applied rewrites 94.9%

      \[\leadsto \color{blue}{\mathsf{fma}\left(5, x, \varepsilon\right) \cdot {\varepsilon}^{4}} \]
   9. Step-by-step derivation

   10. Applied rewrites 94.6%

       \[\leadsto \mathsf{fma}\left(5, x, \varepsilon\right) \cdot \left(\left(\varepsilon \cdot \varepsilon\right) \cdot \color{blue}{\left(\varepsilon \cdot \varepsilon\right)}\right) \]
   11. Step-by-step derivation

   12. Applied rewrites 94.7%

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

   if -2.0000000000000001e-293 < (-.f64 (pow.f64 (+.f64 x eps) #s(literal 5 binary64)) (pow.f64 x #s(literal 5 binary64))) < 0.0

   1. Initial program 86.2%

      \[{\left(x + \varepsilon\right)}^{5} - {x}^{5} \]
   2. Add Preprocessing

   3. Taylor expanded in x around -inf

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

   5. Applied rewrites 99.9%

      \[\leadsto \color{blue}{\mathsf{fma}\left(5, \varepsilon, \frac{\mathsf{fma}\left(6, \varepsilon \cdot \varepsilon, \left(\varepsilon \cdot \varepsilon\right) \cdot 4\right)}{x}\right) \cdot {x}^{4}} \]

   6. Taylor expanded in x around inf

      \[\leadsto \left(5 \cdot \varepsilon\right) \cdot {\color{blue}{x}}^{4} \]
   7. Step-by-step derivation

   8. Applied rewrites 99.9%

      \[\leadsto \left(5 \cdot \varepsilon\right) \cdot {\color{blue}{x}}^{4} \]
3. Recombined 2 regimes into one program.

4. Final simplification 99.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;{\left(x + \varepsilon\right)}^{5} - {x}^{5} \leq -2 \cdot 10^{-293} \lor \neg \left({\left(x + \varepsilon\right)}^{5} - {x}^{5} \leq 0\right):\\ \;\;\;\;\left(\left(\left(\mathsf{fma}\left(5, x, \varepsilon\right) \cdot \varepsilon\right) \cdot \varepsilon\right) \cdot \varepsilon\right) \cdot \varepsilon\\ \mathbf{else}:\\ \;\;\;\;\left(5 \cdot \varepsilon\right) \cdot {x}^{4}\\ \end{array} \]
5. Add Preprocessing

Alternative 9: 97.9% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := {\left(x + \varepsilon\right)}^{5} - {x}^{5}\\ \mathbf{if}\;t\_0 \leq -5 \cdot 10^{-293} \lor \neg \left(t\_0 \leq 0\right):\\ \;\;\;\;\left(\left(\left(\mathsf{fma}\left(5, x, \varepsilon\right) \cdot \varepsilon\right) \cdot \varepsilon\right) \cdot \varepsilon\right) \cdot \varepsilon\\ \mathbf{else}:\\ \;\;\;\;\left(\mathsf{fma}\left(10, \varepsilon, 5 \cdot x\right) \cdot \left(x \cdot \varepsilon\right)\right) \cdot \left(x \cdot x\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x eps)
 :precision binary64
 (let* ((t_0 (- (pow (+ x eps) 5.0) (pow x 5.0))))
   (if (or (<= t_0 -5e-293) (not (<= t_0 0.0)))
     (* (* (* (* (fma 5.0 x eps) eps) eps) eps) eps)
     (* (* (fma 10.0 eps (* 5.0 x)) (* x eps)) (* x x)))))

C

double code(double x, double eps) {
	double t_0 = pow((x + eps), 5.0) - pow(x, 5.0);
	double tmp;
	if ((t_0 <= -5e-293) || !(t_0 <= 0.0)) {
		tmp = (((fma(5.0, x, eps) * eps) * eps) * eps) * eps;
	} else {
		tmp = (fma(10.0, eps, (5.0 * x)) * (x * eps)) * (x * x);
	}
	return tmp;
}

Julia

function code(x, eps)
	t_0 = Float64((Float64(x + eps) ^ 5.0) - (x ^ 5.0))
	tmp = 0.0
	if ((t_0 <= -5e-293) || !(t_0 <= 0.0))
		tmp = Float64(Float64(Float64(Float64(fma(5.0, x, eps) * eps) * eps) * eps) * eps);
	else
		tmp = Float64(Float64(fma(10.0, eps, Float64(5.0 * x)) * Float64(x * eps)) * Float64(x * x));
	end
	return tmp
end

Wolfram

code[x_, eps_] := Block[{t$95$0 = N[(N[Power[N[(x + eps), $MachinePrecision], 5.0], $MachinePrecision] - N[Power[x, 5.0], $MachinePrecision]), $MachinePrecision]}, If[Or[LessEqual[t$95$0, -5e-293], N[Not[LessEqual[t$95$0, 0.0]], $MachinePrecision]], N[(N[(N[(N[(N[(5.0 * x + eps), $MachinePrecision] * eps), $MachinePrecision] * eps), $MachinePrecision] * eps), $MachinePrecision] * eps), $MachinePrecision], N[(N[(N[(10.0 * eps + N[(5.0 * x), $MachinePrecision]), $MachinePrecision] * N[(x * eps), $MachinePrecision]), $MachinePrecision] * N[(x * x), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (-.f64 (pow.f64 (+.f64 x eps) #s(literal 5 binary64)) (pow.f64 x #s(literal 5 binary64))) < -5.0000000000000003e-293 or 0.0 < (-.f64 (pow.f64 (+.f64 x eps) #s(literal 5 binary64)) (pow.f64 x #s(literal 5 binary64)))

   1. Initial program 98.8%

      \[{\left(x + \varepsilon\right)}^{5} - {x}^{5} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

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

   5. Applied rewrites 97.2%

      \[\leadsto \color{blue}{\mathsf{fma}\left({\varepsilon}^{4} \cdot 5, x, {\varepsilon}^{5}\right)} \]

   6. Taylor expanded in x around 0

      \[\leadsto \color{blue}{x \cdot \left(4 \cdot {\varepsilon}^{4} + {\varepsilon}^{4}\right) + {\varepsilon}^{5}} \]
   7. Step-by-step derivation

   8. Applied rewrites 96.8%

      \[\leadsto \color{blue}{\mathsf{fma}\left(5, x, \varepsilon\right) \cdot {\varepsilon}^{4}} \]
   9. Step-by-step derivation

   10. Applied rewrites 96.4%

       \[\leadsto \mathsf{fma}\left(5, x, \varepsilon\right) \cdot \left(\left(\varepsilon \cdot \varepsilon\right) \cdot \color{blue}{\left(\varepsilon \cdot \varepsilon\right)}\right) \]
   11. Step-by-step derivation

   12. Applied rewrites 96.5%

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

   if -5.0000000000000003e-293 < (-.f64 (pow.f64 (+.f64 x eps) #s(literal 5 binary64)) (pow.f64 x #s(literal 5 binary64))) < 0.0

   1. Initial program 86.1%

      \[{\left(x + \varepsilon\right)}^{5} - {x}^{5} \]
   2. Add Preprocessing

   3. Taylor expanded in eps around 0

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

   5. Applied rewrites 99.5%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left({x}^{3}, 6, {x}^{3} \cdot 4\right), \varepsilon, {x}^{4} \cdot 5\right) \cdot \varepsilon} \]

   6. Taylor expanded in x around 0

      \[\leadsto {x}^{3} \cdot \color{blue}{\left(5 \cdot \left(\varepsilon \cdot x\right) + 10 \cdot {\varepsilon}^{2}\right)} \]
   7. Step-by-step derivation

   8. Applied rewrites 99.5%

      \[\leadsto {x}^{3} \cdot \color{blue}{\mathsf{fma}\left(10, \varepsilon \cdot \varepsilon, \left(\varepsilon \cdot x\right) \cdot 5\right)} \]
   9. Step-by-step derivation

   10. Applied rewrites 99.4%

       \[\leadsto \left(\left(\varepsilon \cdot \mathsf{fma}\left(10, \varepsilon, 5 \cdot x\right)\right) \cdot x\right) \cdot \left(x \cdot \color{blue}{x}\right) \]
   11. Step-by-step derivation

   12. Applied rewrites 99.5%

       \[\leadsto \left(\mathsf{fma}\left(10, \varepsilon, 5 \cdot x\right) \cdot \left(x \cdot \varepsilon\right)\right) \cdot \left(x \cdot x\right) \]
3. Recombined 2 regimes into one program.

4. Final simplification 99.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;{\left(x + \varepsilon\right)}^{5} - {x}^{5} \leq -5 \cdot 10^{-293} \lor \neg \left({\left(x + \varepsilon\right)}^{5} - {x}^{5} \leq 0\right):\\ \;\;\;\;\left(\left(\left(\mathsf{fma}\left(5, x, \varepsilon\right) \cdot \varepsilon\right) \cdot \varepsilon\right) \cdot \varepsilon\right) \cdot \varepsilon\\ \mathbf{else}:\\ \;\;\;\;\left(\mathsf{fma}\left(10, \varepsilon, 5 \cdot x\right) \cdot \left(x \cdot \varepsilon\right)\right) \cdot \left(x \cdot x\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 10: 97.9% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := {\left(x + \varepsilon\right)}^{5} - {x}^{5}\\ \mathbf{if}\;t\_0 \leq -2 \cdot 10^{-293} \lor \neg \left(t\_0 \leq 0\right):\\ \;\;\;\;\left(\left(\left(\mathsf{fma}\left(5, x, \varepsilon\right) \cdot \varepsilon\right) \cdot \varepsilon\right) \cdot \varepsilon\right) \cdot \varepsilon\\ \mathbf{else}:\\ \;\;\;\;\left(\left(\left(x \cdot \varepsilon\right) \cdot 5\right) \cdot x\right) \cdot \left(x \cdot x\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x eps)
 :precision binary64
 (let* ((t_0 (- (pow (+ x eps) 5.0) (pow x 5.0))))
   (if (or (<= t_0 -2e-293) (not (<= t_0 0.0)))
     (* (* (* (* (fma 5.0 x eps) eps) eps) eps) eps)
     (* (* (* (* x eps) 5.0) x) (* x x)))))

C

double code(double x, double eps) {
	double t_0 = pow((x + eps), 5.0) - pow(x, 5.0);
	double tmp;
	if ((t_0 <= -2e-293) || !(t_0 <= 0.0)) {
		tmp = (((fma(5.0, x, eps) * eps) * eps) * eps) * eps;
	} else {
		tmp = (((x * eps) * 5.0) * x) * (x * x);
	}
	return tmp;
}

Julia

function code(x, eps)
	t_0 = Float64((Float64(x + eps) ^ 5.0) - (x ^ 5.0))
	tmp = 0.0
	if ((t_0 <= -2e-293) || !(t_0 <= 0.0))
		tmp = Float64(Float64(Float64(Float64(fma(5.0, x, eps) * eps) * eps) * eps) * eps);
	else
		tmp = Float64(Float64(Float64(Float64(x * eps) * 5.0) * x) * Float64(x * x));
	end
	return tmp
end

Wolfram

code[x_, eps_] := Block[{t$95$0 = N[(N[Power[N[(x + eps), $MachinePrecision], 5.0], $MachinePrecision] - N[Power[x, 5.0], $MachinePrecision]), $MachinePrecision]}, If[Or[LessEqual[t$95$0, -2e-293], N[Not[LessEqual[t$95$0, 0.0]], $MachinePrecision]], N[(N[(N[(N[(N[(5.0 * x + eps), $MachinePrecision] * eps), $MachinePrecision] * eps), $MachinePrecision] * eps), $MachinePrecision] * eps), $MachinePrecision], N[(N[(N[(N[(x * eps), $MachinePrecision] * 5.0), $MachinePrecision] * x), $MachinePrecision] * N[(x * x), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (-.f64 (pow.f64 (+.f64 x eps) #s(literal 5 binary64)) (pow.f64 x #s(literal 5 binary64))) < -2.0000000000000001e-293 or 0.0 < (-.f64 (pow.f64 (+.f64 x eps) #s(literal 5 binary64)) (pow.f64 x #s(literal 5 binary64)))

   1. Initial program 97.7%

      \[{\left(x + \varepsilon\right)}^{5} - {x}^{5} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

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

   5. Applied rewrites 95.3%

      \[\leadsto \color{blue}{\mathsf{fma}\left({\varepsilon}^{4} \cdot 5, x, {\varepsilon}^{5}\right)} \]

   6. Taylor expanded in x around 0

      \[\leadsto \color{blue}{x \cdot \left(4 \cdot {\varepsilon}^{4} + {\varepsilon}^{4}\right) + {\varepsilon}^{5}} \]
   7. Step-by-step derivation

   8. Applied rewrites 94.9%

      \[\leadsto \color{blue}{\mathsf{fma}\left(5, x, \varepsilon\right) \cdot {\varepsilon}^{4}} \]
   9. Step-by-step derivation

   10. Applied rewrites 94.6%

       \[\leadsto \mathsf{fma}\left(5, x, \varepsilon\right) \cdot \left(\left(\varepsilon \cdot \varepsilon\right) \cdot \color{blue}{\left(\varepsilon \cdot \varepsilon\right)}\right) \]
   11. Step-by-step derivation

   12. Applied rewrites 94.7%

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

   if -2.0000000000000001e-293 < (-.f64 (pow.f64 (+.f64 x eps) #s(literal 5 binary64)) (pow.f64 x #s(literal 5 binary64))) < 0.0

   1. Initial program 86.2%

      \[{\left(x + \varepsilon\right)}^{5} - {x}^{5} \]
   2. Add Preprocessing

   3. Taylor expanded in eps around 0

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

   5. Applied rewrites 99.9%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left({x}^{3}, 6, {x}^{3} \cdot 4\right), \varepsilon, {x}^{4} \cdot 5\right) \cdot \varepsilon} \]

   6. Taylor expanded in x around 0

      \[\leadsto {x}^{3} \cdot \color{blue}{\left(5 \cdot \left(\varepsilon \cdot x\right) + 10 \cdot {\varepsilon}^{2}\right)} \]
   7. Step-by-step derivation

   8. Applied rewrites 99.9%

      \[\leadsto {x}^{3} \cdot \color{blue}{\mathsf{fma}\left(10, \varepsilon \cdot \varepsilon, \left(\varepsilon \cdot x\right) \cdot 5\right)} \]
   9. Step-by-step derivation

   10. Applied rewrites 99.9%

       \[\leadsto \left(\left(\varepsilon \cdot \mathsf{fma}\left(10, \varepsilon, 5 \cdot x\right)\right) \cdot x\right) \cdot \left(x \cdot \color{blue}{x}\right) \]

   11. Taylor expanded in x around inf

       \[\leadsto \left(\left(5 \cdot \left(\varepsilon \cdot x\right)\right) \cdot x\right) \cdot \left(x \cdot x\right) \]
   12. Step-by-step derivation

   13. Applied rewrites 99.9%

       \[\leadsto \left(\left(\left(x \cdot \varepsilon\right) \cdot 5\right) \cdot x\right) \cdot \left(x \cdot x\right) \]
3. Recombined 2 regimes into one program.

4. Final simplification 99.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;{\left(x + \varepsilon\right)}^{5} - {x}^{5} \leq -2 \cdot 10^{-293} \lor \neg \left({\left(x + \varepsilon\right)}^{5} - {x}^{5} \leq 0\right):\\ \;\;\;\;\left(\left(\left(\mathsf{fma}\left(5, x, \varepsilon\right) \cdot \varepsilon\right) \cdot \varepsilon\right) \cdot \varepsilon\right) \cdot \varepsilon\\ \mathbf{else}:\\ \;\;\;\;\left(\left(\left(x \cdot \varepsilon\right) \cdot 5\right) \cdot x\right) \cdot \left(x \cdot x\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 11: 97.7% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := {\left(x + \varepsilon\right)}^{5} - {x}^{5}\\ \mathbf{if}\;t\_0 \leq -2 \cdot 10^{-293} \lor \neg \left(t\_0 \leq 0\right):\\ \;\;\;\;\varepsilon \cdot \left(\left(\varepsilon \cdot \varepsilon\right) \cdot \left(\varepsilon \cdot \varepsilon\right)\right)\\ \mathbf{else}:\\ \;\;\;\;\left(\left(\left(x \cdot \varepsilon\right) \cdot 5\right) \cdot x\right) \cdot \left(x \cdot x\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x eps)
 :precision binary64
 (let* ((t_0 (- (pow (+ x eps) 5.0) (pow x 5.0))))
   (if (or (<= t_0 -2e-293) (not (<= t_0 0.0)))
     (* eps (* (* eps eps) (* eps eps)))
     (* (* (* (* x eps) 5.0) x) (* x x)))))

C

double code(double x, double eps) {
	double t_0 = pow((x + eps), 5.0) - pow(x, 5.0);
	double tmp;
	if ((t_0 <= -2e-293) || !(t_0 <= 0.0)) {
		tmp = eps * ((eps * eps) * (eps * eps));
	} else {
		tmp = (((x * eps) * 5.0) * x) * (x * x);
	}
	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(x, eps)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: eps
    real(8) :: t_0
    real(8) :: tmp
    t_0 = ((x + eps) ** 5.0d0) - (x ** 5.0d0)
    if ((t_0 <= (-2d-293)) .or. (.not. (t_0 <= 0.0d0))) then
        tmp = eps * ((eps * eps) * (eps * eps))
    else
        tmp = (((x * eps) * 5.0d0) * x) * (x * x)
    end if
    code = tmp
end function

Java

public static double code(double x, double eps) {
	double t_0 = Math.pow((x + eps), 5.0) - Math.pow(x, 5.0);
	double tmp;
	if ((t_0 <= -2e-293) || !(t_0 <= 0.0)) {
		tmp = eps * ((eps * eps) * (eps * eps));
	} else {
		tmp = (((x * eps) * 5.0) * x) * (x * x);
	}
	return tmp;
}

Python

def code(x, eps):
	t_0 = math.pow((x + eps), 5.0) - math.pow(x, 5.0)
	tmp = 0
	if (t_0 <= -2e-293) or not (t_0 <= 0.0):
		tmp = eps * ((eps * eps) * (eps * eps))
	else:
		tmp = (((x * eps) * 5.0) * x) * (x * x)
	return tmp

Julia

function code(x, eps)
	t_0 = Float64((Float64(x + eps) ^ 5.0) - (x ^ 5.0))
	tmp = 0.0
	if ((t_0 <= -2e-293) || !(t_0 <= 0.0))
		tmp = Float64(eps * Float64(Float64(eps * eps) * Float64(eps * eps)));
	else
		tmp = Float64(Float64(Float64(Float64(x * eps) * 5.0) * x) * Float64(x * x));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, eps)
	t_0 = ((x + eps) ^ 5.0) - (x ^ 5.0);
	tmp = 0.0;
	if ((t_0 <= -2e-293) || ~((t_0 <= 0.0)))
		tmp = eps * ((eps * eps) * (eps * eps));
	else
		tmp = (((x * eps) * 5.0) * x) * (x * x);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, eps_] := Block[{t$95$0 = N[(N[Power[N[(x + eps), $MachinePrecision], 5.0], $MachinePrecision] - N[Power[x, 5.0], $MachinePrecision]), $MachinePrecision]}, If[Or[LessEqual[t$95$0, -2e-293], N[Not[LessEqual[t$95$0, 0.0]], $MachinePrecision]], N[(eps * N[(N[(eps * eps), $MachinePrecision] * N[(eps * eps), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(x * eps), $MachinePrecision] * 5.0), $MachinePrecision] * x), $MachinePrecision] * N[(x * x), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (-.f64 (pow.f64 (+.f64 x eps) #s(literal 5 binary64)) (pow.f64 x #s(literal 5 binary64))) < -2.0000000000000001e-293 or 0.0 < (-.f64 (pow.f64 (+.f64 x eps) #s(literal 5 binary64)) (pow.f64 x #s(literal 5 binary64)))

   1. Initial program 97.7%

      \[{\left(x + \varepsilon\right)}^{5} - {x}^{5} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

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

   5. Applied rewrites 95.3%

      \[\leadsto \color{blue}{\mathsf{fma}\left({\varepsilon}^{4} \cdot 5, x, {\varepsilon}^{5}\right)} \]

   6. Taylor expanded in x around 0

      \[\leadsto \color{blue}{x \cdot \left(4 \cdot {\varepsilon}^{4} + {\varepsilon}^{4}\right) + {\varepsilon}^{5}} \]
   7. Step-by-step derivation

   8. Applied rewrites 94.9%

      \[\leadsto \color{blue}{\mathsf{fma}\left(5, x, \varepsilon\right) \cdot {\varepsilon}^{4}} \]
   9. Step-by-step derivation

   10. Applied rewrites 94.6%

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

   11. Taylor expanded in x around 0

       \[\leadsto \varepsilon \cdot \left(\color{blue}{\left(\varepsilon \cdot \varepsilon\right)} \cdot \left(\varepsilon \cdot \varepsilon\right)\right) \]
   12. Step-by-step derivation

   13. Applied rewrites 92.6%

       \[\leadsto \varepsilon \cdot \left(\color{blue}{\left(\varepsilon \cdot \varepsilon\right)} \cdot \left(\varepsilon \cdot \varepsilon\right)\right) \]

   if -2.0000000000000001e-293 < (-.f64 (pow.f64 (+.f64 x eps) #s(literal 5 binary64)) (pow.f64 x #s(literal 5 binary64))) < 0.0

   1. Initial program 86.2%

      \[{\left(x + \varepsilon\right)}^{5} - {x}^{5} \]
   2. Add Preprocessing

   3. Taylor expanded in eps around 0

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

   5. Applied rewrites 99.9%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left({x}^{3}, 6, {x}^{3} \cdot 4\right), \varepsilon, {x}^{4} \cdot 5\right) \cdot \varepsilon} \]

   6. Taylor expanded in x around 0

      \[\leadsto {x}^{3} \cdot \color{blue}{\left(5 \cdot \left(\varepsilon \cdot x\right) + 10 \cdot {\varepsilon}^{2}\right)} \]
   7. Step-by-step derivation

   8. Applied rewrites 99.9%

      \[\leadsto {x}^{3} \cdot \color{blue}{\mathsf{fma}\left(10, \varepsilon \cdot \varepsilon, \left(\varepsilon \cdot x\right) \cdot 5\right)} \]
   9. Step-by-step derivation

   10. Applied rewrites 99.9%

       \[\leadsto \left(\left(\varepsilon \cdot \mathsf{fma}\left(10, \varepsilon, 5 \cdot x\right)\right) \cdot x\right) \cdot \left(x \cdot \color{blue}{x}\right) \]

   11. Taylor expanded in x around inf

       \[\leadsto \left(\left(5 \cdot \left(\varepsilon \cdot x\right)\right) \cdot x\right) \cdot \left(x \cdot x\right) \]
   12. Step-by-step derivation

   13. Applied rewrites 99.9%

       \[\leadsto \left(\left(\left(x \cdot \varepsilon\right) \cdot 5\right) \cdot x\right) \cdot \left(x \cdot x\right) \]
3. Recombined 2 regimes into one program.

4. Final simplification 98.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;{\left(x + \varepsilon\right)}^{5} - {x}^{5} \leq -2 \cdot 10^{-293} \lor \neg \left({\left(x + \varepsilon\right)}^{5} - {x}^{5} \leq 0\right):\\ \;\;\;\;\varepsilon \cdot \left(\left(\varepsilon \cdot \varepsilon\right) \cdot \left(\varepsilon \cdot \varepsilon\right)\right)\\ \mathbf{else}:\\ \;\;\;\;\left(\left(\left(x \cdot \varepsilon\right) \cdot 5\right) \cdot x\right) \cdot \left(x \cdot x\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 12: 87.1% accurate, 10.0× speedup

Math

\[\begin{array}{l} \\ \varepsilon \cdot \left(\left(\varepsilon \cdot \varepsilon\right) \cdot \left(\varepsilon \cdot \varepsilon\right)\right) \end{array} \]

FPCore

(FPCore (x eps) :precision binary64 (* eps (* (* eps eps) (* eps eps))))

C

double code(double x, double eps) {
	return eps * ((eps * eps) * (eps * eps));
}

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(x, eps)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: eps
    code = eps * ((eps * eps) * (eps * eps))
end function

Java

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

Python

def code(x, eps):
	return eps * ((eps * eps) * (eps * eps))

Julia

function code(x, eps)
	return Float64(eps * Float64(Float64(eps * eps) * Float64(eps * eps)))
end

MATLAB

function tmp = code(x, eps)
	tmp = eps * ((eps * eps) * (eps * eps));
end

Wolfram

code[x_, eps_] := N[(eps * N[(N[(eps * eps), $MachinePrecision] * N[(eps * eps), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 88.2%

   \[{\left(x + \varepsilon\right)}^{5} - {x}^{5} \]
2. Add Preprocessing

3. Taylor expanded in x around 0

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

5. Applied rewrites 87.8%

   \[\leadsto \color{blue}{\mathsf{fma}\left({\varepsilon}^{4} \cdot 5, x, {\varepsilon}^{5}\right)} \]

6. Taylor expanded in x around 0

   \[\leadsto \color{blue}{x \cdot \left(4 \cdot {\varepsilon}^{4} + {\varepsilon}^{4}\right) + {\varepsilon}^{5}} \]
7. Step-by-step derivation

8. Applied rewrites 87.8%

   \[\leadsto \color{blue}{\mathsf{fma}\left(5, x, \varepsilon\right) \cdot {\varepsilon}^{4}} \]
9. Step-by-step derivation

10. Applied rewrites 87.7%

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

11. Taylor expanded in x around 0

    \[\leadsto \varepsilon \cdot \left(\color{blue}{\left(\varepsilon \cdot \varepsilon\right)} \cdot \left(\varepsilon \cdot \varepsilon\right)\right) \]
12. Step-by-step derivation

13. Applied rewrites 87.4%

    \[\leadsto \varepsilon \cdot \left(\color{blue}{\left(\varepsilon \cdot \varepsilon\right)} \cdot \left(\varepsilon \cdot \varepsilon\right)\right) \]
14. Add Preprocessing

Reproduce

herbie shell --seed 2025019 
(FPCore (x eps)
  :name "ENA, Section 1.4, Exercise 4b, n=5"
  :precision binary64
  :pre (and (and (<= -1000000000.0 x) (<= x 1000000000.0)) (and (<= -1.0 eps) (<= eps 1.0)))
  (- (pow (+ x eps) 5.0) (pow x 5.0)))