Linear.Quaternion:$ctanh from linear-1.19.1.3

Percentage Accurate: 96.1% → 99.7%

Time: 7.1s

Alternatives: 7

Speedup: 1.0×

Specification

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 96.1% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 99.7% accurate, 1.0× speedup

Math

\[\begin{array}{l} z\_m = \left|z\right| \\ z\_s = \mathsf{copysign}\left(1, z\right) \\ \begin{array}{l} t_0 := \frac{\sin y}{y}\\ z\_s \cdot \begin{array}{l} \mathbf{if}\;z\_m \leq 4.8 \cdot 10^{+18}:\\ \;\;\;\;x \cdot \frac{t\_0}{z\_m}\\ \mathbf{else}:\\ \;\;\;\;\frac{x \cdot t\_0}{z\_m}\\ \end{array} \end{array} \end{array} \]

FPCore

z\_m = (fabs.f64 z)
z\_s = (copysign.f64 #s(literal 1 binary64) z)
(FPCore (z_s x y z_m)
 :precision binary64
 (let* ((t_0 (/ (sin y) y)))
   (* z_s (if (<= z_m 4.8e+18) (* x (/ t_0 z_m)) (/ (* x t_0) z_m)))))

C

z\_m = fabs(z);
z\_s = copysign(1.0, z);
double code(double z_s, double x, double y, double z_m) {
	double t_0 = sin(y) / y;
	double tmp;
	if (z_m <= 4.8e+18) {
		tmp = x * (t_0 / z_m);
	} else {
		tmp = (x * t_0) / z_m;
	}
	return z_s * tmp;
}

Fortran

z\_m = abs(z)
z\_s = copysign(1.0d0, z)
real(8) function code(z_s, x, y, z_m)
    real(8), intent (in) :: z_s
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z_m
    real(8) :: t_0
    real(8) :: tmp
    t_0 = sin(y) / y
    if (z_m <= 4.8d+18) then
        tmp = x * (t_0 / z_m)
    else
        tmp = (x * t_0) / z_m
    end if
    code = z_s * tmp
end function

Java

z\_m = Math.abs(z);
z\_s = Math.copySign(1.0, z);
public static double code(double z_s, double x, double y, double z_m) {
	double t_0 = Math.sin(y) / y;
	double tmp;
	if (z_m <= 4.8e+18) {
		tmp = x * (t_0 / z_m);
	} else {
		tmp = (x * t_0) / z_m;
	}
	return z_s * tmp;
}

Python

z\_m = math.fabs(z)
z\_s = math.copysign(1.0, z)
def code(z_s, x, y, z_m):
	t_0 = math.sin(y) / y
	tmp = 0
	if z_m <= 4.8e+18:
		tmp = x * (t_0 / z_m)
	else:
		tmp = (x * t_0) / z_m
	return z_s * tmp

Julia

z\_m = abs(z)
z\_s = copysign(1.0, z)
function code(z_s, x, y, z_m)
	t_0 = Float64(sin(y) / y)
	tmp = 0.0
	if (z_m <= 4.8e+18)
		tmp = Float64(x * Float64(t_0 / z_m));
	else
		tmp = Float64(Float64(x * t_0) / z_m);
	end
	return Float64(z_s * tmp)
end

MATLAB

z\_m = abs(z);
z\_s = sign(z) * abs(1.0);
function tmp_2 = code(z_s, x, y, z_m)
	t_0 = sin(y) / y;
	tmp = 0.0;
	if (z_m <= 4.8e+18)
		tmp = x * (t_0 / z_m);
	else
		tmp = (x * t_0) / z_m;
	end
	tmp_2 = z_s * tmp;
end

Wolfram

z\_m = N[Abs[z], $MachinePrecision]
z\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[z]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[z$95$s_, x_, y_, z$95$m_] := Block[{t$95$0 = N[(N[Sin[y], $MachinePrecision] / y), $MachinePrecision]}, N[(z$95$s * If[LessEqual[z$95$m, 4.8e+18], N[(x * N[(t$95$0 / z$95$m), $MachinePrecision]), $MachinePrecision], N[(N[(x * t$95$0), $MachinePrecision] / z$95$m), $MachinePrecision]]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < 4.8e18

   1. Initial program 94.4%

      \[\frac{x \cdot \frac{\sin y}{y}}{z} \]
   2. Step-by-step derivation

      1. associate-/l* 98.6%

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

   3. Simplified 98.6%

      \[\leadsto \color{blue}{x \cdot \frac{\frac{\sin y}{y}}{z}} \]
   4. Add Preprocessing

   if 4.8e18 < z

   1. Initial program 99.8%

      \[\frac{x \cdot \frac{\sin y}{y}}{z} \]
   2. Add Preprocessing
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 2: 77.1% accurate, 1.0× speedup

Math

\[\begin{array}{l} z\_m = \left|z\right| \\ z\_s = \mathsf{copysign}\left(1, z\right) \\ z\_s \cdot \begin{array}{l} \mathbf{if}\;y \leq 1.6 \cdot 10^{-8}:\\ \;\;\;\;\frac{x}{z\_m}\\ \mathbf{else}:\\ \;\;\;\;x \cdot \frac{\sin y}{z\_m \cdot y}\\ \end{array} \end{array} \]

FPCore

z\_m = (fabs.f64 z)
z\_s = (copysign.f64 #s(literal 1 binary64) z)
(FPCore (z_s x y z_m)
 :precision binary64
 (* z_s (if (<= y 1.6e-8) (/ x z_m) (* x (/ (sin y) (* z_m y))))))

C

z\_m = fabs(z);
z\_s = copysign(1.0, z);
double code(double z_s, double x, double y, double z_m) {
	double tmp;
	if (y <= 1.6e-8) {
		tmp = x / z_m;
	} else {
		tmp = x * (sin(y) / (z_m * y));
	}
	return z_s * tmp;
}

Fortran

z\_m = abs(z)
z\_s = copysign(1.0d0, z)
real(8) function code(z_s, x, y, z_m)
    real(8), intent (in) :: z_s
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z_m
    real(8) :: tmp
    if (y <= 1.6d-8) then
        tmp = x / z_m
    else
        tmp = x * (sin(y) / (z_m * y))
    end if
    code = z_s * tmp
end function

Java

z\_m = Math.abs(z);
z\_s = Math.copySign(1.0, z);
public static double code(double z_s, double x, double y, double z_m) {
	double tmp;
	if (y <= 1.6e-8) {
		tmp = x / z_m;
	} else {
		tmp = x * (Math.sin(y) / (z_m * y));
	}
	return z_s * tmp;
}

Python

z\_m = math.fabs(z)
z\_s = math.copysign(1.0, z)
def code(z_s, x, y, z_m):
	tmp = 0
	if y <= 1.6e-8:
		tmp = x / z_m
	else:
		tmp = x * (math.sin(y) / (z_m * y))
	return z_s * tmp

Julia

z\_m = abs(z)
z\_s = copysign(1.0, z)
function code(z_s, x, y, z_m)
	tmp = 0.0
	if (y <= 1.6e-8)
		tmp = Float64(x / z_m);
	else
		tmp = Float64(x * Float64(sin(y) / Float64(z_m * y)));
	end
	return Float64(z_s * tmp)
end

MATLAB

z\_m = abs(z);
z\_s = sign(z) * abs(1.0);
function tmp_2 = code(z_s, x, y, z_m)
	tmp = 0.0;
	if (y <= 1.6e-8)
		tmp = x / z_m;
	else
		tmp = x * (sin(y) / (z_m * y));
	end
	tmp_2 = z_s * tmp;
end

Wolfram

z\_m = N[Abs[z], $MachinePrecision]
z\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[z]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[z$95$s_, x_, y_, z$95$m_] := N[(z$95$s * If[LessEqual[y, 1.6e-8], N[(x / z$95$m), $MachinePrecision], N[(x * N[(N[Sin[y], $MachinePrecision] / N[(z$95$m * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if y < 1.6000000000000001e-8

   1. Initial program 96.7%

      \[\frac{x \cdot \frac{\sin y}{y}}{z} \]
   2. Step-by-step derivation

      1. associate-/l* 99.3%

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

      2. associate-/l/ 92.0%

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

      3. *-commutative 92.0%

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

   3. Simplified 92.0%

      \[\leadsto \color{blue}{x \cdot \frac{\sin y}{y \cdot z}} \]
   4. Add Preprocessing

   5. Taylor expanded in y around 0 72.2%

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

   if 1.6000000000000001e-8 < y

   1. Initial program 93.4%

      \[\frac{x \cdot \frac{\sin y}{y}}{z} \]
   2. Step-by-step derivation

      1. associate-/l* 92.8%

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

      2. associate-/l/ 92.9%

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

      3. *-commutative 92.9%

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

   3. Simplified 92.9%

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

4. Final simplification 78.4%

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

Alternative 3: 95.8% accurate, 1.0× speedup

Math

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

FPCore

z\_m = (fabs.f64 z)
z\_s = (copysign.f64 #s(literal 1 binary64) z)
(FPCore (z_s x y z_m) :precision binary64 (* z_s (* x (/ (/ (sin y) y) z_m))))

C

z\_m = fabs(z);
z\_s = copysign(1.0, z);
double code(double z_s, double x, double y, double z_m) {
	return z_s * (x * ((sin(y) / y) / z_m));
}

Fortran

z\_m = abs(z)
z\_s = copysign(1.0d0, z)
real(8) function code(z_s, x, y, z_m)
    real(8), intent (in) :: z_s
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z_m
    code = z_s * (x * ((sin(y) / y) / z_m))
end function

Java

z\_m = Math.abs(z);
z\_s = Math.copySign(1.0, z);
public static double code(double z_s, double x, double y, double z_m) {
	return z_s * (x * ((Math.sin(y) / y) / z_m));
}

Python

z\_m = math.fabs(z)
z\_s = math.copysign(1.0, z)
def code(z_s, x, y, z_m):
	return z_s * (x * ((math.sin(y) / y) / z_m))

Julia

z\_m = abs(z)
z\_s = copysign(1.0, z)
function code(z_s, x, y, z_m)
	return Float64(z_s * Float64(x * Float64(Float64(sin(y) / y) / z_m)))
end

MATLAB

z\_m = abs(z);
z\_s = sign(z) * abs(1.0);
function tmp = code(z_s, x, y, z_m)
	tmp = z_s * (x * ((sin(y) / y) / z_m));
end

Wolfram

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

Derivation

1. Initial program 95.7%

   \[\frac{x \cdot \frac{\sin y}{y}}{z} \]
2. Step-by-step derivation

   1. associate-/l* 97.4%

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

3. Simplified 97.4%

   \[\leadsto \color{blue}{x \cdot \frac{\frac{\sin y}{y}}{z}} \]
4. Add Preprocessing
5. Add Preprocessing

Alternative 4: 61.7% accurate, 8.9× speedup

Math

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

FPCore

z\_m = (fabs.f64 z)
z\_s = (copysign.f64 #s(literal 1 binary64) z)
(FPCore (z_s x y z_m)
 :precision binary64
 (* z_s (if (<= y 2e+41) (/ x z_m) (/ y (* z_m (/ y x))))))

C

z\_m = fabs(z);
z\_s = copysign(1.0, z);
double code(double z_s, double x, double y, double z_m) {
	double tmp;
	if (y <= 2e+41) {
		tmp = x / z_m;
	} else {
		tmp = y / (z_m * (y / x));
	}
	return z_s * tmp;
}

Fortran

z\_m = abs(z)
z\_s = copysign(1.0d0, z)
real(8) function code(z_s, x, y, z_m)
    real(8), intent (in) :: z_s
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z_m
    real(8) :: tmp
    if (y <= 2d+41) then
        tmp = x / z_m
    else
        tmp = y / (z_m * (y / x))
    end if
    code = z_s * tmp
end function

Java

z\_m = Math.abs(z);
z\_s = Math.copySign(1.0, z);
public static double code(double z_s, double x, double y, double z_m) {
	double tmp;
	if (y <= 2e+41) {
		tmp = x / z_m;
	} else {
		tmp = y / (z_m * (y / x));
	}
	return z_s * tmp;
}

Python

z\_m = math.fabs(z)
z\_s = math.copysign(1.0, z)
def code(z_s, x, y, z_m):
	tmp = 0
	if y <= 2e+41:
		tmp = x / z_m
	else:
		tmp = y / (z_m * (y / x))
	return z_s * tmp

Julia

z\_m = abs(z)
z\_s = copysign(1.0, z)
function code(z_s, x, y, z_m)
	tmp = 0.0
	if (y <= 2e+41)
		tmp = Float64(x / z_m);
	else
		tmp = Float64(y / Float64(z_m * Float64(y / x)));
	end
	return Float64(z_s * tmp)
end

MATLAB

z\_m = abs(z);
z\_s = sign(z) * abs(1.0);
function tmp_2 = code(z_s, x, y, z_m)
	tmp = 0.0;
	if (y <= 2e+41)
		tmp = x / z_m;
	else
		tmp = y / (z_m * (y / x));
	end
	tmp_2 = z_s * tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < 2.00000000000000001e41

   1. Initial program 96.4%

      \[\frac{x \cdot \frac{\sin y}{y}}{z} \]
   2. Step-by-step derivation

      1. associate-/l* 99.3%

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

      2. associate-/l/ 92.5%

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

      3. *-commutative 92.5%

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

   3. Simplified 92.5%

      \[\leadsto \color{blue}{x \cdot \frac{\sin y}{y \cdot z}} \]
   4. Add Preprocessing

   5. Taylor expanded in y around 0 70.5%

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

   if 2.00000000000000001e41 < y

   1. Initial program 93.7%

      \[\frac{x \cdot \frac{\sin y}{y}}{z} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. associate-*r/ 93.9%

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

      2. associate-/r* 91.6%

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

      3. times-frac 93.8%

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

   4. Applied egg-rr 93.8%

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

   5. Taylor expanded in y around 0 24.4%

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

      1. clear-num 24.6%

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

      2. frac-times 31.5%

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

      3. *-un-lft-identity 31.5%

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

   7. Applied egg-rr 31.5%

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

4. Final simplification 60.7%

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

Alternative 5: 61.6% accurate, 8.9× speedup

Math

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

FPCore

z\_m = (fabs.f64 z)
z\_s = (copysign.f64 #s(literal 1 binary64) z)
(FPCore (z_s x y z_m)
 :precision binary64
 (* z_s (if (<= y 5e-12) (/ x z_m) (* y (/ x (* z_m y))))))

C

z\_m = fabs(z);
z\_s = copysign(1.0, z);
double code(double z_s, double x, double y, double z_m) {
	double tmp;
	if (y <= 5e-12) {
		tmp = x / z_m;
	} else {
		tmp = y * (x / (z_m * y));
	}
	return z_s * tmp;
}

Fortran

z\_m = abs(z)
z\_s = copysign(1.0d0, z)
real(8) function code(z_s, x, y, z_m)
    real(8), intent (in) :: z_s
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z_m
    real(8) :: tmp
    if (y <= 5d-12) then
        tmp = x / z_m
    else
        tmp = y * (x / (z_m * y))
    end if
    code = z_s * tmp
end function

Java

z\_m = Math.abs(z);
z\_s = Math.copySign(1.0, z);
public static double code(double z_s, double x, double y, double z_m) {
	double tmp;
	if (y <= 5e-12) {
		tmp = x / z_m;
	} else {
		tmp = y * (x / (z_m * y));
	}
	return z_s * tmp;
}

Python

z\_m = math.fabs(z)
z\_s = math.copysign(1.0, z)
def code(z_s, x, y, z_m):
	tmp = 0
	if y <= 5e-12:
		tmp = x / z_m
	else:
		tmp = y * (x / (z_m * y))
	return z_s * tmp

Julia

z\_m = abs(z)
z\_s = copysign(1.0, z)
function code(z_s, x, y, z_m)
	tmp = 0.0
	if (y <= 5e-12)
		tmp = Float64(x / z_m);
	else
		tmp = Float64(y * Float64(x / Float64(z_m * y)));
	end
	return Float64(z_s * tmp)
end

MATLAB

z\_m = abs(z);
z\_s = sign(z) * abs(1.0);
function tmp_2 = code(z_s, x, y, z_m)
	tmp = 0.0;
	if (y <= 5e-12)
		tmp = x / z_m;
	else
		tmp = y * (x / (z_m * y));
	end
	tmp_2 = z_s * tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < 4.9999999999999997e-12

   1. Initial program 96.7%

      \[\frac{x \cdot \frac{\sin y}{y}}{z} \]
   2. Step-by-step derivation

      1. associate-/l* 99.3%

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

      2. associate-/l/ 92.0%

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

      3. *-commutative 92.0%

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

   3. Simplified 92.0%

      \[\leadsto \color{blue}{x \cdot \frac{\sin y}{y \cdot z}} \]
   4. Add Preprocessing

   5. Taylor expanded in y around 0 72.1%

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

   if 4.9999999999999997e-12 < y

   1. Initial program 93.5%

      \[\frac{x \cdot \frac{\sin y}{y}}{z} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. associate-*r/ 93.6%

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

      2. associate-/r* 92.9%

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

      3. times-frac 93.6%

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

   4. Applied egg-rr 93.6%

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

   5. Taylor expanded in y around 0 28.4%

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

      1. clear-num 28.5%

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

      2. frac-times 34.3%

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

      3. *-un-lft-identity 34.3%

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

   7. Applied egg-rr 34.3%

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

      1. clear-num 34.3%

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

      2. associate-/r/ 34.3%

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

      3. associate-/r* 33.6%

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

      4. clear-num 33.5%

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

      5. associate-/l/ 34.3%

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

      6. *-commutative 34.3%

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

   9. Applied egg-rr 34.3%

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

4. Final simplification 60.7%

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

Alternative 6: 59.2% accurate, 8.9× speedup

Math

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

FPCore

z\_m = (fabs.f64 z)
z\_s = (copysign.f64 #s(literal 1 binary64) z)
(FPCore (z_s x y z_m)
 :precision binary64
 (* z_s (if (<= y 7e+41) (/ x z_m) (* (/ x y) (/ y z_m)))))

C

z\_m = fabs(z);
z\_s = copysign(1.0, z);
double code(double z_s, double x, double y, double z_m) {
	double tmp;
	if (y <= 7e+41) {
		tmp = x / z_m;
	} else {
		tmp = (x / y) * (y / z_m);
	}
	return z_s * tmp;
}

Fortran

z\_m = abs(z)
z\_s = copysign(1.0d0, z)
real(8) function code(z_s, x, y, z_m)
    real(8), intent (in) :: z_s
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z_m
    real(8) :: tmp
    if (y <= 7d+41) then
        tmp = x / z_m
    else
        tmp = (x / y) * (y / z_m)
    end if
    code = z_s * tmp
end function

Java

z\_m = Math.abs(z);
z\_s = Math.copySign(1.0, z);
public static double code(double z_s, double x, double y, double z_m) {
	double tmp;
	if (y <= 7e+41) {
		tmp = x / z_m;
	} else {
		tmp = (x / y) * (y / z_m);
	}
	return z_s * tmp;
}

Python

z\_m = math.fabs(z)
z\_s = math.copysign(1.0, z)
def code(z_s, x, y, z_m):
	tmp = 0
	if y <= 7e+41:
		tmp = x / z_m
	else:
		tmp = (x / y) * (y / z_m)
	return z_s * tmp

Julia

z\_m = abs(z)
z\_s = copysign(1.0, z)
function code(z_s, x, y, z_m)
	tmp = 0.0
	if (y <= 7e+41)
		tmp = Float64(x / z_m);
	else
		tmp = Float64(Float64(x / y) * Float64(y / z_m));
	end
	return Float64(z_s * tmp)
end

MATLAB

z\_m = abs(z);
z\_s = sign(z) * abs(1.0);
function tmp_2 = code(z_s, x, y, z_m)
	tmp = 0.0;
	if (y <= 7e+41)
		tmp = x / z_m;
	else
		tmp = (x / y) * (y / z_m);
	end
	tmp_2 = z_s * tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < 6.9999999999999998e41

   1. Initial program 96.4%

      \[\frac{x \cdot \frac{\sin y}{y}}{z} \]
   2. Step-by-step derivation

      1. associate-/l* 99.3%

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

      2. associate-/l/ 92.5%

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

      3. *-commutative 92.5%

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

   3. Simplified 92.5%

      \[\leadsto \color{blue}{x \cdot \frac{\sin y}{y \cdot z}} \]
   4. Add Preprocessing

   5. Taylor expanded in y around 0 70.5%

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

   if 6.9999999999999998e41 < y

   1. Initial program 93.7%

      \[\frac{x \cdot \frac{\sin y}{y}}{z} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. associate-*r/ 93.9%

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

      2. associate-/r* 91.6%

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

      3. times-frac 93.8%

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

   4. Applied egg-rr 93.8%

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

   5. Taylor expanded in y around 0 24.4%

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

Alternative 7: 57.9% accurate, 35.7× speedup

Math

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

FPCore

z\_m = (fabs.f64 z)
z\_s = (copysign.f64 #s(literal 1 binary64) z)
(FPCore (z_s x y z_m) :precision binary64 (* z_s (/ x z_m)))

C

z\_m = fabs(z);
z\_s = copysign(1.0, z);
double code(double z_s, double x, double y, double z_m) {
	return z_s * (x / z_m);
}

Fortran

z\_m = abs(z)
z\_s = copysign(1.0d0, z)
real(8) function code(z_s, x, y, z_m)
    real(8), intent (in) :: z_s
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z_m
    code = z_s * (x / z_m)
end function

Java

z\_m = Math.abs(z);
z\_s = Math.copySign(1.0, z);
public static double code(double z_s, double x, double y, double z_m) {
	return z_s * (x / z_m);
}

Python

z\_m = math.fabs(z)
z\_s = math.copysign(1.0, z)
def code(z_s, x, y, z_m):
	return z_s * (x / z_m)

Julia

z\_m = abs(z)
z\_s = copysign(1.0, z)
function code(z_s, x, y, z_m)
	return Float64(z_s * Float64(x / z_m))
end

MATLAB

z\_m = abs(z);
z\_s = sign(z) * abs(1.0);
function tmp = code(z_s, x, y, z_m)
	tmp = z_s * (x / z_m);
end

Wolfram

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

Derivation

1. Initial program 95.7%

   \[\frac{x \cdot \frac{\sin y}{y}}{z} \]
2. Step-by-step derivation

   1. associate-/l* 97.4%

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

   2. associate-/l/ 92.3%

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

   3. *-commutative 92.3%

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

3. Simplified 92.3%

   \[\leadsto \color{blue}{x \cdot \frac{\sin y}{y \cdot z}} \]
4. Add Preprocessing

5. Taylor expanded in y around 0 57.9%

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

Developer target: 99.5% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{y}{\sin y}\\ t_1 := \frac{x \cdot \frac{1}{t\_0}}{z}\\ \mathbf{if}\;z < -4.2173720203427147 \cdot 10^{-29}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;z < 4.446702369113811 \cdot 10^{+64}:\\ \;\;\;\;\frac{x}{z \cdot t\_0}\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (/ y (sin y))) (t_1 (/ (* x (/ 1.0 t_0)) z)))
   (if (< z -4.2173720203427147e-29)
     t_1
     (if (< z 4.446702369113811e+64) (/ x (* z t_0)) t_1))))

C

double code(double x, double y, double z) {
	double t_0 = y / sin(y);
	double t_1 = (x * (1.0 / t_0)) / z;
	double tmp;
	if (z < -4.2173720203427147e-29) {
		tmp = t_1;
	} else if (z < 4.446702369113811e+64) {
		tmp = x / (z * t_0);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: t_0
    real(8) :: t_1
    real(8) :: tmp
    t_0 = y / sin(y)
    t_1 = (x * (1.0d0 / t_0)) / z
    if (z < (-4.2173720203427147d-29)) then
        tmp = t_1
    else if (z < 4.446702369113811d+64) then
        tmp = x / (z * t_0)
    else
        tmp = t_1
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double t_0 = y / Math.sin(y);
	double t_1 = (x * (1.0 / t_0)) / z;
	double tmp;
	if (z < -4.2173720203427147e-29) {
		tmp = t_1;
	} else if (z < 4.446702369113811e+64) {
		tmp = x / (z * t_0);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

def code(x, y, z):
	t_0 = y / math.sin(y)
	t_1 = (x * (1.0 / t_0)) / z
	tmp = 0
	if z < -4.2173720203427147e-29:
		tmp = t_1
	elif z < 4.446702369113811e+64:
		tmp = x / (z * t_0)
	else:
		tmp = t_1
	return tmp

Julia

function code(x, y, z)
	t_0 = Float64(y / sin(y))
	t_1 = Float64(Float64(x * Float64(1.0 / t_0)) / z)
	tmp = 0.0
	if (z < -4.2173720203427147e-29)
		tmp = t_1;
	elseif (z < 4.446702369113811e+64)
		tmp = Float64(x / Float64(z * t_0));
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	t_0 = y / sin(y);
	t_1 = (x * (1.0 / t_0)) / z;
	tmp = 0.0;
	if (z < -4.2173720203427147e-29)
		tmp = t_1;
	elseif (z < 4.446702369113811e+64)
		tmp = x / (z * t_0);
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(y / N[Sin[y], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(x * N[(1.0 / t$95$0), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision]}, If[Less[z, -4.2173720203427147e-29], t$95$1, If[Less[z, 4.446702369113811e+64], N[(x / N[(z * t$95$0), $MachinePrecision]), $MachinePrecision], t$95$1]]]]

Reproduce

herbie shell --seed 2024085 
(FPCore (x y z)
  :name "Linear.Quaternion:$ctanh from linear-1.19.1.3"
  :precision binary64

  :alt
  (if (< z -4.2173720203427147e-29) (/ (* x (/ 1.0 (/ y (sin y)))) z) (if (< z 4.446702369113811e+64) (/ x (* z (/ y (sin y)))) (/ (* x (/ 1.0 (/ y (sin y)))) z)))

  (/ (* x (/ (sin y) y)) z))