
(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 (hypot re im)) (cbrt (pow (log 10.0) -3.0))))
double code(double re, double im) {
return log(hypot(re, im)) * cbrt(pow(log(10.0), -3.0));
}
public static double code(double re, double im) {
return Math.log(Math.hypot(re, im)) * Math.cbrt(Math.pow(Math.log(10.0), -3.0));
}
function code(re, im) return Float64(log(hypot(re, im)) * cbrt((log(10.0) ^ -3.0))) end
code[re_, im_] := N[(N[Log[N[Sqrt[re ^ 2 + im ^ 2], $MachinePrecision]], $MachinePrecision] * N[Power[N[Power[N[Log[10.0], $MachinePrecision], -3.0], $MachinePrecision], 1/3], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\log \left(\mathsf{hypot}\left(re, im\right)\right) \cdot \sqrt[3]{{\log 10}^{-3}}
\end{array}
Initial program 51.7%
+-commutative51.7%
+-commutative51.7%
sqr-neg51.7%
sqr-neg51.7%
sqr-neg51.7%
sqr-neg51.7%
hypot-def99.1%
Simplified99.1%
expm1-log1p-u75.1%
expm1-udef75.1%
log1p-udef75.1%
add-exp-log99.1%
Applied egg-rr99.1%
associate--l+99.1%
Simplified99.1%
associate-+r-99.1%
add-exp-log75.1%
log1p-udef75.1%
expm1-udef75.1%
expm1-log1p-u99.1%
rem-cbrt-cube98.9%
cube-div98.8%
div-inv98.8%
cbrt-prod98.7%
rem-cbrt-cube98.6%
pow-flip99.6%
metadata-eval99.6%
Applied egg-rr99.6%
Final simplification99.6%
(FPCore (re im) :precision binary64 (+ 1.0 (+ (/ (log (hypot re im)) (log 10.0)) -1.0)))
double code(double re, double im) {
return 1.0 + ((log(hypot(re, im)) / log(10.0)) + -1.0);
}
public static double code(double re, double im) {
return 1.0 + ((Math.log(Math.hypot(re, im)) / Math.log(10.0)) + -1.0);
}
def code(re, im): return 1.0 + ((math.log(math.hypot(re, im)) / math.log(10.0)) + -1.0)
function code(re, im) return Float64(1.0 + Float64(Float64(log(hypot(re, im)) / log(10.0)) + -1.0)) end
function tmp = code(re, im) tmp = 1.0 + ((log(hypot(re, im)) / log(10.0)) + -1.0); end
code[re_, im_] := N[(1.0 + N[(N[(N[Log[N[Sqrt[re ^ 2 + im ^ 2], $MachinePrecision]], $MachinePrecision] / N[Log[10.0], $MachinePrecision]), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
1 + \left(\frac{\log \left(\mathsf{hypot}\left(re, im\right)\right)}{\log 10} + -1\right)
\end{array}
Initial program 51.7%
+-commutative51.7%
+-commutative51.7%
sqr-neg51.7%
sqr-neg51.7%
sqr-neg51.7%
sqr-neg51.7%
hypot-def99.1%
Simplified99.1%
expm1-log1p-u75.1%
expm1-udef75.1%
log1p-udef75.1%
add-exp-log99.1%
Applied egg-rr99.1%
associate--l+99.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 51.7%
+-commutative51.7%
+-commutative51.7%
sqr-neg51.7%
sqr-neg51.7%
sqr-neg51.7%
sqr-neg51.7%
hypot-def99.1%
Simplified99.1%
Final simplification99.1%
(FPCore (re im) :precision binary64 (+ 1.0 (+ (/ (log im) (log 10.0)) -1.0)))
double code(double re, double im) {
return 1.0 + ((log(im) / log(10.0)) + -1.0);
}
real(8) function code(re, im)
real(8), intent (in) :: re
real(8), intent (in) :: im
code = 1.0d0 + ((log(im) / log(10.0d0)) + (-1.0d0))
end function
public static double code(double re, double im) {
return 1.0 + ((Math.log(im) / Math.log(10.0)) + -1.0);
}
def code(re, im): return 1.0 + ((math.log(im) / math.log(10.0)) + -1.0)
function code(re, im) return Float64(1.0 + Float64(Float64(log(im) / log(10.0)) + -1.0)) end
function tmp = code(re, im) tmp = 1.0 + ((log(im) / log(10.0)) + -1.0); end
code[re_, im_] := N[(1.0 + N[(N[(N[Log[im], $MachinePrecision] / N[Log[10.0], $MachinePrecision]), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
1 + \left(\frac{\log im}{\log 10} + -1\right)
\end{array}
Initial program 51.7%
+-commutative51.7%
+-commutative51.7%
sqr-neg51.7%
sqr-neg51.7%
sqr-neg51.7%
sqr-neg51.7%
hypot-def99.1%
Simplified99.1%
expm1-log1p-u75.1%
expm1-udef75.1%
log1p-udef75.1%
add-exp-log99.1%
Applied egg-rr99.1%
associate--l+99.1%
Simplified99.1%
Taylor expanded in re around 0 31.2%
Final simplification31.2%
(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.7%
+-commutative51.7%
+-commutative51.7%
sqr-neg51.7%
sqr-neg51.7%
sqr-neg51.7%
sqr-neg51.7%
hypot-def99.1%
Simplified99.1%
Taylor expanded in re around 0 31.2%
Final simplification31.2%
herbie shell --seed 2023271
(FPCore (re im)
:name "math.log10 on complex, real part"
:precision binary64
(/ (log (sqrt (+ (* re re) (* im im)))) (log 10.0)))