Linear.Quaternion:$cexp from linear-1.19.1.3

Percentage Accurate: 99.8% → 99.8%

Time: 6.2s

Alternatives: 9

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

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

Alternative 2: 57.3% accurate, 9.5× speedup

Math

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

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= y 2.4)
   (* x (+ 1.0 (* (* y y) -0.16666666666666666)))
   (* x (/ 6.0 (* y y)))))

C

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

Java

public static double code(double x, double y) {
	double tmp;
	if (y <= 2.4) {
		tmp = x * (1.0 + ((y * y) * -0.16666666666666666));
	} else {
		tmp = x * (6.0 / (y * y));
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if y <= 2.4:
		tmp = x * (1.0 + ((y * y) * -0.16666666666666666))
	else:
		tmp = x * (6.0 / (y * y))
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (y <= 2.4)
		tmp = Float64(x * Float64(1.0 + Float64(Float64(y * y) * -0.16666666666666666)));
	else
		tmp = Float64(x * Float64(6.0 / Float64(y * y)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (y <= 2.4)
		tmp = x * (1.0 + ((y * y) * -0.16666666666666666));
	else
		tmp = x * (6.0 / (y * y));
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < 2.39999999999999991

   1. Initial program 99.9%

      \[x \cdot \frac{\sin y}{y} \]

   2. Taylor expanded in y around 0 71.5%

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

      1. unpow2 71.5%

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

   4. Simplified 71.5%

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

   if 2.39999999999999991 < y

   1. Initial program 99.6%

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

      1. clear-num 99.5%

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

      2. inv-pow 99.5%

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

   3. Applied egg-rr 99.5%

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

      1. unpow-1 99.5%

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

   5. Applied egg-rr 99.5%

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

   6. Taylor expanded in y around 0 28.0%

      \[\leadsto x \cdot \frac{1}{\color{blue}{1 + 0.16666666666666666 \cdot {y}^{2}}} \]
   7. Step-by-step derivation

      1. *-commutative 28.0%

         \[\leadsto x \cdot \frac{1}{1 + \color{blue}{{y}^{2} \cdot 0.16666666666666666}} \]

      2. unpow2 28.0%

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

   8. Simplified 28.0%

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

   9. Taylor expanded in y around inf 28.0%

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

       1. unpow2 28.0%

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

   11. Simplified 28.0%

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

4. Final simplification 59.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq 2.4:\\ \;\;\;\;x \cdot \left(1 + \left(y \cdot y\right) \cdot -0.16666666666666666\right)\\ \mathbf{else}:\\ \;\;\;\;x \cdot \frac{6}{y \cdot y}\\ \end{array} \]

Alternative 3: 63.4% accurate, 9.5× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.8%

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

   1. clear-num 99.8%

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

   2. inv-pow 99.8%

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

3. Applied egg-rr 99.8%

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

   1. unpow-1 99.8%

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

5. Applied egg-rr 99.8%

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

6. Taylor expanded in y around 0 64.9%

   \[\leadsto x \cdot \frac{1}{\color{blue}{1 + 0.16666666666666666 \cdot {y}^{2}}} \]
7. Step-by-step derivation

   1. *-commutative 64.9%

      \[\leadsto x \cdot \frac{1}{1 + \color{blue}{{y}^{2} \cdot 0.16666666666666666}} \]

   2. unpow2 64.9%

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

8. Simplified 64.9%

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

9. Final simplification 64.9%

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

Alternative 4: 57.5% accurate, 11.6× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < 2.4500000000000002

   1. Initial program 99.9%

      \[x \cdot \frac{\sin y}{y} \]

   2. Taylor expanded in y around 0 71.7%

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

   if 2.4500000000000002 < y

   1. Initial program 99.6%

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

      1. clear-num 99.5%

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

      2. inv-pow 99.5%

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

   3. Applied egg-rr 99.5%

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

      1. unpow-1 99.5%

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

   5. Applied egg-rr 99.5%

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

   6. Taylor expanded in y around 0 28.0%

      \[\leadsto x \cdot \frac{1}{\color{blue}{1 + 0.16666666666666666 \cdot {y}^{2}}} \]
   7. Step-by-step derivation

      1. *-commutative 28.0%

         \[\leadsto x \cdot \frac{1}{1 + \color{blue}{{y}^{2} \cdot 0.16666666666666666}} \]

      2. unpow2 28.0%

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

   8. Simplified 28.0%

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

   9. Taylor expanded in y around inf 28.0%

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

       1. unpow2 28.0%

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

   11. Simplified 28.0%

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

4. Final simplification 59.5%

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

Alternative 5: 57.5% accurate, 11.6× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < 2.4500000000000002

   1. Initial program 99.9%

      \[x \cdot \frac{\sin y}{y} \]

   2. Taylor expanded in y around 0 71.7%

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

   if 2.4500000000000002 < y

   1. Initial program 99.6%

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

      1. clear-num 99.5%

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

      2. inv-pow 99.5%

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

   3. Applied egg-rr 99.5%

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

      1. unpow-1 99.5%

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

   5. Applied egg-rr 99.5%

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

   6. Taylor expanded in y around 0 28.0%

      \[\leadsto x \cdot \frac{1}{\color{blue}{1 + 0.16666666666666666 \cdot {y}^{2}}} \]
   7. Step-by-step derivation

      1. *-commutative 28.0%

         \[\leadsto x \cdot \frac{1}{1 + \color{blue}{{y}^{2} \cdot 0.16666666666666666}} \]

      2. unpow2 28.0%

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

   8. Simplified 28.0%

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

   9. Taylor expanded in y around inf 28.0%

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

       1. unpow2 28.0%

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

   11. Simplified 28.0%

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

4. Final simplification 59.5%

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

Alternative 6: 63.4% accurate, 11.7× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.8%

   \[x \cdot \frac{\sin y}{y} \]
2. 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}}} \]

