\log \left(\sqrt{re \cdot re + im \cdot im}\right)\begin{array}{l}
\mathbf{if}\;re \le -7.58989654767235 \cdot 10^{122}:\\
\;\;\;\;\log \left(-1 \cdot re\right)\\
\mathbf{elif}\;re \le -4.17286400801288077 \cdot 10^{-274}:\\
\;\;\;\;\log \left(\sqrt{re \cdot re + im \cdot im}\right)\\
\mathbf{elif}\;re \le 1.8902523850390375 \cdot 10^{-167}:\\
\;\;\;\;\log im\\
\mathbf{elif}\;re \le 3.6652606826977648 \cdot 10^{101}:\\
\;\;\;\;\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 <= -7.58989654767235e+122)) {
VAR = log((-1.0 * re));
} else {
double VAR_1;
if ((re <= -4.172864008012881e-274)) {
VAR_1 = log(sqrt(((re * re) + (im * im))));
} else {
double VAR_2;
if ((re <= 1.8902523850390375e-167)) {
VAR_2 = log(im);
} else {
double VAR_3;
if ((re <= 3.665260682697765e+101)) {
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 < -7.58989654767235e+122Initial program 56.7
Taylor expanded around -inf 8.2
if -7.58989654767235e+122 < re < -4.172864008012881e-274 or 1.8902523850390375e-167 < re < 3.665260682697765e+101Initial program 18.7
if -4.172864008012881e-274 < re < 1.8902523850390375e-167Initial program 31.6
Taylor expanded around 0 34.5
if 3.665260682697765e+101 < re Initial program 52.0
Taylor expanded around inf 9.0
Final simplification17.8
herbie shell --seed 2020079
(FPCore (re im)
:name "math.log/1 on complex, real part"
:precision binary64
(log (sqrt (+ (* re re) (* im im)))))