
(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 7 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 (pow (hypot re im) (pow (pow (log 10.0) -0.5) 2.0))))
double code(double re, double im) {
return log(pow(hypot(re, im), pow(pow(log(10.0), -0.5), 2.0)));
}
public static double code(double re, double im) {
return Math.log(Math.pow(Math.hypot(re, im), Math.pow(Math.pow(Math.log(10.0), -0.5), 2.0)));
}
def code(re, im): return math.log(math.pow(math.hypot(re, im), math.pow(math.pow(math.log(10.0), -0.5), 2.0)))
function code(re, im) return log((hypot(re, im) ^ ((log(10.0) ^ -0.5) ^ 2.0))) end
function tmp = code(re, im) tmp = log((hypot(re, im) ^ ((log(10.0) ^ -0.5) ^ 2.0))); end
code[re_, im_] := N[Log[N[Power[N[Sqrt[re ^ 2 + im ^ 2], $MachinePrecision], N[Power[N[Power[N[Log[10.0], $MachinePrecision], -0.5], $MachinePrecision], 2.0], $MachinePrecision]], $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\log \left({\left(\mathsf{hypot}\left(re, im\right)\right)}^{\left({\left({\log 10}^{-0.5}\right)}^{2}\right)}\right)
\end{array}
Initial program 49.8%
hypot-def99.1%
Simplified99.1%
add-log-exp99.1%
div-inv98.6%
exp-to-pow98.5%
frac-2neg98.5%
metadata-eval98.5%
neg-log98.9%
metadata-eval98.9%
Applied egg-rr98.9%
metadata-eval98.9%
metadata-eval98.9%
neg-log98.5%
frac-2neg98.5%
add-sqr-sqrt98.5%
associate-/r*99.8%
un-div-inv99.8%
pow299.8%
pow1/299.8%
pow-flip99.8%
metadata-eval99.8%
Applied egg-rr99.8%
Final simplification99.8%
(FPCore (re im) :precision binary64 (/ 1.0 (/ (log 10.0) (log (hypot re im)))))
double code(double re, double im) {
return 1.0 / (log(10.0) / log(hypot(re, im)));
}
public static double code(double re, double im) {
return 1.0 / (Math.log(10.0) / Math.log(Math.hypot(re, im)));
}
def code(re, im): return 1.0 / (math.log(10.0) / math.log(math.hypot(re, im)))
function code(re, im) return Float64(1.0 / Float64(log(10.0) / log(hypot(re, im)))) end
function tmp = code(re, im) tmp = 1.0 / (log(10.0) / log(hypot(re, im))); end
code[re_, im_] := N[(1.0 / N[(N[Log[10.0], $MachinePrecision] / N[Log[N[Sqrt[re ^ 2 + im ^ 2], $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{1}{\frac{\log 10}{\log \left(\mathsf{hypot}\left(re, im\right)\right)}}
\end{array}
Initial program 49.8%
hypot-def99.1%
Simplified99.1%
*-un-lft-identity99.1%
add-sqr-sqrt99.1%
times-frac99.2%
Applied egg-rr99.2%
frac-times99.1%
add-sqr-sqrt99.1%
associate-/l*99.1%
Applied egg-rr99.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%
hypot-def99.1%
Simplified99.1%
Final simplification99.1%
(FPCore (re im) :precision binary64 (if (<= re -2e-158) (/ 1.0 (/ (log 10.0) (log (- re)))) (/ (log im) (log 10.0))))
double code(double re, double im) {
double tmp;
if (re <= -2e-158) {
tmp = 1.0 / (log(10.0) / log(-re));
} else {
tmp = log(im) / log(10.0);
}
return tmp;
}
real(8) function code(re, im)
real(8), intent (in) :: re
real(8), intent (in) :: im
real(8) :: tmp
if (re <= (-2d-158)) then
tmp = 1.0d0 / (log(10.0d0) / log(-re))
else
tmp = log(im) / log(10.0d0)
end if
code = tmp
end function
public static double code(double re, double im) {
double tmp;
if (re <= -2e-158) {
tmp = 1.0 / (Math.log(10.0) / Math.log(-re));
} else {
tmp = Math.log(im) / Math.log(10.0);
}
return tmp;
}
def code(re, im): tmp = 0 if re <= -2e-158: tmp = 1.0 / (math.log(10.0) / math.log(-re)) else: tmp = math.log(im) / math.log(10.0) return tmp
function code(re, im) tmp = 0.0 if (re <= -2e-158) tmp = Float64(1.0 / Float64(log(10.0) / log(Float64(-re)))); else tmp = Float64(log(im) / log(10.0)); end return tmp end
function tmp_2 = code(re, im) tmp = 0.0; if (re <= -2e-158) tmp = 1.0 / (log(10.0) / log(-re)); else tmp = log(im) / log(10.0); end tmp_2 = tmp; end
code[re_, im_] := If[LessEqual[re, -2e-158], N[(1.0 / N[(N[Log[10.0], $MachinePrecision] / N[Log[(-re)], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[Log[im], $MachinePrecision] / N[Log[10.0], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;re \leq -2 \cdot 10^{-158}:\\
\;\;\;\;\frac{1}{\frac{\log 10}{\log \left(-re\right)}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\log im}{\log 10}\\
\end{array}
\end{array}
if re < -2.00000000000000013e-158Initial program 49.9%
hypot-def99.2%
Simplified99.2%
div-inv98.7%
frac-2neg98.7%
metadata-eval98.7%
neg-log98.9%
metadata-eval98.9%
Applied egg-rr98.9%
*-commutative98.9%
associate-*l/98.9%
neg-mul-198.9%
Simplified98.9%
Taylor expanded in re around -inf 70.4%
clear-num70.3%
inv-pow70.3%
frac-2neg70.3%
neg-log70.5%
metadata-eval70.5%
neg-log70.5%
clear-num70.5%
div-inv70.5%
metadata-eval70.5%
Applied egg-rr70.5%
unpow-170.5%
*-commutative70.5%
mul-1-neg70.5%
Simplified70.5%
if -2.00000000000000013e-158 < re Initial program 49.8%
hypot-def99.1%
Simplified99.1%
Taylor expanded in re around 0 33.1%
Final simplification47.4%
(FPCore (re im) :precision binary64 (if (<= re -2e-158) (/ (log (- re)) (log 10.0)) (/ (log im) (log 10.0))))
double code(double re, double im) {
double tmp;
if (re <= -2e-158) {
tmp = log(-re) / log(10.0);
} else {
tmp = log(im) / log(10.0);
}
return tmp;
}
real(8) function code(re, im)
real(8), intent (in) :: re
real(8), intent (in) :: im
real(8) :: tmp
if (re <= (-2d-158)) then
tmp = log(-re) / log(10.0d0)
else
tmp = log(im) / log(10.0d0)
end if
code = tmp
end function
public static double code(double re, double im) {
double tmp;
if (re <= -2e-158) {
tmp = Math.log(-re) / Math.log(10.0);
} else {
tmp = Math.log(im) / Math.log(10.0);
}
return tmp;
}
def code(re, im): tmp = 0 if re <= -2e-158: tmp = math.log(-re) / math.log(10.0) else: tmp = math.log(im) / math.log(10.0) return tmp
function code(re, im) tmp = 0.0 if (re <= -2e-158) tmp = Float64(log(Float64(-re)) / log(10.0)); else tmp = Float64(log(im) / log(10.0)); end return tmp end
function tmp_2 = code(re, im) tmp = 0.0; if (re <= -2e-158) tmp = log(-re) / log(10.0); else tmp = log(im) / log(10.0); end tmp_2 = tmp; end
code[re_, im_] := If[LessEqual[re, -2e-158], N[(N[Log[(-re)], $MachinePrecision] / N[Log[10.0], $MachinePrecision]), $MachinePrecision], N[(N[Log[im], $MachinePrecision] / N[Log[10.0], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;re \leq -2 \cdot 10^{-158}:\\
\;\;\;\;\frac{\log \left(-re\right)}{\log 10}\\
\mathbf{else}:\\
\;\;\;\;\frac{\log im}{\log 10}\\
\end{array}
\end{array}
if re < -2.00000000000000013e-158Initial program 49.9%
hypot-def99.2%
Simplified99.2%
div-inv98.7%
frac-2neg98.7%
metadata-eval98.7%
neg-log98.9%
metadata-eval98.9%
Applied egg-rr98.9%
*-commutative98.9%
associate-*l/98.9%
neg-mul-198.9%
Simplified98.9%
Taylor expanded in re around -inf 70.4%
frac-2neg70.4%
neg-log70.5%
metadata-eval70.5%
metadata-eval70.5%
log1p-udef70.5%
div-inv70.2%
neg-log70.2%
clear-num70.2%
div-inv70.2%
metadata-eval70.2%
log1p-udef70.2%
metadata-eval70.2%
Applied egg-rr70.2%
associate-*r/70.5%
*-rgt-identity70.5%
*-commutative70.5%
mul-1-neg70.5%
Simplified70.5%
if -2.00000000000000013e-158 < re Initial program 49.8%
hypot-def99.1%
Simplified99.1%
Taylor expanded in re around 0 33.1%
Final simplification47.4%
(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) / 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%
hypot-def99.1%
Simplified99.1%
Taylor expanded in re around 0 28.3%
frac-2neg28.3%
neg-log28.2%
metadata-eval28.2%
div-inv28.2%
Applied egg-rr28.2%
log-rec28.2%
associate-*r/28.2%
*-rgt-identity28.2%
log-rec28.2%
Simplified28.2%
*-un-lft-identity28.2%
add-cube-cbrt27.9%
times-frac28.0%
pow228.0%
add-sqr-sqrt8.7%
sqrt-unprod9.0%
sqr-neg9.0%
sqrt-unprod0.4%
add-sqr-sqrt3.1%
Applied egg-rr3.1%
*-commutative3.1%
times-frac3.1%
*-rgt-identity3.1%
unpow23.1%
rem-3cbrt-rft3.1%
Simplified3.1%
Final simplification3.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 49.8%
hypot-def99.1%
Simplified99.1%
Taylor expanded in re around 0 28.3%
Final simplification28.3%
herbie shell --seed 2023195
(FPCore (re im)
:name "math.log10 on complex, real part"
:precision binary64
(/ (log (sqrt (+ (* re re) (* im im)))) (log 10.0)))