
(FPCore re_sqr (re im) :precision binary64 (- (* re re) (* im im)))
double re_sqr(double re, double im) {
return (re * re) - (im * im);
}
real(8) function re_sqr(re, im)
real(8), intent (in) :: re
real(8), intent (in) :: im
re_sqr = (re * re) - (im * im)
end function
public static double re_sqr(double re, double im) {
return (re * re) - (im * im);
}
def re_sqr(re, im): return (re * re) - (im * im)
function re_sqr(re, im) return Float64(Float64(re * re) - Float64(im * im)) end
function tmp = re_sqr(re, im) tmp = (re * re) - (im * im); end
re$95$sqr[re_, im_] := N[(N[(re * re), $MachinePrecision] - N[(im * im), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
re \cdot re - im \cdot im
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 4 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore re_sqr (re im) :precision binary64 (- (* re re) (* im im)))
double re_sqr(double re, double im) {
return (re * re) - (im * im);
}
real(8) function re_sqr(re, im)
real(8), intent (in) :: re
real(8), intent (in) :: im
re_sqr = (re * re) - (im * im)
end function
public static double re_sqr(double re, double im) {
return (re * re) - (im * im);
}
def re_sqr(re, im): return (re * re) - (im * im)
function re_sqr(re, im) return Float64(Float64(re * re) - Float64(im * im)) end
function tmp = re_sqr(re, im) tmp = (re * re) - (im * im); end
re$95$sqr[re_, im_] := N[(N[(re * re), $MachinePrecision] - N[(im * im), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
re \cdot re - im \cdot im
\end{array}
(FPCore re_sqr (re im) :precision binary64 (* (+ re im) (- re im)))
double re_sqr(double re, double im) {
return (re + im) * (re - im);
}
real(8) function re_sqr(re, im)
real(8), intent (in) :: re
real(8), intent (in) :: im
re_sqr = (re + im) * (re - im)
end function
public static double re_sqr(double re, double im) {
return (re + im) * (re - im);
}
def re_sqr(re, im): return (re + im) * (re - im)
function re_sqr(re, im) return Float64(Float64(re + im) * Float64(re - im)) end
function tmp = re_sqr(re, im) tmp = (re + im) * (re - im); end
re$95$sqr[re_, im_] := N[(N[(re + im), $MachinePrecision] * N[(re - im), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\left(re + im\right) \cdot \left(re - im\right)
\end{array}
Initial program 96.9%
add-sqr-sqrt49.9%
associate-*l*49.9%
prod-diff40.9%
Applied egg-rr40.9%
Taylor expanded in im around 0 51.0%
*-commutative51.0%
associate-*r*51.1%
add-sqr-sqrt99.2%
fma-neg96.9%
difference-of-squares100.0%
Applied egg-rr100.0%
Final simplification100.0%
(FPCore re_sqr (re im) :precision binary64 (if (<= (* re re) 1e+249) (- (* re re) (* im im)) (* re (+ re (* im -2.0)))))
double re_sqr(double re, double im) {
double tmp;
if ((re * re) <= 1e+249) {
tmp = (re * re) - (im * im);
} else {
tmp = re * (re + (im * -2.0));
}
return tmp;
}
real(8) function re_sqr(re, im)
real(8), intent (in) :: re
real(8), intent (in) :: im
real(8) :: tmp
if ((re * re) <= 1d+249) then
tmp = (re * re) - (im * im)
else
tmp = re * (re + (im * (-2.0d0)))
end if
re_sqr = tmp
end function
public static double re_sqr(double re, double im) {
double tmp;
if ((re * re) <= 1e+249) {
tmp = (re * re) - (im * im);
} else {
tmp = re * (re + (im * -2.0));
}
return tmp;
}
def re_sqr(re, im): tmp = 0 if (re * re) <= 1e+249: tmp = (re * re) - (im * im) else: tmp = re * (re + (im * -2.0)) return tmp
function re_sqr(re, im) tmp = 0.0 if (Float64(re * re) <= 1e+249) tmp = Float64(Float64(re * re) - Float64(im * im)); else tmp = Float64(re * Float64(re + Float64(im * -2.0))); end return tmp end
function tmp_2 = re_sqr(re, im) tmp = 0.0; if ((re * re) <= 1e+249) tmp = (re * re) - (im * im); else tmp = re * (re + (im * -2.0)); end tmp_2 = tmp; end
re$95$sqr[re_, im_] := If[LessEqual[N[(re * re), $MachinePrecision], 1e+249], N[(N[(re * re), $MachinePrecision] - N[(im * im), $MachinePrecision]), $MachinePrecision], N[(re * N[(re + N[(im * -2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;re \cdot re \leq 10^{+249}:\\
\;\;\;\;re \cdot re - im \cdot im\\
\mathbf{else}:\\
\;\;\;\;re \cdot \left(re + im \cdot -2\right)\\
\end{array}
\end{array}
if (*.f64 re re) < 9.9999999999999992e248Initial program 100.0%
if 9.9999999999999992e248 < (*.f64 re re) Initial program 87.3%
add-sqr-sqrt81.0%
pow281.0%
difference-of-squares84.1%
sqrt-prod44.4%
add-sqr-sqrt25.4%
sqrt-prod44.4%
sqr-neg44.4%
sqrt-unprod19.0%
add-sqr-sqrt44.4%
sub-neg44.4%
add-sqr-sqrt84.1%
add-sqr-sqrt44.4%
add-sqr-sqrt25.4%
difference-of-squares25.4%
unpow-prod-down25.4%
Applied egg-rr25.4%
unpow225.4%
unpow225.4%
unswap-sqr25.4%
difference-of-squares25.4%
rem-square-sqrt25.4%
rem-square-sqrt25.4%
difference-of-squares25.4%
rem-square-sqrt47.6%
rem-square-sqrt84.1%
Simplified84.1%
Taylor expanded in re around inf 77.8%
associate-*r*77.8%
unpow277.8%
distribute-rgt-out92.1%
*-commutative92.1%
Simplified92.1%
Final simplification98.0%
(FPCore re_sqr (re im) :precision binary64 (* re (+ re (* im -2.0))))
double re_sqr(double re, double im) {
return re * (re + (im * -2.0));
}
real(8) function re_sqr(re, im)
real(8), intent (in) :: re
real(8), intent (in) :: im
re_sqr = re * (re + (im * (-2.0d0)))
end function
public static double re_sqr(double re, double im) {
return re * (re + (im * -2.0));
}
def re_sqr(re, im): return re * (re + (im * -2.0))
function re_sqr(re, im) return Float64(re * Float64(re + Float64(im * -2.0))) end
function tmp = re_sqr(re, im) tmp = re * (re + (im * -2.0)); end
re$95$sqr[re_, im_] := N[(re * N[(re + N[(im * -2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
re \cdot \left(re + im \cdot -2\right)
\end{array}
Initial program 96.9%
add-sqr-sqrt49.2%
pow249.2%
difference-of-squares50.0%
sqrt-prod23.6%
add-sqr-sqrt13.2%
sqrt-prod24.4%
sqr-neg24.4%
sqrt-unprod12.8%
add-sqr-sqrt26.0%
sub-neg26.0%
add-sqr-sqrt50.5%
add-sqr-sqrt24.7%
add-sqr-sqrt13.7%
difference-of-squares13.7%
unpow-prod-down13.7%
Applied egg-rr13.7%
unpow213.7%
unpow213.7%
unswap-sqr13.7%
difference-of-squares13.7%
rem-square-sqrt13.7%
rem-square-sqrt13.7%
difference-of-squares13.7%
rem-square-sqrt27.8%
rem-square-sqrt50.5%
Simplified50.5%
Taylor expanded in re around inf 51.5%
associate-*r*51.5%
unpow251.5%
distribute-rgt-out55.0%
*-commutative55.0%
Simplified55.0%
Final simplification55.0%
(FPCore re_sqr (re im) :precision binary64 (* -2.0 (* re im)))
double re_sqr(double re, double im) {
return -2.0 * (re * im);
}
real(8) function re_sqr(re, im)
real(8), intent (in) :: re
real(8), intent (in) :: im
re_sqr = (-2.0d0) * (re * im)
end function
public static double re_sqr(double re, double im) {
return -2.0 * (re * im);
}
def re_sqr(re, im): return -2.0 * (re * im)
function re_sqr(re, im) return Float64(-2.0 * Float64(re * im)) end
function tmp = re_sqr(re, im) tmp = -2.0 * (re * im); end
re$95$sqr[re_, im_] := N[(-2.0 * N[(re * im), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
-2 \cdot \left(re \cdot im\right)
\end{array}
Initial program 96.9%
add-sqr-sqrt49.2%
pow249.2%
difference-of-squares50.0%
sqrt-prod23.6%
add-sqr-sqrt13.2%
sqrt-prod24.4%
sqr-neg24.4%
sqrt-unprod12.8%
add-sqr-sqrt26.0%
sub-neg26.0%
add-sqr-sqrt50.5%
add-sqr-sqrt24.7%
add-sqr-sqrt13.7%
difference-of-squares13.7%
unpow-prod-down13.7%
Applied egg-rr13.7%
unpow213.7%
unpow213.7%
unswap-sqr13.7%
difference-of-squares13.7%
rem-square-sqrt13.7%
rem-square-sqrt13.7%
difference-of-squares13.7%
rem-square-sqrt27.8%
rem-square-sqrt50.5%
Simplified50.5%
Taylor expanded in re around inf 51.5%
associate-*r*51.5%
unpow251.5%
distribute-rgt-out55.0%
*-commutative55.0%
Simplified55.0%
Taylor expanded in re around 0 13.2%
Final simplification13.2%
herbie shell --seed 2024053
(FPCore re_sqr (re im)
:name "math.square on complex, real part"
:precision binary64
(- (* re re) (* im im)))