
(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:
Herbie found 8 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(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}
(FPCore (re im) :precision binary64 (/ (pow (log 10.0) -0.5) (/ (sqrt (log 10.0)) (log (hypot im re)))))
double code(double re, double im) {
return pow(log(10.0), -0.5) / (sqrt(log(10.0)) / log(hypot(im, re)));
}
public static double code(double re, double im) {
return Math.pow(Math.log(10.0), -0.5) / (Math.sqrt(Math.log(10.0)) / Math.log(Math.hypot(im, re)));
}
def code(re, im): return math.pow(math.log(10.0), -0.5) / (math.sqrt(math.log(10.0)) / math.log(math.hypot(im, re)))
function code(re, im) return Float64((log(10.0) ^ -0.5) / Float64(sqrt(log(10.0)) / log(hypot(im, re)))) end
function tmp = code(re, im) tmp = (log(10.0) ^ -0.5) / (sqrt(log(10.0)) / log(hypot(im, re))); end
code[re_, im_] := N[(N[Power[N[Log[10.0], $MachinePrecision], -0.5], $MachinePrecision] / N[(N[Sqrt[N[Log[10.0], $MachinePrecision]], $MachinePrecision] / N[Log[N[Sqrt[im ^ 2 + re ^ 2], $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{{\log 10}^{-0.5}}{\frac{\sqrt{\log 10}}{\log \left(\mathsf{hypot}\left(im, re\right)\right)}}
\end{array}
Initial program 53.5%
+-commutative53.5%
+-commutative53.5%
sqr-neg53.5%
sqr-neg53.5%
sqr-neg53.5%
sqr-neg53.5%
hypot-define99.0%
Simplified99.0%
clear-num99.1%
inv-pow99.1%
add-sqr-sqrt99.1%
associate-/l*98.7%
unpow-prod-down99.2%
inv-pow99.2%
pow1/299.2%
pow-flip99.2%
metadata-eval99.2%
Applied egg-rr99.2%
unpow-199.2%
associate-*r/99.2%
*-rgt-identity99.2%
hypot-undefine53.6%
unpow253.6%
unpow253.6%
+-commutative53.6%
unpow253.6%
unpow253.6%
hypot-define99.2%
Simplified99.2%
(FPCore (re im) :precision binary64 (pow (/ (log 10.0) (log (hypot re im))) -1.0))
double code(double re, double im) {
return pow((log(10.0) / log(hypot(re, im))), -1.0);
}
public static double code(double re, double im) {
return Math.pow((Math.log(10.0) / Math.log(Math.hypot(re, im))), -1.0);
}
def code(re, im): return math.pow((math.log(10.0) / math.log(math.hypot(re, im))), -1.0)
function code(re, im) return Float64(log(10.0) / log(hypot(re, im))) ^ -1.0 end
function tmp = code(re, im) tmp = (log(10.0) / log(hypot(re, im))) ^ -1.0; end
code[re_, im_] := N[Power[N[(N[Log[10.0], $MachinePrecision] / N[Log[N[Sqrt[re ^ 2 + im ^ 2], $MachinePrecision]], $MachinePrecision]), $MachinePrecision], -1.0], $MachinePrecision]
\begin{array}{l}
\\
{\left(\frac{\log 10}{\log \left(\mathsf{hypot}\left(re, im\right)\right)}\right)}^{-1}
\end{array}
Initial program 53.5%
+-commutative53.5%
+-commutative53.5%
sqr-neg53.5%
sqr-neg53.5%
sqr-neg53.5%
sqr-neg53.5%
hypot-define99.0%
Simplified99.0%
clear-num99.1%
inv-pow99.1%
Applied egg-rr99.1%
(FPCore (re im) :precision binary64 (/ 1.0 (/ (log1p 9.0) (log (hypot im re)))))
double code(double re, double im) {
return 1.0 / (log1p(9.0) / log(hypot(im, re)));
}
public static double code(double re, double im) {
return 1.0 / (Math.log1p(9.0) / Math.log(Math.hypot(im, re)));
}
def code(re, im): return 1.0 / (math.log1p(9.0) / math.log(math.hypot(im, re)))
function code(re, im) return Float64(1.0 / Float64(log1p(9.0) / log(hypot(im, re)))) end
code[re_, im_] := N[(1.0 / N[(N[Log[1 + 9.0], $MachinePrecision] / N[Log[N[Sqrt[im ^ 2 + re ^ 2], $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{1}{\frac{\mathsf{log1p}\left(9\right)}{\log \left(\mathsf{hypot}\left(im, re\right)\right)}}
\end{array}
Initial program 53.5%
+-commutative53.5%
+-commutative53.5%
sqr-neg53.5%
sqr-neg53.5%
sqr-neg53.5%
sqr-neg53.5%
hypot-define99.0%
Simplified99.0%
clear-num99.1%
inv-pow99.1%
Applied egg-rr99.1%
unpow-199.1%
div-inv99.1%
div-inv99.1%
hypot-undefine53.5%
+-commutative53.5%
hypot-undefine99.1%
log1p-expm1-u99.1%
expm1-undefine99.1%
rem-exp-log99.1%
metadata-eval99.1%
Applied egg-rr99.1%
(FPCore (re im) :precision binary64 (/ (log (hypot re im)) (- (log 0.1))))
double code(double re, double im) {
return log(hypot(re, im)) / -log(0.1);
}
public static double code(double re, double im) {
return Math.log(Math.hypot(re, im)) / -Math.log(0.1);
}
def code(re, im): return math.log(math.hypot(re, im)) / -math.log(0.1)
function code(re, im) return Float64(log(hypot(re, im)) / Float64(-log(0.1))) end
function tmp = code(re, im) tmp = log(hypot(re, im)) / -log(0.1); end
code[re_, im_] := N[(N[Log[N[Sqrt[re ^ 2 + im ^ 2], $MachinePrecision]], $MachinePrecision] / (-N[Log[0.1], $MachinePrecision])), $MachinePrecision]
\begin{array}{l}
\\
\frac{\log \left(\mathsf{hypot}\left(re, im\right)\right)}{-\log 0.1}
\end{array}
Initial program 53.5%
+-commutative53.5%
+-commutative53.5%
sqr-neg53.5%
sqr-neg53.5%
sqr-neg53.5%
sqr-neg53.5%
hypot-define99.0%
Simplified99.0%
div-inv98.6%
frac-2neg98.6%
metadata-eval98.6%
neg-log99.0%
metadata-eval99.0%
Applied egg-rr99.0%
*-commutative99.0%
associate-*l/99.0%
neg-mul-199.0%
distribute-neg-frac99.0%
distribute-neg-frac299.0%
Simplified99.0%
(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}
Initial program 53.5%
+-commutative53.5%
+-commutative53.5%
sqr-neg53.5%
sqr-neg53.5%
sqr-neg53.5%
sqr-neg53.5%
hypot-define99.0%
Simplified99.0%
(FPCore (re im) :precision binary64 (/ 1.0 (/ (log 10.0) (log im))))
double code(double re, double im) {
return 1.0 / (log(10.0) / log(im));
}
real(8) function code(re, im)
real(8), intent (in) :: re
real(8), intent (in) :: im
code = 1.0d0 / (log(10.0d0) / log(im))
end function
public static double code(double re, double im) {
return 1.0 / (Math.log(10.0) / Math.log(im));
}
def code(re, im): return 1.0 / (math.log(10.0) / math.log(im))
function code(re, im) return Float64(1.0 / Float64(log(10.0) / log(im))) end
function tmp = code(re, im) tmp = 1.0 / (log(10.0) / log(im)); end
code[re_, im_] := N[(1.0 / N[(N[Log[10.0], $MachinePrecision] / N[Log[im], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{1}{\frac{\log 10}{\log im}}
\end{array}
Initial program 53.5%
+-commutative53.5%
+-commutative53.5%
sqr-neg53.5%
sqr-neg53.5%
sqr-neg53.5%
sqr-neg53.5%
hypot-define99.0%
Simplified99.0%
Taylor expanded in re around 0 30.2%
clear-num30.2%
inv-pow30.2%
log1p-expm1-u30.2%
expm1-undefine30.2%
rem-exp-log30.2%
metadata-eval30.2%
Applied egg-rr30.2%
unpow-130.2%
log1p-undefine30.2%
metadata-eval30.2%
Simplified30.2%
(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}
Initial program 53.5%
+-commutative53.5%
+-commutative53.5%
sqr-neg53.5%
sqr-neg53.5%
sqr-neg53.5%
sqr-neg53.5%
hypot-define99.0%
Simplified99.0%
Taylor expanded in re around 0 30.2%
div-inv30.1%
frac-2neg30.1%
metadata-eval30.1%
neg-log30.3%
metadata-eval30.3%
Applied egg-rr30.3%
*-commutative30.3%
associate-*l/30.3%
neg-mul-130.3%
distribute-neg-frac30.3%
distribute-neg-frac230.3%
Simplified30.3%
(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}
Initial program 53.5%
+-commutative53.5%
+-commutative53.5%
sqr-neg53.5%
sqr-neg53.5%
sqr-neg53.5%
sqr-neg53.5%
hypot-define99.0%
Simplified99.0%
Taylor expanded in re around 0 30.2%
herbie shell --seed 2024147
(FPCore (re im)
:name "math.log10 on complex, real part"
:precision binary64
(/ (log (sqrt (+ (* re re) (* im im)))) (log 10.0)))