ENA, Section 1.4, Exercise 4d

Percentage Accurate: 61.6% → 99.5%

Time: 2.7s

Alternatives: 8

Speedup: 0.8×

Specification

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

Math

\[\begin{array}{l} \\ x - \sqrt{x \cdot x - \varepsilon} \end{array} \]

FPCore

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

C

double code(double x, double eps) {
	return x - sqrt(((x * x) - 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 = x - sqrt(((x * x) - eps))
end function

Java

public static double code(double x, double eps) {
	return x - Math.sqrt(((x * x) - eps));
}

Python

def code(x, eps):
	return x - math.sqrt(((x * x) - eps))

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 61.6% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ x - \sqrt{x \cdot x - \varepsilon} \end{array} \]

FPCore

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

C

double code(double x, double eps) {
	return x - sqrt(((x * x) - 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 = x - sqrt(((x * x) - eps))
end function

Java

public static double code(double x, double eps) {
	return x - Math.sqrt(((x * x) - eps));
}

Python

def code(x, eps):
	return x - math.sqrt(((x * x) - eps))

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 99.5% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \frac{\varepsilon}{x + \sqrt{\mathsf{fma}\left(x, x, -\varepsilon\right)}} \end{array} \]

FPCore

(FPCore (x eps) :precision binary64 (/ eps (+ x (sqrt (fma x x (- eps))))))

C

double code(double x, double eps) {
	return eps / (x + sqrt(fma(x, x, -eps)));
}

Julia

function code(x, eps)
	return Float64(eps / Float64(x + sqrt(fma(x, x, Float64(-eps)))))
end

Wolfram

code[x_, eps_] := N[(eps / N[(x + N[Sqrt[N[(x * x + (-eps)), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 61.6%

   \[x - \sqrt{x \cdot x - \varepsilon} \]
2. Step-by-step derivation

   1. lift--.f64 N/A

      \[\leadsto \color{blue}{x - \sqrt{x \cdot x - \varepsilon}} \]

   2. lift-sqrt.f64 N/A

      \[\leadsto x - \color{blue}{\sqrt{x \cdot x - \varepsilon}} \]

   3. lift-*.f64 N/A

      \[\leadsto x - \sqrt{\color{blue}{x \cdot x} - \varepsilon} \]

   4. lift--.f64 N/A

      \[\leadsto x - \sqrt{\color{blue}{x \cdot x - \varepsilon}} \]

   5. flip-- N/A

      \[\leadsto \color{blue}{\frac{x \cdot x - \sqrt{x \cdot x - \varepsilon} \cdot \sqrt{x \cdot x - \varepsilon}}{x + \sqrt{x \cdot x - \varepsilon}}} \]

   6. lower-/.f64 N/A

      \[\leadsto \color{blue}{\frac{x \cdot x - \sqrt{x \cdot x - \varepsilon} \cdot \sqrt{x \cdot x - \varepsilon}}{x + \sqrt{x \cdot x - \varepsilon}}} \]

3. Applied rewrites 61.5%

   \[\leadsto \color{blue}{\frac{x \cdot x - \sqrt{x \cdot x - \varepsilon} \cdot \sqrt{x \cdot x - \varepsilon}}{x + \sqrt{x \cdot x - \varepsilon}}} \]

4. Taylor expanded in x around 0

   \[\leadsto \frac{\color{blue}{\varepsilon}}{x + \sqrt{x \cdot x - \varepsilon}} \]
5. Step-by-step derivation

6. Applied rewrites 99.5%

   \[\leadsto \frac{\color{blue}{\varepsilon}}{x + \sqrt{x \cdot x - \varepsilon}} \]

7. Taylor expanded in eps around 0

   \[\leadsto \frac{\varepsilon}{x + \sqrt{\color{blue}{-1 \cdot \varepsilon + {x}^{2}}}} \]
8. Step-by-step derivation

   1. mul-1-neg N/A

      \[\leadsto \frac{\varepsilon}{x + \sqrt{\left(\mathsf{neg}\left(\varepsilon\right)\right) + {\color{blue}{x}}^{2}}} \]

   2. +-commutative N/A

      \[\leadsto \frac{\varepsilon}{x + \sqrt{{x}^{2} + \color{blue}{\left(\mathsf{neg}\left(\varepsilon\right)\right)}}} \]

   3. pow2 N/A

      \[\leadsto \frac{\varepsilon}{x + \sqrt{x \cdot x + \left(\mathsf{neg}\left(\color{blue}{\varepsilon}\right)\right)}} \]

   4. lower-fma.f64 N/A

      \[\leadsto \frac{\varepsilon}{x + \sqrt{\mathsf{fma}\left(x, \color{blue}{x}, \mathsf{neg}\left(\varepsilon\right)\right)}} \]

   5. lower-neg.f64 99.5

      \[\leadsto \frac{\varepsilon}{x + \sqrt{\mathsf{fma}\left(x, x, -\varepsilon\right)}} \]

9. Applied rewrites 99.5%

   \[\leadsto \frac{\varepsilon}{x + \sqrt{\color{blue}{\mathsf{fma}\left(x, x, -\varepsilon\right)}}} \]
10. Add Preprocessing

Alternative 2: 99.5% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \frac{\varepsilon}{x + \sqrt{x \cdot x - \varepsilon}} \end{array} \]

FPCore

(FPCore (x eps) :precision binary64 (/ eps (+ x (sqrt (- (* x x) eps)))))

C

double code(double x, double eps) {
	return eps / (x + sqrt(((x * x) - 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 / (x + sqrt(((x * x) - eps)))
end function

Java

public static double code(double x, double eps) {
	return eps / (x + Math.sqrt(((x * x) - eps)));
}

Python

def code(x, eps):
	return eps / (x + math.sqrt(((x * x) - eps)))

Julia

function code(x, eps)
	return Float64(eps / Float64(x + sqrt(Float64(Float64(x * x) - eps))))
end

MATLAB

function tmp = code(x, eps)
	tmp = eps / (x + sqrt(((x * x) - eps)));
end

Wolfram

code[x_, eps_] := N[(eps / N[(x + N[Sqrt[N[(N[(x * x), $MachinePrecision] - eps), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 61.6%

   \[x - \sqrt{x \cdot x - \varepsilon} \]
2. Step-by-step derivation

   1. lift--.f64 N/A

      \[\leadsto \color{blue}{x - \sqrt{x \cdot x - \varepsilon}} \]

   2. lift-sqrt.f64 N/A

      \[\leadsto x - \color{blue}{\sqrt{x \cdot x - \varepsilon}} \]

   3. lift-*.f64 N/A

      \[\leadsto x - \sqrt{\color{blue}{x \cdot x} - \varepsilon} \]

   4. lift--.f64 N/A

      \[\leadsto x - \sqrt{\color{blue}{x \cdot x - \varepsilon}} \]

   5. flip-- N/A

      \[\leadsto \color{blue}{\frac{x \cdot x - \sqrt{x \cdot x - \varepsilon} \cdot \sqrt{x \cdot x - \varepsilon}}{x + \sqrt{x \cdot x - \varepsilon}}} \]

   6. lower-/.f64 N/A

      \[\leadsto \color{blue}{\frac{x \cdot x - \sqrt{x \cdot x - \varepsilon} \cdot \sqrt{x \cdot x - \varepsilon}}{x + \sqrt{x \cdot x - \varepsilon}}} \]

3. Applied rewrites 61.5%

   \[\leadsto \color{blue}{\frac{x \cdot x - \sqrt{x \cdot x - \varepsilon} \cdot \sqrt{x \cdot x - \varepsilon}}{x + \sqrt{x \cdot x - \varepsilon}}} \]

4. Taylor expanded in x around 0

   \[\leadsto \frac{\color{blue}{\varepsilon}}{x + \sqrt{x \cdot x - \varepsilon}} \]
5. Step-by-step derivation

6. Applied rewrites 99.5%

   \[\leadsto \frac{\color{blue}{\varepsilon}}{x + \sqrt{x \cdot x - \varepsilon}} \]
7. Add Preprocessing

Alternative 3: 98.3% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x - \sqrt{x \cdot x - \varepsilon} \leq -1 \cdot 10^{-153}:\\ \;\;\;\;x - \sqrt{\mathsf{fma}\left(x, x, -\varepsilon\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{\varepsilon}{x + x}\\ \end{array} \end{array} \]

FPCore

(FPCore (x eps)
 :precision binary64
 (if (<= (- x (sqrt (- (* x x) eps))) -1e-153)
   (- x (sqrt (fma x x (- eps))))
   (/ eps (+ x x))))

C

double code(double x, double eps) {
	double tmp;
	if ((x - sqrt(((x * x) - eps))) <= -1e-153) {
		tmp = x - sqrt(fma(x, x, -eps));
	} else {
		tmp = eps / (x + x);
	}
	return tmp;
}

Julia

function code(x, eps)
	tmp = 0.0
	if (Float64(x - sqrt(Float64(Float64(x * x) - eps))) <= -1e-153)
		tmp = Float64(x - sqrt(fma(x, x, Float64(-eps))));
	else
		tmp = Float64(eps / Float64(x + x));
	end
	return tmp
end

Wolfram

code[x_, eps_] := If[LessEqual[N[(x - N[Sqrt[N[(N[(x * x), $MachinePrecision] - eps), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], -1e-153], N[(x - N[Sqrt[N[(x * x + (-eps)), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(eps / N[(x + x), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (-.f64 x (sqrt.f64 (-.f64 (*.f64 x x) eps))) < -1.00000000000000004e-153

   1. Initial program 61.6%

      \[x - \sqrt{x \cdot x - \varepsilon} \]

   2. Taylor expanded in eps around 0

      \[\leadsto x - \sqrt{\color{blue}{-1 \cdot \varepsilon + {x}^{2}}} \]
   3. Step-by-step derivation

      1. mul-1-neg N/A

         \[\leadsto x - \sqrt{\left(\mathsf{neg}\left(\varepsilon\right)\right) + {\color{blue}{x}}^{2}} \]

      2. +-commutative N/A

         \[\leadsto x - \sqrt{{x}^{2} + \color{blue}{\left(\mathsf{neg}\left(\varepsilon\right)\right)}} \]

      3. pow2 N/A

         \[\leadsto x - \sqrt{x \cdot x + \left(\mathsf{neg}\left(\color{blue}{\varepsilon}\right)\right)} \]

      4. lower-fma.f64 N/A

         \[\leadsto x - \sqrt{\mathsf{fma}\left(x, \color{blue}{x}, \mathsf{neg}\left(\varepsilon\right)\right)} \]

      5. lower-neg.f64 61.6

         \[\leadsto x - \sqrt{\mathsf{fma}\left(x, x, -\varepsilon\right)} \]

   4. Applied rewrites 61.6%

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

   if -1.00000000000000004e-153 < (-.f64 x (sqrt.f64 (-.f64 (*.f64 x x) eps)))

   1. Initial program 61.6%

      \[x - \sqrt{x \cdot x - \varepsilon} \]
   2. Step-by-step derivation

      1. lift--.f64 N/A

         \[\leadsto \color{blue}{x - \sqrt{x \cdot x - \varepsilon}} \]

      2. lift-sqrt.f64 N/A

         \[\leadsto x - \color{blue}{\sqrt{x \cdot x - \varepsilon}} \]

      3. lift-*.f64 N/A

         \[\leadsto x - \sqrt{\color{blue}{x \cdot x} - \varepsilon} \]

      4. lift--.f64 N/A

         \[\leadsto x - \sqrt{\color{blue}{x \cdot x - \varepsilon}} \]

      5. flip-- N/A

         \[\leadsto \color{blue}{\frac{x \cdot x - \sqrt{x \cdot x - \varepsilon} \cdot \sqrt{x \cdot x - \varepsilon}}{x + \sqrt{x \cdot x - \varepsilon}}} \]

      6. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{x \cdot x - \sqrt{x \cdot x - \varepsilon} \cdot \sqrt{x \cdot x - \varepsilon}}{x + \sqrt{x \cdot x - \varepsilon}}} \]

   3. Applied rewrites 61.5%

      \[\leadsto \color{blue}{\frac{x \cdot x - \sqrt{x \cdot x - \varepsilon} \cdot \sqrt{x \cdot x - \varepsilon}}{x + \sqrt{x \cdot x - \varepsilon}}} \]

   4. Taylor expanded in x around 0

      \[\leadsto \frac{\color{blue}{\varepsilon}}{x + \sqrt{x \cdot x - \varepsilon}} \]
   5. Step-by-step derivation

   6. Applied rewrites 99.5%

      \[\leadsto \frac{\color{blue}{\varepsilon}}{x + \sqrt{x \cdot x - \varepsilon}} \]

   7. Taylor expanded in x around inf

      \[\leadsto \frac{\varepsilon}{\color{blue}{2 \cdot x}} \]
   8. Step-by-step derivation

      1. count-2-rev N/A

         \[\leadsto \frac{\varepsilon}{x + \color{blue}{x}} \]

      2. lower-+.f64 44.8

         \[\leadsto \frac{\varepsilon}{x + \color{blue}{x}} \]

   9. Applied rewrites 44.8%

      \[\leadsto \frac{\varepsilon}{\color{blue}{x + x}} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 4: 98.3% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := x - \sqrt{x \cdot x - \varepsilon}\\ \mathbf{if}\;t\_0 \leq -1 \cdot 10^{-153}:\\ \;\;\;\;t\_0\\ \mathbf{else}:\\ \;\;\;\;\frac{\varepsilon}{x + x}\\ \end{array} \end{array} \]

FPCore

(FPCore (x eps)
 :precision binary64
 (let* ((t_0 (- x (sqrt (- (* x x) eps)))))
   (if (<= t_0 -1e-153) t_0 (/ eps (+ x x)))))

C

double code(double x, double eps) {
	double t_0 = x - sqrt(((x * x) - eps));
	double tmp;
	if (t_0 <= -1e-153) {
		tmp = t_0;
	} else {
		tmp = eps / (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 - sqrt(((x * x) - eps))
    if (t_0 <= (-1d-153)) then
        tmp = t_0
    else
        tmp = eps / (x + x)
    end if
    code = tmp
end function

Java

public static double code(double x, double eps) {
	double t_0 = x - Math.sqrt(((x * x) - eps));
	double tmp;
	if (t_0 <= -1e-153) {
		tmp = t_0;
	} else {
		tmp = eps / (x + x);
	}
	return tmp;
}

Python

def code(x, eps):
	t_0 = x - math.sqrt(((x * x) - eps))
	tmp = 0
	if t_0 <= -1e-153:
		tmp = t_0
	else:
		tmp = eps / (x + x)
	return tmp

Julia

function code(x, eps)
	t_0 = Float64(x - sqrt(Float64(Float64(x * x) - eps)))
	tmp = 0.0
	if (t_0 <= -1e-153)
		tmp = t_0;
	else
		tmp = Float64(eps / Float64(x + x));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, eps)
	t_0 = x - sqrt(((x * x) - eps));
	tmp = 0.0;
	if (t_0 <= -1e-153)
		tmp = t_0;
	else
		tmp = eps / (x + x);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, eps_] := Block[{t$95$0 = N[(x - N[Sqrt[N[(N[(x * x), $MachinePrecision] - eps), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, -1e-153], t$95$0, N[(eps / N[(x + x), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (-.f64 x (sqrt.f64 (-.f64 (*.f64 x x) eps))) < -1.00000000000000004e-153

   1. Initial program 61.6%

      \[x - \sqrt{x \cdot x - \varepsilon} \]

   if -1.00000000000000004e-153 < (-.f64 x (sqrt.f64 (-.f64 (*.f64 x x) eps)))

   1. Initial program 61.6%

      \[x - \sqrt{x \cdot x - \varepsilon} \]
   2. Step-by-step derivation

      1. lift--.f64 N/A

         \[\leadsto \color{blue}{x - \sqrt{x \cdot x - \varepsilon}} \]

      2. lift-sqrt.f64 N/A

         \[\leadsto x - \color{blue}{\sqrt{x \cdot x - \varepsilon}} \]

      3. lift-*.f64 N/A

         \[\leadsto x - \sqrt{\color{blue}{x \cdot x} - \varepsilon} \]

      4. lift--.f64 N/A

         \[\leadsto x - \sqrt{\color{blue}{x \cdot x - \varepsilon}} \]

      5. flip-- N/A

         \[\leadsto \color{blue}{\frac{x \cdot x - \sqrt{x \cdot x - \varepsilon} \cdot \sqrt{x \cdot x - \varepsilon}}{x + \sqrt{x \cdot x - \varepsilon}}} \]

      6. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{x \cdot x - \sqrt{x \cdot x - \varepsilon} \cdot \sqrt{x \cdot x - \varepsilon}}{x + \sqrt{x \cdot x - \varepsilon}}} \]

   3. Applied rewrites 61.5%

      \[\leadsto \color{blue}{\frac{x \cdot x - \sqrt{x \cdot x - \varepsilon} \cdot \sqrt{x \cdot x - \varepsilon}}{x + \sqrt{x \cdot x - \varepsilon}}} \]

   4. Taylor expanded in x around 0

      \[\leadsto \frac{\color{blue}{\varepsilon}}{x + \sqrt{x \cdot x - \varepsilon}} \]
   5. Step-by-step derivation

   6. Applied rewrites 99.5%

      \[\leadsto \frac{\color{blue}{\varepsilon}}{x + \sqrt{x \cdot x - \varepsilon}} \]

   7. Taylor expanded in x around inf

      \[\leadsto \frac{\varepsilon}{\color{blue}{2 \cdot x}} \]
   8. Step-by-step derivation

      1. count-2-rev N/A

         \[\leadsto \frac{\varepsilon}{x + \color{blue}{x}} \]

      2. lower-+.f64 44.8

         \[\leadsto \frac{\varepsilon}{x + \color{blue}{x}} \]

   9. Applied rewrites 44.8%

      \[\leadsto \frac{\varepsilon}{\color{blue}{x + x}} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 5: 96.3% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x - \sqrt{x \cdot x - \varepsilon} \leq -1 \cdot 10^{-153}:\\ \;\;\;\;\frac{\varepsilon}{x + \sqrt{-\varepsilon}}\\ \mathbf{else}:\\ \;\;\;\;\frac{\varepsilon}{x + x}\\ \end{array} \end{array} \]

FPCore

(FPCore (x eps)
 :precision binary64
 (if (<= (- x (sqrt (- (* x x) eps))) -1e-153)
   (/ eps (+ x (sqrt (- eps))))
   (/ eps (+ x x))))

C

double code(double x, double eps) {
	double tmp;
	if ((x - sqrt(((x * x) - eps))) <= -1e-153) {
		tmp = eps / (x + sqrt(-eps));
	} else {
		tmp = eps / (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) :: tmp
    if ((x - sqrt(((x * x) - eps))) <= (-1d-153)) then
        tmp = eps / (x + sqrt(-eps))
    else
        tmp = eps / (x + x)
    end if
    code = tmp
end function

Java

public static double code(double x, double eps) {
	double tmp;
	if ((x - Math.sqrt(((x * x) - eps))) <= -1e-153) {
		tmp = eps / (x + Math.sqrt(-eps));
	} else {
		tmp = eps / (x + x);
	}
	return tmp;
}

Python

def code(x, eps):
	tmp = 0
	if (x - math.sqrt(((x * x) - eps))) <= -1e-153:
		tmp = eps / (x + math.sqrt(-eps))
	else:
		tmp = eps / (x + x)
	return tmp

Julia

function code(x, eps)
	tmp = 0.0
	if (Float64(x - sqrt(Float64(Float64(x * x) - eps))) <= -1e-153)
		tmp = Float64(eps / Float64(x + sqrt(Float64(-eps))));
	else
		tmp = Float64(eps / Float64(x + x));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, eps)
	tmp = 0.0;
	if ((x - sqrt(((x * x) - eps))) <= -1e-153)
		tmp = eps / (x + sqrt(-eps));
	else
		tmp = eps / (x + x);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, eps_] := If[LessEqual[N[(x - N[Sqrt[N[(N[(x * x), $MachinePrecision] - eps), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], -1e-153], N[(eps / N[(x + N[Sqrt[(-eps)], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(eps / N[(x + x), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (-.f64 x (sqrt.f64 (-.f64 (*.f64 x x) eps))) < -1.00000000000000004e-153

   1. Initial program 61.6%

      \[x - \sqrt{x \cdot x - \varepsilon} \]
   2. Step-by-step derivation

      1. lift--.f64 N/A

         \[\leadsto \color{blue}{x - \sqrt{x \cdot x - \varepsilon}} \]

      2. lift-sqrt.f64 N/A

         \[\leadsto x - \color{blue}{\sqrt{x \cdot x - \varepsilon}} \]

      3. lift-*.f64 N/A

         \[\leadsto x - \sqrt{\color{blue}{x \cdot x} - \varepsilon} \]

      4. lift--.f64 N/A

         \[\leadsto x - \sqrt{\color{blue}{x \cdot x - \varepsilon}} \]

      5. flip-- N/A

         \[\leadsto \color{blue}{\frac{x \cdot x - \sqrt{x \cdot x - \varepsilon} \cdot \sqrt{x \cdot x - \varepsilon}}{x + \sqrt{x \cdot x - \varepsilon}}} \]

      6. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{x \cdot x - \sqrt{x \cdot x - \varepsilon} \cdot \sqrt{x \cdot x - \varepsilon}}{x + \sqrt{x \cdot x - \varepsilon}}} \]

   3. Applied rewrites 61.5%

      \[\leadsto \color{blue}{\frac{x \cdot x - \sqrt{x \cdot x - \varepsilon} \cdot \sqrt{x \cdot x - \varepsilon}}{x + \sqrt{x \cdot x - \varepsilon}}} \]

   4. Taylor expanded in x around 0

      \[\leadsto \frac{\color{blue}{\varepsilon}}{x + \sqrt{x \cdot x - \varepsilon}} \]
   5. Step-by-step derivation

   6. Applied rewrites 99.5%

      \[\leadsto \frac{\color{blue}{\varepsilon}}{x + \sqrt{x \cdot x - \varepsilon}} \]

   7. Taylor expanded in x around 0

      \[\leadsto \frac{\varepsilon}{x + \sqrt{\color{blue}{-1 \cdot \varepsilon}}} \]
   8. Step-by-step derivation

      1. mul-1-neg N/A

         \[\leadsto \frac{\varepsilon}{x + \sqrt{\mathsf{neg}\left(\varepsilon\right)}} \]

      2. lower-neg.f64 60.1

         \[\leadsto \frac{\varepsilon}{x + \sqrt{-\varepsilon}} \]

   9. Applied rewrites 60.1%

      \[\leadsto \frac{\varepsilon}{x + \sqrt{\color{blue}{-\varepsilon}}} \]

   if -1.00000000000000004e-153 < (-.f64 x (sqrt.f64 (-.f64 (*.f64 x x) eps)))

   1. Initial program 61.6%

      \[x - \sqrt{x \cdot x - \varepsilon} \]
   2. Step-by-step derivation

      1. lift--.f64 N/A

         \[\leadsto \color{blue}{x - \sqrt{x \cdot x - \varepsilon}} \]

      2. lift-sqrt.f64 N/A

         \[\leadsto x - \color{blue}{\sqrt{x \cdot x - \varepsilon}} \]

      3. lift-*.f64 N/A

         \[\leadsto x - \sqrt{\color{blue}{x \cdot x} - \varepsilon} \]

      4. lift--.f64 N/A

         \[\leadsto x - \sqrt{\color{blue}{x \cdot x - \varepsilon}} \]

      5. flip-- N/A

         \[\leadsto \color{blue}{\frac{x \cdot x - \sqrt{x \cdot x - \varepsilon} \cdot \sqrt{x \cdot x - \varepsilon}}{x + \sqrt{x \cdot x - \varepsilon}}} \]

      6. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{x \cdot x - \sqrt{x \cdot x - \varepsilon} \cdot \sqrt{x \cdot x - \varepsilon}}{x + \sqrt{x \cdot x - \varepsilon}}} \]

   3. Applied rewrites 61.5%

      \[\leadsto \color{blue}{\frac{x \cdot x - \sqrt{x \cdot x - \varepsilon} \cdot \sqrt{x \cdot x - \varepsilon}}{x + \sqrt{x \cdot x - \varepsilon}}} \]

   4. Taylor expanded in x around 0

      \[\leadsto \frac{\color{blue}{\varepsilon}}{x + \sqrt{x \cdot x - \varepsilon}} \]
   5. Step-by-step derivation

   6. Applied rewrites 99.5%

      \[\leadsto \frac{\color{blue}{\varepsilon}}{x + \sqrt{x \cdot x - \varepsilon}} \]

   7. Taylor expanded in x around inf

      \[\leadsto \frac{\varepsilon}{\color{blue}{2 \cdot x}} \]
   8. Step-by-step derivation

      1. count-2-rev N/A

         \[\leadsto \frac{\varepsilon}{x + \color{blue}{x}} \]

      2. lower-+.f64 44.8

         \[\leadsto \frac{\varepsilon}{x + \color{blue}{x}} \]

   9. Applied rewrites 44.8%

      \[\leadsto \frac{\varepsilon}{\color{blue}{x + x}} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 6: 96.3% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x - \sqrt{x \cdot x - \varepsilon} \leq -1 \cdot 10^{-153}:\\ \;\;\;\;x - \sqrt{-\varepsilon}\\ \mathbf{else}:\\ \;\;\;\;\frac{\varepsilon}{x + x}\\ \end{array} \end{array} \]

FPCore

(FPCore (x eps)
 :precision binary64
 (if (<= (- x (sqrt (- (* x x) eps))) -1e-153)
   (- x (sqrt (- eps)))
   (/ eps (+ x x))))

C

double code(double x, double eps) {
	double tmp;
	if ((x - sqrt(((x * x) - eps))) <= -1e-153) {
		tmp = x - sqrt(-eps);
	} else {
		tmp = eps / (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) :: tmp
    if ((x - sqrt(((x * x) - eps))) <= (-1d-153)) then
        tmp = x - sqrt(-eps)
    else
        tmp = eps / (x + x)
    end if
    code = tmp
end function

Java

public static double code(double x, double eps) {
	double tmp;
	if ((x - Math.sqrt(((x * x) - eps))) <= -1e-153) {
		tmp = x - Math.sqrt(-eps);
	} else {
		tmp = eps / (x + x);
	}
	return tmp;
}

Python

def code(x, eps):
	tmp = 0
	if (x - math.sqrt(((x * x) - eps))) <= -1e-153:
		tmp = x - math.sqrt(-eps)
	else:
		tmp = eps / (x + x)
	return tmp

Julia

function code(x, eps)
	tmp = 0.0
	if (Float64(x - sqrt(Float64(Float64(x * x) - eps))) <= -1e-153)
		tmp = Float64(x - sqrt(Float64(-eps)));
	else
		tmp = Float64(eps / Float64(x + x));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, eps)
	tmp = 0.0;
	if ((x - sqrt(((x * x) - eps))) <= -1e-153)
		tmp = x - sqrt(-eps);
	else
		tmp = eps / (x + x);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, eps_] := If[LessEqual[N[(x - N[Sqrt[N[(N[(x * x), $MachinePrecision] - eps), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], -1e-153], N[(x - N[Sqrt[(-eps)], $MachinePrecision]), $MachinePrecision], N[(eps / N[(x + x), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (-.f64 x (sqrt.f64 (-.f64 (*.f64 x x) eps))) < -1.00000000000000004e-153

   1. Initial program 61.6%

      \[x - \sqrt{x \cdot x - \varepsilon} \]

   2. Taylor expanded in x around 0

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

      1. mul-1-neg N/A

         \[\leadsto x - \sqrt{\mathsf{neg}\left(\varepsilon\right)} \]

      2. lower-neg.f64 57.0

         \[\leadsto x - \sqrt{-\varepsilon} \]

   4. Applied rewrites 57.0%

      \[\leadsto x - \sqrt{\color{blue}{-\varepsilon}} \]

   if -1.00000000000000004e-153 < (-.f64 x (sqrt.f64 (-.f64 (*.f64 x x) eps)))

   1. Initial program 61.6%

      \[x - \sqrt{x \cdot x - \varepsilon} \]
   2. Step-by-step derivation

      1. lift--.f64 N/A

         \[\leadsto \color{blue}{x - \sqrt{x \cdot x - \varepsilon}} \]

      2. lift-sqrt.f64 N/A

         \[\leadsto x - \color{blue}{\sqrt{x \cdot x - \varepsilon}} \]

      3. lift-*.f64 N/A

         \[\leadsto x - \sqrt{\color{blue}{x \cdot x} - \varepsilon} \]

      4. lift--.f64 N/A

         \[\leadsto x - \sqrt{\color{blue}{x \cdot x - \varepsilon}} \]

      5. flip-- N/A

         \[\leadsto \color{blue}{\frac{x \cdot x - \sqrt{x \cdot x - \varepsilon} \cdot \sqrt{x \cdot x - \varepsilon}}{x + \sqrt{x \cdot x - \varepsilon}}} \]

      6. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{x \cdot x - \sqrt{x \cdot x - \varepsilon} \cdot \sqrt{x \cdot x - \varepsilon}}{x + \sqrt{x \cdot x - \varepsilon}}} \]

   3. Applied rewrites 61.5%

      \[\leadsto \color{blue}{\frac{x \cdot x - \sqrt{x \cdot x - \varepsilon} \cdot \sqrt{x \cdot x - \varepsilon}}{x + \sqrt{x \cdot x - \varepsilon}}} \]

   4. Taylor expanded in x around 0

      \[\leadsto \frac{\color{blue}{\varepsilon}}{x + \sqrt{x \cdot x - \varepsilon}} \]
   5. Step-by-step derivation

   6. Applied rewrites 99.5%

      \[\leadsto \frac{\color{blue}{\varepsilon}}{x + \sqrt{x \cdot x - \varepsilon}} \]

   7. Taylor expanded in x around inf

      \[\leadsto \frac{\varepsilon}{\color{blue}{2 \cdot x}} \]
   8. Step-by-step derivation

      1. count-2-rev N/A

         \[\leadsto \frac{\varepsilon}{x + \color{blue}{x}} \]

      2. lower-+.f64 44.8

         \[\leadsto \frac{\varepsilon}{x + \color{blue}{x}} \]

   9. Applied rewrites 44.8%

      \[\leadsto \frac{\varepsilon}{\color{blue}{x + x}} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 7: 57.3% accurate, 2.3× speedup

Math

\[\begin{array}{l} \\ -\sqrt{-\varepsilon} \end{array} \]

FPCore

(FPCore (x eps) :precision binary64 (- (sqrt (- eps))))

C

double code(double x, double eps) {
	return -sqrt(-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 = -sqrt(-eps)
end function

Java

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

Python

def code(x, eps):
	return -math.sqrt(-eps)

Julia

function code(x, eps)
	return Float64(-sqrt(Float64(-eps)))
end

MATLAB

function tmp = code(x, eps)
	tmp = -sqrt(-eps);
end

Wolfram

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

Derivation

1. Initial program 61.6%

   \[x - \sqrt{x \cdot x - \varepsilon} \]

2. Taylor expanded in x around 0

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

   1. mul-1-neg N/A

      \[\leadsto \mathsf{neg}\left(\sqrt{\varepsilon} \cdot \sqrt{-1}\right) \]

   2. lower-neg.f64 N/A

      \[\leadsto -\sqrt{\varepsilon} \cdot \sqrt{-1} \]

   3. sqrt-unprod N/A

      \[\leadsto -\sqrt{\varepsilon \cdot -1} \]

   4. *-commutative N/A

      \[\leadsto -\sqrt{-1 \cdot \varepsilon} \]

   5. mul-1-neg N/A

      \[\leadsto -\sqrt{\mathsf{neg}\left(\varepsilon\right)} \]

   6. lower-sqrt.f64 N/A

      \[\leadsto -\sqrt{\mathsf{neg}\left(\varepsilon\right)} \]

   7. lower-neg.f64 57.3

      \[\leadsto -\sqrt{-\varepsilon} \]

4. Applied rewrites 57.3%

   \[\leadsto \color{blue}{-\sqrt{-\varepsilon}} \]
5. Add Preprocessing

Alternative 8: 3.5% accurate, 2.9× speedup

Math

\[\begin{array}{l} \\ x + x \end{array} \]

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, eps_] := N[(x + x), $MachinePrecision]

Derivation

1. Initial program 61.6%

   \[x - \sqrt{x \cdot x - \varepsilon} \]

2. Taylor expanded in x around -inf

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

   1. count-2-rev N/A

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

   2. lower-+.f64 3.5

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

4. Applied rewrites 3.5%

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

Developer Target 1: 99.5% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \frac{\varepsilon}{x + \sqrt{x \cdot x - \varepsilon}} \end{array} \]

FPCore

(FPCore (x eps) :precision binary64 (/ eps (+ x (sqrt (- (* x x) eps)))))

C

double code(double x, double eps) {
	return eps / (x + sqrt(((x * x) - 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 / (x + sqrt(((x * x) - eps)))
end function

Java

public static double code(double x, double eps) {
	return eps / (x + Math.sqrt(((x * x) - eps)));
}

Python

def code(x, eps):
	return eps / (x + math.sqrt(((x * x) - eps)))

Julia

function code(x, eps)
	return Float64(eps / Float64(x + sqrt(Float64(Float64(x * x) - eps))))
end

MATLAB

function tmp = code(x, eps)
	tmp = eps / (x + sqrt(((x * x) - eps)));
end

Wolfram

code[x_, eps_] := N[(eps / N[(x + N[Sqrt[N[(N[(x * x), $MachinePrecision] - eps), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Reproduce

herbie shell --seed 2025131 
(FPCore (x eps)
  :name "ENA, Section 1.4, Exercise 4d"
  :precision binary64
  :pre (and (and (<= 0.0 x) (<= x 1000000000.0)) (and (<= -1.0 eps) (<= eps 1.0)))

  :alt
  (! :herbie-platform c (/ eps (+ x (sqrt (- (* x x) eps)))))

  (- x (sqrt (- (* x x) eps))))