Linear.Quaternion:$cexp from linear-1.19.1.3

Percentage Accurate: 99.8% → 99.8%

Time: 6.9s

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.8%

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

   1. clear-num 99.7%

      \[\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. Final simplification 99.8%

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

Alternative 2: 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 3: 57.7% accurate, 10.5× speedup

Math

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

FPCore

(FPCore (x y) :precision binary64 (if (<= y 2e-7) x (* y (/ x y))))

C

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

Python

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < 1.9999999999999999e-7

   1. Initial program 99.8%

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

   3. Taylor expanded in y around 0 69.3%

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

   if 1.9999999999999999e-7 < y

   1. Initial program 99.5%

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

   3. Taylor expanded in x around 0 99.4%

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

      1. associate-*l/ 99.4%

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

      2. *-commutative 99.4%

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

   5. Simplified 99.4%

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

   6. Taylor expanded in y around 0 15.8%

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

4. Final simplification 56.0%

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

Alternative 4: 57.9% accurate, 10.5× speedup

Math

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

FPCore

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

C

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

Python

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < 9.99999999999999908e-22

   1. Initial program 99.8%

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

   3. Taylor expanded in y around 0 68.9%

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

   if 9.99999999999999908e-22 < y

   1. Initial program 99.6%

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

   3. Taylor expanded in x around 0 99.4%

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

      1. associate-*l/ 99.5%

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

      2. *-commutative 99.5%

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

   5. Simplified 99.5%

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

   6. Taylor expanded in y around 0 19.6%

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

      1. clear-num 20.9%

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

      2. un-div-inv 20.9%

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

   8. Applied egg-rr 20.9%

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

4. Final simplification 56.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq 10^{-21}:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;\frac{y}{\frac{y}{x}}\\ \end{array} \]
5. 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 53.0%

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

4. Final simplification 53.0%

   \[\leadsto x \]
5. Add Preprocessing

Reproduce

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