Linear.Quaternion:$cexp from linear-1.19.1.3

Percentage Accurate: 99.8% → 99.8%

Time: 6.3s

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} \\ 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, 10.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq 5000:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;y \cdot \frac{x}{y}\\ \end{array} \end{array} \]

FPCore

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

C

double code(double x, double y) {
	double tmp;
	if (y <= 5000.0) {
		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 <= 5000.0d0) 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 <= 5000.0) {
		tmp = x;
	} else {
		tmp = y * (x / y);
	}
	return tmp;
}

Python

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < 5e3

   1. Initial program 99.9%

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

   3. Taylor expanded in y around 0 75.2%

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

   if 5e3 < y

   1. Initial program 99.7%

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

      1. *-commutative 99.7%

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

      2. associate-*l/ 99.6%

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

   4. Applied egg-rr 99.6%

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

   5. Taylor expanded in y around 0 4.4%

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

      1. associate-/l* 4.5%

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

      2. associate-/r/ 27.8%

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

   7. Applied egg-rr 27.8%

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

4. Final simplification 61.9%

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

Alternative 3: 57.9% accurate, 10.5× speedup

Math

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

FPCore

(FPCore (x y) :precision binary64 (if (<= y 5000.0) x (/ y (/ y x))))

C

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

Python

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < 5e3

   1. Initial program 99.9%

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

   3. Taylor expanded in y around 0 75.2%

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

   if 5e3 < y

   1. Initial program 99.7%

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

      1. *-commutative 99.7%

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

      2. associate-*l/ 99.6%

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

   4. Applied egg-rr 99.6%

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

   5. Taylor expanded in y around 0 4.4%

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

      1. clear-num 4.4%

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

      2. associate-/r/ 4.4%

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

   7. Applied egg-rr 4.4%

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

      1. associate-*l/ 4.4%

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

      2. *-un-lft-identity 4.4%

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

      3. *-commutative 4.4%

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

      4. associate-/l* 33.9%

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

   9. Applied egg-rr 33.9%

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

4. Final simplification 63.6%

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

Alternative 4: 64.1% 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. Step-by-step derivation

   1. associate-*r/ 88.9%

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

   2. associate-/l* 99.8%

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

3. Simplified 99.8%

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

   1. clear-num 99.8%

      \[\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 68.1%

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

   1. *-commutative 68.1%

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

   2. distribute-lft-in 68.1%

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

   3. div-inv 68.3%

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

   4. *-inverses 68.3%

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

9. Applied egg-rr 68.3%

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

10. Final simplification 68.3%

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

Alternative 5: 52.3% 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 55.3%

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

4. Final simplification 55.3%

   \[\leadsto x \]
5. Add Preprocessing

Reproduce

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