Linear.Quaternion:$cexp from linear-1.19.1.3

Percentage Accurate: 99.8% → 99.8%

Time: 7.1s

Alternatives: 6

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} \\ 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]

Derivation

1. Initial program 99.8%

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

3. Final simplification 99.8%

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

Alternative 2: 57.6% accurate, 8.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq 2.5:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{y \cdot \left(y \cdot 0.16666666666666666\right)}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= y 2.5) x (/ x (* y (* y 0.16666666666666666)))))

C

double code(double x, double y) {
	double tmp;
	if (y <= 2.5) {
		tmp = x;
	} else {
		tmp = x / (y * (y * 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.5d0) then
        tmp = x
    else
        tmp = x / (y * (y * 0.16666666666666666d0))
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if (y <= 2.5) {
		tmp = x;
	} else {
		tmp = x / (y * (y * 0.16666666666666666));
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if y <= 2.5:
		tmp = x
	else:
		tmp = x / (y * (y * 0.16666666666666666))
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (y <= 2.5)
		tmp = x;
	else
		tmp = Float64(x / Float64(y * Float64(y * 0.16666666666666666)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (y <= 2.5)
		tmp = x;
	else
		tmp = x / (y * (y * 0.16666666666666666));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[y, 2.5], x, N[(x / N[(y * N[(y * 0.16666666666666666), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < 2.5

   1. Initial program 99.9%

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

   3. Taylor expanded in y around 0 66.4%

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

   if 2.5 < y

   1. Initial program 99.7%

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

      1. clear-num 99.5%

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

      2. un-div-inv 99.7%

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

   4. Applied egg-rr 99.7%

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

      1. clear-num 99.5%

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

      2. associate-/r/ 99.4%

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

   6. Applied egg-rr 99.4%

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

   7. Taylor expanded in y around 0 27.0%

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

   8. Taylor expanded in y around inf 27.0%

      \[\leadsto \frac{x}{\color{blue}{\left(0.16666666666666666 \cdot y\right)} \cdot y} \]
   9. Step-by-step derivation

      1. *-commutative 27.0%

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

   10. Simplified 27.0%

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

4. Final simplification 54.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq 2.5:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{y \cdot \left(y \cdot 0.16666666666666666\right)}\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 56.9% accurate, 10.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq 10^{-6}:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;y \cdot \frac{x}{y}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (if (<= y 1e-6) x (* y (/ x y))))

C

double code(double x, double y) {
	double tmp;
	if (y <= 1e-6) {
		tmp = x;
	} else {
		tmp = y * (x / y);
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if (y <= 1d-6) then
        tmp = x
    else
        tmp = y * (x / y)
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if (y <= 1e-6) {
		tmp = x;
	} else {
		tmp = y * (x / y);
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if y <= 1e-6:
		tmp = x
	else:
		tmp = y * (x / y)
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (y <= 1e-6)
		tmp = x;
	else
		tmp = Float64(y * Float64(x / y));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (y <= 1e-6)
		tmp = x;
	else
		tmp = y * (x / y);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[y, 1e-6], x, N[(y * N[(x / y), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < 9.99999999999999955e-7

   1. Initial program 99.9%

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

   3. Taylor expanded in y around 0 66.6%

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

   if 9.99999999999999955e-7 < y

   1. Initial program 99.7%

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

      1. associate-*r/ 99.6%

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

   3. Simplified 99.6%

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

   5. Taylor expanded in y around 0 4.5%

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

      1. *-commutative 4.5%

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

   7. Simplified 4.5%

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

      1. associate-/l* 24.8%

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

      2. *-commutative 24.8%

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

   9. Applied egg-rr 24.8%

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

4. Final simplification 53.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq 10^{-6}:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;y \cdot \frac{x}{y}\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 57.3% accurate, 10.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq 5.8 \cdot 10^{-8}:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;\frac{y}{\frac{y}{x}}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (if (<= y 5.8e-8) x (/ y (/ y x))))

C

double code(double x, double y) {
	double tmp;
	if (y <= 5.8e-8) {
		tmp = x;
	} else {
		tmp = y / (y / x);
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if (y <= 5.8d-8) then
        tmp = x
    else
        tmp = y / (y / x)
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if (y <= 5.8e-8) {
		tmp = x;
	} else {
		tmp = y / (y / x);
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if y <= 5.8e-8:
		tmp = x
	else:
		tmp = y / (y / x)
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (y <= 5.8e-8)
		tmp = x;
	else
		tmp = Float64(y / Float64(y / x));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (y <= 5.8e-8)
		tmp = x;
	else
		tmp = y / (y / x);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[y, 5.8e-8], x, N[(y / N[(y / x), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < 5.8000000000000003e-8

   1. Initial program 99.9%

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

   3. Taylor expanded in y around 0 66.5%

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

   if 5.8000000000000003e-8 < y

   1. Initial program 99.7%

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

      1. associate-*r/ 99.6%

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

   3. Simplified 99.6%

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

   5. Taylor expanded in y around 0 5.6%

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

      1. *-commutative 5.6%

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

   7. Simplified 5.6%

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

      1. associate-/l* 25.6%

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

      2. *-commutative 25.6%

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

   9. Applied egg-rr 25.6%

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

       1. *-commutative 25.6%

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

       2. clear-num 26.9%

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

       3. un-div-inv 26.9%

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

   11. Applied egg-rr 26.9%

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

4. Final simplification 54.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq 5.8 \cdot 10^{-8}:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;\frac{y}{\frac{y}{x}}\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 63.8% accurate, 11.7× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.8%

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

   1. clear-num 99.8%

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

   2. un-div-inv 99.8%

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

4. Applied egg-rr 99.8%

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

   1. clear-num 99.7%

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

   2. associate-/r/ 99.6%

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

6. Applied egg-rr 99.6%

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

7. Taylor expanded in y around 0 58.9%

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

   1. *-commutative 58.9%

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

   2. distribute-lft-in 58.9%

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

   3. *-commutative 58.9%

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

   4. div-inv 59.0%

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

   5. *-inverses 59.0%

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

9. Applied egg-rr 59.0%

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

10. Final simplification 59.0%

    \[\leadsto \frac{x}{y \cdot \left(y \cdot 0.16666666666666666\right) + 1} \]
11. Add Preprocessing

Alternative 6: 51.9% accurate, 105.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 99.8%

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

3. Taylor expanded in y around 0 47.5%

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

4. Final simplification 47.5%

   \[\leadsto x \]
5. Add Preprocessing

Reproduce

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