\sqrt{re \cdot re + im \cdot im}\begin{array}{l}
\mathbf{if}\;re \le -3.5104348785110151 \cdot 10^{151}:\\
\;\;\;\;-1 \cdot re\\
\mathbf{elif}\;re \le 1.6805901359658878 \cdot 10^{131}:\\
\;\;\;\;\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 <= -3.510434878511015e+151)) {
VAR = ((double) (-1.0 * re));
} else {
double VAR_1;
if ((re <= 1.6805901359658878e+131)) {
VAR_1 = ((double) sqrt(((double) (((double) (re * re)) + ((double) (im * im))))));
} else {
VAR_1 = re;
}
VAR = VAR_1;
}
return VAR;
}



Bits error versus re



Bits error versus im
Results
if re < -3.5104348785110151e151Initial program 63.2
Taylor expanded around -inf 8.2
if -3.5104348785110151e151 < re < 1.6805901359658878e131Initial program 20.9
if 1.6805901359658878e131 < re Initial program 57.8
Taylor expanded around inf 9.1
Final simplification17.6
herbie shell --seed 2020171
(FPCore (re im)
:name "math.abs on complex"
:precision binary64
(sqrt (+ (* re re) (* im im))))