Average Error: 30.9 → 7.2
Time: 1.6s
Precision: binary64
\[[re, im]=\mathsf{sort}([re, im])\]
\[\log \left(\sqrt{re \cdot re + im \cdot im}\right)\]
↓
\[\begin{array}{l} \mathbf{if}\;im \leq 2.3920765018178434 \cdot 10^{-189}:\\ \;\;\;\;\log \left(-re\right)\\ \mathbf{elif}\;im \leq 9.61360645752298 \cdot 10^{+33}:\\ \;\;\;\;\log \left(\sqrt{re \cdot re + im \cdot im}\right)\\ \mathbf{else}:\\ \;\;\;\;\log im\\ \end{array}\]
\log \left(\sqrt{re \cdot re + im \cdot im}\right)
↓
\begin{array}{l}
\mathbf{if}\;im \leq 2.3920765018178434 \cdot 10^{-189}:\\
\;\;\;\;\log \left(-re\right)\\

\mathbf{elif}\;im \leq 9.61360645752298 \cdot 10^{+33}:\\
\;\;\;\;\log \left(\sqrt{re \cdot re + im \cdot im}\right)\\

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

\end{array}
(FPCore (re im) :precision binary64 (log (sqrt (+ (* re re) (* im im)))))
↓
(FPCore (re im)
 :precision binary64
 (if (<= im 2.3920765018178434e-189)
   (log (- re))
   (if (<= im 9.61360645752298e+33)
     (log (sqrt (+ (* re re) (* im im))))
     (log im))))
double code(double re, double im) {
	return log(sqrt((re * re) + (im * im)));
}
↓
double code(double re, double im) {
	double tmp;
	if (im <= 2.3920765018178434e-189) {
		tmp = log(-re);
	} else if (im <= 9.61360645752298e+33) {
		tmp = log(sqrt((re * re) + (im * im)));
	} else {
		tmp = log(im);
	}
	return tmp;
}

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 3 regimes

  2. if im < 2.3920765018178434e-189

    1. Initial program 32.3

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

    2. Taylor expanded around -inf 2.9

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

    3. Simplified2.9

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

    if 2.3920765018178434e-189 < im < 9.61360645752297957e33

    1. Initial program 13.4

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

    if 9.61360645752297957e33 < im

    1. Initial program 41.1

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

    2. Taylor expanded around 0 6.9

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

  4. Final simplification7.2

    \[\leadsto \begin{array}{l} \mathbf{if}\;im \leq 2.3920765018178434 \cdot 10^{-189}:\\ \;\;\;\;\log \left(-re\right)\\ \mathbf{elif}\;im \leq 9.61360645752298 \cdot 10^{+33}:\\ \;\;\;\;\log \left(\sqrt{re \cdot re + im \cdot im}\right)\\ \mathbf{else}:\\ \;\;\;\;\log im\\ \end{array}\]

Reproduce

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