
(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 3 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 (pow (log 10.0) -0.5) 2.0) (log (hypot im re))))
double code(double re, double im) {
return pow(pow(log(10.0), -0.5), 2.0) * log(hypot(im, re));
}
public static double code(double re, double im) {
return Math.pow(Math.pow(Math.log(10.0), -0.5), 2.0) * Math.log(Math.hypot(im, re));
}
def code(re, im): return math.pow(math.pow(math.log(10.0), -0.5), 2.0) * math.log(math.hypot(im, re))
function code(re, im) return Float64(((log(10.0) ^ -0.5) ^ 2.0) * log(hypot(im, re))) end
function tmp = code(re, im) tmp = ((log(10.0) ^ -0.5) ^ 2.0) * log(hypot(im, re)); end
code[re_, im_] := N[(N[Power[N[Power[N[Log[10.0], $MachinePrecision], -0.5], $MachinePrecision], 2.0], $MachinePrecision] * N[Log[N[Sqrt[im ^ 2 + re ^ 2], $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
{\left({\log 10}^{-0.5}\right)}^{2} \cdot \log \left(\mathsf{hypot}\left(im, re\right)\right)
\end{array}
Initial program 54.5%
lift-/.f64N/A
frac-2negN/A
lower-/.f64N/A
lower-neg.f64N/A
lift-sqrt.f64N/A
lift-+.f64N/A
+-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
lower-hypot.f64N/A
lift-log.f64N/A
neg-logN/A
lower-log.f64N/A
metadata-eval99.1
Applied rewrites99.1%
lift-/.f64N/A
clear-numN/A
associate-/r/N/A
unpow-1N/A
lift-pow.f64N/A
lift-neg.f64N/A
neg-sub0N/A
flip--N/A
+-lft-identityN/A
associate-*r/N/A
lower-/.f64N/A
Applied rewrites99.0%
lift-/.f64N/A
lift-*.f64N/A
lift-neg.f64N/A
distribute-rgt-neg-outN/A
distribute-lft-neg-inN/A
lift-pow.f64N/A
unpow-1N/A
metadata-evalN/A
distribute-neg-frac2N/A
metadata-evalN/A
lift-log.f64N/A
neg-logN/A
metadata-evalN/A
lift-log.f64N/A
associate-/l*N/A
lift-pow.f64N/A
Applied rewrites99.5%
Final simplification99.5%
(FPCore (re im) :precision binary64 (/ (log (hypot im re)) (- (log 0.1))))
double code(double re, double im) {
return log(hypot(im, re)) / -log(0.1);
}
public static double code(double re, double im) {
return Math.log(Math.hypot(im, re)) / -Math.log(0.1);
}
def code(re, im): return math.log(math.hypot(im, re)) / -math.log(0.1)
function code(re, im) return Float64(log(hypot(im, re)) / Float64(-log(0.1))) end
function tmp = code(re, im) tmp = log(hypot(im, re)) / -log(0.1); end
code[re_, im_] := N[(N[Log[N[Sqrt[im ^ 2 + re ^ 2], $MachinePrecision]], $MachinePrecision] / (-N[Log[0.1], $MachinePrecision])), $MachinePrecision]
\begin{array}{l}
\\
\frac{\log \left(\mathsf{hypot}\left(im, re\right)\right)}{-\log 0.1}
\end{array}
Initial program 54.5%
lift-/.f64N/A
frac-2negN/A
lower-/.f64N/A
lower-neg.f64N/A
lift-sqrt.f64N/A
lift-+.f64N/A
+-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
lower-hypot.f64N/A
lift-log.f64N/A
neg-logN/A
lower-log.f64N/A
metadata-eval99.1
Applied rewrites99.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 54.5%
Taylor expanded in re around 0
lower-log.f6427.0
Applied rewrites27.0%
herbie shell --seed 2024276
(FPCore (re im)
:name "math.log10 on complex, real part"
:precision binary64
(/ (log (sqrt (+ (* re re) (* im im)))) (log 10.0)))