
(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 re im)) (cbrt (pow (log 10.0) -3.0))))
double code(double re, double im) {
return log(hypot(re, im)) * cbrt(pow(log(10.0), -3.0));
}
public static double code(double re, double im) {
return Math.log(Math.hypot(re, im)) * Math.cbrt(Math.pow(Math.log(10.0), -3.0));
}
function code(re, im) return Float64(log(hypot(re, im)) * cbrt((log(10.0) ^ -3.0))) end
code[re_, im_] := N[(N[Log[N[Sqrt[re ^ 2 + im ^ 2], $MachinePrecision]], $MachinePrecision] * N[Power[N[Power[N[Log[10.0], $MachinePrecision], -3.0], $MachinePrecision], 1/3], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\log \left(\mathsf{hypot}\left(re, im\right)\right) \cdot \sqrt[3]{{\log 10}^{-3}}
\end{array}
Initial program 50.9%
hypot-def99.0%
Simplified99.0%
div-inv98.5%
frac-2neg98.5%
metadata-eval98.5%
neg-log99.1%
metadata-eval99.1%
Applied egg-rr99.1%
*-commutative99.1%
associate-*l/99.1%
neg-mul-199.1%
Simplified99.1%
metadata-eval99.1%
neg-log99.0%
frac-2neg99.0%
rem-cbrt-cube98.9%
cube-div98.8%
div-inv98.8%
cbrt-prod98.7%
rem-cbrt-cube98.5%
pow-flip99.5%
metadata-eval99.5%
Applied egg-rr99.5%
Final simplification99.5%
(FPCore (re im) :precision binary64 (/ (sqrt (pow (log 10.0) -2.0)) (/ 1.0 (log im))))
double code(double re, double im) {
return sqrt(pow(log(10.0), -2.0)) / (1.0 / log(im));
}
real(8) function code(re, im)
real(8), intent (in) :: re
real(8), intent (in) :: im
code = sqrt((log(10.0d0) ** (-2.0d0))) / (1.0d0 / log(im))
end function
public static double code(double re, double im) {
return Math.sqrt(Math.pow(Math.log(10.0), -2.0)) / (1.0 / Math.log(im));
}
def code(re, im): return math.sqrt(math.pow(math.log(10.0), -2.0)) / (1.0 / math.log(im))
function code(re, im) return Float64(sqrt((log(10.0) ^ -2.0)) / Float64(1.0 / log(im))) end
function tmp = code(re, im) tmp = sqrt((log(10.0) ^ -2.0)) / (1.0 / log(im)); end
code[re_, im_] := N[(N[Sqrt[N[Power[N[Log[10.0], $MachinePrecision], -2.0], $MachinePrecision]], $MachinePrecision] / N[(1.0 / N[Log[im], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\sqrt{{\log 10}^{-2}}}{\frac{1}{\log im}}
\end{array}
Initial program 50.9%
hypot-def99.0%
Simplified99.0%
add-exp-log74.1%
Applied egg-rr74.1%
Taylor expanded in re around 0 17.7%
add-exp-log26.3%
clear-num26.3%
div-inv26.3%
associate-/r*26.2%
frac-2neg26.2%
metadata-eval26.2%
neg-log26.4%
metadata-eval26.4%
Applied egg-rr26.4%
metadata-eval26.4%
metadata-eval26.4%
neg-log26.2%
frac-2neg26.2%
add-sqr-sqrt26.3%
sqrt-unprod26.2%
inv-pow26.2%
inv-pow26.2%
pow-prod-up26.3%
metadata-eval26.3%
Applied egg-rr26.3%
Final simplification26.3%
(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(-Float64(log(hypot(re, im)) / 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 50.9%
hypot-def99.0%
Simplified99.0%
div-inv98.5%
frac-2neg98.5%
metadata-eval98.5%
neg-log99.1%
metadata-eval99.1%
Applied egg-rr99.1%
*-commutative99.1%
associate-*l/99.1%
neg-mul-199.1%
Simplified99.1%
Final simplification99.1%
(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(Float64(-log(im)) / 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 50.9%
hypot-def99.0%
Simplified99.0%
div-inv98.5%
frac-2neg98.5%
metadata-eval98.5%
neg-log99.1%
metadata-eval99.1%
Applied egg-rr99.1%
*-commutative99.1%
associate-*l/99.1%
neg-mul-199.1%
Simplified99.1%
Taylor expanded in re around 0 26.4%
neg-mul-126.4%
distribute-neg-frac26.4%
Simplified26.4%
Final simplification26.4%
(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.9%
hypot-def99.0%
Simplified99.0%
Taylor expanded in re around 0 26.3%
Final simplification26.3%
herbie shell --seed 2023230
(FPCore (re im)
:name "math.log10 on complex, real part"
:precision binary64
(/ (log (sqrt (+ (* re re) (* im im)))) (log 10.0)))