math.log10 on complex, real part

Percentage Accurate: 50.7% → 99.6%

Time: 7.3s

Alternatives: 3

Speedup: 1.0×

Specification

Math

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

FPCore

(FPCore (re im)
 :precision binary64
 (/ (log (sqrt (+ (* re re) (* im im)))) (log 10.0)))

C

double code(double re, double im) {
	return log(sqrt(((re * re) + (im * im)))) / log(10.0);
}

Fortran

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

Java

public static double code(double re, double im) {
	return Math.log(Math.sqrt(((re * re) + (im * im)))) / Math.log(10.0);
}

Python

def code(re, im):
	return math.log(math.sqrt(((re * re) + (im * im)))) / math.log(10.0)

Julia

function code(re, im)
	return Float64(log(sqrt(Float64(Float64(re * re) + Float64(im * im)))) / log(10.0))
end

MATLAB

function tmp = code(re, im)
	tmp = log(sqrt(((re * re) + (im * im)))) / log(10.0);
end

Wolfram

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]

Initial Program: 50.7% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (re im)
 :precision binary64
 (/ (log (sqrt (+ (* re re) (* im im)))) (log 10.0)))

C

double code(double re, double im) {
	return log(sqrt(((re * re) + (im * im)))) / log(10.0);
}

Fortran

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

Java

public static double code(double re, double im) {
	return Math.log(Math.sqrt(((re * re) + (im * im)))) / Math.log(10.0);
}

Python

def code(re, im):
	return math.log(math.sqrt(((re * re) + (im * im)))) / math.log(10.0)

Julia

function code(re, im)
	return Float64(log(sqrt(Float64(Float64(re * re) + Float64(im * im)))) / log(10.0))
end

MATLAB

function tmp = code(re, im)
	tmp = log(sqrt(((re * re) + (im * im)))) / log(10.0);
end

Wolfram

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]

Alternative 1: 99.6% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \log \left(\mathsf{hypot}\left(re, im\right)\right) \cdot \sqrt[3]{{\log 10}^{-3}} \end{array} \]

FPCore

(FPCore (re im)
 :precision binary64
 (* (log (hypot re im)) (cbrt (pow (log 10.0) -3.0))))

C

double code(double re, double im) {
	return log(hypot(re, im)) * cbrt(pow(log(10.0), -3.0));
}

Java

public static double code(double re, double im) {
	return Math.log(Math.hypot(re, im)) * Math.cbrt(Math.pow(Math.log(10.0), -3.0));
}

Julia

function code(re, im)
	return Float64(log(hypot(re, im)) * cbrt((log(10.0) ^ -3.0)))
end

Wolfram

