
(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 (* (pow (log 10.0) -0.5) (/ (log (hypot re im)) (sqrt (log 10.0)))))
double code(double re, double im) {
return pow(log(10.0), -0.5) * (log(hypot(re, im)) / sqrt(log(10.0)));
}
public static double code(double re, double im) {
return Math.pow(Math.log(10.0), -0.5) * (Math.log(Math.hypot(re, im)) / Math.sqrt(Math.log(10.0)));
}
def code(re, im): return math.pow(math.log(10.0), -0.5) * (math.log(math.hypot(re, im)) / math.sqrt(math.log(10.0)))
function code(re, im) return Float64((log(10.0) ^ -0.5) * Float64(log(hypot(re, im)) / sqrt(log(10.0)))) end
function tmp = code(re, im) tmp = (log(10.0) ^ -0.5) * (log(hypot(re, im)) / sqrt(log(10.0))); end
code[re_, im_] := N[(N[Power[N[Log[10.0], $MachinePrecision], -0.5], $MachinePrecision] * N[(N[Log[N[Sqrt[re ^ 2 + im ^ 2], $MachinePrecision]], $MachinePrecision] / N[Sqrt[N[Log[10.0], $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
{\log 10}^{-0.5} \cdot \frac{\log \left(\mathsf{hypot}\left(re, im\right)\right)}{\sqrt{\log 10}}
\end{array}
Initial program 50.9%
+-commutative50.9%
+-commutative50.9%
sqr-neg50.9%
sqr-neg50.9%
+-commutative50.9%
+-commutative50.9%
hypot-def99.1%
Simplified99.1%
*-un-lft-identity99.1%
add-sqr-sqrt99.1%
times-frac99.1%
pow1/299.1%
pow-flip99.1%
metadata-eval99.1%
Applied egg-rr99.1%
Final simplification99.1%
(FPCore (re im) :precision binary64 (pow (/ (log 10.0) (log (hypot re im))) -1.0))
double code(double re, double im) {
return pow((log(10.0) / log(hypot(re, im))), -1.0);
}
public static double code(double re, double im) {
return Math.pow((Math.log(10.0) / Math.log(Math.hypot(re, im))), -1.0);
}
def code(re, im): return math.pow((math.log(10.0) / math.log(math.hypot(re, im))), -1.0)
function code(re, im) return Float64(log(10.0) / log(hypot(re, im))) ^ -1.0 end
function tmp = code(re, im) tmp = (log(10.0) / log(hypot(re, im))) ^ -1.0; end
code[re_, im_] := N[Power[N[(N[Log[10.0], $MachinePrecision] / N[Log[N[Sqrt[re ^ 2 + im ^ 2], $MachinePrecision]], $MachinePrecision]), $MachinePrecision], -1.0], $MachinePrecision]
\begin{array}{l}
\\
{\left(\frac{\log 10}{\log \left(\mathsf{hypot}\left(re, im\right)\right)}\right)}^{-1}
\end{array}
Initial program 50.9%
+-commutative50.9%
+-commutative50.9%
sqr-neg50.9%
sqr-neg50.9%
+-commutative50.9%
+-commutative50.9%
hypot-def99.1%
Simplified99.1%
clear-num99.1%
inv-pow99.1%
Applied egg-rr99.1%
Final simplification99.1%
(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%
+-commutative50.9%
+-commutative50.9%
sqr-neg50.9%
sqr-neg50.9%
+-commutative50.9%
+-commutative50.9%
hypot-def99.1%
Simplified99.1%
frac-2neg99.1%
div-inv98.5%
neg-log99.0%
metadata-eval99.0%
Applied egg-rr99.0%
associate-*r/99.1%
*-rgt-identity99.1%
Simplified99.1%
Final simplification99.1%
(FPCore (re im) :precision binary64 (log (pow im (/ -1.0 (log 0.1)))))
double code(double re, double im) {
return log(pow(im, (-1.0 / log(0.1))));
}
real(8) function code(re, im)
real(8), intent (in) :: re
real(8), intent (in) :: im
code = log((im ** ((-1.0d0) / log(0.1d0))))
end function
public static double code(double re, double im) {
return Math.log(Math.pow(im, (-1.0 / Math.log(0.1))));
}
def code(re, im): return math.log(math.pow(im, (-1.0 / math.log(0.1))))
function code(re, im) return log((im ^ Float64(-1.0 / log(0.1)))) end
function tmp = code(re, im) tmp = log((im ^ (-1.0 / log(0.1)))); end
code[re_, im_] := N[Log[N[Power[im, N[(-1.0 / N[Log[0.1], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\log \left({im}^{\left(\frac{-1}{\log 0.1}\right)}\right)
\end{array}
Initial program 50.9%
+-commutative50.9%
+-commutative50.9%
sqr-neg50.9%
sqr-neg50.9%
+-commutative50.9%
+-commutative50.9%
hypot-def99.1%
Simplified99.1%
Taylor expanded in re around 0 25.0%
add-log-exp25.0%
div-inv24.9%
exp-to-pow24.9%
frac-2neg24.9%
metadata-eval24.9%
neg-log25.0%
metadata-eval25.0%
Applied egg-rr25.0%
Final simplification25.0%
(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 50.9%
+-commutative50.9%
+-commutative50.9%
sqr-neg50.9%
sqr-neg50.9%
+-commutative50.9%
+-commutative50.9%
hypot-def99.1%
Simplified99.1%
Final simplification99.1%
(FPCore (re im) :precision binary64 (/ 1.0 (/ (log 10.0) (log im))))
double code(double re, double im) {
return 1.0 / (log(10.0) / log(im));
}
real(8) function code(re, im)
real(8), intent (in) :: re
real(8), intent (in) :: im
code = 1.0d0 / (log(10.0d0) / log(im))
end function
public static double code(double re, double im) {
return 1.0 / (Math.log(10.0) / Math.log(im));
}
def code(re, im): return 1.0 / (math.log(10.0) / math.log(im))
function code(re, im) return Float64(1.0 / Float64(log(10.0) / log(im))) end
function tmp = code(re, im) tmp = 1.0 / (log(10.0) / log(im)); end
code[re_, im_] := N[(1.0 / N[(N[Log[10.0], $MachinePrecision] / N[Log[im], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{1}{\frac{\log 10}{\log im}}
\end{array}
Initial program 50.9%
+-commutative50.9%
+-commutative50.9%
sqr-neg50.9%
sqr-neg50.9%
+-commutative50.9%
+-commutative50.9%
hypot-def99.1%
Simplified99.1%
Taylor expanded in re around 0 25.0%
clear-num25.0%
inv-pow25.0%
Applied egg-rr25.0%
unpow-125.0%
Simplified25.0%
Final simplification25.0%
(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%
+-commutative50.9%
+-commutative50.9%
sqr-neg50.9%
sqr-neg50.9%
+-commutative50.9%
+-commutative50.9%
hypot-def99.1%
Simplified99.1%
Taylor expanded in re around 0 25.0%
Final simplification25.0%
herbie shell --seed 2023318
(FPCore (re im)
:name "math.log10 on complex, real part"
:precision binary64
(/ (log (sqrt (+ (* re re) (* im im)))) (log 10.0)))