cos2 (problem 3.4.1)

Percentage Accurate: 50.7% → 99.7%

Time: 7.0s

Alternatives: 6

Speedup: 120.0×

Specification

Math

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

FPCore

(FPCore (x) :precision binary64 (/ (- 1.0 (cos x)) (* x x)))

C

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

Java

public static double code(double x) {
	return (1.0 - Math.cos(x)) / (x * x);
}

Python

def code(x):
	return (1.0 - math.cos(x)) / (x * x)

Julia

function code(x)
	return Float64(Float64(1.0 - cos(x)) / Float64(x * x))
end

MATLAB

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

Wolfram

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

Initial Program: 50.7% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (x) :precision binary64 (/ (- 1.0 (cos x)) (* x x)))

C

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

Java

public static double code(double x) {
	return (1.0 - Math.cos(x)) / (x * x);
}

Python

def code(x):
	return (1.0 - math.cos(x)) / (x * x)

Julia

function code(x)
	return Float64(Float64(1.0 - cos(x)) / Float64(x * x))
end

MATLAB

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

Wolfram

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

Alternative 1: 99.7% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \tan \left(\frac{x}{2}\right) \cdot \frac{\frac{\sin x}{x}}{x} \end{array} \]

FPCore

(FPCore (x) :precision binary64 (* (tan (/ x 2.0)) (/ (/ (sin x) x) x)))

C

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

Java

public static double code(double x) {
	return Math.tan((x / 2.0)) * ((Math.sin(x) / x) / x);
}

Python

def code(x):
	return math.tan((x / 2.0)) * ((math.sin(x) / x) / x)

Julia

function code(x)
	return Float64(tan(Float64(x / 2.0)) * Float64(Float64(sin(x) / x) / x))
end

MATLAB

function tmp = code(x)
	tmp = tan((x / 2.0)) * ((sin(x) / x) / x);
end

Wolfram

