
(FPCore (x y) :precision binary64 (* x (/ (sin y) y)))
double code(double x, double y) {
return x * (sin(y) / y);
}
real(8) function code(x, y)
real(8), intent (in) :: x
real(8), intent (in) :: y
code = x * (sin(y) / y)
end function
public static double code(double x, double y) {
return x * (Math.sin(y) / y);
}
def code(x, y): return x * (math.sin(y) / y)
function code(x, y) return Float64(x * Float64(sin(y) / y)) end
function tmp = code(x, y) tmp = x * (sin(y) / y); end
code[x_, y_] := N[(x * N[(N[Sin[y], $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
x \cdot \frac{\sin y}{y}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 4 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (x y) :precision binary64 (* x (/ (sin y) y)))
double code(double x, double y) {
return x * (sin(y) / y);
}
real(8) function code(x, y)
real(8), intent (in) :: x
real(8), intent (in) :: y
code = x * (sin(y) / y)
end function
public static double code(double x, double y) {
return x * (Math.sin(y) / y);
}
def code(x, y): return x * (math.sin(y) / y)
function code(x, y) return Float64(x * Float64(sin(y) / y)) end
function tmp = code(x, y) tmp = x * (sin(y) / y); end
code[x_, y_] := N[(x * N[(N[Sin[y], $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
x \cdot \frac{\sin y}{y}
\end{array}
(FPCore (x y) :precision binary64 (* x (/ (sin y) y)))
double code(double x, double y) {
return x * (sin(y) / y);
}
real(8) function code(x, y)
real(8), intent (in) :: x
real(8), intent (in) :: y
code = x * (sin(y) / y)
end function
public static double code(double x, double y) {
return x * (Math.sin(y) / y);
}
def code(x, y): return x * (math.sin(y) / y)
function code(x, y) return Float64(x * Float64(sin(y) / y)) end
function tmp = code(x, y) tmp = x * (sin(y) / y); end
code[x_, y_] := N[(x * N[(N[Sin[y], $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
x \cdot \frac{\sin y}{y}
\end{array}
Initial program 99.8%
Final simplification99.8%
(FPCore (x y) :precision binary64 (if (<= y 1e-5) x (* y (/ x y))))
double code(double x, double y) {
double tmp;
if (y <= 1e-5) {
tmp = x;
} else {
tmp = y * (x / y);
}
return tmp;
}
real(8) function code(x, y)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8) :: tmp
if (y <= 1d-5) then
tmp = x
else
tmp = y * (x / y)
end if
code = tmp
end function
public static double code(double x, double y) {
double tmp;
if (y <= 1e-5) {
tmp = x;
} else {
tmp = y * (x / y);
}
return tmp;
}
def code(x, y): tmp = 0 if y <= 1e-5: tmp = x else: tmp = y * (x / y) return tmp
function code(x, y) tmp = 0.0 if (y <= 1e-5) tmp = x; else tmp = Float64(y * Float64(x / y)); end return tmp end
function tmp_2 = code(x, y) tmp = 0.0; if (y <= 1e-5) tmp = x; else tmp = y * (x / y); end tmp_2 = tmp; end
code[x_, y_] := If[LessEqual[y, 1e-5], x, N[(y * N[(x / y), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;y \leq 10^{-5}:\\
\;\;\;\;x\\
\mathbf{else}:\\
\;\;\;\;y \cdot \frac{x}{y}\\
\end{array}
\end{array}
if y < 1.00000000000000008e-5Initial program 99.8%
Taylor expanded in y around 0 60.3%
if 1.00000000000000008e-5 < y Initial program 99.6%
*-commutative99.6%
associate-*l/99.7%
Applied egg-rr99.7%
Taylor expanded in y around 0 5.7%
*-commutative5.7%
Simplified5.7%
clear-num5.7%
inv-pow5.7%
associate-/r*5.7%
pow15.7%
pow15.7%
pow-div5.7%
metadata-eval5.7%
metadata-eval5.7%
Applied egg-rr5.7%
unpow-15.7%
associate-/l*5.7%
lft-mult-inverse5.7%
frac-times28.5%
clear-num28.5%
/-rgt-identity28.5%
*-commutative28.5%
Applied egg-rr28.5%
Final simplification53.2%
(FPCore (x y) :precision binary64 (if (<= y 2e-22) x (/ y (/ y x))))
double code(double x, double y) {
double tmp;
if (y <= 2e-22) {
tmp = x;
} else {
tmp = y / (y / x);
}
return tmp;
}
real(8) function code(x, y)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8) :: tmp
if (y <= 2d-22) then
tmp = x
else
tmp = y / (y / x)
end if
code = tmp
end function
public static double code(double x, double y) {
double tmp;
if (y <= 2e-22) {
tmp = x;
} else {
tmp = y / (y / x);
}
return tmp;
}
def code(x, y): tmp = 0 if y <= 2e-22: tmp = x else: tmp = y / (y / x) return tmp
function code(x, y) tmp = 0.0 if (y <= 2e-22) tmp = x; else tmp = Float64(y / Float64(y / x)); end return tmp end
function tmp_2 = code(x, y) tmp = 0.0; if (y <= 2e-22) tmp = x; else tmp = y / (y / x); end tmp_2 = tmp; end
code[x_, y_] := If[LessEqual[y, 2e-22], x, N[(y / N[(y / x), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;y \leq 2 \cdot 10^{-22}:\\
\;\;\;\;x\\
\mathbf{else}:\\
\;\;\;\;\frac{y}{\frac{y}{x}}\\
\end{array}
\end{array}
if y < 2.0000000000000001e-22Initial program 99.8%
Taylor expanded in y around 0 59.4%
if 2.0000000000000001e-22 < y Initial program 99.6%
*-commutative99.6%
associate-*l/98.6%
Applied egg-rr98.6%
Taylor expanded in y around 0 12.0%
*-commutative12.0%
Simplified12.0%
associate-/l*34.1%
div-inv34.1%
inv-pow34.1%
div-inv34.1%
metadata-eval34.1%
metadata-eval34.1%
pow-div34.1%
pow134.1%
pow134.1%
associate-/r*32.9%
pow-prod-down32.9%
inv-pow32.9%
inv-pow32.9%
clear-num32.9%
div-inv32.9%
*-commutative32.9%
associate-*l*34.1%
pow134.1%
inv-pow34.1%
pow-prod-up34.1%
metadata-eval34.1%
metadata-eval34.1%
*-commutative34.1%
*-un-lft-identity34.1%
Applied egg-rr34.1%
associate-*l/34.1%
*-un-lft-identity34.1%
associate-*r/12.0%
associate-/l*34.1%
Applied egg-rr34.1%
Final simplification53.2%
(FPCore (x y) :precision binary64 x)
double code(double x, double y) {
return x;
}
real(8) function code(x, y)
real(8), intent (in) :: x
real(8), intent (in) :: y
code = x
end function
public static double code(double x, double y) {
return x;
}
def code(x, y): return x
function code(x, y) return x end
function tmp = code(x, y) tmp = x; end
code[x_, y_] := x
\begin{array}{l}
\\
x
\end{array}
Initial program 99.8%
Taylor expanded in y around 0 48.2%
Final simplification48.2%
herbie shell --seed 2024034
(FPCore (x y)
:name "Linear.Quaternion:$cexp from linear-1.19.1.3"
:precision binary64
(* x (/ (sin y) y)))