cos2 (problem 3.4.1)

Percentage Accurate: 50.6% → 99.6%

Time: 8.6s

Alternatives: 7

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

real(8) function code(x)
    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.6% 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

real(8) function code(x)
    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.6% accurate, 0.9× speedup

Math

\[\begin{array}{l} x_m = \left|x\right| \\ \begin{array}{l} \mathbf{if}\;x\_m \leq 0.03:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(0.001388888888888889, x\_m \cdot x\_m, -0.041666666666666664\right), x\_m \cdot x\_m, 0.5\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{1 - \cos x\_m}{x\_m}}{x\_m}\\ \end{array} \end{array} \]

FPCore

x_m = (fabs.f64 x)
(FPCore (x_m)
 :precision binary64
 (if (<= x_m 0.03)
   (fma
    (fma 0.001388888888888889 (* x_m x_m) -0.041666666666666664)
    (* x_m x_m)
    0.5)
   (/ (/ (- 1.0 (cos x_m)) x_m) x_m)))

C

x_m = fabs(x);
double code(double x_m) {
	double tmp;
	if (x_m <= 0.03) {
		tmp = fma(fma(0.001388888888888889, (x_m * x_m), -0.041666666666666664), (x_m * x_m), 0.5);
	} else {
		tmp = ((1.0 - cos(x_m)) / x_m) / x_m;
	}
	return tmp;
}

Julia

x_m = abs(x)
function code(x_m)
	tmp = 0.0
	if (x_m <= 0.03)
		tmp = fma(fma(0.001388888888888889, Float64(x_m * x_m), -0.041666666666666664), Float64(x_m * x_m), 0.5);
	else
		tmp = Float64(Float64(Float64(1.0 - cos(x_m)) / x_m) / x_m);
	end
	return tmp
end

Wolfram

x_m = N[Abs[x], $MachinePrecision]
code[x$95$m_] := If[LessEqual[x$95$m, 0.03], N[(N[(0.001388888888888889 * N[(x$95$m * x$95$m), $MachinePrecision] + -0.041666666666666664), $MachinePrecision] * N[(x$95$m * x$95$m), $MachinePrecision] + 0.5), $MachinePrecision], N[(N[(N[(1.0 - N[Cos[x$95$m], $MachinePrecision]), $MachinePrecision] / x$95$m), $MachinePrecision] / x$95$m), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < 0.029999999999999999

   1. Initial program 31.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)} \]
   4. Step-by-step derivation

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. sub-neg N/A

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

      5. metadata-eval N/A

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

      6. lower-fma.f64 N/A

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

      7. unpow2 N/A

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

      8. lower-*.f64 N/A

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

      9. unpow2 N/A

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

      10. lower-*.f64 70.3

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

   5. Applied rewrites 70.3%

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

   if 0.029999999999999999 < x

   1. Initial program 99.3%

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

   4. Applied rewrites 99.2%

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

Alternative 2: 99.1% accurate, 1.0× speedup

Math

\[\begin{array}{l} x_m = \left|x\right| \\ \begin{array}{l} \mathbf{if}\;x\_m \leq 0.03:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(0.001388888888888889, x\_m \cdot x\_m, -0.041666666666666664\right), x\_m \cdot x\_m, 0.5\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{1 - \cos x\_m}{x\_m \cdot x\_m}\\ \end{array} \end{array} \]

FPCore

x_m = (fabs.f64 x)
(FPCore (x_m)
 :precision binary64
 (if (<= x_m 0.03)
   (fma
    (fma 0.001388888888888889 (* x_m x_m) -0.041666666666666664)
    (* x_m x_m)
    0.5)
   (/ (- 1.0 (cos x_m)) (* x_m x_m))))

C

x_m = fabs(x);
double code(double x_m) {
	double tmp;
	if (x_m <= 0.03) {
		tmp = fma(fma(0.001388888888888889, (x_m * x_m), -0.041666666666666664), (x_m * x_m), 0.5);
	} else {
		tmp = (1.0 - cos(x_m)) / (x_m * x_m);
	}
	return tmp;
}

Julia

x_m = abs(x)
function code(x_m)
	tmp = 0.0
	if (x_m <= 0.03)
		tmp = fma(fma(0.001388888888888889, Float64(x_m * x_m), -0.041666666666666664), Float64(x_m * x_m), 0.5);
	else
		tmp = Float64(Float64(1.0 - cos(x_m)) / Float64(x_m * x_m));
	end
	return tmp
end

Wolfram

