Average Error: 31.9 → 17.8
Time: 1.1s
Precision: 64
\[\log \left(\sqrt{re \cdot re + im \cdot im}\right)\]
↓
\[\begin{array}{l} \mathbf{if}\;re \le -2.27109209614237641 \cdot 10^{59}:\\ \;\;\;\;\log \left(-1 \cdot re\right)\\ \mathbf{elif}\;re \le 7.01675339023471452 \cdot 10^{131}:\\ \;\;\;\;\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.27109209614237641 \cdot 10^{59}:\\
\;\;\;\;\log \left(-1 \cdot re\right)\\

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

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

\end{array}
double f(double re, double im) {
        double r26612 = re;
        double r26613 = r26612 * r26612;
        double r26614 = im;
        double r26615 = r26614 * r26614;
        double r26616 = r26613 + r26615;
        double r26617 = sqrt(r26616);
        double r26618 = log(r26617);
        return r26618;
}
↓
double f(double re, double im) {
        double r26619 = re;
        double r26620 = -2.2710920961423764e+59;
        bool r26621 = r26619 <= r26620;
        double r26622 = -1.0;
        double r26623 = r26622 * r26619;
        double r26624 = log(r26623);
        double r26625 = 7.0167533902347145e+131;
        bool r26626 = r26619 <= r26625;
        double r26627 = r26619 * r26619;
        double r26628 = im;
        double r26629 = r26628 * r26628;
        double r26630 = r26627 + r26629;
        double r26631 = sqrt(r26630);
        double r26632 = log(r26631);
        double r26633 = log(r26619);
        double r26634 = r26626 ? r26632 : r26633;
        double r26635 = r26621 ? r26624 : r26634;
        return r26635;
}

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 re < -2.2710920961423764e+59

    1. Initial program 45.1

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

    2. Taylor expanded around -inf 11.0

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

    if -2.2710920961423764e+59 < re < 7.0167533902347145e+131

    1. Initial program 22.2

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

    if 7.0167533902347145e+131 < re

    1. Initial program 57.7

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

    2. Taylor expanded around inf 7.1

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

  4. Final simplification17.8

    \[\leadsto \begin{array}{l} \mathbf{if}\;re \le -2.27109209614237641 \cdot 10^{59}:\\ \;\;\;\;\log \left(-1 \cdot re\right)\\ \mathbf{elif}\;re \le 7.01675339023471452 \cdot 10^{131}:\\ \;\;\;\;\log \left(\sqrt{re \cdot re + im \cdot im}\right)\\ \mathbf{else}:\\ \;\;\;\;\log re\\ \end{array}\]

Reproduce

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