Average Error: 31.4 → 17.1
Time: 1.7s
Precision: binary64
\[\log \left(\sqrt{re \cdot re + im \cdot im}\right)\]
↓
\[\begin{array}{l} \mathbf{if}\;re \le -2.17857680956286608 \cdot 10^{141}:\\ \;\;\;\;\log \left(-1 \cdot re\right)\\ \mathbf{elif}\;re \le -1.6305656569805007 \cdot 10^{-266}:\\ \;\;\;\;\log \left(\sqrt{re \cdot re + im \cdot im}\right)\\ \mathbf{elif}\;re \le 6.85794034380905002 \cdot 10^{-290}:\\ \;\;\;\;\log im\\ \mathbf{elif}\;re \le 1.4073591105666147 \cdot 10^{73}:\\ \;\;\;\;\log \left(\sqrt{re \cdot re + im \cdot im}\right)\\ \mathbf{else}:\\ \;\;\;\;\log re\\ \end{array}\]
\log \left(\sqrt{re \cdot re + im \cdot im}\right)
↓
\begin{array}{l}
\mathbf{if}\;re \le -2.17857680956286608 \cdot 10^{141}:\\
\;\;\;\;\log \left(-1 \cdot re\right)\\

\mathbf{elif}\;re \le -1.6305656569805007 \cdot 10^{-266}:\\
\;\;\;\;\log \left(\sqrt{re \cdot re + im \cdot im}\right)\\

\mathbf{elif}\;re \le 6.85794034380905002 \cdot 10^{-290}:\\
\;\;\;\;\log im\\

\mathbf{elif}\;re \le 1.4073591105666147 \cdot 10^{73}:\\
\;\;\;\;\log \left(\sqrt{re \cdot re + im \cdot im}\right)\\

\mathbf{else}:\\
\;\;\;\;\log re\\

\end{array}
double code(double re, double im) {
	return ((double) log(((double) sqrt(((double) (((double) (re * re)) + ((double) (im * im))))))));
}
↓
double code(double re, double im) {
	double VAR;
	if ((re <= -2.178576809562866e+141)) {
		VAR = ((double) log(((double) (-1.0 * re))));
	} else {
		double VAR_1;
		if ((re <= -1.6305656569805007e-266)) {
			VAR_1 = ((double) log(((double) sqrt(((double) (((double) (re * re)) + ((double) (im * im))))))));
		} else {
			double VAR_2;
			if ((re <= 6.85794034380905e-290)) {
				VAR_2 = ((double) log(im));
			} else {
				double VAR_3;
				if ((re <= 1.4073591105666147e+73)) {
					VAR_3 = ((double) log(((double) sqrt(((double) (((double) (re * re)) + ((double) (im * im))))))));
				} else {
					VAR_3 = ((double) log(re));
				}
				VAR_2 = VAR_3;
			}
			VAR_1 = VAR_2;
		}
		VAR = VAR_1;
	}
	return VAR;
}

Error

Bits error versus re

Bits error versus im

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Split input into 4 regimes

  2. if re < -2.17857680956286608e141

    1. Initial program 59.5

      \[\log \left(\sqrt{re \cdot re + im \cdot im}\right)\]

    2. Taylor expanded around -inf 6.7

      \[\leadsto \log \color{blue}{\left(-1 \cdot re\right)}\]

    if -2.17857680956286608e141 < re < -1.6305656569805007e-266 or 6.85794034380905002e-290 < re < 1.4073591105666147e73

    1. Initial program 20.4

      \[\log \left(\sqrt{re \cdot re + im \cdot im}\right)\]

    if -1.6305656569805007e-266 < re < 6.85794034380905002e-290

    1. Initial program 31.2

      \[\log \left(\sqrt{re \cdot re + im \cdot im}\right)\]

    2. Taylor expanded around 0 32.0

      \[\leadsto \log \color{blue}{im}\]

    if 1.4073591105666147e73 < re

    1. Initial program 47.5

      \[\log \left(\sqrt{re \cdot re + im \cdot im}\right)\]

    2. Taylor expanded around inf 9.5

      \[\leadsto \log \color{blue}{re}\]
  3. Recombined 4 regimes into one program.

  4. Final simplification17.1

    \[\leadsto \begin{array}{l} \mathbf{if}\;re \le -2.17857680956286608 \cdot 10^{141}:\\ \;\;\;\;\log \left(-1 \cdot re\right)\\ \mathbf{elif}\;re \le -1.6305656569805007 \cdot 10^{-266}:\\ \;\;\;\;\log \left(\sqrt{re \cdot re + im \cdot im}\right)\\ \mathbf{elif}\;re \le 6.85794034380905002 \cdot 10^{-290}:\\ \;\;\;\;\log im\\ \mathbf{elif}\;re \le 1.4073591105666147 \cdot 10^{73}:\\ \;\;\;\;\log \left(\sqrt{re \cdot re + im \cdot im}\right)\\ \mathbf{else}:\\ \;\;\;\;\log re\\ \end{array}\]

Reproduce

herbie shell --seed 2020174 
(FPCore (re im)
  :name "math.log/1 on complex, real part"
  :precision binary64
  (log (sqrt (+ (* re re) (* im im)))))