code[re_, im_] := N[(N[Log[N[Sqrt[re ^ 2 + im ^ 2], $MachinePrecision]], $MachinePrecision] * N[Power[N[Power[N[Log[10.0], $MachinePrecision], -3.0], $MachinePrecision], 1/3], $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 49.8%

   \[\frac{\log \left(\sqrt{re \cdot re + im \cdot im}\right)}{\log 10} \]
2. Step-by-step derivation

   1. hypot-def 99.1%

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

3. Simplified 99.1%

   \[\leadsto \color{blue}{\frac{\log \left(\mathsf{hypot}\left(re, im\right)\right)}{\log 10}} \]
4. Step-by-step derivation

   1. clear-num 99.1%

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

   2. inv-pow 99.1%

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

5. Applied egg-rr 99.1%

   \[\leadsto \color{blue}{{\left(\frac{\log 10}{\log \left(\mathsf{hypot}\left(re, im\right)\right)}\right)}^{-1}} \]
6. Step-by-step derivation

   1. unpow-1 99.1%

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

   2. clear-num 99.1%

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

   3. rem-cbrt-cube 98.9%

      \[\leadsto \color{blue}{\sqrt[3]{{\left(\frac{\log \left(\mathsf{hypot}\left(re, im\right)\right)}{\log 10}\right)}^{3}}} \]

   4. cube-div 98.8%

      \[\leadsto \sqrt[3]{\color{blue}{\frac{{\log \left(\mathsf{hypot}\left(re, im\right)\right)}^{3}}{{\log 10}^{3}}}} \]

   5. div-inv 98.8%

      \[\leadsto \sqrt[3]{\color{blue}{{\log \left(\mathsf{hypot}\left(re, im\right)\right)}^{3} \cdot \frac{1}{{\log 10}^{3}}}} \]

   6. cbrt-prod 98.7%

      \[\leadsto \color{blue}{\sqrt[3]{{\log \left(\mathsf{hypot}\left(re, im\right)\right)}^{3}} \cdot \sqrt[3]{\frac{1}{{\log 10}^{3}}}} \]

   7. rem-cbrt-cube 98.6%

      \[\leadsto \color{blue}{\log \left(\mathsf{hypot}\left(re, im\right)\right)} \cdot \sqrt[3]{\frac{1}{{\log 10}^{3}}} \]

   8. pow-flip 99.6%

      \[\leadsto \log \left(\mathsf{hypot}\left(re, im\right)\right) \cdot \sqrt[3]{\color{blue}{{\log 10}^{\left(-3\right)}}} \]

   9. metadata-eval 99.6%

      \[\leadsto \log \left(\mathsf{hypot}\left(re, im\right)\right) \cdot \sqrt[3]{{\log 10}^{\color{blue}{-3}}} \]

7. Applied egg-rr 99.6%

   \[\leadsto \color{blue}{\log \left(\mathsf{hypot}\left(re, im\right)\right) \cdot \sqrt[3]{{\log 10}^{-3}}} \]

8. Final simplification 99.6%

   \[\leadsto \log \left(\mathsf{hypot}\left(re, im\right)\right) \cdot \sqrt[3]{{\log 10}^{-3}} \]

Alternative 2: 99.1% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \frac{\log \left(\mathsf{hypot}\left(re, im\right)\right)}{\log 10} \end{array} \]

FPCore

(FPCore (re im) :precision binary64 (/ (log (hypot re im)) (log 10.0)))

C

double code(double re, double im) {
	return log(hypot(re, im)) / log(10.0);
}

Java

public static double code(double re, double im) {
	return Math.log(Math.hypot(re, im)) / Math.log(10.0);
}

Python

def code(re, im):
	return math.log(math.hypot(re, im)) / math.log(10.0)

Julia

function code(re, im)
	return Float64(log(hypot(re, im)) / log(10.0))
end

MATLAB

function tmp = code(re, im)
	tmp = log(hypot(re, im)) / log(10.0);
end

Wolfram

code[re_, im_] := N[(N[Log[N[Sqrt[re ^ 2 + im ^ 2], $MachinePrecision]], $MachinePrecision] / N[Log[10.0], $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 49.8%

   \[\frac{\log \left(\sqrt{re \cdot re + im \cdot im}\right)}{\log 10} \]
2. Step-by-step derivation

   1. hypot-def 99.1%

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

3. Simplified 99.1%

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

4. Final simplification 99.1%

   \[\leadsto \frac{\log \left(\mathsf{hypot}\left(re, im\right)\right)}{\log 10} \]

Alternative 3: 28.0% accurate, 1.5× speedup

Math

\[\begin{array}{l} \\ \frac{\log im}{\log 10} \end{array} \]

FPCore

(FPCore (re im) :precision binary64 (/ (log im) (log 10.0)))

C

double code(double re, double im) {
	return log(im) / log(10.0);
}

Fortran

real(8) function code(re, im)
    real(8), intent (in) :: re
    real(8), intent (in) :: im
    code = log(im) / log(10.0d0)
end function

Java

public static double code(double re, double im) {
	return Math.log(im) / Math.log(10.0);
}

Python

def code(re, im):
	return math.log(im) / math.log(10.0)

Julia

function code(re, im)
	return Float64(log(im) / log(10.0))
end

MATLAB

function tmp = code(re, im)
	tmp = log(im) / log(10.0);
end

Wolfram

code[re_, im_] := N[(N[Log[im], $MachinePrecision] / N[Log[10.0], $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 49.8%

   \[\frac{\log \left(\sqrt{re \cdot re + im \cdot im}\right)}{\log 10} \]
2. Step-by-step derivation

   1. hypot-def 99.1%

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

3. Simplified 99.1%

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

4. Taylor expanded in re around 0 25.5%

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

5. Final simplification 25.5%

   \[\leadsto \frac{\log im}{\log 10} \]

Reproduce

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