Average Error: 30.8 → 17.0
Time: 4.6s
Precision: 64
\[\log \left(\sqrt{re \cdot re + im \cdot im}\right)\]
↓
\[\begin{array}{l} \mathbf{if}\;re \le -1.427484018494741 \cdot 10^{+134}:\\ \;\;\;\;\log \left(-re\right)\\ \mathbf{elif}\;re \le 1.5824798583418597 \cdot 10^{+66}:\\ \;\;\;\;\log \left(\sqrt{im \cdot im + re \cdot re}\right)\\ \mathbf{else}:\\ \;\;\;\;\log re\\ \end{array}\]
\log \left(\sqrt{re \cdot re + im \cdot im}\right)
↓
\begin{array}{l}
\mathbf{if}\;re \le -1.427484018494741 \cdot 10^{+134}:\\
\;\;\;\;\log \left(-re\right)\\

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

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

\end{array}
double f(double re, double im) {
        double r1497781 = re;
        double r1497782 = r1497781 * r1497781;
        double r1497783 = im;
        double r1497784 = r1497783 * r1497783;
        double r1497785 = r1497782 + r1497784;
        double r1497786 = sqrt(r1497785);
        double r1497787 = log(r1497786);
        return r1497787;
}
↓
double f(double re, double im) {
        double r1497788 = re;
        double r1497789 = -1.427484018494741e+134;
        bool r1497790 = r1497788 <= r1497789;
        double r1497791 = -r1497788;
        double r1497792 = log(r1497791);
        double r1497793 = 1.5824798583418597e+66;
        bool r1497794 = r1497788 <= r1497793;
        double r1497795 = im;
        double r1497796 = r1497795 * r1497795;
        double r1497797 = r1497788 * r1497788;
        double r1497798 = r1497796 + r1497797;
        double r1497799 = sqrt(r1497798);
        double r1497800 = log(r1497799);
        double r1497801 = log(r1497788);
        double r1497802 = r1497794 ? r1497800 : r1497801;
        double r1497803 = r1497790 ? r1497792 : r1497802;
        return r1497803;
}

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 < -1.427484018494741e+134

    1. Initial program 56.6

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

    2. Taylor expanded around -inf 7.3

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

    3. Simplified7.3

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

    if -1.427484018494741e+134 < re < 1.5824798583418597e+66

    1. Initial program 21.1

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

    if 1.5824798583418597e+66 < re

    1. Initial program 46.1

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

    2. Taylor expanded around inf 10.0

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

  4. Final simplification17.0

    \[\leadsto \begin{array}{l} \mathbf{if}\;re \le -1.427484018494741 \cdot 10^{+134}:\\ \;\;\;\;\log \left(-re\right)\\ \mathbf{elif}\;re \le 1.5824798583418597 \cdot 10^{+66}:\\ \;\;\;\;\log \left(\sqrt{im \cdot im + re \cdot re}\right)\\ \mathbf{else}:\\ \;\;\;\;\log re\\ \end{array}\]

Reproduce

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