Linear.Quaternion:$ctanh from linear-1.19.1.3

Percentage Accurate: 95.9% → 98.9%

Time: 9.5s

Alternatives: 9

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: 95.9% 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: 98.9% accurate, 1.0× speedup

Math

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

FPCore

x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
(FPCore (x_s x_m y z)
 :precision binary64
 (let* ((t_0 (/ (sin y) y)))
   (* x_s (if (<= x_m 1e-140) (* (/ x_m z) t_0) (/ (* t_0 x_m) z)))))

C

x\_m = fabs(x);
x\_s = copysign(1.0, x);
double code(double x_s, double x_m, double y, double z) {
	double t_0 = sin(y) / y;
	double tmp;
	if (x_m <= 1e-140) {
		tmp = (x_m / z) * t_0;
	} else {
		tmp = (t_0 * x_m) / z;
	}
	return x_s * tmp;
}

Fortran

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

Java

x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
public static double code(double x_s, double x_m, double y, double z) {
	double t_0 = Math.sin(y) / y;
	double tmp;
	if (x_m <= 1e-140) {
		tmp = (x_m / z) * t_0;
	} else {
		tmp = (t_0 * x_m) / z;
	}
	return x_s * tmp;
}

Python

x\_m = math.fabs(x)
x\_s = math.copysign(1.0, x)
def code(x_s, x_m, y, z):
	t_0 = math.sin(y) / y
	tmp = 0
	if x_m <= 1e-140:
		tmp = (x_m / z) * t_0
	else:
		tmp = (t_0 * x_m) / z
	return x_s * tmp

Julia

x\_m = abs(x)
x\_s = copysign(1.0, x)
function code(x_s, x_m, y, z)
	t_0 = Float64(sin(y) / y)
	tmp = 0.0
	if (x_m <= 1e-140)
		tmp = Float64(Float64(x_m / z) * t_0);
	else
		tmp = Float64(Float64(t_0 * x_m) / z);
	end
	return Float64(x_s * tmp)
end

MATLAB

x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
function tmp_2 = code(x_s, x_m, y, z)
	t_0 = sin(y) / y;
	tmp = 0.0;
	if (x_m <= 1e-140)
		tmp = (x_m / z) * t_0;
	else
		tmp = (t_0 * x_m) / z;
	end
	tmp_2 = x_s * tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x < 9.9999999999999998e-141

   1. Initial program 89.3%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. *-commutative N/A

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

      4. associate-/l* N/A

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

      5. lower-*.f64 N/A

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

      6. lower-/.f64 99.9

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

   4. Applied rewrites 99.9%

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

   if 9.9999999999999998e-141 < x

   1. Initial program 99.8%

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

4. Final simplification 99.8%

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

Alternative 2: 93.3% accurate, 0.5× speedup

Math

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

FPCore

x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
(FPCore (x_s x_m y z)
 :precision binary64
 (let* ((t_0 (/ (sin y) y)))
   (*
    x_s
    (if (<= (/ (* t_0 x_m) z) -100000000.0)
      (* (/ x_m (* z y)) (sin y))
      (* (/ x_m z) t_0)))))

C

x\_m = fabs(x);
x\_s = copysign(1.0, x);
double code(double x_s, double x_m, double y, double z) {
	double t_0 = sin(y) / y;
	double tmp;
	if (((t_0 * x_m) / z) <= -100000000.0) {
		tmp = (x_m / (z * y)) * sin(y);
	} else {
		tmp = (x_m / z) * t_0;
	}
	return x_s * tmp;
}

Fortran

x\_m = abs(x)
x\_s = copysign(1.0d0, x)
real(8) function code(x_s, x_m, y, z)
    real(8), intent (in) :: x_s
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: t_0
    real(8) :: tmp
    t_0 = sin(y) / y
    if (((t_0 * x_m) / z) <= (-100000000.0d0)) then
        tmp = (x_m / (z * y)) * sin(y)
    else
        tmp = (x_m / z) * t_0
    end if
    code = x_s * tmp
end function

Java

x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
public static double code(double x_s, double x_m, double y, double z) {
	double t_0 = Math.sin(y) / y;
	double tmp;
	if (((t_0 * x_m) / z) <= -100000000.0) {
		tmp = (x_m / (z * y)) * Math.sin(y);
	} else {
		tmp = (x_m / z) * t_0;
	}
	return x_s * tmp;
}

Python

x\_m = math.fabs(x)
x\_s = math.copysign(1.0, x)
def code(x_s, x_m, y, z):
	t_0 = math.sin(y) / y
	tmp = 0
	if ((t_0 * x_m) / z) <= -100000000.0:
		tmp = (x_m / (z * y)) * math.sin(y)
	else:
		tmp = (x_m / z) * t_0
	return x_s * tmp

Julia

x\_m = abs(x)
x\_s = copysign(1.0, x)
function code(x_s, x_m, y, z)
	t_0 = Float64(sin(y) / y)
	tmp = 0.0
	if (Float64(Float64(t_0 * x_m) / z) <= -100000000.0)
		tmp = Float64(Float64(x_m / Float64(z * y)) * sin(y));
	else
		tmp = Float64(Float64(x_m / z) * t_0);
	end
	return Float64(x_s * tmp)
end

MATLAB

x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
function tmp_2 = code(x_s, x_m, y, z)
	t_0 = sin(y) / y;
	tmp = 0.0;
	if (((t_0 * x_m) / z) <= -100000000.0)
		tmp = (x_m / (z * y)) * sin(y);
	else
		tmp = (x_m / z) * t_0;
	end
	tmp_2 = x_s * tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (/.f64 (*.f64 x (/.f64 (sin.f64 y) y)) z) < -1e8

   1. Initial program 99.8%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. *-commutative N/A

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

      4. lift-/.f64 N/A

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

      5. div-inv N/A

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

      6. associate-*l* N/A

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

      7. associate-/l* N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. associate-*l/ N/A

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

      11. *-lft-identity N/A

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

      12. associate-/l/ N/A

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

      13. lower-/.f64 N/A

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

      14. lower-*.f64 74.8

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

   4. Applied rewrites 74.8%

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

   if -1e8 < (/.f64 (*.f64 x (/.f64 (sin.f64 y) y)) z)

   1. Initial program 95.0%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. *-commutative N/A

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

      4. associate-/l* N/A

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

      5. lower-*.f64 N/A

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

      6. lower-/.f64 97.7

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

   4. Applied rewrites 97.7%

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

4. Final simplification 93.3%

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

Developer Target 1: 99.6% accurate, 0.8× 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 2024230 
(FPCore (x y z)
  :name "Linear.Quaternion:$ctanh from linear-1.19.1.3"
  :precision binary64

  :alt
  (! :herbie-platform default (if (< z -42173720203427147/1000000000000000000000000000000000000000000000) (/ (* x (/ 1 (/ y (sin y)))) z) (if (< z 44467023691138110000000000000000000000000000000000000000000000000) (/ x (* z (/ y (sin y)))) (/ (* x (/ 1 (/ y (sin y)))) z))))

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