x_m = N[Abs[x], $MachinePrecision]
code[x$95$m_] := If[LessEqual[x$95$m, 0.03], N[(N[(0.001388888888888889 * N[(x$95$m * x$95$m), $MachinePrecision] + -0.041666666666666664), $MachinePrecision] * N[(x$95$m * x$95$m), $MachinePrecision] + 0.5), $MachinePrecision], N[(N[(1.0 - N[Cos[x$95$m], $MachinePrecision]), $MachinePrecision] / N[(x$95$m * x$95$m), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < 0.029999999999999999

   1. Initial program 31.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)} \]
   4. Step-by-step derivation

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. sub-neg N/A

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

      5. metadata-eval N/A

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

      6. lower-fma.f64 N/A

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

      7. unpow2 N/A

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

      8. lower-*.f64 N/A

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

      9. unpow2 N/A

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

      10. lower-*.f64 70.3

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

   5. Applied rewrites 70.3%

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

   if 0.029999999999999999 < x

   1. Initial program 99.3%

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

Alternative 3: 78.2% accurate, 4.1× speedup

Math

\[\begin{array}{l} x_m = \left|x\right| \\ \begin{array}{l} \mathbf{if}\;x\_m \leq 4.8:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(0.001388888888888889, x\_m \cdot x\_m, -0.041666666666666664\right), x\_m \cdot x\_m, 0.5\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{0.16666666666666666 \cdot \left(x\_m \cdot x\_m\right)}\\ \end{array} \end{array} \]

FPCore

x_m = (fabs.f64 x)
(FPCore (x_m)
 :precision binary64
 (if (<= x_m 4.8)
   (fma
    (fma 0.001388888888888889 (* x_m x_m) -0.041666666666666664)
    (* x_m x_m)
    0.5)
   (/ 1.0 (* 0.16666666666666666 (* x_m x_m)))))

C

x_m = fabs(x);
double code(double x_m) {
	double tmp;
	if (x_m <= 4.8) {
		tmp = fma(fma(0.001388888888888889, (x_m * x_m), -0.041666666666666664), (x_m * x_m), 0.5);
	} else {
		tmp = 1.0 / (0.16666666666666666 * (x_m * x_m));
	}
	return tmp;
}

Julia

x_m = abs(x)
function code(x_m)
	tmp = 0.0
	if (x_m <= 4.8)
		tmp = fma(fma(0.001388888888888889, Float64(x_m * x_m), -0.041666666666666664), Float64(x_m * x_m), 0.5);
	else
		tmp = Float64(1.0 / Float64(0.16666666666666666 * Float64(x_m * x_m)));
	end
	return tmp
end

Wolfram

x_m = N[Abs[x], $MachinePrecision]
code[x$95$m_] := If[LessEqual[x$95$m, 4.8], N[(N[(0.001388888888888889 * N[(x$95$m * x$95$m), $MachinePrecision] + -0.041666666666666664), $MachinePrecision] * N[(x$95$m * x$95$m), $MachinePrecision] + 0.5), $MachinePrecision], N[(1.0 / N[(0.16666666666666666 * N[(x$95$m * x$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < 4.79999999999999982

   1. Initial program 31.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)} \]
   4. Step-by-step derivation

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. sub-neg N/A

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

      5. metadata-eval N/A

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

      6. lower-fma.f64 N/A

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

      7. unpow2 N/A

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

      8. lower-*.f64 N/A

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

      9. unpow2 N/A

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

      10. lower-*.f64 70.3

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

   5. Applied rewrites 70.3%

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

   if 4.79999999999999982 < x

   1. Initial program 99.3%

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

   4. Applied rewrites 99.3%

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

   5. Taylor expanded in x around 0

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

      1. +-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. unpow2 N/A

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

      4. lower-*.f64 55.8

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

   7. Applied rewrites 55.8%

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

   8. Taylor expanded in x around inf

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

   10. Applied rewrites 55.8%

       \[\leadsto \frac{1}{0.16666666666666666 \cdot \color{blue}{\left(x \cdot x\right)}} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 4: 78.1% accurate, 4.3× speedup

Math

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

FPCore

x_m = (fabs.f64 x)
(FPCore (x_m)
 :precision binary64
 (if (<= x_m 3.3)
   (fma -0.041666666666666664 (* x_m x_m) 0.5)
   (/ 1.0 (* 0.16666666666666666 (* x_m x_m)))))

C

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

Julia

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

Wolfram

x_m = N[Abs[x], $MachinePrecision]
code[x$95$m_] := If[LessEqual[x$95$m, 3.3], N[(-0.041666666666666664 * N[(x$95$m * x$95$m), $MachinePrecision] + 0.5), $MachinePrecision], N[(1.0 / N[(0.16666666666666666 * N[(x$95$m * x$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < 3.2999999999999998

   1. Initial program 31.9%

      \[\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. +-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. unpow2 N/A

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

      4. lower-*.f64 69.9

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

   5. Applied rewrites 69.9%

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

   if 3.2999999999999998 < x

   1. Initial program 99.3%

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

   4. Applied rewrites 99.3%

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

   5. Taylor expanded in x around 0

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

      1. +-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. unpow2 N/A

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

      4. lower-*.f64 55.8

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

   7. Applied rewrites 55.8%

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

   8. Taylor expanded in x around inf

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

   10. Applied rewrites 55.8%

       \[\leadsto \frac{1}{0.16666666666666666 \cdot \color{blue}{\left(x \cdot x\right)}} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 5: 75.4% accurate, 4.6× speedup

Math

\[\begin{array}{l} x_m = \left|x\right| \\ \begin{array}{l} \mathbf{if}\;x\_m \leq 1.3 \cdot 10^{+77}:\\ \;\;\;\;0.5\\ \mathbf{else}:\\ \;\;\;\;\frac{1 - 1}{x\_m \cdot x\_m}\\ \end{array} \end{array} \]

FPCore

x_m = (fabs.f64 x)
(FPCore (x_m)
 :precision binary64
 (if (<= x_m 1.3e+77) 0.5 (/ (- 1.0 1.0) (* x_m x_m))))

C

x_m = fabs(x);
double code(double x_m) {
	double tmp;
	if (x_m <= 1.3e+77) {
		tmp = 0.5;
	} else {
		tmp = (1.0 - 1.0) / (x_m * x_m);
	}
	return tmp;
}

Fortran

x_m = abs(x)
real(8) function code(x_m)
    real(8), intent (in) :: x_m
    real(8) :: tmp
    if (x_m <= 1.3d+77) then
        tmp = 0.5d0
    else
        tmp = (1.0d0 - 1.0d0) / (x_m * x_m)
    end if
    code = tmp
end function

Java

x_m = Math.abs(x);
public static double code(double x_m) {
	double tmp;
	if (x_m <= 1.3e+77) {
		tmp = 0.5;
	} else {
		tmp = (1.0 - 1.0) / (x_m * x_m);
	}
	return tmp;
}

Python

x_m = math.fabs(x)
def code(x_m):
	tmp = 0
	if x_m <= 1.3e+77:
		tmp = 0.5
	else:
		tmp = (1.0 - 1.0) / (x_m * x_m)
	return tmp

Julia

x_m = abs(x)
function code(x_m)
	tmp = 0.0
	if (x_m <= 1.3e+77)
		tmp = 0.5;
	else
		tmp = Float64(Float64(1.0 - 1.0) / Float64(x_m * x_m));
	end
	return tmp
end

MATLAB

x_m = abs(x);
function tmp_2 = code(x_m)
	tmp = 0.0;
	if (x_m <= 1.3e+77)
		tmp = 0.5;
	else
		tmp = (1.0 - 1.0) / (x_m * x_m);
	end
	tmp_2 = tmp;
end

Wolfram

x_m = N[Abs[x], $MachinePrecision]
code[x$95$m_] := If[LessEqual[x$95$m, 1.3e+77], 0.5, N[(N[(1.0 - 1.0), $MachinePrecision] / N[(x$95$m * x$95$m), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < 1.3000000000000001e77

   1. Initial program 37.1%

      \[\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 65.5%

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

   if 1.3000000000000001e77 < x

   1. Initial program 99.6%

      \[\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 70.5%

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

Alternative 6: 78.1% accurate, 5.2× speedup

Math

\[\begin{array}{l} x_m = \left|x\right| \\ \frac{1}{\mathsf{fma}\left(0.16666666666666666, x\_m \cdot x\_m, 2\right)} \end{array} \]

FPCore

x_m = (fabs.f64 x)
(FPCore (x_m)
 :precision binary64
 (/ 1.0 (fma 0.16666666666666666 (* x_m x_m) 2.0)))

C

x_m = fabs(x);
double code(double x_m) {
	return 1.0 / fma(0.16666666666666666, (x_m * x_m), 2.0);
}

Julia

x_m = abs(x)
function code(x_m)
	return Float64(1.0 / fma(0.16666666666666666, Float64(x_m * x_m), 2.0))
end

Wolfram

x_m = N[Abs[x], $MachinePrecision]
code[x$95$m_] := N[(1.0 / N[(0.16666666666666666 * N[(x$95$m * x$95$m), $MachinePrecision] + 2.0), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 46.4%

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

4. Applied rewrites 47.2%

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

5. Taylor expanded in x around 0

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

   1. +-commutative N/A

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

   2. lower-fma.f64 N/A

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

   3. unpow2 N/A

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

   4. lower-*.f64 79.3

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

7. Applied rewrites 79.3%

   \[\leadsto \frac{1}{\color{blue}{\mathsf{fma}\left(0.16666666666666666, x \cdot x, 2\right)}} \]
8. Add Preprocessing

Alternative 7: 51.8% accurate, 120.0× speedup

Math

\[\begin{array}{l} x_m = \left|x\right| \\ 0.5 \end{array} \]

FPCore

x_m = (fabs.f64 x)
(FPCore (x_m) :precision binary64 0.5)

C

x_m = fabs(x);
double code(double x_m) {
	return 0.5;
}

Fortran

x_m = abs(x)
real(8) function code(x_m)
    real(8), intent (in) :: x_m
    code = 0.5d0
end function

Java

x_m = Math.abs(x);
public static double code(double x_m) {
	return 0.5;
}

Python

x_m = math.fabs(x)
def code(x_m):
	return 0.5

Julia

x_m = abs(x)
function code(x_m)
	return 0.5
end

MATLAB

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

Wolfram

x_m = N[Abs[x], $MachinePrecision]
code[x$95$m_] := 0.5

Derivation

1. Initial program 46.4%

   \[\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 56.3%

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

Reproduce

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