
(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 6 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 51.4%
+-commutative51.4%
+-commutative51.4%
sqr-neg51.4%
sqr-neg51.4%
sqr-neg51.4%
sqr-neg51.4%
hypot-define99.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%
metadata-eval99.0%
metadata-eval99.0%
neg-log98.5%
frac-2neg98.5%
inv-pow98.5%
metadata-eval98.5%
pow-prod-up99.7%
pow299.7%
Applied egg-rr99.7%
Final simplification99.7%
(FPCore (re im) :precision binary64 (* (log im) (sqrt (pow (log 10.0) -2.0))))
double code(double re, double im) {
return log(im) * sqrt(pow(log(10.0), -2.0));
}
real(8) function code(re, im)
real(8), intent (in) :: re
real(8), intent (in) :: im
code = log(im) * sqrt((log(10.0d0) ** (-2.0d0)))
end function
public static double code(double re, double im) {
return Math.log(im) * Math.sqrt(Math.pow(Math.log(10.0), -2.0));
}
def code(re, im): return math.log(im) * math.sqrt(math.pow(math.log(10.0), -2.0))
function code(re, im) return Float64(log(im) * sqrt((log(10.0) ^ -2.0))) end
function tmp = code(re, im) tmp = log(im) * sqrt((log(10.0) ^ -2.0)); end
code[re_, im_] := N[(N[Log[im], $MachinePrecision] * N[Sqrt[N[Power[N[Log[10.0], $MachinePrecision], -2.0], $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\log im \cdot \sqrt{{\log 10}^{-2}}
\end{array}
Initial program 51.4%
+-commutative51.4%
+-commutative51.4%
sqr-neg51.4%
sqr-neg51.4%
sqr-neg51.4%
sqr-neg51.4%
hypot-define99.0%
Simplified99.0%
Taylor expanded in re around 0 23.9%
frac-2neg23.9%
neg-log23.9%
metadata-eval23.9%
div-inv23.9%
frac-2neg23.9%
metadata-eval23.9%
neg-log23.8%
metadata-eval23.8%
Applied egg-rr23.8%
distribute-lft-neg-out23.8%
distribute-rgt-neg-in23.8%
distribute-neg-frac23.8%
metadata-eval23.8%
Simplified23.8%
add-sqr-sqrt24.0%
sqrt-unprod23.8%
inv-pow23.8%
inv-pow23.8%
pow-prod-up24.0%
metadata-eval24.0%
Applied egg-rr24.0%
Final simplification24.0%
(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(log(hypot(re, im)) / Float64(-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 51.4%
+-commutative51.4%
+-commutative51.4%
sqr-neg51.4%
sqr-neg51.4%
sqr-neg51.4%
sqr-neg51.4%
hypot-define99.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.0%
neg-mul-199.0%
distribute-neg-frac99.0%
distribute-neg-frac299.0%
Simplified99.0%
Final simplification99.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 51.4%
+-commutative51.4%
+-commutative51.4%
sqr-neg51.4%
sqr-neg51.4%
sqr-neg51.4%
sqr-neg51.4%
hypot-define99.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(log(im) / Float64(-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 51.4%
+-commutative51.4%
+-commutative51.4%
sqr-neg51.4%
sqr-neg51.4%
sqr-neg51.4%
sqr-neg51.4%
hypot-define99.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%
Taylor expanded in re around 0 23.9%
neg-mul-123.9%
distribute-neg-frac223.9%
Simplified23.9%
Final simplification23.9%
(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.4%
+-commutative51.4%
+-commutative51.4%
sqr-neg51.4%
sqr-neg51.4%
sqr-neg51.4%
sqr-neg51.4%
hypot-define99.0%
Simplified99.0%
Taylor expanded in re around 0 23.9%
Final simplification23.9%
herbie shell --seed 2024059
(FPCore (re im)
:name "math.log10 on complex, real part"
:precision binary64
(/ (log (sqrt (+ (* re re) (* im im)))) (log 10.0)))