Linear.Quaternion:$ctanh from linear-1.19.1.3

Percentage Accurate: 96.0% → 99.5%

Time: 5.8s

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.0% 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.5% 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 2 \cdot 10^{+56}:\\ \;\;\;\;\frac{x}{\frac{z_m}{t_0}}\\ \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 1 z)
(FPCore (z_s x y z_m)
 :precision binary64
 (let* ((t_0 (/ (sin y) y)))
   (* z_s (if (<= z_m 2e+56) (/ x (/ z_m t_0)) (/ (* 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 <= 2e+56) {
		tmp = x / (z_m / t_0);
	} 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 <= 2d+56) then
        tmp = x / (z_m / t_0)
    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 <= 2e+56) {
		tmp = x / (z_m / t_0);
	} 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 <= 2e+56:
		tmp = x / (z_m / t_0)
	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 <= 2e+56)
		tmp = Float64(x / Float64(z_m / t_0));
	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 <= 2e+56)
		tmp = x / (z_m / t_0);
	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, 2e+56], N[(x / N[(z$95$m / t$95$0), $MachinePrecision]), $MachinePrecision], N[(N[(x * t$95$0), $MachinePrecision] / z$95$m), $MachinePrecision]]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < 2.00000000000000018e56

   1. Initial program 97.1%

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

      1. associate-/l* 97.7%

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

   3. Simplified 97.7%

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

   if 2.00000000000000018e56 < z

   1. Initial program 99.9%

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

4. Final simplification 98.2%

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

Alternative 2: 95.8% accurate, 0.5× 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}\;t_0 \leq 10^{-184}:\\ \;\;\;\;\sin y \cdot \frac{\frac{x}{y}}{z_m}\\ \mathbf{else}:\\ \;\;\;\;t_0 \cdot \frac{x}{z_m}\\ \end{array} \end{array} \end{array} \]

FPCore

