
(FPCore (x y) :precision binary64 (- (* x x) (* y y)))
double code(double x, double y) {
return (x * x) - (y * y);
}
real(8) function code(x, y)
real(8), intent (in) :: x
real(8), intent (in) :: y
code = (x * x) - (y * y)
end function
public static double code(double x, double y) {
return (x * x) - (y * y);
}
def code(x, y): return (x * x) - (y * y)
function code(x, y) return Float64(Float64(x * x) - Float64(y * y)) end
function tmp = code(x, y) tmp = (x * x) - (y * y); end
code[x_, y_] := N[(N[(x * x), $MachinePrecision] - N[(y * y), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
x \cdot x - y \cdot y
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 3 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (x y) :precision binary64 (- (* x x) (* y y)))
double code(double x, double y) {
return (x * x) - (y * y);
}
real(8) function code(x, y)
real(8), intent (in) :: x
real(8), intent (in) :: y
code = (x * x) - (y * y)
end function
public static double code(double x, double y) {
return (x * x) - (y * y);
}
def code(x, y): return (x * x) - (y * y)
function code(x, y) return Float64(Float64(x * x) - Float64(y * y)) end
function tmp = code(x, y) tmp = (x * x) - (y * y); end
code[x_, y_] := N[(N[(x * x), $MachinePrecision] - N[(y * y), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
x \cdot x - y \cdot y
\end{array}
x_m = (fabs.f64 x) y_m = (fabs.f64 y) (FPCore (x_m y_m) :precision binary64 (if (<= (* x_m x_m) 5e+258) (- (* x_m x_m) (* y_m y_m)) (* x_m (+ x_m (* y_m -2.0)))))
x_m = fabs(x);
y_m = fabs(y);
double code(double x_m, double y_m) {
double tmp;
if ((x_m * x_m) <= 5e+258) {
tmp = (x_m * x_m) - (y_m * y_m);
} else {
tmp = x_m * (x_m + (y_m * -2.0));
}
return tmp;
}
x_m = abs(x)
y_m = abs(y)
real(8) function code(x_m, y_m)
real(8), intent (in) :: x_m
real(8), intent (in) :: y_m
real(8) :: tmp
if ((x_m * x_m) <= 5d+258) then
tmp = (x_m * x_m) - (y_m * y_m)
else
tmp = x_m * (x_m + (y_m * (-2.0d0)))
end if
code = tmp
end function
x_m = Math.abs(x);
y_m = Math.abs(y);
public static double code(double x_m, double y_m) {
double tmp;
if ((x_m * x_m) <= 5e+258) {
tmp = (x_m * x_m) - (y_m * y_m);
} else {
tmp = x_m * (x_m + (y_m * -2.0));
}
return tmp;
}
x_m = math.fabs(x) y_m = math.fabs(y) def code(x_m, y_m): tmp = 0 if (x_m * x_m) <= 5e+258: tmp = (x_m * x_m) - (y_m * y_m) else: tmp = x_m * (x_m + (y_m * -2.0)) return tmp
x_m = abs(x) y_m = abs(y) function code(x_m, y_m) tmp = 0.0 if (Float64(x_m * x_m) <= 5e+258) tmp = Float64(Float64(x_m * x_m) - Float64(y_m * y_m)); else tmp = Float64(x_m * Float64(x_m + Float64(y_m * -2.0))); end return tmp end
x_m = abs(x); y_m = abs(y); function tmp_2 = code(x_m, y_m) tmp = 0.0; if ((x_m * x_m) <= 5e+258) tmp = (x_m * x_m) - (y_m * y_m); else tmp = x_m * (x_m + (y_m * -2.0)); end tmp_2 = tmp; end
x_m = N[Abs[x], $MachinePrecision] y_m = N[Abs[y], $MachinePrecision] code[x$95$m_, y$95$m_] := If[LessEqual[N[(x$95$m * x$95$m), $MachinePrecision], 5e+258], N[(N[(x$95$m * x$95$m), $MachinePrecision] - N[(y$95$m * y$95$m), $MachinePrecision]), $MachinePrecision], N[(x$95$m * N[(x$95$m + N[(y$95$m * -2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
x_m = \left|x\right|
\\
y_m = \left|y\right|
\\
\begin{array}{l}
\mathbf{if}\;x\_m \cdot x\_m \leq 5 \cdot 10^{+258}:\\
\;\;\;\;x\_m \cdot x\_m - y\_m \cdot y\_m\\
\mathbf{else}:\\
\;\;\;\;x\_m \cdot \left(x\_m + y\_m \cdot -2\right)\\
\end{array}
\end{array}
if (*.f64 x x) < 5e258Initial program 100.0%
if 5e258 < (*.f64 x x) Initial program 80.6%
add-sqr-sqrt73.6%
pow273.6%
difference-of-squares81.9%
sqrt-prod38.8%
add-sqr-sqrt19.4%
sqrt-prod38.8%
sqr-neg38.8%
sqrt-unprod19.4%
add-sqr-sqrt38.8%
sub-neg38.8%
add-sqr-sqrt81.9%
add-sqr-sqrt38.8%
add-sqr-sqrt19.4%
difference-of-squares19.4%
unpow-prod-down19.4%
Applied egg-rr19.4%
unpow219.4%
unpow219.4%
unswap-sqr19.4%
difference-of-squares19.4%
rem-square-sqrt19.4%
rem-square-sqrt19.4%
difference-of-squares19.4%
rem-square-sqrt41.7%
rem-square-sqrt81.9%
Simplified81.9%
Taylor expanded in x around inf 76.4%
*-commutative76.4%
associate-*l*76.4%
unpow276.4%
distribute-lft-out91.7%
Simplified91.7%
Final simplification97.7%
x_m = (fabs.f64 x) y_m = (fabs.f64 y) (FPCore (x_m y_m) :precision binary64 (* x_m (+ x_m (* y_m -2.0))))
x_m = fabs(x);
y_m = fabs(y);
double code(double x_m, double y_m) {
return x_m * (x_m + (y_m * -2.0));
}
x_m = abs(x)
y_m = abs(y)
real(8) function code(x_m, y_m)
real(8), intent (in) :: x_m
real(8), intent (in) :: y_m
code = x_m * (x_m + (y_m * (-2.0d0)))
end function
x_m = Math.abs(x);
y_m = Math.abs(y);
public static double code(double x_m, double y_m) {
return x_m * (x_m + (y_m * -2.0));
}
x_m = math.fabs(x) y_m = math.fabs(y) def code(x_m, y_m): return x_m * (x_m + (y_m * -2.0))
x_m = abs(x) y_m = abs(y) function code(x_m, y_m) return Float64(x_m * Float64(x_m + Float64(y_m * -2.0))) end
x_m = abs(x); y_m = abs(y); function tmp = code(x_m, y_m) tmp = x_m * (x_m + (y_m * -2.0)); end
x_m = N[Abs[x], $MachinePrecision] y_m = N[Abs[y], $MachinePrecision] code[x$95$m_, y$95$m_] := N[(x$95$m * N[(x$95$m + N[(y$95$m * -2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
x_m = \left|x\right|
\\
y_m = \left|y\right|
\\
x\_m \cdot \left(x\_m + y\_m \cdot -2\right)
\end{array}
Initial program 94.5%
add-sqr-sqrt50.8%
pow250.8%
difference-of-squares53.1%
sqrt-prod26.0%
add-sqr-sqrt14.0%
sqrt-prod26.7%
sqr-neg26.7%
sqrt-unprod13.1%
add-sqr-sqrt26.9%
sub-neg26.9%
add-sqr-sqrt53.2%
add-sqr-sqrt27.6%
add-sqr-sqrt15.1%
difference-of-squares15.1%
unpow-prod-down15.1%
Applied egg-rr15.1%
unpow215.1%
unpow215.1%
unswap-sqr15.1%
difference-of-squares15.1%
rem-square-sqrt15.1%
rem-square-sqrt15.1%
difference-of-squares15.1%
rem-square-sqrt27.4%
rem-square-sqrt53.2%
Simplified53.2%
Taylor expanded in x around inf 54.3%
*-commutative54.3%
associate-*l*54.3%
unpow254.3%
distribute-lft-out58.6%
Simplified58.6%
Final simplification58.6%
x_m = (fabs.f64 x) y_m = (fabs.f64 y) (FPCore (x_m y_m) :precision binary64 (* y_m (* x_m -2.0)))
x_m = fabs(x);
y_m = fabs(y);
double code(double x_m, double y_m) {
return y_m * (x_m * -2.0);
}
x_m = abs(x)
y_m = abs(y)
real(8) function code(x_m, y_m)
real(8), intent (in) :: x_m
real(8), intent (in) :: y_m
code = y_m * (x_m * (-2.0d0))
end function
x_m = Math.abs(x);
y_m = Math.abs(y);
public static double code(double x_m, double y_m) {
return y_m * (x_m * -2.0);
}
x_m = math.fabs(x) y_m = math.fabs(y) def code(x_m, y_m): return y_m * (x_m * -2.0)
x_m = abs(x) y_m = abs(y) function code(x_m, y_m) return Float64(y_m * Float64(x_m * -2.0)) end
x_m = abs(x); y_m = abs(y); function tmp = code(x_m, y_m) tmp = y_m * (x_m * -2.0); end
x_m = N[Abs[x], $MachinePrecision] y_m = N[Abs[y], $MachinePrecision] code[x$95$m_, y$95$m_] := N[(y$95$m * N[(x$95$m * -2.0), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
x_m = \left|x\right|
\\
y_m = \left|y\right|
\\
y\_m \cdot \left(x\_m \cdot -2\right)
\end{array}
Initial program 94.5%
add-sqr-sqrt50.8%
pow250.8%
difference-of-squares53.1%
sqrt-prod26.0%
add-sqr-sqrt14.0%
sqrt-prod26.7%
sqr-neg26.7%
sqrt-unprod13.1%
add-sqr-sqrt26.9%
sub-neg26.9%
add-sqr-sqrt53.2%
add-sqr-sqrt27.6%
add-sqr-sqrt15.1%
difference-of-squares15.1%
unpow-prod-down15.1%
Applied egg-rr15.1%
unpow215.1%
unpow215.1%
unswap-sqr15.1%
difference-of-squares15.1%
rem-square-sqrt15.1%
rem-square-sqrt15.1%
difference-of-squares15.1%
rem-square-sqrt27.4%
rem-square-sqrt53.2%
Simplified53.2%
Taylor expanded in x around inf 54.3%
*-commutative54.3%
associate-*l*54.3%
unpow254.3%
distribute-lft-out58.6%
Simplified58.6%
Taylor expanded in x around 0 17.1%
associate-*r*17.1%
*-commutative17.1%
Simplified17.1%
Final simplification17.1%
herbie shell --seed 2024039
(FPCore (x y)
:name "Examples.Basics.BasicTests:f2 from sbv-4.4"
:precision binary64
(- (* x x) (* y y)))