math.log10 on complex, real part

Percentage Accurate: 51.6% → 99.0%

Time: 7.6s

Alternatives: 6

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: 51.6% 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.0% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (re im) :precision binary64 (/ -1.0 (/ (log 0.1) (log (hypot re im)))))

C

double code(double re, double im) {
	return -1.0 / (log(0.1) / log(hypot(re, im)));
}

Java

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

Python

def code(re, im):
	return -1.0 / (math.log(0.1) / math.log(math.hypot(re, im)))

Julia

function code(re, im)
	return Float64(-1.0 / Float64(log(0.1) / log(hypot(re, im))))
end

MATLAB

function tmp = code(re, im)
	tmp = -1.0 / (log(0.1) / log(hypot(re, im)));
end

Wolfram

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

Derivation

1. Initial program 52.1%

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

   1. hypot-def 99.0%

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

3. Simplified 99.0%

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

   1. clear-num 99.0%

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

   2. inv-pow 99.0%

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

5. Applied egg-rr 99.0%

   \[\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.0%

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

   2. clear-num 99.0%

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

   3. frac-2neg 99.0%

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

   4. neg-mul-1 99.0%

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

   5. neg-log 99.1%

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

   6. metadata-eval 99.1%

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

   7. associate-/l* 99.1%

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

7. Applied egg-rr 99.1%

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

8. Final simplification 99.1%

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

Alternative 2: 99.0% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (re im) :precision binary64 (- (/ (log (hypot re im)) (log 0.1))))

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 52.1%

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

   1. hypot-def 99.0%

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

3. Simplified 99.0%

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

   1. div-inv 98.5%

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

   2. frac-2neg 98.5%

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

   3. metadata-eval 98.5%

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

   4. neg-log 99.0%

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

   5. metadata-eval 99.0%

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

5. Applied egg-rr 99.0%

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

   1. *-commutative 99.0%

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

   2. associate-*l/ 99.1%

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

   3. neg-mul-1 99.1%

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

7. Simplified 99.1%

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

8. Final simplification 99.1%

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

Alternative 3: 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 52.1%

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

   1. hypot-def 99.0%

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

3. Simplified 99.0%

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

4. Final simplification 99.0%

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

Alternative 4: 26.8% accurate, 1.5× speedup

Math

\[\begin{array}{l} \\ \frac{-1}{\frac{\log 0.1}{\log im}} \end{array} \]

FPCore

(FPCore (re im) :precision binary64 (/ -1.0 (/ (log 0.1) (log im))))

C

double code(double re, double im) {
	return -1.0 / (log(0.1) / log(im));
}

Fortran

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

Java

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

Python

def code(re, im):
	return -1.0 / (math.log(0.1) / math.log(im))

Julia

function code(re, im)
	return Float64(-1.0 / Float64(log(0.1) / log(im)))
end

MATLAB

function tmp = code(re, im)
	tmp = -1.0 / (log(0.1) / log(im));
end

Wolfram

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

Derivation

1. Initial program 52.1%

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

   1. hypot-def 99.0%

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

3. Simplified 99.0%

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

   1. clear-num 99.0%

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

   2. inv-pow 99.0%

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

5. Applied egg-rr 99.0%

   \[\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.0%

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

   2. clear-num 99.0%

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

   3. frac-2neg 99.0%

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

   4. neg-mul-1 99.0%

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

   5. neg-log 99.1%

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

   6. metadata-eval 99.1%

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

   7. associate-/l* 99.1%

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

7. Applied egg-rr 99.1%

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

8. Taylor expanded in re around 0 28.7%

   \[\leadsto \frac{-1}{\color{blue}{\frac{\log 0.1}{\log im}}} \]

9. Final simplification 28.7%

   \[\leadsto \frac{-1}{\frac{\log 0.1}{\log im}} \]

Alternative 5: 26.8% accurate, 1.5× speedup

Math

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

FPCore

(FPCore (re im) :precision binary64 (- (/ (log im) (log 0.1))))

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 52.1%

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

   1. hypot-def 99.0%

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

3. Simplified 99.0%

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

   1. div-inv 98.5%

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

   2. frac-2neg 98.5%

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

   3. metadata-eval 98.5%

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

   4. neg-log 99.0%

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

   5. metadata-eval 99.0%

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

5. Applied egg-rr 99.0%

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

   1. *-commutative 99.0%

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

   2. associate-*l/ 99.1%

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

   3. neg-mul-1 99.1%

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

7. Simplified 99.1%

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

8. Taylor expanded in re around 0 28.7%

   \[\leadsto \color{blue}{-1 \cdot \frac{\log im}{\log 0.1}} \]
9. Step-by-step derivation

   1. neg-mul-1 28.7%

      \[\leadsto \color{blue}{-\frac{\log im}{\log 0.1}} \]

   2. distribute-neg-frac 28.7%

      \[\leadsto \color{blue}{\frac{-\log im}{\log 0.1}} \]

10. Simplified 28.7%

    \[\leadsto \color{blue}{\frac{-\log im}{\log 0.1}} \]

11. Final simplification 28.7%

    \[\leadsto -\frac{\log im}{\log 0.1} \]

Alternative 6: 26.9% 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 52.1%

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

   1. hypot-def 99.0%

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

3. Simplified 99.0%

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

4. Taylor expanded in re around 0 28.6%

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

5. Final simplification 28.6%

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

Reproduce

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