math.log10 on complex, real part

Percentage Accurate: 52.1% → 99.0%
Time: 6.6s
Alternatives: 5
Speedup: 0.8×

Specification

?
\[\begin{array}{l} \\ \frac{\log \left(\sqrt{re \cdot re + im \cdot im}\right)}{\log 10} \end{array} \]
(FPCore (re im)
 :precision binary64
 (/ (log (sqrt (+ (* re re) (* im im)))) (log 10.0)))
double code(double re, double im) {
	return log(sqrt(((re * re) + (im * im)))) / log(10.0);
}
real(8) function code(re, im)
    real(8), intent (in) :: re
    real(8), intent (in) :: im
    code = log(sqrt(((re * re) + (im * im)))) / log(10.0d0)
end function
public static double code(double re, double im) {
	return Math.log(Math.sqrt(((re * re) + (im * im)))) / Math.log(10.0);
}
def code(re, im):
	return math.log(math.sqrt(((re * re) + (im * im)))) / math.log(10.0)
function code(re, im)
	return Float64(log(sqrt(Float64(Float64(re * re) + Float64(im * im)))) / log(10.0))
end
function tmp = code(re, im)
	tmp = log(sqrt(((re * re) + (im * im)))) / log(10.0);
end
code[re_, im_] := N[(N[Log[N[Sqrt[N[(N[(re * re), $MachinePrecision] + N[(im * im), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]], $MachinePrecision] / N[Log[10.0], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}

\\
\frac{\log \left(\sqrt{re \cdot re + im \cdot im}\right)}{\log 10}
\end{array}

Sampling outcomes in binary64 precision:

Local Percentage Accuracy vs ?

The average percentage accuracy by input value. Horizontal axis shows value of an input variable; the variable is choosen in the title. Vertical axis is accuracy; higher is better. Red represent the original program, while blue represents Herbie's suggestion. These can be toggled with buttons below the plot. The line is an average while dots represent individual samples.

Accuracy vs Speed?

Herbie found 5 alternatives:

AlternativeAccuracySpeedup
The accuracy (vertical axis) and speed (horizontal axis) of each alternatives. Up and to the right is better. The red square shows the initial program, and each blue circle shows an alternative.The line shows the best available speed-accuracy tradeoffs.

Initial Program: 52.1% accurate, 1.0× speedup?

\[\begin{array}{l} \\ \frac{\log \left(\sqrt{re \cdot re + im \cdot im}\right)}{\log 10} \end{array} \]
(FPCore (re im)
 :precision binary64
 (/ (log (sqrt (+ (* re re) (* im im)))) (log 10.0)))
double code(double re, double im) {
	return log(sqrt(((re * re) + (im * im)))) / log(10.0);
}
real(8) function code(re, im)
    real(8), intent (in) :: re
    real(8), intent (in) :: im
    code = log(sqrt(((re * re) + (im * im)))) / log(10.0d0)
end function
public static double code(double re, double im) {
	return Math.log(Math.sqrt(((re * re) + (im * im)))) / Math.log(10.0);
}
def code(re, im):
	return math.log(math.sqrt(((re * re) + (im * im)))) / math.log(10.0)
function code(re, im)
	return Float64(log(sqrt(Float64(Float64(re * re) + Float64(im * im)))) / log(10.0))
end
function tmp = code(re, im)
	tmp = log(sqrt(((re * re) + (im * im)))) / log(10.0);
end
code[re_, im_] := N[(N[Log[N[Sqrt[N[(N[(re * re), $MachinePrecision] + N[(im * im), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]], $MachinePrecision] / N[Log[10.0], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}

\\
\frac{\log \left(\sqrt{re \cdot re + im \cdot im}\right)}{\log 10}
\end{array}

Alternative 1: 99.0% accurate, 0.7× speedup?

\[\begin{array}{l} \\ \frac{\log \left(\mathsf{hypot}\left(im, re\right)\right)}{-\log 0.1} \end{array} \]
(FPCore (re im) :precision binary64 (/ (log (hypot im re)) (- (log 0.1))))
double code(double re, double im) {
	return log(hypot(im, re)) / -log(0.1);
}
public static double code(double re, double im) {
	return Math.log(Math.hypot(im, re)) / -Math.log(0.1);
}
def code(re, im):
	return math.log(math.hypot(im, re)) / -math.log(0.1)
function code(re, im)
	return Float64(log(hypot(im, re)) / Float64(-log(0.1)))
end
function tmp = code(re, im)
	tmp = log(hypot(im, re)) / -log(0.1);
end
code[re_, im_] := N[(N[Log[N[Sqrt[im ^ 2 + re ^ 2], $MachinePrecision]], $MachinePrecision] / (-N[Log[0.1], $MachinePrecision])), $MachinePrecision]
\begin{array}{l}

\\
\frac{\log \left(\mathsf{hypot}\left(im, re\right)\right)}{-\log 0.1}
\end{array}
Derivation
  1. Initial program 56.5%

    \[\frac{\log \left(\sqrt{re \cdot re + im \cdot im}\right)}{\log 10} \]
  2. Add Preprocessing
  3. Step-by-step derivation
    1. lift-/.f64N/A

      \[\leadsto \color{blue}{\frac{\log \left(\sqrt{re \cdot re + im \cdot im}\right)}{\log 10}} \]
    2. frac-2negN/A

      \[\leadsto \color{blue}{\frac{\mathsf{neg}\left(\log \left(\sqrt{re \cdot re + im \cdot im}\right)\right)}{\mathsf{neg}\left(\log 10\right)}} \]
    3. lower-/.f64N/A

      \[\leadsto \color{blue}{\frac{\mathsf{neg}\left(\log \left(\sqrt{re \cdot re + im \cdot im}\right)\right)}{\mathsf{neg}\left(\log 10\right)}} \]
    4. lower-neg.f64N/A

      \[\leadsto \frac{\color{blue}{-\log \left(\sqrt{re \cdot re + im \cdot im}\right)}}{\mathsf{neg}\left(\log 10\right)} \]
    5. lift-sqrt.f64N/A

      \[\leadsto \frac{-\log \color{blue}{\left(\sqrt{re \cdot re + im \cdot im}\right)}}{\mathsf{neg}\left(\log 10\right)} \]
    6. lift-+.f64N/A

      \[\leadsto \frac{-\log \left(\sqrt{\color{blue}{re \cdot re + im \cdot im}}\right)}{\mathsf{neg}\left(\log 10\right)} \]
    7. +-commutativeN/A

      \[\leadsto \frac{-\log \left(\sqrt{\color{blue}{im \cdot im + re \cdot re}}\right)}{\mathsf{neg}\left(\log 10\right)} \]
    8. lift-*.f64N/A

      \[\leadsto \frac{-\log \left(\sqrt{\color{blue}{im \cdot im} + re \cdot re}\right)}{\mathsf{neg}\left(\log 10\right)} \]
    9. lift-*.f64N/A

      \[\leadsto \frac{-\log \left(\sqrt{im \cdot im + \color{blue}{re \cdot re}}\right)}{\mathsf{neg}\left(\log 10\right)} \]
    10. lower-hypot.f64N/A

      \[\leadsto \frac{-\log \color{blue}{\left(\mathsf{hypot}\left(im, re\right)\right)}}{\mathsf{neg}\left(\log 10\right)} \]
    11. lift-log.f64N/A

      \[\leadsto \frac{-\log \left(\mathsf{hypot}\left(im, re\right)\right)}{\mathsf{neg}\left(\color{blue}{\log 10}\right)} \]
    12. neg-logN/A

      \[\leadsto \frac{-\log \left(\mathsf{hypot}\left(im, re\right)\right)}{\color{blue}{\log \left(\frac{1}{10}\right)}} \]
    13. lower-log.f64N/A

      \[\leadsto \frac{-\log \left(\mathsf{hypot}\left(im, re\right)\right)}{\color{blue}{\log \left(\frac{1}{10}\right)}} \]
    14. metadata-eval99.1

      \[\leadsto \frac{-\log \left(\mathsf{hypot}\left(im, re\right)\right)}{\log \color{blue}{0.1}} \]
  4. Applied rewrites99.1%

    \[\leadsto \color{blue}{\frac{-\log \left(\mathsf{hypot}\left(im, re\right)\right)}{\log 0.1}} \]
  5. Final simplification99.1%

    \[\leadsto \frac{\log \left(\mathsf{hypot}\left(im, re\right)\right)}{-\log 0.1} \]
  6. Add Preprocessing

Alternative 2: 99.1% accurate, 0.8× speedup?

\[\begin{array}{l} \\ \frac{\log \left(\mathsf{hypot}\left(re, im\right)\right)}{\log 10} \end{array} \]
(FPCore (re im) :precision binary64 (/ (log (hypot re im)) (log 10.0)))
double code(double re, double im) {
	return log(hypot(re, im)) / log(10.0);
}
public static double code(double re, double im) {
	return Math.log(Math.hypot(re, im)) / Math.log(10.0);
}
def code(re, im):
	return math.log(math.hypot(re, im)) / math.log(10.0)
function code(re, im)
	return Float64(log(hypot(re, im)) / log(10.0))
end
function tmp = code(re, im)
	tmp = log(hypot(re, im)) / log(10.0);
end
code[re_, im_] := N[(N[Log[N[Sqrt[re ^ 2 + im ^ 2], $MachinePrecision]], $MachinePrecision] / N[Log[10.0], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}

\\
\frac{\log \left(\mathsf{hypot}\left(re, im\right)\right)}{\log 10}
\end{array}
Derivation
  1. Initial program 56.5%

    \[\frac{\log \left(\sqrt{re \cdot re + im \cdot im}\right)}{\log 10} \]
  2. Add Preprocessing
  3. Step-by-step derivation
    1. lift-sqrt.f64N/A

      \[\leadsto \frac{\log \color{blue}{\left(\sqrt{re \cdot re + im \cdot im}\right)}}{\log 10} \]
    2. lift-+.f64N/A

      \[\leadsto \frac{\log \left(\sqrt{\color{blue}{re \cdot re + im \cdot im}}\right)}{\log 10} \]
    3. lift-*.f64N/A

      \[\leadsto \frac{\log \left(\sqrt{\color{blue}{re \cdot re} + im \cdot im}\right)}{\log 10} \]
    4. lift-*.f64N/A

      \[\leadsto \frac{\log \left(\sqrt{re \cdot re + \color{blue}{im \cdot im}}\right)}{\log 10} \]
    5. lower-hypot.f6499.1

      \[\leadsto \frac{\log \color{blue}{\left(\mathsf{hypot}\left(re, im\right)\right)}}{\log 10} \]
  4. Applied rewrites99.1%

    \[\leadsto \frac{\log \color{blue}{\left(\mathsf{hypot}\left(re, im\right)\right)}}{\log 10} \]
  5. Add Preprocessing

Alternative 3: 25.2% accurate, 0.9× speedup?

\[\begin{array}{l} \\ \frac{-0.5 \cdot \mathsf{fma}\left(\frac{re}{im}, \frac{re}{im}, 2 \cdot \log im\right)}{\log 0.1} \end{array} \]
(FPCore (re im)
 :precision binary64
 (/ (* -0.5 (fma (/ re im) (/ re im) (* 2.0 (log im)))) (log 0.1)))
double code(double re, double im) {
	return (-0.5 * fma((re / im), (re / im), (2.0 * log(im)))) / log(0.1);
}
function code(re, im)
	return Float64(Float64(-0.5 * fma(Float64(re / im), Float64(re / im), Float64(2.0 * log(im)))) / log(0.1))
end
code[re_, im_] := N[(N[(-0.5 * N[(N[(re / im), $MachinePrecision] * N[(re / im), $MachinePrecision] + N[(2.0 * N[Log[im], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[Log[0.1], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}

\\
\frac{-0.5 \cdot \mathsf{fma}\left(\frac{re}{im}, \frac{re}{im}, 2 \cdot \log im\right)}{\log 0.1}
\end{array}
Derivation
  1. Initial program 56.5%

    \[\frac{\log \left(\sqrt{re \cdot re + im \cdot im}\right)}{\log 10} \]
  2. Add Preprocessing
  3. Step-by-step derivation
    1. lift-/.f64N/A

      \[\leadsto \color{blue}{\frac{\log \left(\sqrt{re \cdot re + im \cdot im}\right)}{\log 10}} \]
    2. frac-2negN/A

      \[\leadsto \color{blue}{\frac{\mathsf{neg}\left(\log \left(\sqrt{re \cdot re + im \cdot im}\right)\right)}{\mathsf{neg}\left(\log 10\right)}} \]
    3. lower-/.f64N/A

      \[\leadsto \color{blue}{\frac{\mathsf{neg}\left(\log \left(\sqrt{re \cdot re + im \cdot im}\right)\right)}{\mathsf{neg}\left(\log 10\right)}} \]
    4. lower-neg.f64N/A

      \[\leadsto \frac{\color{blue}{-\log \left(\sqrt{re \cdot re + im \cdot im}\right)}}{\mathsf{neg}\left(\log 10\right)} \]
    5. lift-sqrt.f64N/A

      \[\leadsto \frac{-\log \color{blue}{\left(\sqrt{re \cdot re + im \cdot im}\right)}}{\mathsf{neg}\left(\log 10\right)} \]
    6. lift-+.f64N/A

      \[\leadsto \frac{-\log \left(\sqrt{\color{blue}{re \cdot re + im \cdot im}}\right)}{\mathsf{neg}\left(\log 10\right)} \]
    7. +-commutativeN/A

      \[\leadsto \frac{-\log \left(\sqrt{\color{blue}{im \cdot im + re \cdot re}}\right)}{\mathsf{neg}\left(\log 10\right)} \]
    8. lift-*.f64N/A

      \[\leadsto \frac{-\log \left(\sqrt{\color{blue}{im \cdot im} + re \cdot re}\right)}{\mathsf{neg}\left(\log 10\right)} \]
    9. lift-*.f64N/A

      \[\leadsto \frac{-\log \left(\sqrt{im \cdot im + \color{blue}{re \cdot re}}\right)}{\mathsf{neg}\left(\log 10\right)} \]
    10. lower-hypot.f64N/A

      \[\leadsto \frac{-\log \color{blue}{\left(\mathsf{hypot}\left(im, re\right)\right)}}{\mathsf{neg}\left(\log 10\right)} \]
    11. lift-log.f64N/A

      \[\leadsto \frac{-\log \left(\mathsf{hypot}\left(im, re\right)\right)}{\mathsf{neg}\left(\color{blue}{\log 10}\right)} \]
    12. neg-logN/A

      \[\leadsto \frac{-\log \left(\mathsf{hypot}\left(im, re\right)\right)}{\color{blue}{\log \left(\frac{1}{10}\right)}} \]
    13. lower-log.f64N/A

      \[\leadsto \frac{-\log \left(\mathsf{hypot}\left(im, re\right)\right)}{\color{blue}{\log \left(\frac{1}{10}\right)}} \]
    14. metadata-eval99.1

      \[\leadsto \frac{-\log \left(\mathsf{hypot}\left(im, re\right)\right)}{\log \color{blue}{0.1}} \]
  4. Applied rewrites99.1%

    \[\leadsto \color{blue}{\frac{-\log \left(\mathsf{hypot}\left(im, re\right)\right)}{\log 0.1}} \]
  5. Step-by-step derivation
    1. lift-neg.f64N/A

      \[\leadsto \frac{\color{blue}{\mathsf{neg}\left(\log \left(\mathsf{hypot}\left(im, re\right)\right)\right)}}{\log \frac{1}{10}} \]
    2. lift-log.f64N/A

      \[\leadsto \frac{\mathsf{neg}\left(\color{blue}{\log \left(\mathsf{hypot}\left(im, re\right)\right)}\right)}{\log \frac{1}{10}} \]
    3. lift-hypot.f64N/A

      \[\leadsto \frac{\mathsf{neg}\left(\log \color{blue}{\left(\sqrt{im \cdot im + re \cdot re}\right)}\right)}{\log \frac{1}{10}} \]
    4. pow1/2N/A

      \[\leadsto \frac{\mathsf{neg}\left(\log \color{blue}{\left({\left(im \cdot im + re \cdot re\right)}^{\frac{1}{2}}\right)}\right)}{\log \frac{1}{10}} \]
    5. lift-*.f64N/A

      \[\leadsto \frac{\mathsf{neg}\left(\log \left({\left(\color{blue}{im \cdot im} + re \cdot re\right)}^{\frac{1}{2}}\right)\right)}{\log \frac{1}{10}} \]
    6. lift-*.f64N/A

      \[\leadsto \frac{\mathsf{neg}\left(\log \left({\left(im \cdot im + \color{blue}{re \cdot re}\right)}^{\frac{1}{2}}\right)\right)}{\log \frac{1}{10}} \]
    7. +-commutativeN/A

      \[\leadsto \frac{\mathsf{neg}\left(\log \left({\color{blue}{\left(re \cdot re + im \cdot im\right)}}^{\frac{1}{2}}\right)\right)}{\log \frac{1}{10}} \]
    8. lift-+.f64N/A

      \[\leadsto \frac{\mathsf{neg}\left(\log \left({\color{blue}{\left(re \cdot re + im \cdot im\right)}}^{\frac{1}{2}}\right)\right)}{\log \frac{1}{10}} \]
    9. log-powN/A

      \[\leadsto \frac{\mathsf{neg}\left(\color{blue}{\frac{1}{2} \cdot \log \left(re \cdot re + im \cdot im\right)}\right)}{\log \frac{1}{10}} \]
    10. distribute-lft-neg-inN/A

      \[\leadsto \frac{\color{blue}{\left(\mathsf{neg}\left(\frac{1}{2}\right)\right) \cdot \log \left(re \cdot re + im \cdot im\right)}}{\log \frac{1}{10}} \]
    11. metadata-evalN/A

      \[\leadsto \frac{\color{blue}{\frac{-1}{2}} \cdot \log \left(re \cdot re + im \cdot im\right)}{\log \frac{1}{10}} \]
    12. lower-*.f64N/A

      \[\leadsto \frac{\color{blue}{\frac{-1}{2} \cdot \log \left(re \cdot re + im \cdot im\right)}}{\log \frac{1}{10}} \]
    13. lower-log.f6456.6

      \[\leadsto \frac{-0.5 \cdot \color{blue}{\log \left(re \cdot re + im \cdot im\right)}}{\log 0.1} \]
    14. lift-+.f64N/A

      \[\leadsto \frac{\frac{-1}{2} \cdot \log \color{blue}{\left(re \cdot re + im \cdot im\right)}}{\log \frac{1}{10}} \]
    15. lift-*.f64N/A

      \[\leadsto \frac{\frac{-1}{2} \cdot \log \left(\color{blue}{re \cdot re} + im \cdot im\right)}{\log \frac{1}{10}} \]
    16. lower-fma.f6456.6

      \[\leadsto \frac{-0.5 \cdot \log \color{blue}{\left(\mathsf{fma}\left(re, re, im \cdot im\right)\right)}}{\log 0.1} \]
  6. Applied rewrites56.6%

    \[\leadsto \frac{\color{blue}{-0.5 \cdot \log \left(\mathsf{fma}\left(re, re, im \cdot im\right)\right)}}{\log 0.1} \]
  7. Taylor expanded in im around inf

    \[\leadsto \frac{\frac{-1}{2} \cdot \color{blue}{\left(-2 \cdot \log \left(\frac{1}{im}\right) + \frac{{re}^{2}}{{im}^{2}}\right)}}{\log \frac{1}{10}} \]
  8. Step-by-step derivation
    1. +-commutativeN/A

      \[\leadsto \frac{\frac{-1}{2} \cdot \color{blue}{\left(\frac{{re}^{2}}{{im}^{2}} + -2 \cdot \log \left(\frac{1}{im}\right)\right)}}{\log \frac{1}{10}} \]
    2. unpow2N/A

      \[\leadsto \frac{\frac{-1}{2} \cdot \left(\frac{\color{blue}{re \cdot re}}{{im}^{2}} + -2 \cdot \log \left(\frac{1}{im}\right)\right)}{\log \frac{1}{10}} \]
    3. unpow2N/A

      \[\leadsto \frac{\frac{-1}{2} \cdot \left(\frac{re \cdot re}{\color{blue}{im \cdot im}} + -2 \cdot \log \left(\frac{1}{im}\right)\right)}{\log \frac{1}{10}} \]
    4. times-fracN/A

      \[\leadsto \frac{\frac{-1}{2} \cdot \left(\color{blue}{\frac{re}{im} \cdot \frac{re}{im}} + -2 \cdot \log \left(\frac{1}{im}\right)\right)}{\log \frac{1}{10}} \]
    5. lower-fma.f64N/A

      \[\leadsto \frac{\frac{-1}{2} \cdot \color{blue}{\mathsf{fma}\left(\frac{re}{im}, \frac{re}{im}, -2 \cdot \log \left(\frac{1}{im}\right)\right)}}{\log \frac{1}{10}} \]
    6. lower-/.f64N/A

      \[\leadsto \frac{\frac{-1}{2} \cdot \mathsf{fma}\left(\color{blue}{\frac{re}{im}}, \frac{re}{im}, -2 \cdot \log \left(\frac{1}{im}\right)\right)}{\log \frac{1}{10}} \]
    7. lower-/.f64N/A

      \[\leadsto \frac{\frac{-1}{2} \cdot \mathsf{fma}\left(\frac{re}{im}, \color{blue}{\frac{re}{im}}, -2 \cdot \log \left(\frac{1}{im}\right)\right)}{\log \frac{1}{10}} \]
    8. log-recN/A

      \[\leadsto \frac{\frac{-1}{2} \cdot \mathsf{fma}\left(\frac{re}{im}, \frac{re}{im}, -2 \cdot \color{blue}{\left(\mathsf{neg}\left(\log im\right)\right)}\right)}{\log \frac{1}{10}} \]
    9. mul-1-negN/A

      \[\leadsto \frac{\frac{-1}{2} \cdot \mathsf{fma}\left(\frac{re}{im}, \frac{re}{im}, -2 \cdot \color{blue}{\left(-1 \cdot \log im\right)}\right)}{\log \frac{1}{10}} \]
    10. associate-*r*N/A

      \[\leadsto \frac{\frac{-1}{2} \cdot \mathsf{fma}\left(\frac{re}{im}, \frac{re}{im}, \color{blue}{\left(-2 \cdot -1\right) \cdot \log im}\right)}{\log \frac{1}{10}} \]
    11. metadata-evalN/A

      \[\leadsto \frac{\frac{-1}{2} \cdot \mathsf{fma}\left(\frac{re}{im}, \frac{re}{im}, \color{blue}{2} \cdot \log im\right)}{\log \frac{1}{10}} \]
    12. lower-*.f64N/A

      \[\leadsto \frac{\frac{-1}{2} \cdot \mathsf{fma}\left(\frac{re}{im}, \frac{re}{im}, \color{blue}{2 \cdot \log im}\right)}{\log \frac{1}{10}} \]
    13. lower-log.f6422.6

      \[\leadsto \frac{-0.5 \cdot \mathsf{fma}\left(\frac{re}{im}, \frac{re}{im}, 2 \cdot \color{blue}{\log im}\right)}{\log 0.1} \]
  9. Applied rewrites22.6%

    \[\leadsto \frac{-0.5 \cdot \color{blue}{\mathsf{fma}\left(\frac{re}{im}, \frac{re}{im}, 2 \cdot \log im\right)}}{\log 0.1} \]
  10. Add Preprocessing

Alternative 4: 26.9% accurate, 1.1× speedup?

\[\begin{array}{l} \\ \frac{\log im}{-\log 0.1} \end{array} \]
(FPCore (re im) :precision binary64 (/ (log im) (- (log 0.1))))
double code(double re, double im) {
	return log(im) / -log(0.1);
}
real(8) function code(re, im)
    real(8), intent (in) :: re
    real(8), intent (in) :: im
    code = log(im) / -log(0.1d0)
end function
public static double code(double re, double im) {
	return Math.log(im) / -Math.log(0.1);
}
def code(re, im):
	return math.log(im) / -math.log(0.1)
function code(re, im)
	return Float64(log(im) / Float64(-log(0.1)))
end
function tmp = code(re, im)
	tmp = log(im) / -log(0.1);
end
code[re_, im_] := N[(N[Log[im], $MachinePrecision] / (-N[Log[0.1], $MachinePrecision])), $MachinePrecision]
\begin{array}{l}

\\
\frac{\log im}{-\log 0.1}
\end{array}
Derivation
  1. Initial program 56.5%

    \[\frac{\log \left(\sqrt{re \cdot re + im \cdot im}\right)}{\log 10} \]
  2. Add Preprocessing
  3. Taylor expanded in re around 0

    \[\leadsto \frac{\color{blue}{\log im}}{\log 10} \]
  4. Step-by-step derivation
    1. lower-log.f6423.9

      \[\leadsto \frac{\color{blue}{\log im}}{\log 10} \]
  5. Applied rewrites23.9%

    \[\leadsto \frac{\color{blue}{\log im}}{\log 10} \]
  6. Step-by-step derivation
    1. lift-/.f64N/A

      \[\leadsto \color{blue}{\frac{\log im}{\log 10}} \]
    2. frac-2negN/A

      \[\leadsto \color{blue}{\frac{\mathsf{neg}\left(\log im\right)}{\mathsf{neg}\left(\log 10\right)}} \]
    3. lift-log.f64N/A

      \[\leadsto \frac{\mathsf{neg}\left(\log im\right)}{\mathsf{neg}\left(\color{blue}{\log 10}\right)} \]
    4. neg-logN/A

      \[\leadsto \frac{\mathsf{neg}\left(\log im\right)}{\color{blue}{\log \left(\frac{1}{10}\right)}} \]
    5. metadata-evalN/A

      \[\leadsto \frac{\mathsf{neg}\left(\log im\right)}{\log \color{blue}{\frac{1}{10}}} \]
    6. lift-log.f64N/A

      \[\leadsto \frac{\mathsf{neg}\left(\log im\right)}{\color{blue}{\log \frac{1}{10}}} \]
    7. lower-/.f64N/A

      \[\leadsto \color{blue}{\frac{\mathsf{neg}\left(\log im\right)}{\log \frac{1}{10}}} \]
    8. lower-neg.f6423.9

      \[\leadsto \frac{\color{blue}{-\log im}}{\log 0.1} \]
  7. Applied rewrites23.9%

    \[\leadsto \color{blue}{\frac{-\log im}{\log 0.1}} \]
  8. Final simplification23.9%

    \[\leadsto \frac{\log im}{-\log 0.1} \]
  9. Add Preprocessing

Alternative 5: 26.9% accurate, 1.1× speedup?

\[\begin{array}{l} \\ \frac{\log im}{\log 10} \end{array} \]
(FPCore (re im) :precision binary64 (/ (log im) (log 10.0)))
double code(double re, double im) {
	return log(im) / log(10.0);
}
real(8) function code(re, im)
    real(8), intent (in) :: re
    real(8), intent (in) :: im
    code = log(im) / log(10.0d0)
end function
public static double code(double re, double im) {
	return Math.log(im) / Math.log(10.0);
}
def code(re, im):
	return math.log(im) / math.log(10.0)
function code(re, im)
	return Float64(log(im) / log(10.0))
end
function tmp = code(re, im)
	tmp = log(im) / log(10.0);
end
code[re_, im_] := N[(N[Log[im], $MachinePrecision] / N[Log[10.0], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}

\\
\frac{\log im}{\log 10}
\end{array}
Derivation
  1. Initial program 56.5%

    \[\frac{\log \left(\sqrt{re \cdot re + im \cdot im}\right)}{\log 10} \]
  2. Add Preprocessing
  3. Taylor expanded in re around 0

    \[\leadsto \frac{\color{blue}{\log im}}{\log 10} \]
  4. Step-by-step derivation
    1. lower-log.f6423.9

      \[\leadsto \frac{\color{blue}{\log im}}{\log 10} \]
  5. Applied rewrites23.9%

    \[\leadsto \frac{\color{blue}{\log im}}{\log 10} \]
  6. Add Preprocessing

Reproduce

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