z_m = (fabs.f64 z)
z_s = (copysign.f64 1 z)
(FPCore (z_s x y z_m)
 :precision binary64
 (let* ((t_0 (/ (sin y) y)))
   (* z_s (if (<= t_0 1e-184) (* (sin y) (/ (/ x y) z_m)) (* t_0 (/ 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) {
	double t_0 = sin(y) / y;
	double tmp;
	if (t_0 <= 1e-184) {
		tmp = sin(y) * ((x / y) / z_m);
	} else {
		tmp = t_0 * (x / 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 (t_0 <= 1d-184) then
        tmp = sin(y) * ((x / y) / z_m)
    else
        tmp = t_0 * (x / 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 (t_0 <= 1e-184) {
		tmp = Math.sin(y) * ((x / y) / z_m);
	} else {
		tmp = t_0 * (x / 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 t_0 <= 1e-184:
		tmp = math.sin(y) * ((x / y) / z_m)
	else:
		tmp = t_0 * (x / 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 (t_0 <= 1e-184)
		tmp = Float64(sin(y) * Float64(Float64(x / y) / z_m));
	else
		tmp = Float64(t_0 * Float64(x / 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 (t_0 <= 1e-184)
		tmp = sin(y) * ((x / y) / z_m);
	else
		tmp = t_0 * (x / 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[t$95$0, 1e-184], N[(N[Sin[y], $MachinePrecision] * N[(N[(x / y), $MachinePrecision] / z$95$m), $MachinePrecision]), $MachinePrecision], N[(t$95$0 * N[(x / z$95$m), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (sin.f64 y) y) < 1.0000000000000001e-184

   1. Initial program 97.3%

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

      1. *-lft-identity 97.3%

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

      2. metadata-eval 97.3%

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

      3. times-frac 97.3%

         \[\leadsto \color{blue}{\frac{-1 \cdot \left(x \cdot \frac{\sin y}{y}\right)}{-1 \cdot z}} \]

      4. neg-mul-1 97.3%

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

      5. distribute-lft-neg-out 97.3%

         \[\leadsto \frac{\color{blue}{\left(-x\right) \cdot \frac{\sin y}{y}}}{-1 \cdot z} \]

      6. associate-*r/ 97.2%

         \[\leadsto \frac{\color{blue}{\frac{\left(-x\right) \cdot \sin y}{y}}}{-1 \cdot z} \]

      7. associate-*l/ 97.3%

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

      8. *-commutative 97.3%

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

      9. times-frac 97.2%

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

      10. remove-double-neg 97.2%

          \[\leadsto \frac{\frac{-x}{y}}{z} \cdot \color{blue}{\left(-\left(-\frac{\sin y}{-1}\right)\right)} \]

      11. distribute-frac-neg 97.2%

          \[\leadsto \frac{\frac{-x}{y}}{z} \cdot \left(-\color{blue}{\frac{-\sin y}{-1}}\right) \]

      12. sin-neg 97.2%

          \[\leadsto \frac{\frac{-x}{y}}{z} \cdot \left(-\frac{\color{blue}{\sin \left(-y\right)}}{-1}\right) \]

      13. sin-neg 97.2%

          \[\leadsto \frac{\frac{-x}{y}}{z} \cdot \left(-\frac{\color{blue}{-\sin y}}{-1}\right) \]

      14. neg-mul-1 97.2%

          \[\leadsto \frac{\frac{-x}{y}}{z} \cdot \left(-\frac{\color{blue}{-1 \cdot \sin y}}{-1}\right) \]

      15. associate-/l* 97.2%

          \[\leadsto \frac{\frac{-x}{y}}{z} \cdot \left(-\color{blue}{\frac{-1}{\frac{-1}{\sin y}}}\right) \]

      16. associate-/r/ 97.2%

          \[\leadsto \frac{\frac{-x}{y}}{z} \cdot \left(-\color{blue}{\frac{-1}{-1} \cdot \sin y}\right) \]

      17. distribute-lft-neg-in 97.2%

          \[\leadsto \frac{\frac{-x}{y}}{z} \cdot \color{blue}{\left(\left(-\frac{-1}{-1}\right) \cdot \sin y\right)} \]

      18. metadata-eval 97.2%

          \[\leadsto \frac{\frac{-x}{y}}{z} \cdot \left(\left(-\color{blue}{1}\right) \cdot \sin y\right) \]

      19. metadata-eval 97.2%

          \[\leadsto \frac{\frac{-x}{y}}{z} \cdot \left(\color{blue}{-1} \cdot \sin y\right) \]

      20. neg-mul-1 97.2%

          \[\leadsto \frac{\frac{-x}{y}}{z} \cdot \color{blue}{\left(-\sin y\right)} \]

      21. sin-neg 97.2%

          \[\leadsto \frac{\frac{-x}{y}}{z} \cdot \color{blue}{\sin \left(-y\right)} \]

      22. *-commutative 97.2%

          \[\leadsto \color{blue}{\sin \left(-y\right) \cdot \frac{\frac{-x}{y}}{z}} \]

   3. Simplified 97.2%

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

   if 1.0000000000000001e-184 < (/.f64 (sin.f64 y) y)

   1. Initial program 97.9%

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

      1. *-commutative 97.9%

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

      2. associate-*r/ 99.9%

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

   3. Simplified 99.9%

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

4. Final simplification 99.0%

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

Alternative 3: 76.4% 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 2 \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 1 z)
(FPCore (z_s x y z_m)
 :precision binary64
 (* z_s (if (<= y 2e-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 <= 2e-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 <= 2d-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 <= 2e-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 <= 2e-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 <= 2e-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 <= 2e-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, 2e-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 < 2e-8

   1. Initial program 98.1%

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

   3. Taylor expanded in y around 0 71.4%

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

   if 2e-8 < y

   1. Initial program 96.5%

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

      1. associate-*r/ 95.7%

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

      2. associate-/l/ 93.3%

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

      3. *-commutative 93.3%

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

   3. Simplified 93.3%

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

4. Final simplification 76.6%

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

Alternative 4: 76.7% 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 10^{-9}:\\ \;\;\;\;\frac{x}{z_m}\\ \mathbf{else}:\\ \;\;\;\;\sin y \cdot \frac{\frac{x}{y}}{z_m}\\ \end{array} \end{array} \]

FPCore

z_m = (fabs.f64 z)
z_s = (copysign.f64 1 z)
(FPCore (z_s x y z_m)
 :precision binary64
 (* z_s (if (<= y 1e-9) (/ x z_m) (* (sin y) (/ (/ x 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 <= 1e-9) {
		tmp = x / z_m;
	} else {
		tmp = sin(y) * ((x / 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 <= 1d-9) then
        tmp = x / z_m
    else
        tmp = sin(y) * ((x / 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 <= 1e-9) {
		tmp = x / z_m;
	} else {
		tmp = Math.sin(y) * ((x / 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 <= 1e-9:
		tmp = x / z_m
	else:
		tmp = math.sin(y) * ((x / 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 <= 1e-9)
		tmp = Float64(x / z_m);
	else
		tmp = Float64(sin(y) * Float64(Float64(x / 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 <= 1e-9)
		tmp = x / z_m;
	else
		tmp = sin(y) * ((x / 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, 1e-9], N[(x / z$95$m), $MachinePrecision], N[(N[Sin[y], $MachinePrecision] * N[(N[(x / y), $MachinePrecision] / z$95$m), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if y < 1.00000000000000006e-9

   1. Initial program 98.1%

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

   3. Taylor expanded in y around 0 71.4%

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

   if 1.00000000000000006e-9 < y

   1. Initial program 96.5%

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

      1. *-lft-identity 96.5%

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

      2. metadata-eval 96.5%

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

      3. times-frac 96.5%

         \[\leadsto \color{blue}{\frac{-1 \cdot \left(x \cdot \frac{\sin y}{y}\right)}{-1 \cdot z}} \]

      4. neg-mul-1 96.5%

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

      5. distribute-lft-neg-out 96.5%

         \[\leadsto \frac{\color{blue}{\left(-x\right) \cdot \frac{\sin y}{y}}}{-1 \cdot z} \]

      6. associate-*r/ 96.5%

         \[\leadsto \frac{\color{blue}{\frac{\left(-x\right) \cdot \sin y}{y}}}{-1 \cdot z} \]

      7. associate-*l/ 96.5%

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

      8. *-commutative 96.5%

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

      9. times-frac 96.6%

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

      10. remove-double-neg 96.6%

          \[\leadsto \frac{\frac{-x}{y}}{z} \cdot \color{blue}{\left(-\left(-\frac{\sin y}{-1}\right)\right)} \]

      11. distribute-frac-neg 96.6%

          \[\leadsto \frac{\frac{-x}{y}}{z} \cdot \left(-\color{blue}{\frac{-\sin y}{-1}}\right) \]

      12. sin-neg 96.6%

          \[\leadsto \frac{\frac{-x}{y}}{z} \cdot \left(-\frac{\color{blue}{\sin \left(-y\right)}}{-1}\right) \]

      13. sin-neg 96.6%

          \[\leadsto \frac{\frac{-x}{y}}{z} \cdot \left(-\frac{\color{blue}{-\sin y}}{-1}\right) \]

      14. neg-mul-1 96.6%

          \[\leadsto \frac{\frac{-x}{y}}{z} \cdot \left(-\frac{\color{blue}{-1 \cdot \sin y}}{-1}\right) \]

      15. associate-/l* 96.5%

          \[\leadsto \frac{\frac{-x}{y}}{z} \cdot \left(-\color{blue}{\frac{-1}{\frac{-1}{\sin y}}}\right) \]

      16. associate-/r/ 96.6%

          \[\leadsto \frac{\frac{-x}{y}}{z} \cdot \left(-\color{blue}{\frac{-1}{-1} \cdot \sin y}\right) \]

      17. distribute-lft-neg-in 96.6%

          \[\leadsto \frac{\frac{-x}{y}}{z} \cdot \color{blue}{\left(\left(-\frac{-1}{-1}\right) \cdot \sin y\right)} \]

      18. metadata-eval 96.6%

          \[\leadsto \frac{\frac{-x}{y}}{z} \cdot \left(\left(-\color{blue}{1}\right) \cdot \sin y\right) \]

      19. metadata-eval 96.6%

          \[\leadsto \frac{\frac{-x}{y}}{z} \cdot \left(\color{blue}{-1} \cdot \sin y\right) \]

      20. neg-mul-1 96.6%

          \[\leadsto \frac{\frac{-x}{y}}{z} \cdot \color{blue}{\left(-\sin y\right)} \]

      21. sin-neg 96.6%

          \[\leadsto \frac{\frac{-x}{y}}{z} \cdot \color{blue}{\sin \left(-y\right)} \]

      22. *-commutative 96.6%

          \[\leadsto \color{blue}{\sin \left(-y\right) \cdot \frac{\frac{-x}{y}}{z}} \]

   3. Simplified 96.6%

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

4. Final simplification 77.4%

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

Alternative 5: 99.3% 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 \cdot 10^{+77}:\\ \;\;\;\;\frac{x}{\frac{z_m}{t_0}}\\ \mathbf{else}:\\ \;\;\;\;t_0 \cdot \frac{x}{z_m}\\ \end{array} \end{array} \end{array} \]

FPCore

z_m = (fabs.f64 z)
z_s = (copysign.f64 1 z)
(FPCore (z_s x y z_m)
 :precision binary64
 (let* ((t_0 (/ (sin y) y)))
   (* z_s (if (<= z_m 4e+77) (/ x (/ z_m t_0)) (* t_0 (/ 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) {
	double t_0 = sin(y) / y;
	double tmp;
	if (z_m <= 4e+77) {
		tmp = x / (z_m / t_0);
	} else {
		tmp = t_0 * (x / 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 <= 4d+77) then
        tmp = x / (z_m / t_0)
    else
        tmp = t_0 * (x / 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 <= 4e+77) {
		tmp = x / (z_m / t_0);
	} else {
		tmp = t_0 * (x / 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 <= 4e+77:
		tmp = x / (z_m / t_0)
	else:
		tmp = t_0 * (x / 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 <= 4e+77)
		tmp = Float64(x / Float64(z_m / t_0));
	else
		tmp = Float64(t_0 * Float64(x / 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 <= 4e+77)
		tmp = x / (z_m / t_0);
	else
		tmp = t_0 * (x / 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, 4e+77], N[(x / N[(z$95$m / t$95$0), $MachinePrecision]), $MachinePrecision], N[(t$95$0 * N[(x / z$95$m), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < 3.99999999999999993e77

   1. Initial program 97.2%

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

      1. associate-/l* 97.7%

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

   3. Simplified 97.7%

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

   if 3.99999999999999993e77 < z

   1. Initial program 99.9%

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

      1. *-commutative 99.9%

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

      2. associate-*r/ 99.8%

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

   3. Simplified 99.8%

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

4. Final simplification 98.2%

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

Alternative 6: 62.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 13000:\\ \;\;\;\;\frac{x}{z_m}\\ \mathbf{else}:\\ \;\;\;\;\left(\frac{x}{z_m} + 1\right) + -1\\ \end{array} \end{array} \]

FPCore

z_m = (fabs.f64 z)
z_s = (copysign.f64 1 z)
(FPCore (z_s x y z_m)
 :precision binary64
 (* z_s (if (<= y 13000.0) (/ x z_m) (+ (+ (/ x z_m) 1.0) -1.0))))

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 <= 13000.0) {
		tmp = x / z_m;
	} else {
		tmp = ((x / z_m) + 1.0) + -1.0;
	}
	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 <= 13000.0d0) then
        tmp = x / z_m
    else
        tmp = ((x / z_m) + 1.0d0) + (-1.0d0)
    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 <= 13000.0) {
		tmp = x / z_m;
	} else {
		tmp = ((x / z_m) + 1.0) + -1.0;
	}
	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 <= 13000.0:
		tmp = x / z_m
	else:
		tmp = ((x / z_m) + 1.0) + -1.0
	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 <= 13000.0)
		tmp = Float64(x / z_m);
	else
		tmp = Float64(Float64(Float64(x / z_m) + 1.0) + -1.0);
	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 <= 13000.0)
		tmp = x / z_m;
	else
		tmp = ((x / z_m) + 1.0) + -1.0;
	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, 13000.0], N[(x / z$95$m), $MachinePrecision], N[(N[(N[(x / z$95$m), $MachinePrecision] + 1.0), $MachinePrecision] + -1.0), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if y < 13000

   1. Initial program 98.1%

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

   3. Taylor expanded in y around 0 71.0%

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

   if 13000 < y

   1. Initial program 96.3%

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

      1. associate-*r/ 95.5%

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

   5. Taylor expanded in y around 0 26.3%

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

      1. un-div-inv 26.3%

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

      2. clear-num 26.3%

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

   7. Applied egg-rr 26.3%

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

      1. expm1-log1p-u 24.0%

         \[\leadsto \color{blue}{\mathsf{expm1}\left(\mathsf{log1p}\left(\frac{1}{\frac{z}{x}}\right)\right)} \]

      2. expm1-udef 40.3%

         \[\leadsto \color{blue}{e^{\mathsf{log1p}\left(\frac{1}{\frac{z}{x}}\right)} - 1} \]

      3. log1p-udef 40.3%

         \[\leadsto e^{\color{blue}{\log \left(1 + \frac{1}{\frac{z}{x}}\right)}} - 1 \]

      4. rem-exp-log 42.6%

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

      5. clear-num 42.6%

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

   9. Applied egg-rr 42.6%

      \[\leadsto \color{blue}{\left(1 + \frac{x}{z}\right) - 1} \]
3. Recombined 2 regimes into one program.

4. Final simplification 64.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq 13000:\\ \;\;\;\;\frac{x}{z}\\ \mathbf{else}:\\ \;\;\;\;\left(\frac{x}{z} + 1\right) + -1\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 58.5% 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 1 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 97.7%

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

3. Taylor expanded in y around 0 61.0%

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

4. Final simplification 61.0%

   \[\leadsto \frac{x}{z} \]
5. 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 2024018 
(FPCore (x y z)
  :name "Linear.Quaternion:$ctanh from linear-1.19.1.3"
  :precision binary64

  :herbie-target
  (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))