
(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 (pow (hypot re im) (cbrt (pow (log 10.0) -3.0)))))
double code(double re, double im) {
return log(pow(hypot(re, im), cbrt(pow(log(10.0), -3.0))));
}
public static double code(double re, double im) {
return Math.log(Math.pow(Math.hypot(re, im), Math.cbrt(Math.pow(Math.log(10.0), -3.0))));
}
function code(re, im) return log((hypot(re, im) ^ cbrt((log(10.0) ^ -3.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], -3.0], $MachinePrecision], 1/3], $MachinePrecision]], $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\log \left({\left(\mathsf{hypot}\left(re, im\right)\right)}^{\left(\sqrt[3]{{\log 10}^{-3}}\right)}\right)
\end{array}
Initial program 58.9%
hypot-def99.0%
Simplified99.0%
add-log-exp99.0%
div-inv98.5%
exp-to-pow98.5%
frac-2neg98.5%
metadata-eval98.5%
neg-log99.0%
metadata-eval99.0%
Applied egg-rr99.0%
add-cbrt-cube98.0%
pow1/399.0%
Applied egg-rr99.8%
unpow1/399.8%
Simplified99.8%
Final simplification99.8%
(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 58.9%
hypot-def99.0%
Simplified99.0%
div-inv98.5%
frac-2neg98.5%
metadata-eval98.5%
neg-log99.0%
metadata-eval99.0%
Applied egg-rr99.0%
*-commutative99.0%
associate-*l/99.1%
neg-mul-199.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 58.9%
hypot-def99.0%
Simplified99.0%
Final simplification99.0%
(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 58.9%
hypot-def99.0%
Simplified99.0%
Taylor expanded in re around 0 27.1%
frac-2neg27.1%
neg-log27.1%
metadata-eval27.1%
div-inv27.1%
Applied egg-rr27.1%
log-rec27.1%
associate-*r/27.1%
*-rgt-identity27.1%
log-rec27.1%
Simplified27.1%
Final simplification27.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 58.9%
hypot-def99.0%
Simplified99.0%
Taylor expanded in re around 0 27.1%
Final simplification27.1%
herbie shell --seed 2023224
(FPCore (re im)
:name "math.log10 on complex, real part"
:precision binary64
(/ (log (sqrt (+ (* re re) (* im im)))) (log 10.0)))