\sqrt{re \cdot re + im \cdot im}\begin{array}{l}
\mathbf{if}\;re \le -6.10750123063483244 \cdot 10^{116}:\\
\;\;\;\;-1 \cdot re\\
\mathbf{elif}\;re \le -2.80809519100113736 \cdot 10^{-191}:\\
\;\;\;\;\sqrt{re \cdot re + im \cdot im}\\
\mathbf{elif}\;re \le 1.99786214231465739 \cdot 10^{-154}:\\
\;\;\;\;im\\
\mathbf{elif}\;re \le 4.03768629029534308 \cdot 10^{74}:\\
\;\;\;\;\sqrt{re \cdot re + im \cdot im}\\
\mathbf{else}:\\
\;\;\;\;re\\
\end{array}double code(double re, double im) {
return ((double) sqrt(((double) (((double) (re * re)) + ((double) (im * im))))));
}
double code(double re, double im) {
double VAR;
if ((re <= -6.1075012306348324e+116)) {
VAR = ((double) (-1.0 * re));
} else {
double VAR_1;
if ((re <= -2.8080951910011374e-191)) {
VAR_1 = ((double) sqrt(((double) (((double) (re * re)) + ((double) (im * im))))));
} else {
double VAR_2;
if ((re <= 1.9978621423146574e-154)) {
VAR_2 = im;
} else {
double VAR_3;
if ((re <= 4.037686290295343e+74)) {
VAR_3 = ((double) sqrt(((double) (((double) (re * re)) + ((double) (im * im))))));
} else {
VAR_3 = re;
}
VAR_2 = VAR_3;
}
VAR_1 = VAR_2;
}
VAR = VAR_1;
}
return VAR;
}



Bits error versus re



Bits error versus im
Results
if re < -6.10750123063483244e116Initial program 54.4
Taylor expanded around -inf 10.2
if -6.10750123063483244e116 < re < -2.80809519100113736e-191 or 1.99786214231465739e-154 < re < 4.03768629029534308e74Initial program 16.9
if -2.80809519100113736e-191 < re < 1.99786214231465739e-154Initial program 31.6
Taylor expanded around 0 35.1
if 4.03768629029534308e74 < re Initial program 48.0
Taylor expanded around inf 13.0
Final simplification19.2
herbie shell --seed 2020153
(FPCore (re im)
:name "math.abs on complex"
:precision binary64
(sqrt (+ (* re re) (* im im))))