
(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 (if (<= (* re re) 2e+296) (- (* re re) (* im im)) (* (- re im) (- re im))))
double re_sqr(double re, double im) {
double tmp;
if ((re * re) <= 2e+296) {
tmp = (re * re) - (im * im);
} else {
tmp = (re - im) * (re - im);
}
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) <= 2d+296) then
tmp = (re * re) - (im * im)
else
tmp = (re - im) * (re - im)
end if
re_sqr = tmp
end function
public static double re_sqr(double re, double im) {
double tmp;
if ((re * re) <= 2e+296) {
tmp = (re * re) - (im * im);
} else {
tmp = (re - im) * (re - im);
}
return tmp;
}
def re_sqr(re, im): tmp = 0 if (re * re) <= 2e+296: tmp = (re * re) - (im * im) else: tmp = (re - im) * (re - im) return tmp
function re_sqr(re, im) tmp = 0.0 if (Float64(re * re) <= 2e+296) tmp = Float64(Float64(re * re) - Float64(im * im)); else tmp = Float64(Float64(re - im) * Float64(re - im)); end return tmp end
function tmp_2 = re_sqr(re, im) tmp = 0.0; if ((re * re) <= 2e+296) tmp = (re * re) - (im * im); else tmp = (re - im) * (re - im); end tmp_2 = tmp; end
re$95$sqr[re_, im_] := If[LessEqual[N[(re * re), $MachinePrecision], 2e+296], N[(N[(re * re), $MachinePrecision] - N[(im * im), $MachinePrecision]), $MachinePrecision], N[(N[(re - im), $MachinePrecision] * N[(re - im), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;re \cdot re \leq 2 \cdot 10^{+296}:\\
\;\;\;\;re \cdot re - im \cdot im\\
\mathbf{else}:\\
\;\;\;\;\left(re - im\right) \cdot \left(re - im\right)\\
\end{array}
\end{array}
if (*.f64 re re) < 1.99999999999999996e296Initial program 100.0%
if 1.99999999999999996e296 < (*.f64 re re) Initial program 77.0%
difference-of-squares100.0%
add-sqr-sqrt49.2%
sqrt-prod88.5%
sqr-neg88.5%
sqrt-unprod44.3%
add-sqr-sqrt90.2%
sub-neg90.2%
pow190.2%
pow190.2%
pow-prod-up90.2%
metadata-eval90.2%
add-sqr-sqrt44.2%
add-sqr-sqrt23.0%
difference-of-squares23.0%
unpow-prod-down23.0%
Applied egg-rr23.0%
unpow223.0%
unpow223.0%
unswap-sqr23.0%
difference-of-squares23.0%
unpow1/223.0%
unpow1/223.0%
pow-sqr23.0%
metadata-eval23.0%
unpow123.0%
unpow1/223.0%
unpow1/223.0%
pow-sqr23.0%
metadata-eval23.0%
unpow123.0%
difference-of-squares23.0%
unpow1/223.0%
unpow1/223.0%
pow-sqr45.9%
metadata-eval45.9%
unpow145.9%
Simplified90.2%
Final simplification97.7%
(FPCore re_sqr (re im) :precision binary64 (fma re re (* im (- im))))
double re_sqr(double re, double im) {
return fma(re, re, (im * -im));
}
function re_sqr(re, im) return fma(re, re, Float64(im * Float64(-im))) end
re$95$sqr[re_, im_] := N[(re * re + N[(im * (-im)), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\mathsf{fma}\left(re, re, im \cdot \left(-im\right)\right)
\end{array}
Initial program 94.5%
sqr-neg94.5%
cancel-sign-sub94.5%
fma-def96.9%
Simplified96.9%
Final simplification96.9%
(FPCore re_sqr (re im)
:precision binary64
(if (or (<= (* im im) 2e-99)
(and (not (<= (* im im) 2e+21)) (<= (* im im) 2e+175)))
(* (- re im) (- re im))
(* im (- im))))
double re_sqr(double re, double im) {
double tmp;
if (((im * im) <= 2e-99) || (!((im * im) <= 2e+21) && ((im * im) <= 2e+175))) {
tmp = (re - im) * (re - im);
} else {
tmp = im * -im;
}
return tmp;
}
real(8) function re_sqr(re, im)
real(8), intent (in) :: re
real(8), intent (in) :: im
real(8) :: tmp
if (((im * im) <= 2d-99) .or. (.not. ((im * im) <= 2d+21)) .and. ((im * im) <= 2d+175)) then
tmp = (re - im) * (re - im)
else
tmp = im * -im
end if
re_sqr = tmp
end function
public static double re_sqr(double re, double im) {
double tmp;
if (((im * im) <= 2e-99) || (!((im * im) <= 2e+21) && ((im * im) <= 2e+175))) {
tmp = (re - im) * (re - im);
} else {
tmp = im * -im;
}
return tmp;
}
def re_sqr(re, im): tmp = 0 if ((im * im) <= 2e-99) or (not ((im * im) <= 2e+21) and ((im * im) <= 2e+175)): tmp = (re - im) * (re - im) else: tmp = im * -im return tmp
function re_sqr(re, im) tmp = 0.0 if ((Float64(im * im) <= 2e-99) || (!(Float64(im * im) <= 2e+21) && (Float64(im * im) <= 2e+175))) tmp = Float64(Float64(re - im) * Float64(re - im)); else tmp = Float64(im * Float64(-im)); end return tmp end
function tmp_2 = re_sqr(re, im) tmp = 0.0; if (((im * im) <= 2e-99) || (~(((im * im) <= 2e+21)) && ((im * im) <= 2e+175))) tmp = (re - im) * (re - im); else tmp = im * -im; end tmp_2 = tmp; end
re$95$sqr[re_, im_] := If[Or[LessEqual[N[(im * im), $MachinePrecision], 2e-99], And[N[Not[LessEqual[N[(im * im), $MachinePrecision], 2e+21]], $MachinePrecision], LessEqual[N[(im * im), $MachinePrecision], 2e+175]]], N[(N[(re - im), $MachinePrecision] * N[(re - im), $MachinePrecision]), $MachinePrecision], N[(im * (-im)), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;im \cdot im \leq 2 \cdot 10^{-99} \lor \neg \left(im \cdot im \leq 2 \cdot 10^{+21}\right) \land im \cdot im \leq 2 \cdot 10^{+175}:\\
\;\;\;\;\left(re - im\right) \cdot \left(re - im\right)\\
\mathbf{else}:\\
\;\;\;\;im \cdot \left(-im\right)\\
\end{array}
\end{array}
if (*.f64 im im) < 2e-99 or 2e21 < (*.f64 im im) < 1.9999999999999999e175Initial program 100.0%
difference-of-squares100.0%
add-sqr-sqrt51.3%
sqrt-prod89.9%
sqr-neg89.9%
sqrt-unprod38.5%
add-sqr-sqrt83.4%
sub-neg83.4%
pow183.4%
pow183.4%
pow-prod-up83.4%
metadata-eval83.4%
add-sqr-sqrt40.7%
add-sqr-sqrt22.9%
difference-of-squares22.9%
unpow-prod-down22.9%
Applied egg-rr22.9%
unpow222.9%
unpow222.9%
unswap-sqr22.9%
difference-of-squares22.9%
unpow1/222.9%
unpow1/222.9%
pow-sqr23.0%
metadata-eval23.0%
unpow123.0%
unpow1/223.0%
unpow1/223.0%
pow-sqr23.0%
metadata-eval23.0%
unpow123.0%
difference-of-squares23.0%
unpow1/223.0%
unpow1/223.0%
pow-sqr44.8%
metadata-eval44.8%
unpow144.8%
Simplified83.4%
if 2e-99 < (*.f64 im im) < 2e21 or 1.9999999999999999e175 < (*.f64 im im) Initial program 87.0%
Taylor expanded in re around 0 85.2%
mul-1-neg85.2%
Simplified85.2%
unpow285.2%
Applied egg-rr85.2%
Final simplification84.1%
(FPCore re_sqr (re im) :precision binary64 (* im (- im)))
double re_sqr(double re, double im) {
return im * -im;
}
real(8) function re_sqr(re, im)
real(8), intent (in) :: re
real(8), intent (in) :: im
re_sqr = im * -im
end function
public static double re_sqr(double re, double im) {
return im * -im;
}
def re_sqr(re, im): return im * -im
function re_sqr(re, im) return Float64(im * Float64(-im)) end
function tmp = re_sqr(re, im) tmp = im * -im; end
re$95$sqr[re_, im_] := N[(im * (-im)), $MachinePrecision]
\begin{array}{l}
\\
im \cdot \left(-im\right)
\end{array}
Initial program 94.5%
Taylor expanded in re around 0 54.9%
mul-1-neg54.9%
Simplified54.9%
unpow254.9%
Applied egg-rr54.9%
Final simplification54.9%
herbie shell --seed 2023333
(FPCore re_sqr (re im)
:name "math.square on complex, real part"
:precision binary64
(- (* re re) (* im im)))