Linear.Quaternion:$cexp from linear-1.19.1.3

Percentage Accurate: 99.8% → 99.7%

Time: 4.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.7% 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.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. 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.1% accurate, 10.5× speedup

Math

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

FPCore

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

C

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

Python

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < 1.5e-6

   1. Initial program 99.9%

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

   3. Taylor expanded in y around 0 70.8%

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

   if 1.5e-6 < y

   1. Initial program 99.5%

      \[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.1%

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

      1. *-commutative 5.1%

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

   7. Simplified 5.1%

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

      1. associate-/l* 29.5%

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

      2. *-commutative 29.5%

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

   9. Applied egg-rr 29.5%

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

4. Final simplification 59.7%

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

Alternative 4: 57.4% accurate, 10.5× speedup

Math

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

FPCore

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

C

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

Python

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < 1.2e12

   1. Initial program 99.8%

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

   3. Taylor expanded in y around 0 69.8%

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

   if 1.2e12 < y

   1. Initial program 99.6%

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

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

      1. *-commutative 3.9%

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

   7. Simplified 3.9%

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

      1. associate-/l* 29.9%

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

      2. *-commutative 29.9%

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

   9. Applied egg-rr 29.9%

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

       1. associate-*l/ 3.9%

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

       2. associate-/l* 4.1%

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

       3. un-div-inv 4.1%

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

       4. rgt-mult-inverse 4.1%

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

       5. *-commutative 4.1%

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

       6. *-un-lft-identity 4.1%

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

       7. remove-double-div 4.1%

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

       8. unpow-1 4.1%

          \[\leadsto \color{blue}{{\left(\frac{1}{x}\right)}^{-1}} \]

   11. Applied egg-rr 4.1%

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

       1. unpow-1 4.1%

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

       2. clear-num 4.1%

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

       3. div-inv 4.1%

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

       4. metadata-eval 4.1%

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

       5. rgt-mult-inverse 4.1%

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

       6. *-commutative 4.1%

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

       7. associate-*l* 29.9%

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

       8. div-inv 29.9%

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

       9. clear-num 31.3%

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

       10. associate-*l/ 31.3%

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

       11. *-un-lft-identity 31.3%

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

   13. Applied egg-rr 31.3%

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

4. Final simplification 60.0%

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

Alternative 5: 51.8% 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.1%

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

4. Final simplification 53.1%

   \[\leadsto x \]
5. Add Preprocessing

Reproduce

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