
(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 6 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 re im))))
double code(double re, double im) {
return (pow(log(10.0), -0.5) / sqrt(log(10.0))) * log(hypot(re, im));
}
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(re, im));
}
def code(re, im): return (math.pow(math.log(10.0), -0.5) / math.sqrt(math.log(10.0))) * math.log(math.hypot(re, im))
function code(re, im) return Float64(Float64((log(10.0) ^ -0.5) / sqrt(log(10.0))) * log(hypot(re, im))) end
function tmp = code(re, im) tmp = ((log(10.0) ^ -0.5) / sqrt(log(10.0))) * log(hypot(re, im)); end
code[re_, im_] := N[(N[(N[Power[N[Log[10.0], $MachinePrecision], -0.5], $MachinePrecision] / N[Sqrt[N[Log[10.0], $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[Log[N[Sqrt[re ^ 2 + im ^ 2], $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{{\log 10}^{-0.5}}{\sqrt{\log 10}} \cdot \log \left(\mathsf{hypot}\left(re, im\right)\right)
\end{array}
Initial program 50.3%
+-commutative50.3%
+-commutative50.3%
sqr-neg50.3%
sqr-neg50.3%
sqr-neg50.3%
sqr-neg50.3%
hypot-def99.0%
Simplified99.0%
*-un-lft-identity99.0%
add-sqr-sqrt99.0%
times-frac99.1%
Applied egg-rr99.1%
clear-num99.0%
un-div-inv99.1%
pow1/299.1%
pow-flip99.1%
metadata-eval99.1%
Applied egg-rr99.1%
associate-/r/99.6%
Simplified99.6%
Final simplification99.6%
(FPCore (re im) :precision binary64 (* (/ (pow (log 10.0) -0.5) (sqrt (log 10.0))) (log im)))
double code(double re, double im) {
return (pow(log(10.0), -0.5) / sqrt(log(10.0))) * log(im);
}
real(8) function code(re, im)
real(8), intent (in) :: re
real(8), intent (in) :: im
code = ((log(10.0d0) ** (-0.5d0)) / sqrt(log(10.0d0))) * log(im)
end function
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(im);
}
def code(re, im): return (math.pow(math.log(10.0), -0.5) / math.sqrt(math.log(10.0))) * math.log(im)
function code(re, im) return Float64(Float64((log(10.0) ^ -0.5) / sqrt(log(10.0))) * log(im)) end
function tmp = code(re, im) tmp = ((log(10.0) ^ -0.5) / sqrt(log(10.0))) * log(im); end
code[re_, im_] := N[(N[(N[Power[N[Log[10.0], $MachinePrecision], -0.5], $MachinePrecision] / N[Sqrt[N[Log[10.0], $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[Log[im], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{{\log 10}^{-0.5}}{\sqrt{\log 10}} \cdot \log im
\end{array}
Initial program 50.3%
+-commutative50.3%
+-commutative50.3%
sqr-neg50.3%
sqr-neg50.3%
sqr-neg50.3%
sqr-neg50.3%
hypot-def99.0%
Simplified99.0%
*-un-lft-identity99.0%
add-sqr-sqrt99.0%
times-frac99.1%
Applied egg-rr99.1%
Taylor expanded in re around 0 25.9%
associate-*l/25.9%
*-un-lft-identity25.9%
associate-/l*25.8%
metadata-eval25.8%
log1p-udef25.8%
inv-pow25.8%
sqrt-pow125.8%
log1p-udef25.8%
metadata-eval25.8%
metadata-eval25.8%
Applied egg-rr25.8%
associate-/r/25.9%
Simplified25.9%
Final simplification25.9%
(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 50.3%
+-commutative50.3%
+-commutative50.3%
sqr-neg50.3%
sqr-neg50.3%
sqr-neg50.3%
sqr-neg50.3%
hypot-def99.0%
Simplified99.0%
clear-num99.0%
inv-pow99.0%
Applied egg-rr99.0%
Final simplification99.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 50.3%
+-commutative50.3%
+-commutative50.3%
sqr-neg50.3%
sqr-neg50.3%
sqr-neg50.3%
sqr-neg50.3%
hypot-def99.0%
Simplified99.0%
Final simplification99.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 50.3%
+-commutative50.3%
+-commutative50.3%
sqr-neg50.3%
sqr-neg50.3%
sqr-neg50.3%
sqr-neg50.3%
hypot-def99.0%
Simplified99.0%
Taylor expanded in re around 0 25.8%
clear-num25.8%
inv-pow25.8%
Applied egg-rr25.8%
unpow-125.8%
Simplified25.8%
Final simplification25.8%
(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 50.3%
+-commutative50.3%
+-commutative50.3%
sqr-neg50.3%
sqr-neg50.3%
sqr-neg50.3%
sqr-neg50.3%
hypot-def99.0%
Simplified99.0%
Taylor expanded in re around 0 25.8%
Final simplification25.8%
herbie shell --seed 2023283
(FPCore (re im)
:name "math.log10 on complex, real part"
:precision binary64
(/ (log (sqrt (+ (* re re) (* im im)))) (log 10.0)))