Linear.Quaternion:$csinh from linear-1.19.1.3

Percentage Accurate: 99.9% → 99.9%

Time: 6.5s

Alternatives: 4

Speedup: 1.0×

• 49.5% of points produce a very large (infinite) output. You may want to add a precondition.

Specification

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 99.9% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 99.9% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.9%

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

3. Final simplification 99.9%

   \[\leadsto \cosh x \cdot \frac{\sin y}{y} \]
4. Add Preprocessing

Alternative 2: 87.2% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\cosh x \leq 42:\\ \;\;\;\;\frac{\sin y}{y}\\ \mathbf{else}:\\ \;\;\;\;\cosh x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= (cosh x) 42.0) (/ (sin y) y) (cosh x)))

C

double code(double x, double y) {
	double tmp;
	if (cosh(x) <= 42.0) {
		tmp = sin(y) / y;
	} else {
		tmp = cosh(x);
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if (cosh(x) <= 42.0d0) then
        tmp = sin(y) / y
    else
        tmp = cosh(x)
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if (Math.cosh(x) <= 42.0) {
		tmp = Math.sin(y) / y;
	} else {
		tmp = Math.cosh(x);
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if math.cosh(x) <= 42.0:
		tmp = math.sin(y) / y
	else:
		tmp = math.cosh(x)
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (cosh(x) <= 42.0)
		tmp = Float64(sin(y) / y);
	else
		tmp = cosh(x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (cosh(x) <= 42.0)
		tmp = sin(y) / y;
	else
		tmp = cosh(x);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[N[Cosh[x], $MachinePrecision], 42.0], N[(N[Sin[y], $MachinePrecision] / y), $MachinePrecision], N[Cosh[x], $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (cosh.f64 x) < 42

   1. Initial program 99.8%

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

   3. Taylor expanded in x around 0 97.8%

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

   if 42 < (cosh.f64 x)

   1. Initial program 100.0%

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

   3. Taylor expanded in y around 0 74.8%

      \[\leadsto \cosh x \cdot \color{blue}{1} \]
3. Recombined 2 regimes into one program.

4. Final simplification 86.4%

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

Alternative 3: 63.5% accurate, 2.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.9%

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

3. Taylor expanded in y around 0 63.5%

   \[\leadsto \cosh x \cdot \color{blue}{1} \]

4. Final simplification 63.5%

   \[\leadsto \cosh x \]
5. Add Preprocessing

Alternative 4: 26.7% accurate, 205.0× speedup

Math

\[\begin{array}{l} \\ 1 \end{array} \]

FPCore

(FPCore (x y) :precision binary64 1.0)

C

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

Fortran

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

Java

public static double code(double x, double y) {
	return 1.0;
}

Python

def code(x, y):
	return 1.0

Julia

function code(x, y)
	return 1.0
end

MATLAB

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

Wolfram

code[x_, y_] := 1.0

Derivation

1. Initial program 99.9%

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

3. Taylor expanded in x around 0 50.6%

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

4. Taylor expanded in y around 0 27.6%

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

5. Final simplification 27.6%

   \[\leadsto 1 \]
6. Add Preprocessing

Developer target: 99.9% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Reproduce

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

  :alt
  (/ (* (cosh x) (sin y)) y)

  (* (cosh x) (/ (sin y) y)))