Linear.Quaternion:$cexp from linear-1.19.1.3

Percentage Accurate: 99.8% → 99.8%

Time: 10.0s

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. Add Preprocessing

Alternative 2: 58.1% accurate, 7.5× speedup

Math

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

FPCore

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

C

double code(double x, double y) {
	double tmp;
	if (y <= 7.5e-6) {
		tmp = x;
	} else {
		tmp = y * (y / (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 <= 7.5d-6) then
        tmp = x
    else
        tmp = y * (y / (y * (y / x)))
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < 7.50000000000000019e-6

   1. Initial program 99.8%

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

   3. Taylor expanded in y around 0 64.1%

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

   if 7.50000000000000019e-6 < y

   1. Initial program 99.7%

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

   3. Taylor expanded in x around 0 99.7%

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

      1. associate-*l/ 99.6%

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

      2. *-commutative 99.6%

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

   5. Simplified 99.6%

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

   6. Taylor expanded in y around 0 22.0%

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

      1. clear-num 22.8%

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

      2. associate-/r/ 22.0%

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

   8. Applied egg-rr 22.0%

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

      1. associate-/r/ 22.8%

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

      2. lft-mult-inverse 22.8%

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

      3. *-commutative 22.8%

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

      4. associate-*l/ 22.8%

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

      5. frac-times 23.5%

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

      6. *-commutative 23.5%

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

      7. *-un-lft-identity 23.5%

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

   10. Applied egg-rr 23.5%

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

4. Final simplification 53.2%

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

Alternative 3: 57.9% accurate, 8.7× speedup

Math

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

FPCore

(FPCore (x y) :precision binary64 (if (<= y 3.2e-17) x (/ y (* y (/ 1.0 x)))))

C

double code(double x, double y) {
	double tmp;
	if (y <= 3.2e-17) {
		tmp = x;
	} else {
		tmp = y / (y * (1.0 / 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 <= 3.2d-17) then
        tmp = x
    else
        tmp = y / (y * (1.0d0 / x))
    end if
    code = tmp
end function

Java

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

Python

def code(x, y):
	tmp = 0
	if y <= 3.2e-17:
		tmp = x
	else:
		tmp = y / (y * (1.0 / x))
	return tmp

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < 3.2000000000000002e-17

   1. Initial program 99.8%

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

   3. Taylor expanded in y around 0 63.5%

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

   if 3.2000000000000002e-17 < y

   1. Initial program 99.7%

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

   3. Taylor expanded in x around 0 99.7%

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

      1. associate-*l/ 99.6%

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

      2. *-commutative 99.6%

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

   5. Simplified 99.6%

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

   6. Taylor expanded in y around 0 26.0%

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

      1. clear-num 26.8%

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

      2. un-div-inv 26.8%

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

   8. Applied egg-rr 26.8%

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

      1. clear-num 26.7%

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

      2. associate-/r/ 26.8%

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

   10. Applied egg-rr 26.8%

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

4. Final simplification 53.0%

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

Alternative 4: 57.9% accurate, 10.5× speedup

Math

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

FPCore

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

C

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

Python

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < 5.00000000000000041e-6

   1. Initial program 99.8%

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

   3. Taylor expanded in y around 0 64.1%

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

   if 5.00000000000000041e-6 < y

   1. Initial program 99.7%

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

   3. Taylor expanded in x around 0 99.7%

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

      1. associate-*l/ 99.6%

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

      2. *-commutative 99.6%

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

   5. Simplified 99.6%

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

   6. Taylor expanded in y around 0 22.0%

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

      1. clear-num 22.8%

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

      2. un-div-inv 22.8%

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

   8. Applied egg-rr 22.8%

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

Alternative 5: 57.4% accurate, 10.5× speedup

Math

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

FPCore

(FPCore (x y) :precision binary64 (if (<= y 2.5e+58) x (* y (/ x y))))

C

double code(double x, double y) {
	double tmp;
	if (y <= 2.5e+58) {
		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 <= 2.5d+58) 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 <= 2.5e+58) {
		tmp = x;
	} else {
		tmp = y * (x / y);
	}
	return tmp;
}

Python

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < 2.49999999999999993e58

   1. Initial program 99.8%

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

   3. Taylor expanded in y around 0 60.1%

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

   if 2.49999999999999993e58 < y

   1. Initial program 99.7%

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

   3. Taylor expanded in x around 0 99.7%

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

      1. associate-*l/ 99.7%

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

      2. *-commutative 99.7%

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

   5. Simplified 99.7%

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

   6. Taylor expanded in y around 0 26.2%

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

Alternative 6: 52.4% 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 48.0%

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

Reproduce

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