x / (x^2 + 1)

Percentage Accurate: 75.8% → 99.2%

Time: 2.4s

Alternatives: 5

Speedup: 1.1×

Specification

Math

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

FPCore

(FPCore (x) :precision binary64 (/ x (+ (* x x) 1.0)))

C

double code(double x) {
	return x / ((x * x) + 1.0);
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(x)
use fmin_fmax_functions
    real(8), intent (in) :: x
    code = x / ((x * x) + 1.0d0)
end function

Java

public static double code(double x) {
	return x / ((x * x) + 1.0);
}

Python

def code(x):
	return x / ((x * x) + 1.0)

Julia

function code(x)
	return Float64(x / Float64(Float64(x * x) + 1.0))
end

MATLAB

function tmp = code(x)
	tmp = x / ((x * x) + 1.0);
end

Wolfram

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

Initial Program: 75.8% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (x) :precision binary64 (/ x (+ (* x x) 1.0)))

C

double code(double x) {
	return x / ((x * x) + 1.0);
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(x)
use fmin_fmax_functions
    real(8), intent (in) :: x
    code = x / ((x * x) + 1.0d0)
end function

Java

public static double code(double x) {
	return x / ((x * x) + 1.0);
}

Python

def code(x):
	return x / ((x * x) + 1.0)

Julia

function code(x)
	return Float64(x / Float64(Float64(x * x) + 1.0))
end

MATLAB

function tmp = code(x)
	tmp = x / ((x * x) + 1.0);
end

Wolfram

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

Alternative 1: 99.2% accurate, 0.7× speedup

Math

\[\begin{array}{l} x\_m = \left|x\right| \\ x\_s = \mathsf{copysign}\left(1, x\right) \\ x\_s \cdot \begin{array}{l} \mathbf{if}\;x\_m \leq 1:\\ \;\;\;\;x\_m \cdot \mathsf{fma}\left(\mathsf{fma}\left(x\_m, x\_m, -1\right), x\_m \cdot x\_m, 1\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{x\_m}\\ \end{array} \end{array} \]

FPCore

x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
(FPCore (x_s x_m)
 :precision binary64
 (*
  x_s
  (if (<= x_m 1.0)
    (* x_m (fma (fma x_m x_m -1.0) (* x_m x_m) 1.0))
    (/ 1.0 x_m))))

C

x\_m = fabs(x);
x\_s = copysign(1.0, x);
double code(double x_s, double x_m) {
	double tmp;
	if (x_m <= 1.0) {
		tmp = x_m * fma(fma(x_m, x_m, -1.0), (x_m * x_m), 1.0);
	} else {
		tmp = 1.0 / x_m;
	}
	return x_s * tmp;
}

Julia

x\_m = abs(x)
x\_s = copysign(1.0, x)
function code(x_s, x_m)
	tmp = 0.0
	if (x_m <= 1.0)
		tmp = Float64(x_m * fma(fma(x_m, x_m, -1.0), Float64(x_m * x_m), 1.0));
	else
		tmp = Float64(1.0 / x_m);
	end
	return Float64(x_s * tmp)
end

Wolfram

x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[x$95$s_, x$95$m_] := N[(x$95$s * If[LessEqual[x$95$m, 1.0], N[(x$95$m * N[(N[(x$95$m * x$95$m + -1.0), $MachinePrecision] * N[(x$95$m * x$95$m), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision], N[(1.0 / x$95$m), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if x < 1

   1. Initial program 85.0%

      \[\frac{x}{x \cdot x + 1} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto \color{blue}{\frac{x}{x \cdot x + 1}} \]

      2. lift-+.f64 N/A

         \[\leadsto \frac{x}{\color{blue}{x \cdot x + 1}} \]

      3. lift-*.f64 N/A

         \[\leadsto \frac{x}{\color{blue}{x \cdot x} + 1} \]

      4. pow2 N/A

         \[\leadsto \frac{x}{\color{blue}{{x}^{2}} + 1} \]

      5. +-commutative N/A

         \[\leadsto \frac{x}{\color{blue}{1 + {x}^{2}}} \]

      6. flip3-+ N/A

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

      7. associate-/r/ N/A

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

      8. metadata-eval N/A

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

      9. pow-pow N/A

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

      10. metadata-eval N/A

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

      11. +-commutative N/A

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

      12. metadata-eval N/A

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

      13. pow-pow N/A

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

      14. metadata-eval N/A

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

      15. lower-*.f64 N/A

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

   4. Applied rewrites 74.4%

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

   5. Taylor expanded in x around 0

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

   7. Applied rewrites 70.1%

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

   if 1 < x

   1. Initial program 50.1%

      \[\frac{x}{x \cdot x + 1} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

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

      1. inv-pow N/A

         \[\leadsto {x}^{\color{blue}{-1}} \]

      2. lower-pow.f64 100.0

         \[\leadsto {x}^{\color{blue}{-1}} \]

   5. Applied rewrites 100.0%

      \[\leadsto \color{blue}{{x}^{-1}} \]
   6. Step-by-step derivation

      1. lift-pow.f64 N/A

         \[\leadsto {x}^{\color{blue}{-1}} \]

      2. inv-pow N/A

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

      3. lower-/.f64 100.0

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

   7. Applied rewrites 100.0%

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

Alternative 2: 99.9% accurate, 0.8× speedup

Math

\[\begin{array}{l} x\_m = \left|x\right| \\ x\_s = \mathsf{copysign}\left(1, x\right) \\ x\_s \cdot \begin{array}{l} \mathbf{if}\;x\_m \leq 50000:\\ \;\;\;\;\frac{x\_m}{\mathsf{fma}\left(x\_m, x\_m, 1\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{x\_m}\\ \end{array} \end{array} \]

FPCore

x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
(FPCore (x_s x_m)
 :precision binary64
 (* x_s (if (<= x_m 50000.0) (/ x_m (fma x_m x_m 1.0)) (/ 1.0 x_m))))

C

x\_m = fabs(x);
x\_s = copysign(1.0, x);
double code(double x_s, double x_m) {
	double tmp;
	if (x_m <= 50000.0) {
		tmp = x_m / fma(x_m, x_m, 1.0);
	} else {
		tmp = 1.0 / x_m;
	}
	return x_s * tmp;
}

Julia

x\_m = abs(x)
x\_s = copysign(1.0, x)
function code(x_s, x_m)
	tmp = 0.0
	if (x_m <= 50000.0)
		tmp = Float64(x_m / fma(x_m, x_m, 1.0));
	else
		tmp = Float64(1.0 / x_m);
	end
	return Float64(x_s * tmp)
end

Wolfram

x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[x$95$s_, x$95$m_] := N[(x$95$s * If[LessEqual[x$95$m, 50000.0], N[(x$95$m / N[(x$95$m * x$95$m + 1.0), $MachinePrecision]), $MachinePrecision], N[(1.0 / x$95$m), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if x < 5e4

   1. Initial program 85.0%

      \[\frac{x}{x \cdot x + 1} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-+.f64 N/A

         \[\leadsto \frac{x}{\color{blue}{x \cdot x + 1}} \]

      2. lift-*.f64 N/A

         \[\leadsto \frac{x}{\color{blue}{x \cdot x} + 1} \]

      3. lower-fma.f64 85.0

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

   4. Applied rewrites 85.0%

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

   if 5e4 < x

   1. Initial program 50.1%

      \[\frac{x}{x \cdot x + 1} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

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

      1. inv-pow N/A

         \[\leadsto {x}^{\color{blue}{-1}} \]

      2. lower-pow.f64 100.0

         \[\leadsto {x}^{\color{blue}{-1}} \]

   5. Applied rewrites 100.0%

      \[\leadsto \color{blue}{{x}^{-1}} \]
   6. Step-by-step derivation

      1. lift-pow.f64 N/A

         \[\leadsto {x}^{\color{blue}{-1}} \]

      2. inv-pow N/A

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

      3. lower-/.f64 100.0

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

   7. Applied rewrites 100.0%

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

Alternative 3: 99.1% accurate, 1.0× speedup

Math

\[\begin{array}{l} x\_m = \left|x\right| \\ x\_s = \mathsf{copysign}\left(1, x\right) \\ x\_s \cdot \begin{array}{l} \mathbf{if}\;x\_m \leq 0.85:\\ \;\;\;\;\mathsf{fma}\left(\left(-x\_m\right) \cdot x\_m, x\_m, x\_m\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{x\_m}\\ \end{array} \end{array} \]

FPCore

x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
(FPCore (x_s x_m)
 :precision binary64
 (* x_s (if (<= x_m 0.85) (fma (* (- x_m) x_m) x_m x_m) (/ 1.0 x_m))))

C

x\_m = fabs(x);
x\_s = copysign(1.0, x);
double code(double x_s, double x_m) {
	double tmp;
	if (x_m <= 0.85) {
		tmp = fma((-x_m * x_m), x_m, x_m);
	} else {
		tmp = 1.0 / x_m;
	}
	return x_s * tmp;
}

Julia

x\_m = abs(x)
x\_s = copysign(1.0, x)
function code(x_s, x_m)
	tmp = 0.0
	if (x_m <= 0.85)
		tmp = fma(Float64(Float64(-x_m) * x_m), x_m, x_m);
	else
		tmp = Float64(1.0 / x_m);
	end
	return Float64(x_s * tmp)
end

Wolfram

x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[x$95$s_, x$95$m_] := N[(x$95$s * If[LessEqual[x$95$m, 0.85], N[(N[((-x$95$m) * x$95$m), $MachinePrecision] * x$95$m + x$95$m), $MachinePrecision], N[(1.0 / x$95$m), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if x < 0.849999999999999978

   1. Initial program 85.0%

      \[\frac{x}{x \cdot x + 1} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

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

      1. distribute-rgt-in N/A

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

      2. mul-1-neg N/A

         \[\leadsto 1 \cdot x + \left(\mathsf{neg}\left({x}^{2}\right)\right) \cdot x \]

      3. fp-cancel-sub-sign N/A

         \[\leadsto 1 \cdot x - \color{blue}{{x}^{2} \cdot x} \]

      4. *-lft-identity N/A

         \[\leadsto x - \color{blue}{{x}^{2}} \cdot x \]

      5. pow2 N/A

         \[\leadsto x - \left(x \cdot x\right) \cdot x \]

      6. unpow3 N/A

         \[\leadsto x - {x}^{\color{blue}{3}} \]

      7. metadata-eval N/A

         \[\leadsto x - {x}^{\left(\frac{6}{\color{blue}{2}}\right)} \]

      8. lower--.f64 N/A

         \[\leadsto x - \color{blue}{{x}^{\left(\frac{6}{2}\right)}} \]

      9. metadata-eval N/A

         \[\leadsto x - {x}^{3} \]

      10. lower-pow.f64 69.6

          \[\leadsto x - {x}^{\color{blue}{3}} \]

   5. Applied rewrites 69.6%

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

      1. lift--.f64 N/A

         \[\leadsto x - \color{blue}{{x}^{3}} \]

      2. lift-pow.f64 N/A

         \[\leadsto x - {x}^{\color{blue}{3}} \]

      3. unpow3 N/A

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

      4. pow2 N/A

         \[\leadsto x - {x}^{2} \cdot x \]

      5. *-lft-identity N/A

         \[\leadsto 1 \cdot x - \color{blue}{{x}^{2}} \cdot x \]

      6. fp-cancel-sub-sign N/A

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

      7. mul-1-neg N/A

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

      8. distribute-rgt-in N/A

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

      9. +-commutative N/A

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

      10. distribute-rgt-in N/A

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

      11. *-lft-identity N/A

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

      12. lower-fma.f64 N/A

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

      13. mul-1-neg N/A

          \[\leadsto \mathsf{fma}\left(\mathsf{neg}\left({x}^{2}\right), x, x\right) \]

      14. pow2 N/A

          \[\leadsto \mathsf{fma}\left(\mathsf{neg}\left(x \cdot x\right), x, x\right) \]

      15. distribute-lft-neg-in N/A

          \[\leadsto \mathsf{fma}\left(\left(\mathsf{neg}\left(x\right)\right) \cdot x, x, x\right) \]

      16. lower-*.f64 N/A

          \[\leadsto \mathsf{fma}\left(\left(\mathsf{neg}\left(x\right)\right) \cdot x, x, x\right) \]

      17. lower-neg.f64 69.6

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

   7. Applied rewrites 69.6%

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

   if 0.849999999999999978 < x

   1. Initial program 50.1%

      \[\frac{x}{x \cdot x + 1} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

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

      1. inv-pow N/A

         \[\leadsto {x}^{\color{blue}{-1}} \]

      2. lower-pow.f64 100.0

         \[\leadsto {x}^{\color{blue}{-1}} \]

   5. Applied rewrites 100.0%

      \[\leadsto \color{blue}{{x}^{-1}} \]
   6. Step-by-step derivation

      1. lift-pow.f64 N/A

         \[\leadsto {x}^{\color{blue}{-1}} \]

      2. inv-pow N/A

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

      3. lower-/.f64 100.0

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

   7. Applied rewrites 100.0%

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

Alternative 4: 98.8% accurate, 1.1× speedup

Math

\[\begin{array}{l} x\_m = \left|x\right| \\ x\_s = \mathsf{copysign}\left(1, x\right) \\ x\_s \cdot \begin{array}{l} \mathbf{if}\;x\_m \leq 1:\\ \;\;\;\;x\_m\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{x\_m}\\ \end{array} \end{array} \]

FPCore

x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
(FPCore (x_s x_m)
 :precision binary64
 (* x_s (if (<= x_m 1.0) x_m (/ 1.0 x_m))))

C

x\_m = fabs(x);
x\_s = copysign(1.0, x);
double code(double x_s, double x_m) {
	double tmp;
	if (x_m <= 1.0) {
		tmp = x_m;
	} else {
		tmp = 1.0 / x_m;
	}
	return x_s * tmp;
}

Fortran

x\_m =     private
x\_s =     private
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_s, x_m)
use fmin_fmax_functions
    real(8), intent (in) :: x_s
    real(8), intent (in) :: x_m
    real(8) :: tmp
    if (x_m <= 1.0d0) then
        tmp = x_m
    else
        tmp = 1.0d0 / x_m
    end if
    code = x_s * tmp
end function

Java

x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
public static double code(double x_s, double x_m) {
	double tmp;
	if (x_m <= 1.0) {
		tmp = x_m;
	} else {
		tmp = 1.0 / x_m;
	}
	return x_s * tmp;
}

Python

x\_m = math.fabs(x)
x\_s = math.copysign(1.0, x)
def code(x_s, x_m):
	tmp = 0
	if x_m <= 1.0:
		tmp = x_m
	else:
		tmp = 1.0 / x_m
	return x_s * tmp

Julia

x\_m = abs(x)
x\_s = copysign(1.0, x)
function code(x_s, x_m)
	tmp = 0.0
	if (x_m <= 1.0)
		tmp = x_m;
	else
		tmp = Float64(1.0 / x_m);
	end
	return Float64(x_s * tmp)
end

MATLAB

x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
function tmp_2 = code(x_s, x_m)
	tmp = 0.0;
	if (x_m <= 1.0)
		tmp = x_m;
	else
		tmp = 1.0 / x_m;
	end
	tmp_2 = x_s * tmp;
end

Wolfram

x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[x$95$s_, x$95$m_] := N[(x$95$s * If[LessEqual[x$95$m, 1.0], x$95$m, N[(1.0 / x$95$m), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if x < 1

   1. Initial program 85.0%

      \[\frac{x}{x \cdot x + 1} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

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

   5. Applied rewrites 69.4%

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

   if 1 < x

   1. Initial program 50.1%

      \[\frac{x}{x \cdot x + 1} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

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

      1. inv-pow N/A

         \[\leadsto {x}^{\color{blue}{-1}} \]

      2. lower-pow.f64 100.0

         \[\leadsto {x}^{\color{blue}{-1}} \]

   5. Applied rewrites 100.0%

      \[\leadsto \color{blue}{{x}^{-1}} \]
   6. Step-by-step derivation

      1. lift-pow.f64 N/A

         \[\leadsto {x}^{\color{blue}{-1}} \]

      2. inv-pow N/A

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

      3. lower-/.f64 100.0

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

   7. Applied rewrites 100.0%

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

Alternative 5: 50.6% accurate, 20.0× speedup

Math

\[\begin{array}{l} x\_m = \left|x\right| \\ x\_s = \mathsf{copysign}\left(1, x\right) \\ x\_s \cdot x\_m \end{array} \]

FPCore

x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
(FPCore (x_s x_m) :precision binary64 (* x_s x_m))

C

x\_m = fabs(x);
x\_s = copysign(1.0, x);
double code(double x_s, double x_m) {
	return x_s * x_m;
}

Fortran

x\_m =     private
x\_s =     private
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_s, x_m)
use fmin_fmax_functions
    real(8), intent (in) :: x_s
    real(8), intent (in) :: x_m
    code = x_s * x_m
end function

Java

x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
public static double code(double x_s, double x_m) {
	return x_s * x_m;
}

Python

x\_m = math.fabs(x)
x\_s = math.copysign(1.0, x)
def code(x_s, x_m):
	return x_s * x_m

Julia

x\_m = abs(x)
x\_s = copysign(1.0, x)
function code(x_s, x_m)
	return Float64(x_s * x_m)
end

MATLAB

x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
function tmp = code(x_s, x_m)
	tmp = x_s * x_m;
end

Wolfram

x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[x$95$s_, x$95$m_] := N[(x$95$s * x$95$m), $MachinePrecision]

Derivation

1. Initial program 77.2%

   \[\frac{x}{x \cdot x + 1} \]
2. Add Preprocessing

3. Taylor expanded in x around 0

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

5. Applied rewrites 54.7%

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

Developer Target 1: 99.8% accurate, 0.8× speedup

Math

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

FPCore

(FPCore (x) :precision binary64 (/ 1.0 (+ x (/ 1.0 x))))

C

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

Java

public static double code(double x) {
	return 1.0 / (x + (1.0 / x));
}

Python

def code(x):
	return 1.0 / (x + (1.0 / x))

Julia

function code(x)
	return Float64(1.0 / Float64(x + Float64(1.0 / x)))
end

MATLAB

function tmp = code(x)
	tmp = 1.0 / (x + (1.0 / x));
end

Wolfram

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

Reproduce

herbie shell --seed 2025060 
(FPCore (x)
  :name "x / (x^2 + 1)"
  :precision binary64

  :alt
  (! :herbie-platform default (/ 1 (+ x (/ 1 x))))

  (/ x (+ (* x x) 1.0)))