
(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 5 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 (* (log (hypot im re)) (/ (pow (log 10.0) -0.5) (sqrt (log 10.0)))))
double code(double re, double im) {
return log(hypot(im, re)) * (pow(log(10.0), -0.5) / sqrt(log(10.0)));
}
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)));
}
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)))
function code(re, im) return Float64(log(hypot(im, re)) * Float64((log(10.0) ^ -0.5) / sqrt(log(10.0)))) end
function tmp = code(re, im) tmp = log(hypot(im, re)) * ((log(10.0) ^ -0.5) / sqrt(log(10.0))); end
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]
\begin{array}{l}
\\
\log \left(\mathsf{hypot}\left(im, re\right)\right) \cdot \frac{{\log 10}^{-0.5}}{\sqrt{\log 10}}
\end{array}
Initial program 49.8%
+-commutative49.8%
+-commutative49.8%
sqr-neg49.8%
sqr-neg49.8%
sqr-neg49.8%
sqr-neg49.8%
hypot-define98.9%
Simplified98.9%
*-un-lft-identity98.9%
add-sqr-sqrt98.9%
times-frac99.0%
pow1/299.0%
pow-flip99.0%
metadata-eval99.0%
Applied egg-rr99.0%
*-commutative99.0%
associate-*l/99.1%
associate-/l*99.5%
hypot-undefine50.1%
unpow250.1%
unpow250.1%
+-commutative50.1%
unpow250.1%
unpow250.1%
hypot-define99.5%
Simplified99.5%
Final simplification99.5%
(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}
Initial program 49.8%
+-commutative49.8%
+-commutative49.8%
sqr-neg49.8%
sqr-neg49.8%
sqr-neg49.8%
sqr-neg49.8%
hypot-define98.9%
Simplified98.9%
add-log-exp98.9%
add-sqr-sqrt98.9%
log-prod98.9%
div-inv98.7%
exp-to-pow98.7%
frac-2neg98.7%
metadata-eval98.7%
neg-log99.4%
metadata-eval99.4%
div-inv99.4%
exp-to-pow99.5%
frac-2neg99.5%
metadata-eval99.5%
neg-log99.1%
Applied egg-rr99.1%
count-299.1%
sqr-pow99.1%
rem-sqrt-square99.1%
sqr-pow99.1%
fabs-sqr99.1%
sqr-pow99.1%
count-299.1%
log-prod99.1%
sqr-pow99.1%
log-pow99.1%
associate-*l/99.1%
neg-mul-199.1%
distribute-neg-frac99.1%
Simplified99.1%
Final simplification99.1%
(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 49.8%
+-commutative49.8%
+-commutative49.8%
sqr-neg49.8%
sqr-neg49.8%
sqr-neg49.8%
sqr-neg49.8%
hypot-define98.9%
Simplified98.9%
Final simplification98.9%
(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 49.8%
+-commutative49.8%
+-commutative49.8%
sqr-neg49.8%
sqr-neg49.8%
sqr-neg49.8%
sqr-neg49.8%
hypot-define98.9%
Simplified98.9%
Taylor expanded in re around 0 28.0%
clear-num28.0%
associate-/r/27.9%
frac-2neg27.9%
metadata-eval27.9%
neg-log28.0%
metadata-eval28.0%
Applied egg-rr28.0%
associate-*l/28.0%
neg-mul-128.0%
Simplified28.0%
Final simplification28.0%
(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 49.8%
+-commutative49.8%
+-commutative49.8%
sqr-neg49.8%
sqr-neg49.8%
sqr-neg49.8%
sqr-neg49.8%
hypot-define98.9%
Simplified98.9%
Taylor expanded in re around 0 28.0%
Final simplification28.0%
herbie shell --seed 2024062
(FPCore (re im)
:name "math.log10 on complex, real part"
:precision binary64
(/ (log (sqrt (+ (* re re) (* im im)))) (log 10.0)))