code[x_] := N[(N[Tan[N[(x / 2.0), $MachinePrecision]], $MachinePrecision] * N[(N[(N[Sin[x], $MachinePrecision] / x), $MachinePrecision] / x), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 49.7%

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

   1. lift-/.f64 N/A

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

   2. lift--.f64 N/A

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

   3. flip-- N/A

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

   4. associate-/l/ N/A

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

   5. metadata-eval N/A

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

   6. lift-cos.f64 N/A

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

   7. lift-cos.f64 N/A

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

   8. 1-sub-cos N/A

      \[\leadsto \frac{\color{blue}{\sin x \cdot \sin x}}{\left(1 + \cos x\right) \cdot \left(x \cdot x\right)} \]

   9. associate-/l* N/A

      \[\leadsto \color{blue}{\sin x \cdot \frac{\sin x}{\left(1 + \cos x\right) \cdot \left(x \cdot x\right)}} \]

   10. lower-*.f64 N/A

       \[\leadsto \color{blue}{\sin x \cdot \frac{\sin x}{\left(1 + \cos x\right) \cdot \left(x \cdot x\right)}} \]

   11. lower-sin.f64 N/A

       \[\leadsto \color{blue}{\sin x} \cdot \frac{\sin x}{\left(1 + \cos x\right) \cdot \left(x \cdot x\right)} \]

   12. lower-/.f64 N/A

       \[\leadsto \sin x \cdot \color{blue}{\frac{\sin x}{\left(1 + \cos x\right) \cdot \left(x \cdot x\right)}} \]

   13. lower-sin.f64 N/A

       \[\leadsto \sin x \cdot \frac{\color{blue}{\sin x}}{\left(1 + \cos x\right) \cdot \left(x \cdot x\right)} \]

   14. lift-*.f64 N/A

       \[\leadsto \sin x \cdot \frac{\sin x}{\left(1 + \cos x\right) \cdot \color{blue}{\left(x \cdot x\right)}} \]

   15. associate-*r* N/A

       \[\leadsto \sin x \cdot \frac{\sin x}{\color{blue}{\left(\left(1 + \cos x\right) \cdot x\right) \cdot x}} \]

   16. lower-*.f64 N/A

       \[\leadsto \sin x \cdot \frac{\sin x}{\color{blue}{\left(\left(1 + \cos x\right) \cdot x\right) \cdot x}} \]

   17. lower-*.f64 N/A

       \[\leadsto \sin x \cdot \frac{\sin x}{\color{blue}{\left(\left(1 + \cos x\right) \cdot x\right)} \cdot x} \]

   18. +-commutative N/A

       \[\leadsto \sin x \cdot \frac{\sin x}{\left(\color{blue}{\left(\cos x + 1\right)} \cdot x\right) \cdot x} \]

   19. lower-+.f64 78.3

       \[\leadsto \sin x \cdot \frac{\sin x}{\left(\color{blue}{\left(\cos x + 1\right)} \cdot x\right) \cdot x} \]

4. Applied rewrites 78.3%

   \[\leadsto \color{blue}{\sin x \cdot \frac{\sin x}{\left(\left(\cos x + 1\right) \cdot x\right) \cdot x}} \]

5. Taylor expanded in x around inf

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

   1. unpow2 N/A

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

   2. *-commutative N/A

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

   3. times-frac N/A

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

   4. lower-*.f64 N/A

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

   5. hang-0p-tan N/A

      \[\leadsto \color{blue}{\tan \left(\frac{x}{2}\right)} \cdot \frac{\sin x}{{x}^{2}} \]

   6. lower-tan.f64 N/A

      \[\leadsto \color{blue}{\tan \left(\frac{x}{2}\right)} \cdot \frac{\sin x}{{x}^{2}} \]

   7. lower-/.f64 N/A

      \[\leadsto \tan \color{blue}{\left(\frac{x}{2}\right)} \cdot \frac{\sin x}{{x}^{2}} \]

   8. unpow2 N/A

      \[\leadsto \tan \left(\frac{x}{2}\right) \cdot \frac{\sin x}{\color{blue}{x \cdot x}} \]

   9. associate-/r* N/A

      \[\leadsto \tan \left(\frac{x}{2}\right) \cdot \color{blue}{\frac{\frac{\sin x}{x}}{x}} \]

   10. lower-/.f64 N/A

       \[\leadsto \tan \left(\frac{x}{2}\right) \cdot \color{blue}{\frac{\frac{\sin x}{x}}{x}} \]

   11. lower-/.f64 N/A

       \[\leadsto \tan \left(\frac{x}{2}\right) \cdot \frac{\color{blue}{\frac{\sin x}{x}}}{x} \]

   12. lower-sin.f64 99.7

       \[\leadsto \tan \left(\frac{x}{2}\right) \cdot \frac{\frac{\color{blue}{\sin x}}{x}}{x} \]

7. Applied rewrites 99.7%

   \[\leadsto \color{blue}{\tan \left(\frac{x}{2}\right) \cdot \frac{\frac{\sin x}{x}}{x}} \]
8. Add Preprocessing

Alternative 2: 74.0% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq 0.1:\\ \;\;\;\;\mathsf{fma}\left(x \cdot \mathsf{fma}\left(x \cdot x, \left(x \cdot x\right) \cdot -2.48015873015873 \cdot 10^{-5}, \mathsf{fma}\left(0.001388888888888889 \cdot x, x, -0.041666666666666664\right)\right), x, 0.5\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{1 - \cos x}{x}}{x}\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (if (<= x 0.1)
   (fma
    (*
     x
     (fma
      (* x x)
      (* (* x x) -2.48015873015873e-5)
      (fma (* 0.001388888888888889 x) x -0.041666666666666664)))
    x
    0.5)
   (/ (/ (- 1.0 (cos x)) x) x)))

C

double code(double x) {
	double tmp;
	if (x <= 0.1) {
		tmp = fma((x * fma((x * x), ((x * x) * -2.48015873015873e-5), fma((0.001388888888888889 * x), x, -0.041666666666666664))), x, 0.5);
	} else {
		tmp = ((1.0 - cos(x)) / x) / x;
	}
	return tmp;
}

Julia

function code(x)
	tmp = 0.0
	if (x <= 0.1)
		tmp = fma(Float64(x * fma(Float64(x * x), Float64(Float64(x * x) * -2.48015873015873e-5), fma(Float64(0.001388888888888889 * x), x, -0.041666666666666664))), x, 0.5);
	else
		tmp = Float64(Float64(Float64(1.0 - cos(x)) / x) / x);
	end
	return tmp
end

Wolfram

code[x_] := If[LessEqual[x, 0.1], N[(N[(x * N[(N[(x * x), $MachinePrecision] * N[(N[(x * x), $MachinePrecision] * -2.48015873015873e-5), $MachinePrecision] + N[(N[(0.001388888888888889 * x), $MachinePrecision] * x + -0.041666666666666664), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * x + 0.5), $MachinePrecision], N[(N[(N[(1.0 - N[Cos[x], $MachinePrecision]), $MachinePrecision] / x), $MachinePrecision] / x), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < 0.10000000000000001

   1. Initial program 34.5%

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

   3. Taylor expanded in x around 0

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

   5. Applied rewrites 67.7%

      \[\leadsto \color{blue}{\mathsf{fma}\left(x \cdot \mathsf{fma}\left({x}^{4}, -2.48015873015873 \cdot 10^{-5}, \mathsf{fma}\left(0.001388888888888889 \cdot x, x, -0.041666666666666664\right)\right), x, 0.5\right)} \]
   6. Step-by-step derivation

   7. Applied rewrites 67.7%

      \[\leadsto \mathsf{fma}\left(x \cdot \mathsf{fma}\left(x \cdot x, \left(x \cdot x\right) \cdot -2.48015873015873 \cdot 10^{-5}, \mathsf{fma}\left(0.001388888888888889 \cdot x, x, -0.041666666666666664\right)\right), x, 0.5\right) \]

   if 0.10000000000000001 < x

   1. Initial program 97.1%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-/r* N/A

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

      4. lower-/.f64 N/A

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

      5. lower-/.f64 98.6

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

   4. Applied rewrites 98.6%

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

Alternative 3: 73.7% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq 0.102:\\ \;\;\;\;\mathsf{fma}\left(x \cdot \mathsf{fma}\left(x \cdot x, \left(x \cdot x\right) \cdot -2.48015873015873 \cdot 10^{-5}, \mathsf{fma}\left(0.001388888888888889 \cdot x, x, -0.041666666666666664\right)\right), x, 0.5\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{1 - \cos x}{x \cdot x}\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (if (<= x 0.102)
   (fma
    (*
     x
     (fma
      (* x x)
      (* (* x x) -2.48015873015873e-5)
      (fma (* 0.001388888888888889 x) x -0.041666666666666664)))
    x
    0.5)
   (/ (- 1.0 (cos x)) (* x x))))

C

double code(double x) {
	double tmp;
	if (x <= 0.102) {
		tmp = fma((x * fma((x * x), ((x * x) * -2.48015873015873e-5), fma((0.001388888888888889 * x), x, -0.041666666666666664))), x, 0.5);
	} else {
		tmp = (1.0 - cos(x)) / (x * x);
	}
	return tmp;
}

Julia

function code(x)
	tmp = 0.0
	if (x <= 0.102)
		tmp = fma(Float64(x * fma(Float64(x * x), Float64(Float64(x * x) * -2.48015873015873e-5), fma(Float64(0.001388888888888889 * x), x, -0.041666666666666664))), x, 0.5);
	else
		tmp = Float64(Float64(1.0 - cos(x)) / Float64(x * x));
	end
	return tmp
end

Wolfram

code[x_] := If[LessEqual[x, 0.102], N[(N[(x * N[(N[(x * x), $MachinePrecision] * N[(N[(x * x), $MachinePrecision] * -2.48015873015873e-5), $MachinePrecision] + N[(N[(0.001388888888888889 * x), $MachinePrecision] * x + -0.041666666666666664), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * x + 0.5), $MachinePrecision], N[(N[(1.0 - N[Cos[x], $MachinePrecision]), $MachinePrecision] / N[(x * x), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < 0.101999999999999993

   1. Initial program 34.5%

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

   3. Taylor expanded in x around 0

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

   5. Applied rewrites 67.7%

      \[\leadsto \color{blue}{\mathsf{fma}\left(x \cdot \mathsf{fma}\left({x}^{4}, -2.48015873015873 \cdot 10^{-5}, \mathsf{fma}\left(0.001388888888888889 \cdot x, x, -0.041666666666666664\right)\right), x, 0.5\right)} \]
   6. Step-by-step derivation

   7. Applied rewrites 67.7%

      \[\leadsto \mathsf{fma}\left(x \cdot \mathsf{fma}\left(x \cdot x, \left(x \cdot x\right) \cdot -2.48015873015873 \cdot 10^{-5}, \mathsf{fma}\left(0.001388888888888889 \cdot x, x, -0.041666666666666664\right)\right), x, 0.5\right) \]

   if 0.101999999999999993 < x

   1. Initial program 97.1%

      \[\frac{1 - \cos x}{x \cdot x} \]
   2. Add Preprocessing
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 4: 63.3% accurate, 4.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq 6 \cdot 10^{+38}:\\ \;\;\;\;\mathsf{fma}\left(x \cdot x, \mathsf{fma}\left(0.001388888888888889 \cdot x, x, -0.041666666666666664\right), 0.5\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{1 - 1}{x \cdot x}\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (if (<= x 6e+38)
   (fma (* x x) (fma (* 0.001388888888888889 x) x -0.041666666666666664) 0.5)
   (/ (- 1.0 1.0) (* x x))))

C

double code(double x) {
	double tmp;
	if (x <= 6e+38) {
		tmp = fma((x * x), fma((0.001388888888888889 * x), x, -0.041666666666666664), 0.5);
	} else {
		tmp = (1.0 - 1.0) / (x * x);
	}
	return tmp;
}

Julia

function code(x)
	tmp = 0.0
	if (x <= 6e+38)
		tmp = fma(Float64(x * x), fma(Float64(0.001388888888888889 * x), x, -0.041666666666666664), 0.5);
	else
		tmp = Float64(Float64(1.0 - 1.0) / Float64(x * x));
	end
	return tmp
end

Wolfram

code[x_] := If[LessEqual[x, 6e+38], N[(N[(x * x), $MachinePrecision] * N[(N[(0.001388888888888889 * x), $MachinePrecision] * x + -0.041666666666666664), $MachinePrecision] + 0.5), $MachinePrecision], N[(N[(1.0 - 1.0), $MachinePrecision] / N[(x * x), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < 6.0000000000000002e38

   1. Initial program 36.9%

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

   3. Taylor expanded in x around 0

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

   5. Applied rewrites 65.7%

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

   if 6.0000000000000002e38 < x

   1. Initial program 97.4%

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

   3. Taylor expanded in x around 0

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

   5. Applied rewrites 54.6%

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

Alternative 5: 62.9% accurate, 4.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq 3.5:\\ \;\;\;\;\mathsf{fma}\left(x \cdot x, -0.041666666666666664, 0.5\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{1 - 1}{x \cdot x}\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (if (<= x 3.5)
   (fma (* x x) -0.041666666666666664 0.5)
   (/ (- 1.0 1.0) (* x x))))

C

double code(double x) {
	double tmp;
	if (x <= 3.5) {
		tmp = fma((x * x), -0.041666666666666664, 0.5);
	} else {
		tmp = (1.0 - 1.0) / (x * x);
	}
	return tmp;
}

Julia

function code(x)
	tmp = 0.0
	if (x <= 3.5)
		tmp = fma(Float64(x * x), -0.041666666666666664, 0.5);
	else
		tmp = Float64(Float64(1.0 - 1.0) / Float64(x * x));
	end
	return tmp
end

Wolfram

code[x_] := If[LessEqual[x, 3.5], N[(N[(x * x), $MachinePrecision] * -0.041666666666666664 + 0.5), $MachinePrecision], N[(N[(1.0 - 1.0), $MachinePrecision] / N[(x * x), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < 3.5

   1. Initial program 34.5%

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

   3. Taylor expanded in x around 0

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

      1. fp-cancel-sign-sub-inv N/A

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

      2. metadata-eval N/A

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

      3. *-commutative N/A

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

      4. fp-cancel-sub-sign-inv N/A

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

      5. +-commutative N/A

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

      6. distribute-lft-neg-out N/A

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

      7. distribute-rgt-neg-in N/A

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

      8. metadata-eval N/A

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

      9. lower-fma.f64 N/A

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

      10. unpow2 N/A

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

      11. lower-*.f64 67.6

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

   5. Applied rewrites 67.6%

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

   if 3.5 < x

   1. Initial program 97.1%

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

   3. Taylor expanded in x around 0

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

   5. Applied rewrites 48.0%

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

Alternative 6: 51.7% accurate, 120.0× speedup

Math

\[\begin{array}{l} \\ 0.5 \end{array} \]

FPCore

(FPCore (x) :precision binary64 0.5)

C

double code(double x) {
	return 0.5;
}

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 = 0.5d0
end function

Java

public static double code(double x) {
	return 0.5;
}

Python

def code(x):
	return 0.5

Julia

function code(x)
	return 0.5
end

MATLAB

function tmp = code(x)
	tmp = 0.5;
end

Wolfram

code[x_] := 0.5

Derivation

1. Initial program 49.7%

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

3. Taylor expanded in x around 0

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

5. Applied rewrites 52.4%

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

Reproduce

herbie shell --seed 2024359 
(FPCore (x)
  :name "cos2 (problem 3.4.1)"
  :precision binary64
  (/ (- 1.0 (cos x)) (* x x)))