Linear.Quaternion:$ccos from linear-1.19.1.3

Percentage Accurate: 100.0% → 100.0%

Time: 8.2s

Alternatives: 9

Speedup: 1.0×

• 49.8% of points produce a very large (infinite) output. You may want to add a precondition.

Specification

Math

\[\begin{array}{l} \\ \sin x \cdot \frac{\sinh y}{y} \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (* (sin x) (/ (sinh y) y)))

C

double code(double x, double y) {
	return sin(x) * (sinh(y) / y);
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = sin(x) * (sinh(y) / y)
end function

Java

public static double code(double x, double y) {
	return Math.sin(x) * (Math.sinh(y) / y);
}

Python

def code(x, y):
	return math.sin(x) * (math.sinh(y) / y)

Julia

function code(x, y)
	return Float64(sin(x) * Float64(sinh(y) / y))
end

MATLAB

function tmp = code(x, y)
	tmp = sin(x) * (sinh(y) / y);
end

Wolfram

code[x_, y_] := N[(N[Sin[x], $MachinePrecision] * N[(N[Sinh[y], $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision]

Initial Program: 100.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \sin x \cdot \frac{\sinh y}{y} \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (* (sin x) (/ (sinh y) y)))

C

double code(double x, double y) {
	return sin(x) * (sinh(y) / y);
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = sin(x) * (sinh(y) / y)
end function

Java

public static double code(double x, double y) {
	return Math.sin(x) * (Math.sinh(y) / y);
}

Python

def code(x, y):
	return math.sin(x) * (math.sinh(y) / y)

Julia

function code(x, y)
	return Float64(sin(x) * Float64(sinh(y) / y))
end

MATLAB

function tmp = code(x, y)
	tmp = sin(x) * (sinh(y) / y);
end

Wolfram

code[x_, y_] := N[(N[Sin[x], $MachinePrecision] * N[(N[Sinh[y], $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision]

Alternative 1: 100.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \sin x \cdot \frac{\sinh y}{y} \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (* (sin x) (/ (sinh y) y)))

C

double code(double x, double y) {
	return sin(x) * (sinh(y) / y);
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = sin(x) * (sinh(y) / y)
end function

Java

public static double code(double x, double y) {
	return Math.sin(x) * (Math.sinh(y) / y);
}

Python

def code(x, y):
	return math.sin(x) * (math.sinh(y) / y)

Julia

function code(x, y)
	return Float64(sin(x) * Float64(sinh(y) / y))
end

MATLAB

function tmp = code(x, y)
	tmp = sin(x) * (sinh(y) / y);
end

Wolfram

code[x_, y_] := N[(N[Sin[x], $MachinePrecision] * N[(N[Sinh[y], $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 100.0%

   \[\sin x \cdot \frac{\sinh y}{y} \]
2. Add Preprocessing
3. Add Preprocessing

Alternative 2: 86.9% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{\sinh y}{y}\\ \mathbf{if}\;t\_0 \leq 2:\\ \;\;\;\;\sin x\\ \mathbf{else}:\\ \;\;\;\;x \cdot t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (let* ((t_0 (/ (sinh y) y))) (if (<= t_0 2.0) (sin x) (* x t_0))))

C

double code(double x, double y) {
	double t_0 = sinh(y) / y;
	double tmp;
	if (t_0 <= 2.0) {
		tmp = sin(x);
	} else {
		tmp = x * t_0;
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: t_0
    real(8) :: tmp
    t_0 = sinh(y) / y
    if (t_0 <= 2.0d0) then
        tmp = sin(x)
    else
        tmp = x * t_0
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double t_0 = Math.sinh(y) / y;
	double tmp;
	if (t_0 <= 2.0) {
		tmp = Math.sin(x);
	} else {
		tmp = x * t_0;
	}
	return tmp;
}

Python

def code(x, y):
	t_0 = math.sinh(y) / y
	tmp = 0
	if t_0 <= 2.0:
		tmp = math.sin(x)
	else:
		tmp = x * t_0
	return tmp

Julia

function code(x, y)
	t_0 = Float64(sinh(y) / y)
	tmp = 0.0
	if (t_0 <= 2.0)
		tmp = sin(x);
	else
		tmp = Float64(x * t_0);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	t_0 = sinh(y) / y;
	tmp = 0.0;
	if (t_0 <= 2.0)
		tmp = sin(x);
	else
		tmp = x * t_0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := Block[{t$95$0 = N[(N[Sinh[y], $MachinePrecision] / y), $MachinePrecision]}, If[LessEqual[t$95$0, 2.0], N[Sin[x], $MachinePrecision], N[(x * t$95$0), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (sinh.f64 y) y) < 2

   1. Initial program 100.0%

      \[\sin x \cdot \frac{\sinh y}{y} \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0 99.9%

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

   if 2 < (/.f64 (sinh.f64 y) y)

   1. Initial program 100.0%

      \[\sin x \cdot \frac{\sinh y}{y} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0 80.1%

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

Alternative 3: 84.1% accurate, 1.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq 0.015 \lor \neg \left(y \leq 1.35 \cdot 10^{+154}\right):\\ \;\;\;\;\sin x \cdot \left(1 + 0.16666666666666666 \cdot \left(y \cdot y\right)\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{x \cdot \sinh y}{y}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (or (<= y 0.015) (not (<= y 1.35e+154)))
   (* (sin x) (+ 1.0 (* 0.16666666666666666 (* y y))))
   (/ (* x (sinh y)) y)))

C

double code(double x, double y) {
	double tmp;
	if ((y <= 0.015) || !(y <= 1.35e+154)) {
		tmp = sin(x) * (1.0 + (0.16666666666666666 * (y * y)));
	} else {
		tmp = (x * sinh(y)) / y;
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if ((y <= 0.015d0) .or. (.not. (y <= 1.35d+154))) then
        tmp = sin(x) * (1.0d0 + (0.16666666666666666d0 * (y * y)))
    else
        tmp = (x * sinh(y)) / y
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if ((y <= 0.015) || !(y <= 1.35e+154)) {
		tmp = Math.sin(x) * (1.0 + (0.16666666666666666 * (y * y)));
	} else {
		tmp = (x * Math.sinh(y)) / y;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if (y <= 0.015) or not (y <= 1.35e+154):
		tmp = math.sin(x) * (1.0 + (0.16666666666666666 * (y * y)))
	else:
		tmp = (x * math.sinh(y)) / y
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if ((y <= 0.015) || !(y <= 1.35e+154))
		tmp = Float64(sin(x) * Float64(1.0 + Float64(0.16666666666666666 * Float64(y * y))));
	else
		tmp = Float64(Float64(x * sinh(y)) / y);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if ((y <= 0.015) || ~((y <= 1.35e+154)))
		tmp = sin(x) * (1.0 + (0.16666666666666666 * (y * y)));
	else
		tmp = (x * sinh(y)) / y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[Or[LessEqual[y, 0.015], N[Not[LessEqual[y, 1.35e+154]], $MachinePrecision]], N[(N[Sin[x], $MachinePrecision] * N[(1.0 + N[(0.16666666666666666 * N[(y * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(x * N[Sinh[y], $MachinePrecision]), $MachinePrecision] / y), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < 0.014999999999999999 or 1.35000000000000003e154 < y

   1. Initial program 100.0%

      \[\sin x \cdot \frac{\sinh y}{y} \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0 84.6%

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

      1. unpow2 84.6%

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

   5. Applied egg-rr 84.6%

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

   if 0.014999999999999999 < y < 1.35000000000000003e154

   1. Initial program 100.0%

      \[\sin x \cdot \frac{\sinh y}{y} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0 92.3%

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

      1. associate-*r/ 92.3%

         \[\leadsto \color{blue}{\frac{x \cdot \sinh y}{y}} \]

   5. Applied egg-rr 92.3%

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

4. Final simplification 85.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq 0.015 \lor \neg \left(y \leq 1.35 \cdot 10^{+154}\right):\\ \;\;\;\;\sin x \cdot \left(1 + 0.16666666666666666 \cdot \left(y \cdot y\right)\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{x \cdot \sinh y}{y}\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 68.6% accurate, 1.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq 0.0006:\\ \;\;\;\;\sin x\\ \mathbf{else}:\\ \;\;\;\;\frac{x \cdot \sinh y}{y}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= y 0.0006) (sin x) (/ (* x (sinh y)) y)))

C

double code(double x, double y) {
	double tmp;
	if (y <= 0.0006) {
		tmp = sin(x);
	} else {
		tmp = (x * sinh(y)) / y;
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if (y <= 0.0006d0) then
        tmp = sin(x)
    else
        tmp = (x * sinh(y)) / y
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if (y <= 0.0006) {
		tmp = Math.sin(x);
	} else {
		tmp = (x * Math.sinh(y)) / y;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if y <= 0.0006:
		tmp = math.sin(x)
	else:
		tmp = (x * math.sinh(y)) / y
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (y <= 0.0006)
		tmp = sin(x);
	else
		tmp = Float64(Float64(x * sinh(y)) / y);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (y <= 0.0006)
		tmp = sin(x);
	else
		tmp = (x * sinh(y)) / y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[y, 0.0006], N[Sin[x], $MachinePrecision], N[(N[(x * N[Sinh[y], $MachinePrecision]), $MachinePrecision] / y), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < 5.99999999999999947e-4

   1. Initial program 100.0%

      \[\sin x \cdot \frac{\sinh y}{y} \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0 66.0%

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

   if 5.99999999999999947e-4 < y

   1. Initial program 100.0%

      \[\sin x \cdot \frac{\sinh y}{y} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0 82.8%

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

      1. associate-*r/ 82.8%

         \[\leadsto \color{blue}{\frac{x \cdot \sinh y}{y}} \]

   5. Applied egg-rr 82.8%

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

Alternative 5: 61.2% accurate, 1.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq 240:\\ \;\;\;\;\sin x\\ \mathbf{elif}\;y \leq 5.2 \cdot 10^{+45}:\\ \;\;\;\;x \cdot \left(1 + \left(x \cdot x\right) \cdot -0.16666666666666666\right)\\ \mathbf{else}:\\ \;\;\;\;x \cdot \left(1 + 0.16666666666666666 \cdot \left(y \cdot y\right)\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= y 240.0)
   (sin x)
   (if (<= y 5.2e+45)
     (* x (+ 1.0 (* (* x x) -0.16666666666666666)))
     (* x (+ 1.0 (* 0.16666666666666666 (* y y)))))))

C

double code(double x, double y) {
	double tmp;
	if (y <= 240.0) {
		tmp = sin(x);
	} else if (y <= 5.2e+45) {
		tmp = x * (1.0 + ((x * x) * -0.16666666666666666));
	} else {
		tmp = x * (1.0 + (0.16666666666666666 * (y * y)));
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if (y <= 240.0d0) then
        tmp = sin(x)
    else if (y <= 5.2d+45) then
        tmp = x * (1.0d0 + ((x * x) * (-0.16666666666666666d0)))
    else
        tmp = x * (1.0d0 + (0.16666666666666666d0 * (y * y)))
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if (y <= 240.0) {
		tmp = Math.sin(x);
	} else if (y <= 5.2e+45) {
		tmp = x * (1.0 + ((x * x) * -0.16666666666666666));
	} else {
		tmp = x * (1.0 + (0.16666666666666666 * (y * y)));
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if y <= 240.0:
		tmp = math.sin(x)
	elif y <= 5.2e+45:
		tmp = x * (1.0 + ((x * x) * -0.16666666666666666))
	else:
		tmp = x * (1.0 + (0.16666666666666666 * (y * y)))
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (y <= 240.0)
		tmp = sin(x);
	elseif (y <= 5.2e+45)
		tmp = Float64(x * Float64(1.0 + Float64(Float64(x * x) * -0.16666666666666666)));
	else
		tmp = Float64(x * Float64(1.0 + Float64(0.16666666666666666 * Float64(y * y))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (y <= 240.0)
		tmp = sin(x);
	elseif (y <= 5.2e+45)
		tmp = x * (1.0 + ((x * x) * -0.16666666666666666));
	else
		tmp = x * (1.0 + (0.16666666666666666 * (y * y)));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[y, 240.0], N[Sin[x], $MachinePrecision], If[LessEqual[y, 5.2e+45], N[(x * N[(1.0 + N[(N[(x * x), $MachinePrecision] * -0.16666666666666666), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(x * N[(1.0 + N[(0.16666666666666666 * N[(y * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if y < 240

   1. Initial program 100.0%

      \[\sin x \cdot \frac{\sinh y}{y} \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0 66.0%

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

   if 240 < y < 5.20000000000000014e45

   1. Initial program 100.0%

      \[\sin x \cdot \frac{\sinh y}{y} \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0 2.6%

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

   4. Taylor expanded in x around 0 17.8%

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

      1. *-commutative 17.8%

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

   6. Simplified 17.8%

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

      1. unpow2 17.8%

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

   8. Applied egg-rr 17.8%

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

   if 5.20000000000000014e45 < y

   1. Initial program 100.0%

      \[\sin x \cdot \frac{\sinh y}{y} \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0 67.2%

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

      1. unpow2 67.2%

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

   5. Applied egg-rr 67.2%

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

   6. Taylor expanded in x around 0 59.6%

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

Alternative 6: 41.0% accurate, 14.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq 1.95 \cdot 10^{+46}:\\ \;\;\;\;x \cdot \left(1 + \left(x \cdot x\right) \cdot -0.16666666666666666\right)\\ \mathbf{else}:\\ \;\;\;\;x \cdot \left(1 + 0.16666666666666666 \cdot \left(y \cdot y\right)\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= y 1.95e+46)
   (* x (+ 1.0 (* (* x x) -0.16666666666666666)))
   (* x (+ 1.0 (* 0.16666666666666666 (* y y))))))

C

double code(double x, double y) {
	double tmp;
	if (y <= 1.95e+46) {
		tmp = x * (1.0 + ((x * x) * -0.16666666666666666));
	} else {
		tmp = x * (1.0 + (0.16666666666666666 * (y * y)));
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if (y <= 1.95d+46) then
        tmp = x * (1.0d0 + ((x * x) * (-0.16666666666666666d0)))
    else
        tmp = x * (1.0d0 + (0.16666666666666666d0 * (y * y)))
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if (y <= 1.95e+46) {
		tmp = x * (1.0 + ((x * x) * -0.16666666666666666));
	} else {
		tmp = x * (1.0 + (0.16666666666666666 * (y * y)));
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if y <= 1.95e+46:
		tmp = x * (1.0 + ((x * x) * -0.16666666666666666))
	else:
		tmp = x * (1.0 + (0.16666666666666666 * (y * y)))
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (y <= 1.95e+46)
		tmp = Float64(x * Float64(1.0 + Float64(Float64(x * x) * -0.16666666666666666)));
	else
		tmp = Float64(x * Float64(1.0 + Float64(0.16666666666666666 * Float64(y * y))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (y <= 1.95e+46)
		tmp = x * (1.0 + ((x * x) * -0.16666666666666666));
	else
		tmp = x * (1.0 + (0.16666666666666666 * (y * y)));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[y, 1.95e+46], N[(x * N[(1.0 + N[(N[(x * x), $MachinePrecision] * -0.16666666666666666), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(x * N[(1.0 + N[(0.16666666666666666 * N[(y * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < 1.94999999999999997e46

   1. Initial program 100.0%

      \[\sin x \cdot \frac{\sinh y}{y} \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0 64.1%

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

   4. Taylor expanded in x around 0 42.7%

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

      1. *-commutative 42.7%

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

   6. Simplified 42.7%

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

      1. unpow2 42.7%

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

   8. Applied egg-rr 42.7%

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

   if 1.94999999999999997e46 < y

   1. Initial program 100.0%

      \[\sin x \cdot \frac{\sinh y}{y} \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0 67.2%

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

      1. unpow2 67.2%

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

   5. Applied egg-rr 67.2%

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

   6. Taylor expanded in x around 0 59.6%

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

Alternative 7: 29.6% accurate, 20.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq 10^{-8}:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;\frac{x \cdot y}{y}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (if (<= x 1e-8) x (/ (* x y) y)))

C

double code(double x, double y) {
	double tmp;
	if (x <= 1e-8) {
		tmp = x;
	} else {
		tmp = (x * y) / y;
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if (x <= 1d-8) then
        tmp = x
    else
        tmp = (x * y) / y
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if (x <= 1e-8) {
		tmp = x;
	} else {
		tmp = (x * y) / y;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if x <= 1e-8:
		tmp = x
	else:
		tmp = (x * y) / y
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (x <= 1e-8)
		tmp = x;
	else
		tmp = Float64(Float64(x * y) / y);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (x <= 1e-8)
		tmp = x;
	else
		tmp = (x * y) / y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[x, 1e-8], x, N[(N[(x * y), $MachinePrecision] / y), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < 1e-8

   1. Initial program 100.0%

      \[\sin x \cdot \frac{\sinh y}{y} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0 80.1%

      \[\leadsto \color{blue}{x} \cdot \frac{\sinh y}{y} \]

   4. Taylor expanded in y around 0 38.5%

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

   if 1e-8 < x

   1. Initial program 100.0%

      \[\sin x \cdot \frac{\sinh y}{y} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0 36.9%

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

      1. associate-*r/ 36.9%

         \[\leadsto \color{blue}{\frac{x \cdot \sinh y}{y}} \]

   5. Applied egg-rr 36.9%

      \[\leadsto \color{blue}{\frac{x \cdot \sinh y}{y}} \]

   6. Taylor expanded in y around 0 19.2%

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

      1. *-commutative 19.2%

         \[\leadsto \frac{\color{blue}{y \cdot x}}{y} \]

   8. Simplified 19.2%

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

4. Final simplification 33.6%

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

Alternative 8: 47.7% accurate, 22.8× speedup

Math

\[\begin{array}{l} \\ x \cdot \left(1 + 0.16666666666666666 \cdot \left(y \cdot y\right)\right) \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (* x (+ 1.0 (* 0.16666666666666666 (* y y)))))

C

double code(double x, double y) {
	return x * (1.0 + (0.16666666666666666 * (y * y)));
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = x * (1.0d0 + (0.16666666666666666d0 * (y * y)))
end function

Java

public static double code(double x, double y) {
	return x * (1.0 + (0.16666666666666666 * (y * y)));
}

Python

def code(x, y):
	return x * (1.0 + (0.16666666666666666 * (y * y)))

Julia

function code(x, y)
	return Float64(x * Float64(1.0 + Float64(0.16666666666666666 * Float64(y * y))))
end

MATLAB

function tmp = code(x, y)
	tmp = x * (1.0 + (0.16666666666666666 * (y * y)));
end

Wolfram

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

Derivation

1. Initial program 100.0%

   \[\sin x \cdot \frac{\sinh y}{y} \]
2. Add Preprocessing

3. Taylor expanded in y around 0 76.5%

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

   1. unpow2 76.5%

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

5. Applied egg-rr 76.5%

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

6. Taylor expanded in x around 0 53.7%

   \[\leadsto \color{blue}{x} \cdot \left(1 + 0.16666666666666666 \cdot \left(y \cdot y\right)\right) \]
7. Add Preprocessing

Alternative 9: 26.8% accurate, 205.0× speedup

Math

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

FPCore

(FPCore (x y) :precision binary64 x)

C

double code(double x, double y) {
	return x;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = x
end function

Java

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

Python

def code(x, y):
	return x

Julia

function code(x, y)
	return x
end

MATLAB

function tmp = code(x, y)
	tmp = x;
end

Wolfram

code[x_, y_] := x

Derivation

1. Initial program 100.0%

   \[\sin x \cdot \frac{\sinh y}{y} \]
2. Add Preprocessing

3. Taylor expanded in x around 0 69.1%

   \[\leadsto \color{blue}{x} \cdot \frac{\sinh y}{y} \]

4. Taylor expanded in y around 0 29.6%

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

Reproduce

herbie shell --seed 2024182 
(FPCore (x y)
  :name "Linear.Quaternion:$ccos from linear-1.19.1.3"
  :precision binary64
  (* (sin x) (/ (sinh y) y)))