cos2 (problem 3.4.1)

Percentage Accurate: 51.5% → 99.6%

Time: 8.7s

Alternatives: 6

Speedup: 17.8×

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: 51.5% 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, 1.0× speedup

Math

\[\begin{array}{l} x_m = \left|x\right| \\ \begin{array}{l} \mathbf{if}\;x\_m \leq 0.033:\\ \;\;\;\;0.5 + \left(x\_m \cdot x\_m\right) \cdot \left(\left(x\_m \cdot x\_m\right) \cdot 0.001388888888888889 - 0.041666666666666664\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.033)
   (+
    0.5
    (*
     (* x_m x_m)
     (- (* (* x_m x_m) 0.001388888888888889) 0.041666666666666664)))
   (/ (/ (- 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.033) {
		tmp = 0.5 + ((x_m * x_m) * (((x_m * x_m) * 0.001388888888888889) - 0.041666666666666664));
	} else {
		tmp = ((1.0 - cos(x_m)) / 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 <= 0.033d0) then
        tmp = 0.5d0 + ((x_m * x_m) * (((x_m * x_m) * 0.001388888888888889d0) - 0.041666666666666664d0))
    else
        tmp = ((1.0d0 - cos(x_m)) / 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 <= 0.033) {
		tmp = 0.5 + ((x_m * x_m) * (((x_m * x_m) * 0.001388888888888889) - 0.041666666666666664));
	} else {
		tmp = ((1.0 - Math.cos(x_m)) / x_m) / x_m;
	}
	return tmp;
}

Python

x_m = math.fabs(x)
def code(x_m):
	tmp = 0
	if x_m <= 0.033:
		tmp = 0.5 + ((x_m * x_m) * (((x_m * x_m) * 0.001388888888888889) - 0.041666666666666664))
	else:
		tmp = ((1.0 - math.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.033)
		tmp = Float64(0.5 + Float64(Float64(x_m * x_m) * Float64(Float64(Float64(x_m * x_m) * 0.001388888888888889) - 0.041666666666666664)));
	else
		tmp = Float64(Float64(Float64(1.0 - cos(x_m)) / 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 <= 0.033)
		tmp = 0.5 + ((x_m * x_m) * (((x_m * x_m) * 0.001388888888888889) - 0.041666666666666664));
	else
		tmp = ((1.0 - cos(x_m)) / 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, 0.033], N[(0.5 + N[(N[(x$95$m * x$95$m), $MachinePrecision] * N[(N[(N[(x$95$m * x$95$m), $MachinePrecision] * 0.001388888888888889), $MachinePrecision] - 0.041666666666666664), $MachinePrecision]), $MachinePrecision]), $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.033000000000000002

   1. Initial program 27.4%

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

   3. Taylor expanded in x around 0 74.7%

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

      1. unpow2 74.7%

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

   5. Applied egg-rr 74.7%

      \[\leadsto 0.5 + {x}^{2} \cdot \left(0.001388888888888889 \cdot \color{blue}{\left(x \cdot x\right)} - 0.041666666666666664\right) \]
   6. Step-by-step derivation

      1. unpow2 74.7%

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

   7. Applied egg-rr 74.7%

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

   if 0.033000000000000002 < x

   1. Initial program 99.2%

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

      1. associate-/r* 99.4%

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

      2. clear-num 99.0%

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

      3. inv-pow 99.0%

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

   4. Applied egg-rr 99.0%

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

      1. unpow-1 99.0%

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

      2. clear-num 99.4%

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

   6. Applied egg-rr 99.4%

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

4. Final simplification 80.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq 0.033:\\ \;\;\;\;0.5 + \left(x \cdot x\right) \cdot \left(\left(x \cdot x\right) \cdot 0.001388888888888889 - 0.041666666666666664\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{1 - \cos x}{x}}{x}\\ \end{array} \]
5. Add Preprocessing

Alternative 2: 99.2% accurate, 1.0× speedup

Math

\[\begin{array}{l} x_m = \left|x\right| \\ \begin{array}{l} \mathbf{if}\;x\_m \leq 0.033:\\ \;\;\;\;0.5 + \left(x\_m \cdot x\_m\right) \cdot \left(\left(x\_m \cdot x\_m\right) \cdot 0.001388888888888889 - 0.041666666666666664\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.033)
   (+
    0.5
    (*
     (* x_m x_m)
     (- (* (* x_m x_m) 0.001388888888888889) 0.041666666666666664)))
   (/ (- 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.033) {
		tmp = 0.5 + ((x_m * x_m) * (((x_m * x_m) * 0.001388888888888889) - 0.041666666666666664));
	} else {
		tmp = (1.0 - cos(x_m)) / (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 <= 0.033d0) then
        tmp = 0.5d0 + ((x_m * x_m) * (((x_m * x_m) * 0.001388888888888889d0) - 0.041666666666666664d0))
    else
        tmp = (1.0d0 - cos(x_m)) / (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 <= 0.033) {
		tmp = 0.5 + ((x_m * x_m) * (((x_m * x_m) * 0.001388888888888889) - 0.041666666666666664));
	} else {
		tmp = (1.0 - Math.cos(x_m)) / (x_m * x_m);
	}
	return tmp;
}

Python

x_m = math.fabs(x)
def code(x_m):
	tmp = 0
	if x_m <= 0.033:
		tmp = 0.5 + ((x_m * x_m) * (((x_m * x_m) * 0.001388888888888889) - 0.041666666666666664))
	else:
		tmp = (1.0 - math.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.033)
		tmp = Float64(0.5 + Float64(Float64(x_m * x_m) * Float64(Float64(Float64(x_m * x_m) * 0.001388888888888889) - 0.041666666666666664)));
	else
		tmp = Float64(Float64(1.0 - cos(x_m)) / 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 <= 0.033)
		tmp = 0.5 + ((x_m * x_m) * (((x_m * x_m) * 0.001388888888888889) - 0.041666666666666664));
	else
		tmp = (1.0 - cos(x_m)) / (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, 0.033], N[(0.5 + N[(N[(x$95$m * x$95$m), $MachinePrecision] * N[(N[(N[(x$95$m * x$95$m), $MachinePrecision] * 0.001388888888888889), $MachinePrecision] - 0.041666666666666664), $MachinePrecision]), $MachinePrecision]), $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.033000000000000002

   1. Initial program 27.4%

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

   3. Taylor expanded in x around 0 74.7%

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

      1. unpow2 74.7%

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

   5. Applied egg-rr 74.7%

      \[\leadsto 0.5 + {x}^{2} \cdot \left(0.001388888888888889 \cdot \color{blue}{\left(x \cdot x\right)} - 0.041666666666666664\right) \]
   6. Step-by-step derivation

      1. unpow2 74.7%

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

   7. Applied egg-rr 74.7%

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

   if 0.033000000000000002 < x

   1. Initial program 99.2%

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

4. Final simplification 80.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq 0.033:\\ \;\;\;\;0.5 + \left(x \cdot x\right) \cdot \left(\left(x \cdot x\right) \cdot 0.001388888888888889 - 0.041666666666666664\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{1 - \cos x}{x \cdot x}\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 76.1% accurate, 5.9× speedup

Math

\[\begin{array}{l} x_m = \left|x\right| \\ \begin{array}{l} \mathbf{if}\;x\_m \leq 4.2 \cdot 10^{+38}:\\ \;\;\;\;0.5 + \left(x\_m \cdot x\_m\right) \cdot \left(\left(x\_m \cdot x\_m\right) \cdot 0.001388888888888889 - 0.041666666666666664\right)\\ \mathbf{else}:\\ \;\;\;\;0\\ \end{array} \end{array} \]

FPCore

x_m = (fabs.f64 x)
(FPCore (x_m)
 :precision binary64
 (if (<= x_m 4.2e+38)
   (+
    0.5
    (*
     (* x_m x_m)
     (- (* (* x_m x_m) 0.001388888888888889) 0.041666666666666664)))
   0.0))

C

x_m = fabs(x);
double code(double x_m) {
	double tmp;
	if (x_m <= 4.2e+38) {
		tmp = 0.5 + ((x_m * x_m) * (((x_m * x_m) * 0.001388888888888889) - 0.041666666666666664));
	} else {
		tmp = 0.0;
	}
	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 <= 4.2d+38) then
        tmp = 0.5d0 + ((x_m * x_m) * (((x_m * x_m) * 0.001388888888888889d0) - 0.041666666666666664d0))
    else
        tmp = 0.0d0
    end if
    code = tmp
end function

Java

x_m = Math.abs(x);
public static double code(double x_m) {
	double tmp;
	if (x_m <= 4.2e+38) {
		tmp = 0.5 + ((x_m * x_m) * (((x_m * x_m) * 0.001388888888888889) - 0.041666666666666664));
	} else {
		tmp = 0.0;
	}
	return tmp;
}

Python

x_m = math.fabs(x)
def code(x_m):
	tmp = 0
	if x_m <= 4.2e+38:
		tmp = 0.5 + ((x_m * x_m) * (((x_m * x_m) * 0.001388888888888889) - 0.041666666666666664))
	else:
		tmp = 0.0
	return tmp

Julia

x_m = abs(x)
function code(x_m)
	tmp = 0.0
	if (x_m <= 4.2e+38)
		tmp = Float64(0.5 + Float64(Float64(x_m * x_m) * Float64(Float64(Float64(x_m * x_m) * 0.001388888888888889) - 0.041666666666666664)));
	else
		tmp = 0.0;
	end
	return tmp
end

MATLAB

x_m = abs(x);
function tmp_2 = code(x_m)
	tmp = 0.0;
	if (x_m <= 4.2e+38)
		tmp = 0.5 + ((x_m * x_m) * (((x_m * x_m) * 0.001388888888888889) - 0.041666666666666664));
	else
		tmp = 0.0;
	end
	tmp_2 = tmp;
end

Wolfram

x_m = N[Abs[x], $MachinePrecision]
code[x$95$m_] := If[LessEqual[x$95$m, 4.2e+38], N[(0.5 + N[(N[(x$95$m * x$95$m), $MachinePrecision] * N[(N[(N[(x$95$m * x$95$m), $MachinePrecision] * 0.001388888888888889), $MachinePrecision] - 0.041666666666666664), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.0]

Derivation

1. Split input into 2 regimes

2. if x < 4.2e38

   1. Initial program 30.5%

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

   3. Taylor expanded in x around 0 71.7%

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

      1. unpow2 71.7%

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

   5. Applied egg-rr 71.7%

      \[\leadsto 0.5 + {x}^{2} \cdot \left(0.001388888888888889 \cdot \color{blue}{\left(x \cdot x\right)} - 0.041666666666666664\right) \]
   6. Step-by-step derivation

      1. unpow2 71.7%

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

   7. Applied egg-rr 71.7%

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

   if 4.2e38 < x

   1. Initial program 99.2%

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

   3. Taylor expanded in x around 0 52.4%

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

   4. Taylor expanded in x around 0 52.4%

      \[\leadsto \color{blue}{0} \]
3. Recombined 2 regimes into one program.

4. Final simplification 67.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq 4.2 \cdot 10^{+38}:\\ \;\;\;\;0.5 + \left(x \cdot x\right) \cdot \left(\left(x \cdot x\right) \cdot 0.001388888888888889 - 0.041666666666666664\right)\\ \mathbf{else}:\\ \;\;\;\;0\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 76.0% accurate, 10.7× speedup

Math

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

FPCore

x_m = (fabs.f64 x)
(FPCore (x_m) :precision binary64 (if (<= x_m 8e+76) 0.5 (/ 0.0 (* x_m x_m))))

C

x_m = fabs(x);
double code(double x_m) {
	double tmp;
	if (x_m <= 8e+76) {
		tmp = 0.5;
	} else {
		tmp = 0.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 <= 8d+76) then
        tmp = 0.5d0
    else
        tmp = 0.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 <= 8e+76) {
		tmp = 0.5;
	} else {
		tmp = 0.0 / (x_m * x_m);
	}
	return tmp;
}

Python

x_m = math.fabs(x)
def code(x_m):
	tmp = 0
	if x_m <= 8e+76:
		tmp = 0.5
	else:
		tmp = 0.0 / (x_m * x_m)
	return tmp

Julia

x_m = abs(x)
function code(x_m)
	tmp = 0.0
	if (x_m <= 8e+76)
		tmp = 0.5;
	else
		tmp = Float64(0.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 <= 8e+76)
		tmp = 0.5;
	else
		tmp = 0.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, 8e+76], 0.5, N[(0.0 / N[(x$95$m * x$95$m), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < 8.0000000000000004e76

   1. Initial program 33.4%

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

   3. Taylor expanded in x around 0 69.1%

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

   if 8.0000000000000004e76 < x

   1. Initial program 99.2%

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

   3. Taylor expanded in x around 0 63.0%

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

4. Final simplification 68.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq 8 \cdot 10^{+76}:\\ \;\;\;\;0.5\\ \mathbf{else}:\\ \;\;\;\;\frac{0}{x \cdot x}\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 76.0% accurate, 17.8× speedup

Math

\[\begin{array}{l} x_m = \left|x\right| \\ \begin{array}{l} \mathbf{if}\;x\_m \leq 8 \cdot 10^{+76}:\\ \;\;\;\;0.5\\ \mathbf{else}:\\ \;\;\;\;0\\ \end{array} \end{array} \]

FPCore

x_m = (fabs.f64 x)
(FPCore (x_m) :precision binary64 (if (<= x_m 8e+76) 0.5 0.0))

C

x_m = fabs(x);
double code(double x_m) {
	double tmp;
	if (x_m <= 8e+76) {
		tmp = 0.5;
	} else {
		tmp = 0.0;
	}
	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 <= 8d+76) then
        tmp = 0.5d0
    else
        tmp = 0.0d0
    end if
    code = tmp
end function

Java

x_m = Math.abs(x);
public static double code(double x_m) {
	double tmp;
	if (x_m <= 8e+76) {
		tmp = 0.5;
	} else {
		tmp = 0.0;
	}
	return tmp;
}

Python

x_m = math.fabs(x)
def code(x_m):
	tmp = 0
	if x_m <= 8e+76:
		tmp = 0.5
	else:
		tmp = 0.0
	return tmp

Julia

x_m = abs(x)
function code(x_m)
	tmp = 0.0
	if (x_m <= 8e+76)
		tmp = 0.5;
	else
		tmp = 0.0;
	end
	return tmp
end

MATLAB

x_m = abs(x);
function tmp_2 = code(x_m)
	tmp = 0.0;
	if (x_m <= 8e+76)
		tmp = 0.5;
	else
		tmp = 0.0;
	end
	tmp_2 = tmp;
end

Wolfram

x_m = N[Abs[x], $MachinePrecision]
code[x$95$m_] := If[LessEqual[x$95$m, 8e+76], 0.5, 0.0]

Derivation

1. Split input into 2 regimes

2. if x < 8.0000000000000004e76

   1. Initial program 33.4%

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

   3. Taylor expanded in x around 0 69.1%

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

   if 8.0000000000000004e76 < x

   1. Initial program 99.2%

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

   3. Taylor expanded in x around 0 63.0%

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

   4. Taylor expanded in x around 0 63.0%

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

Alternative 6: 28.3% accurate, 107.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 44.0%

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

3. Taylor expanded in x around 0 21.2%

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

4. Taylor expanded in x around 0 22.0%

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

Reproduce

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