Linear.Quaternion:$csinh from linear-1.19.1.3

Percentage Accurate: 99.9% → 99.9%

Time: 8.5s

Alternatives: 5

Speedup: 1.0×

• 50.1% 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. Add Preprocessing

Alternative 2: 86.2% accurate, 1.0× speedup

Math

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

FPCore

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

C

double code(double x, double y) {
	double tmp;
	if (cosh(x) <= 1.1) {
		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) <= 1.1d0) 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) <= 1.1) {
		tmp = Math.sin(y) / y;
	} else {
		tmp = Math.cosh(x);
	}
	return tmp;
}

Python

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

Julia

function code(x, y)
	tmp = 0.0
	if (cosh(x) <= 1.1)
		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) <= 1.1)
		tmp = sin(y) / y;
	else
		tmp = cosh(x);
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (cosh.f64 x) < 1.1000000000000001

   1. Initial program 99.9%

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

   3. Taylor expanded in x around 0 98.8%

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

   if 1.1000000000000001 < (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 78.7%

      \[\leadsto \cosh x \cdot \frac{\color{blue}{y}}{y} \]
   4. Step-by-step derivation

      1. *-inverses 78.7%

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

      2. *-rgt-identity 78.7%

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

      3. add-log-exp 78.7%

         \[\leadsto \color{blue}{\log \left(e^{\cosh x}\right)} \]

      4. *-un-lft-identity 78.7%

         \[\leadsto \log \color{blue}{\left(1 \cdot e^{\cosh x}\right)} \]

      5. log-prod 78.7%

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

      6. metadata-eval 78.7%

         \[\leadsto \color{blue}{0} + \log \left(e^{\cosh x}\right) \]

      7. add-log-exp 78.7%

         \[\leadsto 0 + \color{blue}{\cosh x} \]

   5. Applied egg-rr 78.7%

      \[\leadsto \color{blue}{0 + \cosh x} \]
   6. Step-by-step derivation

      1. +-lft-identity 78.7%

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

   7. Simplified 78.7%

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

Alternative 3: 62.1% 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 67.4%

   \[\leadsto \cosh x \cdot \frac{\color{blue}{y}}{y} \]
4. Step-by-step derivation

   1. *-inverses 67.4%

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

   2. *-rgt-identity 67.4%

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

   3. add-log-exp 67.4%

      \[\leadsto \color{blue}{\log \left(e^{\cosh x}\right)} \]

   4. *-un-lft-identity 67.4%

      \[\leadsto \log \color{blue}{\left(1 \cdot e^{\cosh x}\right)} \]

   5. log-prod 67.4%

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

   6. metadata-eval 67.4%

      \[\leadsto \color{blue}{0} + \log \left(e^{\cosh x}\right) \]

   7. add-log-exp 67.4%

      \[\leadsto 0 + \color{blue}{\cosh x} \]

5. Applied egg-rr 67.4%

   \[\leadsto \color{blue}{0 + \cosh x} \]
6. Step-by-step derivation

   1. +-lft-identity 67.4%

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

7. Simplified 67.4%

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

Alternative 4: 32.1% accurate, 29.3× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_] := N[(1.0 + N[(N[(y * y), $MachinePrecision] * -0.16666666666666666), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 99.9%

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

   1. *-commutative 99.9%

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

   2. associate-*l/ 99.9%

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

   3. associate-/l* 99.8%

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

3. Simplified 99.8%

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

5. Taylor expanded in x around 0 53.0%

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

6. Taylor expanded in y around 0 36.0%

   \[\leadsto \color{blue}{1 + -0.16666666666666666 \cdot {y}^{2}} \]
7. Step-by-step derivation

   1. *-commutative 36.0%

      \[\leadsto 1 + \color{blue}{{y}^{2} \cdot -0.16666666666666666} \]

8. Simplified 36.0%

   \[\leadsto \color{blue}{1 + {y}^{2} \cdot -0.16666666666666666} \]
9. Step-by-step derivation

   1. unpow2 36.0%

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

10. Applied egg-rr 36.0%

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

Alternative 5: 25.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 y around 0 67.4%

   \[\leadsto \cosh x \cdot \frac{\color{blue}{y}}{y} \]
4. Step-by-step derivation

   1. *-inverses 67.4%

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

   2. *-rgt-identity 67.4%

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

   3. add-log-exp 67.4%

      \[\leadsto \color{blue}{\log \left(e^{\cosh x}\right)} \]

   4. *-un-lft-identity 67.4%

      \[\leadsto \log \color{blue}{\left(1 \cdot e^{\cosh x}\right)} \]

   5. log-prod 67.4%

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

   6. metadata-eval 67.4%

      \[\leadsto \color{blue}{0} + \log \left(e^{\cosh x}\right) \]

   7. add-log-exp 67.4%

      \[\leadsto 0 + \color{blue}{\cosh x} \]

5. Applied egg-rr 67.4%

   \[\leadsto \color{blue}{0 + \cosh x} \]
6. Step-by-step derivation

   1. +-lft-identity 67.4%

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

7. Simplified 67.4%

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

8. Taylor expanded in x around 0 31.2%

   \[\leadsto \color{blue}{1} \]
9. Add Preprocessing

Developer Target 1: 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 2024145 
(FPCore (x y)
  :name "Linear.Quaternion:$csinh from linear-1.19.1.3"
  :precision binary64

  :alt
  (! :herbie-platform default (/ (* (cosh x) (sin y)) y))

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