Linear.Quaternion:$ccos from linear-1.19.1.3

Percentage Accurate: 100.0% → 100.0%

Time: 4.0s

Alternatives: 4

Speedup: 1.0×

• 49.9% 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. Final simplification 100.0%

   \[\leadsto \sin x \cdot \frac{\sinh y}{y} \]

Alternative 2: 86.8% 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. Taylor expanded in y around 0 99.1%

      \[\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. Step-by-step derivation

      1. *-commutative 100.0%

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

      2. associate-/r/ 73.6%

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

   3. Simplified 73.6%

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

   4. Taylor expanded in x around 0 44.0%

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

      1. associate-/r/ 69.6%

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

   6. Applied egg-rr 69.6%

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

4. Final simplification 84.7%

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

Alternative 3: 50.4% accurate, 2.0× speedup

Math

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

FPCore

(FPCore (x y) :precision binary64 (sin x))

C

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

Fortran

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

Java

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

Python

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

Julia

function code(x, y)
	return sin(x)
end

MATLAB

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

Wolfram

code[x_, y_] := N[Sin[x], $MachinePrecision]

Derivation

1. Initial program 100.0%

   \[\sin x \cdot \frac{\sinh y}{y} \]

2. Taylor expanded in y around 0 52.1%

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

3. Final simplification 52.1%

   \[\leadsto \sin x \]

Alternative 4: 26.5% 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. Step-by-step derivation

   1. *-commutative 100.0%

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

   2. associate-/r/ 87.0%

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

3. Simplified 87.0%

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

4. Taylor expanded in x around 0 46.3%

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

5. Taylor expanded in y around 0 26.3%

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

6. Final simplification 26.3%

   \[\leadsto x \]

Reproduce

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