
(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 51.8%
hypot-def99.1%
Simplified99.1%
add-exp-log73.4%
Applied egg-rr73.4%
rem-cbrt-cube73.3%
rem-cbrt-cube73.1%
cbrt-div73.3%
add-exp-log98.9%
div-inv98.8%
cbrt-prod98.7%
rem-cbrt-cube98.5%
pow-flip99.6%
metadata-eval99.6%
Applied egg-rr99.6%
Final simplification99.6%
(FPCore (re im) :precision binary64 (+ 1.0 (+ (/ (log (hypot re im)) (log 10.0)) -1.0)))
double code(double re, double im) {
return 1.0 + ((log(hypot(re, im)) / log(10.0)) + -1.0);
}
public static double code(double re, double im) {
return 1.0 + ((Math.log(Math.hypot(re, im)) / Math.log(10.0)) + -1.0);
}
def code(re, im): return 1.0 + ((math.log(math.hypot(re, im)) / math.log(10.0)) + -1.0)
function code(re, im) return Float64(1.0 + Float64(Float64(log(hypot(re, im)) / log(10.0)) + -1.0)) end
function tmp = code(re, im) tmp = 1.0 + ((log(hypot(re, im)) / log(10.0)) + -1.0); end
code[re_, im_] := N[(1.0 + N[(N[(N[Log[N[Sqrt[re ^ 2 + im ^ 2], $MachinePrecision]], $MachinePrecision] / N[Log[10.0], $MachinePrecision]), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
1 + \left(\frac{\log \left(\mathsf{hypot}\left(re, im\right)\right)}{\log 10} + -1\right)
\end{array}
Initial program 51.8%
hypot-def99.1%
Simplified99.1%
expm1-log1p-u73.7%
expm1-udef73.7%
log1p-udef73.7%
add-exp-log99.0%
Applied egg-rr99.0%
associate--l+99.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 51.8%
hypot-def99.1%
Simplified99.1%
Final simplification99.1%
(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 51.8%
hypot-def99.1%
Simplified99.1%
Taylor expanded in re around 0 30.4%
Final simplification30.4%
(FPCore (re im) :precision binary64 (* (* re (/ re (log 10.0))) 0.5))
double code(double re, double im) {
return (re * (re / log(10.0))) * 0.5;
}
real(8) function code(re, im)
real(8), intent (in) :: re
real(8), intent (in) :: im
code = (re * (re / log(10.0d0))) * 0.5d0
end function
public static double code(double re, double im) {
return (re * (re / Math.log(10.0))) * 0.5;
}
def code(re, im): return (re * (re / math.log(10.0))) * 0.5
function code(re, im) return Float64(Float64(re * Float64(re / log(10.0))) * 0.5) end
function tmp = code(re, im) tmp = (re * (re / log(10.0))) * 0.5; end
code[re_, im_] := N[(N[(re * N[(re / N[Log[10.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * 0.5), $MachinePrecision]
\begin{array}{l}
\\
\left(re \cdot \frac{re}{\log 10}\right) \cdot 0.5
\end{array}
Initial program 51.8%
hypot-def99.1%
Simplified99.1%
Taylor expanded in re around 0 26.0%
unpow226.0%
unpow226.0%
Simplified26.0%
Taylor expanded in im around 0 2.7%
*-commutative2.7%
unpow22.7%
*-commutative2.7%
unpow22.7%
associate-*r*2.7%
Simplified2.7%
associate-/l*3.0%
div-inv3.0%
associate-/l*3.4%
associate-/r*3.4%
div-inv3.4%
add-exp-log1.7%
neg-log1.7%
add-sqr-sqrt0.6%
sqrt-unprod1.8%
sqr-neg1.8%
sqrt-unprod1.2%
add-sqr-sqrt2.1%
add-exp-log3.9%
Applied egg-rr3.9%
associate-*r/3.9%
*-rgt-identity3.9%
associate-/r/3.8%
times-frac3.8%
associate-*l*3.8%
*-commutative3.8%
*-commutative3.8%
associate-*r/3.7%
times-frac3.7%
Simplified3.7%
Taylor expanded in im around 0 3.9%
unpow23.9%
associate-*r/3.9%
Simplified3.9%
Final simplification3.9%
herbie shell --seed 2023200
(FPCore (re im)
:name "math.log10 on complex, real part"
:precision binary64
(/ (log (sqrt (+ (* re re) (* im im)))) (log 10.0)))