\log \left(\sqrt{re \cdot re + im \cdot im}\right)\begin{array}{l}
\mathbf{if}\;re \le -3.8249499853926235 \cdot 10^{103}:\\
\;\;\;\;\log \left(-1 \cdot re\right)\\
\mathbf{elif}\;re \le 2.56439878537218745 \cdot 10^{-244}:\\
\;\;\;\;\log \left(\sqrt{re \cdot re + im \cdot im}\right)\\
\mathbf{elif}\;re \le 2.9654757473955426 \cdot 10^{-173}:\\
\;\;\;\;\log im\\
\mathbf{elif}\;re \le 1.556390230884587 \cdot 10^{144}:\\
\;\;\;\;\log \left(\sqrt{re \cdot re + im \cdot im}\right)\\
\mathbf{else}:\\
\;\;\;\;\log re\\
\end{array}double code(double re, double im) {
return log(sqrt(((re * re) + (im * im))));
}
double code(double re, double im) {
double VAR;
if ((re <= -3.8249499853926235e+103)) {
VAR = log((-1.0 * re));
} else {
double VAR_1;
if ((re <= 2.5643987853721874e-244)) {
VAR_1 = log(sqrt(((re * re) + (im * im))));
} else {
double VAR_2;
if ((re <= 2.9654757473955426e-173)) {
VAR_2 = log(im);
} else {
double VAR_3;
if ((re <= 1.5563902308845874e+144)) {
VAR_3 = log(sqrt(((re * re) + (im * im))));
} else {
VAR_3 = log(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 < -3.8249499853926235e+103Initial program 52.4
Taylor expanded around -inf 8.9
if -3.8249499853926235e+103 < re < 2.5643987853721874e-244 or 2.9654757473955426e-173 < re < 1.5563902308845874e+144Initial program 19.8
if 2.5643987853721874e-244 < re < 2.9654757473955426e-173Initial program 32.1
Taylor expanded around 0 35.2
if 1.5563902308845874e+144 < re Initial program 61.2
Taylor expanded around inf 5.2
Final simplification17.0
herbie shell --seed 2020075
(FPCore (re im)
:name "math.log/1 on complex, real part"
:precision binary64
(log (sqrt (+ (* re re) (* im im)))))