Linear.Quaternion:$ccos from linear-1.19.1.3

Percentage Accurate: 100.0% → 100.0%

Time: 6.9s

Alternatives: 5

Speedup: 1.0×

• 48.6% 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: 87.6% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{\sinh y}{y}\\ \mathbf{if}\;t\_0 \leq 1.000000002:\\ \;\;\;\;\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 1.000000002) (sin x) (* x t_0))))

C

double code(double x, double y) {
	double t_0 = sinh(y) / y;
	double tmp;
	if (t_0 <= 1.000000002) {
		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 <= 1.000000002d0) 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 <= 1.000000002) {
		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 <= 1.000000002:
		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 <= 1.000000002)
		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 <= 1.000000002)
		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, 1.000000002], N[Sin[x], $MachinePrecision], N[(x * t$95$0), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

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

   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 1.00000000199999994 < (/.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 65.8%

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

Alternative 3: 55.1% accurate, 1.9× speedup

Math

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

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= y 2.05e+33) (sin x) (* x (+ 1.0 (* (* x x) -0.16666666666666666)))))

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < 2.04999999999999997e33

   1. Initial program 100.0%

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

   3. Taylor expanded in y around 0 70.9%

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

   if 2.04999999999999997e33 < y

   1. Initial program 100.0%

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

   3. Taylor expanded in y around 0 2.8%

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

   4. Taylor expanded in x around 0 24.4%

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

      1. *-commutative 24.4%

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

   6. Simplified 24.4%

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

      1. unpow2 24.4%

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

   8. Applied egg-rr 24.4%

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

Alternative 4: 33.6% accurate, 22.8× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_] := N[(x * N[(1.0 + N[(N[(x * x), $MachinePrecision] * -0.16666666666666666), $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 55.8%

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

4. Taylor expanded in x around 0 36.3%

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

   1. *-commutative 36.3%

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

6. Simplified 36.3%

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

   1. unpow2 36.3%

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

8. Applied egg-rr 36.3%

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

Alternative 5: 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. Add Preprocessing

3. Taylor expanded in x around 0 56.1%

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

4. Taylor expanded in y around 0 27.2%

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

Reproduce

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