Linear.Quaternion:$cexp from linear-1.19.1.3

Percentage Accurate: 99.8% → 99.8%

Time: 6.0s

Alternatives: 5

Speedup: 1.0×

Specification

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 99.8% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 99.8% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.9%

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

   1. lift-*.f64 N/A

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

   2. lift-/.f64 N/A

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

   3. clear-num N/A

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

   4. un-div-inv N/A

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

   5. lower-/.f64 N/A

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

   6. lower-/.f64 99.9

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

4. Applied rewrites 99.9%

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

Alternative 2: 65.1% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\frac{\sin y}{y} \leq 10^{-7}:\\ \;\;\;\;\frac{x}{\left(y \cdot y\right) \cdot 0.16666666666666666}\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(-0.16666666666666666 \cdot y, y, 1\right) \cdot x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= (/ (sin y) y) 1e-7)
   (/ x (* (* y y) 0.16666666666666666))
   (* (fma (* -0.16666666666666666 y) y 1.0) x)))

C

double code(double x, double y) {
	double tmp;
	if ((sin(y) / y) <= 1e-7) {
		tmp = x / ((y * y) * 0.16666666666666666);
	} else {
		tmp = fma((-0.16666666666666666 * y), y, 1.0) * x;
	}
	return tmp;
}

Julia

function code(x, y)
	tmp = 0.0
	if (Float64(sin(y) / y) <= 1e-7)
		tmp = Float64(x / Float64(Float64(y * y) * 0.16666666666666666));
	else
		tmp = Float64(fma(Float64(-0.16666666666666666 * y), y, 1.0) * x);
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (/.f64 (sin.f64 y) y) < 9.9999999999999995e-8

   1. Initial program 99.7%

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

      1. lift-*.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. clear-num N/A

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

      4. un-div-inv N/A

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

      5. lower-/.f64 N/A

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

      6. lower-/.f64 99.7

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

   4. Applied rewrites 99.7%

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

   5. Taylor expanded in y around 0

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

      1. +-commutative N/A

         \[\leadsto \frac{x}{\color{blue}{\frac{1}{6} \cdot {y}^{2} + 1}} \]

      2. lower-fma.f64 N/A

         \[\leadsto \frac{x}{\color{blue}{\mathsf{fma}\left(\frac{1}{6}, {y}^{2}, 1\right)}} \]

      3. unpow2 N/A

         \[\leadsto \frac{x}{\mathsf{fma}\left(\frac{1}{6}, \color{blue}{y \cdot y}, 1\right)} \]

      4. lower-*.f64 30.3

         \[\leadsto \frac{x}{\mathsf{fma}\left(0.16666666666666666, \color{blue}{y \cdot y}, 1\right)} \]

   7. Applied rewrites 30.3%

      \[\leadsto \frac{x}{\color{blue}{\mathsf{fma}\left(0.16666666666666666, y \cdot y, 1\right)}} \]

   8. Taylor expanded in y around inf

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

   10. Applied rewrites 30.3%

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

   if 9.9999999999999995e-8 < (/.f64 (sin.f64 y) y)

   1. Initial program 100.0%

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

   3. Taylor expanded in y around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

         \[\leadsto x \cdot \color{blue}{\mathsf{fma}\left({y}^{2}, \frac{-1}{6}, 1\right)} \]

      4. unpow2 N/A

         \[\leadsto x \cdot \mathsf{fma}\left(\color{blue}{y \cdot y}, \frac{-1}{6}, 1\right) \]

      5. lower-*.f64 99.5

         \[\leadsto x \cdot \mathsf{fma}\left(\color{blue}{y \cdot y}, -0.16666666666666666, 1\right) \]

   5. Applied rewrites 99.5%

      \[\leadsto x \cdot \color{blue}{\mathsf{fma}\left(y \cdot y, -0.16666666666666666, 1\right)} \]
   6. Step-by-step derivation

   7. Applied rewrites 99.5%

      \[\leadsto x \cdot \mathsf{fma}\left(-0.16666666666666666 \cdot y, \color{blue}{y}, 1\right) \]
3. Recombined 2 regimes into one program.

4. Final simplification 70.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{\sin y}{y} \leq 10^{-7}:\\ \;\;\;\;\frac{x}{\left(y \cdot y\right) \cdot 0.16666666666666666}\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(-0.16666666666666666 \cdot y, y, 1\right) \cdot x\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 99.8% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.9%

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

3. Final simplification 99.9%

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

Alternative 4: 65.1% accurate, 5.1× speedup

Math

\[\begin{array}{l} \\ \frac{x}{\mathsf{fma}\left(0.16666666666666666, y \cdot y, 1\right)} \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (/ x (fma 0.16666666666666666 (* y y) 1.0)))

C

double code(double x, double y) {
	return x / fma(0.16666666666666666, (y * y), 1.0);
}

Julia

function code(x, y)
	return Float64(x / fma(0.16666666666666666, Float64(y * y), 1.0))
end

Wolfram

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

Derivation

1. Initial program 99.9%

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

   1. lift-*.f64 N/A

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

   2. lift-/.f64 N/A

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

   3. clear-num N/A

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

   4. un-div-inv N/A

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

   5. lower-/.f64 N/A

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

   6. lower-/.f64 99.9

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

4. Applied rewrites 99.9%

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

5. Taylor expanded in y around 0

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

   1. +-commutative N/A

      \[\leadsto \frac{x}{\color{blue}{\frac{1}{6} \cdot {y}^{2} + 1}} \]

   2. lower-fma.f64 N/A

      \[\leadsto \frac{x}{\color{blue}{\mathsf{fma}\left(\frac{1}{6}, {y}^{2}, 1\right)}} \]

   3. unpow2 N/A

      \[\leadsto \frac{x}{\mathsf{fma}\left(\frac{1}{6}, \color{blue}{y \cdot y}, 1\right)} \]

   4. lower-*.f64 70.0

      \[\leadsto \frac{x}{\mathsf{fma}\left(0.16666666666666666, \color{blue}{y \cdot y}, 1\right)} \]

7. Applied rewrites 70.0%

   \[\leadsto \frac{x}{\color{blue}{\mathsf{fma}\left(0.16666666666666666, y \cdot y, 1\right)}} \]
8. Add Preprocessing

Alternative 5: 53.0% accurate, 19.5× speedup

Math

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

FPCore

(FPCore (x y) :precision binary64 (* 1.0 x))

C

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

Fortran

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

Java

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

Python

def code(x, y):
	return 1.0 * x

Julia

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

MATLAB

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

Wolfram

code[x_, y_] := N[(1.0 * x), $MachinePrecision]

Derivation

1. Initial program 99.9%

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

3. Taylor expanded in y around 0

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

5. Applied rewrites 59.0%

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

6. Final simplification 59.0%

   \[\leadsto 1 \cdot x \]
7. Add Preprocessing

Reproduce

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