
(FPCore (a b) :precision binary64 (- (* a a) (* b b)))
double code(double a, double b) {
return (a * a) - (b * b);
}
real(8) function code(a, b)
real(8), intent (in) :: a
real(8), intent (in) :: b
code = (a * a) - (b * b)
end function
public static double code(double a, double b) {
return (a * a) - (b * b);
}
def code(a, b): return (a * a) - (b * b)
function code(a, b) return Float64(Float64(a * a) - Float64(b * b)) end
function tmp = code(a, b) tmp = (a * a) - (b * b); end
code[a_, b_] := N[(N[(a * a), $MachinePrecision] - N[(b * b), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
a \cdot a - b \cdot b
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 3 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (a b) :precision binary64 (- (* a a) (* b b)))
double code(double a, double b) {
return (a * a) - (b * b);
}
real(8) function code(a, b)
real(8), intent (in) :: a
real(8), intent (in) :: b
code = (a * a) - (b * b)
end function
public static double code(double a, double b) {
return (a * a) - (b * b);
}
def code(a, b): return (a * a) - (b * b)
function code(a, b) return Float64(Float64(a * a) - Float64(b * b)) end
function tmp = code(a, b) tmp = (a * a) - (b * b); end
code[a_, b_] := N[(N[(a * a), $MachinePrecision] - N[(b * b), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
a \cdot a - b \cdot b
\end{array}
a_m = (fabs.f64 a) b_m = (fabs.f64 b) (FPCore (a_m b_m) :precision binary64 (if (<= (* a_m a_m) 5e+258) (- (* a_m a_m) (* b_m b_m)) (* a_m (+ a_m (* b_m -2.0)))))
a_m = fabs(a);
b_m = fabs(b);
double code(double a_m, double b_m) {
double tmp;
if ((a_m * a_m) <= 5e+258) {
tmp = (a_m * a_m) - (b_m * b_m);
} else {
tmp = a_m * (a_m + (b_m * -2.0));
}
return tmp;
}
a_m = abs(a)
b_m = abs(b)
real(8) function code(a_m, b_m)
real(8), intent (in) :: a_m
real(8), intent (in) :: b_m
real(8) :: tmp
if ((a_m * a_m) <= 5d+258) then
tmp = (a_m * a_m) - (b_m * b_m)
else
tmp = a_m * (a_m + (b_m * (-2.0d0)))
end if
code = tmp
end function
a_m = Math.abs(a);
b_m = Math.abs(b);
public static double code(double a_m, double b_m) {
double tmp;
if ((a_m * a_m) <= 5e+258) {
tmp = (a_m * a_m) - (b_m * b_m);
} else {
tmp = a_m * (a_m + (b_m * -2.0));
}
return tmp;
}
a_m = math.fabs(a) b_m = math.fabs(b) def code(a_m, b_m): tmp = 0 if (a_m * a_m) <= 5e+258: tmp = (a_m * a_m) - (b_m * b_m) else: tmp = a_m * (a_m + (b_m * -2.0)) return tmp
a_m = abs(a) b_m = abs(b) function code(a_m, b_m) tmp = 0.0 if (Float64(a_m * a_m) <= 5e+258) tmp = Float64(Float64(a_m * a_m) - Float64(b_m * b_m)); else tmp = Float64(a_m * Float64(a_m + Float64(b_m * -2.0))); end return tmp end
a_m = abs(a); b_m = abs(b); function tmp_2 = code(a_m, b_m) tmp = 0.0; if ((a_m * a_m) <= 5e+258) tmp = (a_m * a_m) - (b_m * b_m); else tmp = a_m * (a_m + (b_m * -2.0)); end tmp_2 = tmp; end
a_m = N[Abs[a], $MachinePrecision] b_m = N[Abs[b], $MachinePrecision] code[a$95$m_, b$95$m_] := If[LessEqual[N[(a$95$m * a$95$m), $MachinePrecision], 5e+258], N[(N[(a$95$m * a$95$m), $MachinePrecision] - N[(b$95$m * b$95$m), $MachinePrecision]), $MachinePrecision], N[(a$95$m * N[(a$95$m + N[(b$95$m * -2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
a_m = \left|a\right|
\\
b_m = \left|b\right|
\\
\begin{array}{l}
\mathbf{if}\;a\_m \cdot a\_m \leq 5 \cdot 10^{+258}:\\
\;\;\;\;a\_m \cdot a\_m - b\_m \cdot b\_m\\
\mathbf{else}:\\
\;\;\;\;a\_m \cdot \left(a\_m + b\_m \cdot -2\right)\\
\end{array}
\end{array}
if (*.f64 a a) < 5e258Initial program 100.0%
if 5e258 < (*.f64 a a) 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 a around inf 76.4%
*-commutative76.4%
associate-*l*76.4%
unpow276.4%
distribute-lft-out91.7%
Simplified91.7%
Final simplification97.7%
a_m = (fabs.f64 a) b_m = (fabs.f64 b) (FPCore (a_m b_m) :precision binary64 (* a_m (+ a_m (* b_m -2.0))))
a_m = fabs(a);
b_m = fabs(b);
double code(double a_m, double b_m) {
return a_m * (a_m + (b_m * -2.0));
}
a_m = abs(a)
b_m = abs(b)
real(8) function code(a_m, b_m)
real(8), intent (in) :: a_m
real(8), intent (in) :: b_m
code = a_m * (a_m + (b_m * (-2.0d0)))
end function
a_m = Math.abs(a);
b_m = Math.abs(b);
public static double code(double a_m, double b_m) {
return a_m * (a_m + (b_m * -2.0));
}
a_m = math.fabs(a) b_m = math.fabs(b) def code(a_m, b_m): return a_m * (a_m + (b_m * -2.0))
a_m = abs(a) b_m = abs(b) function code(a_m, b_m) return Float64(a_m * Float64(a_m + Float64(b_m * -2.0))) end
a_m = abs(a); b_m = abs(b); function tmp = code(a_m, b_m) tmp = a_m * (a_m + (b_m * -2.0)); end
a_m = N[Abs[a], $MachinePrecision] b_m = N[Abs[b], $MachinePrecision] code[a$95$m_, b$95$m_] := N[(a$95$m * N[(a$95$m + N[(b$95$m * -2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
a_m = \left|a\right|
\\
b_m = \left|b\right|
\\
a\_m \cdot \left(a\_m + b\_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 a around inf 54.3%
*-commutative54.3%
associate-*l*54.3%
unpow254.3%
distribute-lft-out58.6%
Simplified58.6%
Final simplification58.6%
a_m = (fabs.f64 a) b_m = (fabs.f64 b) (FPCore (a_m b_m) :precision binary64 (* b_m (* a_m -2.0)))
a_m = fabs(a);
b_m = fabs(b);
double code(double a_m, double b_m) {
return b_m * (a_m * -2.0);
}
a_m = abs(a)
b_m = abs(b)
real(8) function code(a_m, b_m)
real(8), intent (in) :: a_m
real(8), intent (in) :: b_m
code = b_m * (a_m * (-2.0d0))
end function
a_m = Math.abs(a);
b_m = Math.abs(b);
public static double code(double a_m, double b_m) {
return b_m * (a_m * -2.0);
}
a_m = math.fabs(a) b_m = math.fabs(b) def code(a_m, b_m): return b_m * (a_m * -2.0)
a_m = abs(a) b_m = abs(b) function code(a_m, b_m) return Float64(b_m * Float64(a_m * -2.0)) end
a_m = abs(a); b_m = abs(b); function tmp = code(a_m, b_m) tmp = b_m * (a_m * -2.0); end
a_m = N[Abs[a], $MachinePrecision] b_m = N[Abs[b], $MachinePrecision] code[a$95$m_, b$95$m_] := N[(b$95$m * N[(a$95$m * -2.0), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
a_m = \left|a\right|
\\
b_m = \left|b\right|
\\
b\_m \cdot \left(a\_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 a around inf 54.3%
*-commutative54.3%
associate-*l*54.3%
unpow254.3%
distribute-lft-out58.6%
Simplified58.6%
Taylor expanded in a around 0 17.1%
associate-*r*17.1%
*-commutative17.1%
Simplified17.1%
Final simplification17.1%
(FPCore (a b) :precision binary64 (* (+ a b) (- a b)))
double code(double a, double b) {
return (a + b) * (a - b);
}
real(8) function code(a, b)
real(8), intent (in) :: a
real(8), intent (in) :: b
code = (a + b) * (a - b)
end function
public static double code(double a, double b) {
return (a + b) * (a - b);
}
def code(a, b): return (a + b) * (a - b)
function code(a, b) return Float64(Float64(a + b) * Float64(a - b)) end
function tmp = code(a, b) tmp = (a + b) * (a - b); end
code[a_, b_] := N[(N[(a + b), $MachinePrecision] * N[(a - b), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\left(a + b\right) \cdot \left(a - b\right)
\end{array}
herbie shell --seed 2024039
(FPCore (a b)
:name "Difference of squares"
:precision binary64
:herbie-target
(* (+ a b) (- a b))
(- (* a a) (* b b)))