math.log10 on complex, real part

Percentage Accurate: 51.3% → 99.5%

Time: 8.4s

Alternatives: 4

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.3% 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.5% accurate, 0.5× speedup

Math

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

FPCore

(FPCore (re im)
 :precision binary64
 (* (log (hypot im re)) (/ (pow (log 10.0) -0.5) (sqrt (log 10.0)))))

C

double code(double re, double im) {
	return log(hypot(im, re)) * (pow(log(10.0), -0.5) / sqrt(log(10.0)));
}

Java

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

Python

def code(re, im):
	return math.log(math.hypot(im, re)) * (math.pow(math.log(10.0), -0.5) / math.sqrt(math.log(10.0)))

Julia

function code(re, im)
	return Float64(log(hypot(im, re)) * Float64((log(10.0) ^ -0.5) / sqrt(log(10.0))))
end

MATLAB

function tmp = code(re, im)
	tmp = log(hypot(im, re)) * ((log(10.0) ^ -0.5) / sqrt(log(10.0)));
end

Wolfram

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

Derivation

1. Initial program 52.0%

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

   1. +-commutative 52.0%

      \[\leadsto \frac{\log \left(\sqrt{\color{blue}{im \cdot im + re \cdot re}}\right)}{\log 10} \]

   2. +-commutative 52.0%

      \[\leadsto \frac{\log \left(\sqrt{\color{blue}{re \cdot re + im \cdot im}}\right)}{\log 10} \]

   3. sqr-neg 52.0%

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

   4. sqr-neg 52.0%

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

   5. sqr-neg 52.0%

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

   6. sqr-neg 52.0%

      \[\leadsto \frac{\log \left(\sqrt{re \cdot re + \color{blue}{im \cdot im}}\right)}{\log 10} \]

   7. hypot-define 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. Add Preprocessing
5. Step-by-step derivation

   1. *-un-lft-identity 99.1%

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

   2. add-sqr-sqrt 99.1%

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

   3. times-frac 99.2%

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

   4. pow1/2 99.2%

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

   5. pow-flip 99.2%

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

   6. metadata-eval 99.2%

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

6. Applied egg-rr 99.2%

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

   1. *-commutative 99.2%

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

   2. associate-*l/ 99.1%

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

   3. associate-/l* 99.5%

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

   4. hypot-undefine 52.2%

      \[\leadsto \log \color{blue}{\left(\sqrt{re \cdot re + im \cdot im}\right)} \cdot \frac{{\log 10}^{-0.5}}{\sqrt{\log 10}} \]

   5. unpow2 52.2%

      \[\leadsto \log \left(\sqrt{\color{blue}{{re}^{2}} + im \cdot im}\right) \cdot \frac{{\log 10}^{-0.5}}{\sqrt{\log 10}} \]

   6. unpow2 52.2%

      \[\leadsto \log \left(\sqrt{{re}^{2} + \color{blue}{{im}^{2}}}\right) \cdot \frac{{\log 10}^{-0.5}}{\sqrt{\log 10}} \]

   7. +-commutative 52.2%

      \[\leadsto \log \left(\sqrt{\color{blue}{{im}^{2} + {re}^{2}}}\right) \cdot \frac{{\log 10}^{-0.5}}{\sqrt{\log 10}} \]

   8. unpow2 52.2%

      \[\leadsto \log \left(\sqrt{\color{blue}{im \cdot im} + {re}^{2}}\right) \cdot \frac{{\log 10}^{-0.5}}{\sqrt{\log 10}} \]

   9. unpow2 52.2%

      \[\leadsto \log \left(\sqrt{im \cdot im + \color{blue}{re \cdot re}}\right) \cdot \frac{{\log 10}^{-0.5}}{\sqrt{\log 10}} \]

   10. hypot-define 99.5%

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

8. Simplified 99.5%

   \[\leadsto \color{blue}{\log \left(\mathsf{hypot}\left(im, re\right)\right) \cdot \frac{{\log 10}^{-0.5}}{\sqrt{\log 10}}} \]
9. Add Preprocessing

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(log(hypot(re, im)) / Float64(-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.0%

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

   1. +-commutative 52.0%

      \[\leadsto \frac{\log \left(\sqrt{\color{blue}{im \cdot im + re \cdot re}}\right)}{\log 10} \]

   2. +-commutative 52.0%

      \[\leadsto \frac{\log \left(\sqrt{\color{blue}{re \cdot re + im \cdot im}}\right)}{\log 10} \]

   3. sqr-neg 52.0%

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

   4. sqr-neg 52.0%

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

   5. sqr-neg 52.0%

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

   6. sqr-neg 52.0%

      \[\leadsto \frac{\log \left(\sqrt{re \cdot re + \color{blue}{im \cdot im}}\right)}{\log 10} \]

   7. hypot-define 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. Add Preprocessing
5. Step-by-step derivation

   1. frac-2neg 99.1%

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

   2. neg-log 99.1%

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

   3. metadata-eval 99.1%

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

6. Applied egg-rr 99.1%

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

7. Final simplification 99.1%

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

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

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

   1. +-commutative 52.0%

      \[\leadsto \frac{\log \left(\sqrt{\color{blue}{im \cdot im + re \cdot re}}\right)}{\log 10} \]

   2. +-commutative 52.0%

      \[\leadsto \frac{\log \left(\sqrt{\color{blue}{re \cdot re + im \cdot im}}\right)}{\log 10} \]

   3. sqr-neg 52.0%

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

   4. sqr-neg 52.0%

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

   5. sqr-neg 52.0%

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

   6. sqr-neg 52.0%

      \[\leadsto \frac{\log \left(\sqrt{re \cdot re + \color{blue}{im \cdot im}}\right)}{\log 10} \]

   7. hypot-define 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. Add Preprocessing
5. Add Preprocessing

Alternative 4: 27.5% 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.0%

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

   1. +-commutative 52.0%

      \[\leadsto \frac{\log \left(\sqrt{\color{blue}{im \cdot im + re \cdot re}}\right)}{\log 10} \]

   2. +-commutative 52.0%

      \[\leadsto \frac{\log \left(\sqrt{\color{blue}{re \cdot re + im \cdot im}}\right)}{\log 10} \]

   3. sqr-neg 52.0%

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

   4. sqr-neg 52.0%

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

   5. sqr-neg 52.0%

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

   6. sqr-neg 52.0%

      \[\leadsto \frac{\log \left(\sqrt{re \cdot re + \color{blue}{im \cdot im}}\right)}{\log 10} \]

   7. hypot-define 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. Add Preprocessing

5. Taylor expanded in re around 0 28.8%

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

Reproduce

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