3. Applied egg-rr 99.8%

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

4. Taylor expanded in y around 0 64.9%

   \[\leadsto \frac{x}{\color{blue}{1 + 0.16666666666666666 \cdot {y}^{2}}} \]
5. Step-by-step derivation

   1. *-commutative 64.9%

      \[\leadsto x \cdot \frac{1}{1 + \color{blue}{{y}^{2} \cdot 0.16666666666666666}} \]

   2. unpow2 64.9%

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

6. Simplified 64.9%

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

7. Final simplification 64.9%

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

Alternative 7: 56.9% accurate, 14.9× speedup

Math

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

FPCore

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

C

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

Python

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < 1e11

   1. Initial program 99.9%

      \[x \cdot \frac{\sin y}{y} \]

   2. Taylor expanded in y around 0 70.9%

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

   if 1e11 < y

   1. Initial program 99.6%

      \[x \cdot \frac{\sin y}{y} \]

   2. Taylor expanded in x around 0 99.6%

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

   3. Taylor expanded in y around 0 4.7%

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

      1. associate-/l* 27.6%

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

      2. div-inv 27.6%

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

      3. clear-num 27.6%

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

   5. Applied egg-rr 27.6%

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

4. Final simplification 59.2%

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

Alternative 8: 57.1% accurate, 14.9× speedup

Math

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

FPCore

(FPCore (x y) :precision binary64 (if (<= y 2.9e-25) x (/ y (/ y x))))

C

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

Python

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < 2.9000000000000001e-25

   1. Initial program 99.9%

      \[x \cdot \frac{\sin y}{y} \]

   2. Taylor expanded in y around 0 70.8%

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

   if 2.9000000000000001e-25 < y

   1. Initial program 99.7%

      \[x \cdot \frac{\sin y}{y} \]

   2. Taylor expanded in x around 0 99.6%

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

   3. Taylor expanded in y around 0 14.7%

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

      1. associate-/l* 34.2%

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

      2. div-inv 34.2%

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

      3. clear-num 34.2%

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

   5. Applied egg-rr 34.2%

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

      1. clear-num 34.2%

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

      2. un-div-inv 34.2%

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

   7. Applied egg-rr 34.2%

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

4. Final simplification 59.2%

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

Alternative 9: 52.0% 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. Taylor expanded in y around 0 53.1%

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

3. Final simplification 53.1%

   \[\leadsto x \]

Reproduce

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