
(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 4 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 (* (* 0.3333333333333333 (log (hypot im re))) (/ -3.0 (log 0.1))))
double code(double re, double im) {
return (0.3333333333333333 * log(hypot(im, re))) * (-3.0 / log(0.1));
}
public static double code(double re, double im) {
return (0.3333333333333333 * Math.log(Math.hypot(im, re))) * (-3.0 / Math.log(0.1));
}
def code(re, im): return (0.3333333333333333 * math.log(math.hypot(im, re))) * (-3.0 / math.log(0.1))
function code(re, im) return Float64(Float64(0.3333333333333333 * log(hypot(im, re))) * Float64(-3.0 / log(0.1))) end
function tmp = code(re, im) tmp = (0.3333333333333333 * log(hypot(im, re))) * (-3.0 / log(0.1)); end
code[re_, im_] := N[(N[(0.3333333333333333 * N[Log[N[Sqrt[im ^ 2 + re ^ 2], $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(-3.0 / N[Log[0.1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\left(0.3333333333333333 \cdot \log \left(\mathsf{hypot}\left(im, re\right)\right)\right) \cdot \frac{-3}{\log 0.1}
\end{array}
Initial program 50.7%
+-commutative50.7%
+-commutative50.7%
sqr-neg50.7%
sqr-neg50.7%
hypot-define99.1%
Simplified99.1%
clear-num99.0%
inv-pow99.0%
add-sqr-sqrt99.0%
*-un-lft-identity99.0%
times-frac98.7%
unpow-prod-down99.1%
Applied egg-rr99.1%
unpow-199.1%
/-rgt-identity99.1%
associate-*l/98.8%
*-lft-identity98.8%
unpow-198.8%
associate-/r/99.2%
hypot-undefine50.8%
unpow250.8%
unpow250.8%
+-commutative50.8%
unpow250.8%
unpow250.8%
hypot-define99.2%
Simplified99.2%
Applied egg-rr99.3%
associate-*r/99.3%
metadata-eval99.3%
Simplified99.3%
pow1/399.6%
log-pow99.4%
Applied egg-rr99.4%
(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.7%
+-commutative50.7%
+-commutative50.7%
sqr-neg50.7%
sqr-neg50.7%
hypot-define99.1%
Simplified99.1%
(FPCore (re im) :precision binary64 (* (/ -3.0 (log 0.1)) (* 0.3333333333333333 (log im))))
double code(double re, double im) {
return (-3.0 / log(0.1)) * (0.3333333333333333 * log(im));
}
real(8) function code(re, im)
real(8), intent (in) :: re
real(8), intent (in) :: im
code = ((-3.0d0) / log(0.1d0)) * (0.3333333333333333d0 * log(im))
end function
public static double code(double re, double im) {
return (-3.0 / Math.log(0.1)) * (0.3333333333333333 * Math.log(im));
}
def code(re, im): return (-3.0 / math.log(0.1)) * (0.3333333333333333 * math.log(im))
function code(re, im) return Float64(Float64(-3.0 / log(0.1)) * Float64(0.3333333333333333 * log(im))) end
function tmp = code(re, im) tmp = (-3.0 / log(0.1)) * (0.3333333333333333 * log(im)); end
code[re_, im_] := N[(N[(-3.0 / N[Log[0.1], $MachinePrecision]), $MachinePrecision] * N[(0.3333333333333333 * N[Log[im], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{-3}{\log 0.1} \cdot \left(0.3333333333333333 \cdot \log im\right)
\end{array}
Initial program 50.7%
+-commutative50.7%
+-commutative50.7%
sqr-neg50.7%
sqr-neg50.7%
hypot-define99.1%
Simplified99.1%
clear-num99.0%
inv-pow99.0%
add-sqr-sqrt99.0%
*-un-lft-identity99.0%
times-frac98.7%
unpow-prod-down99.1%
Applied egg-rr99.1%
unpow-199.1%
/-rgt-identity99.1%
associate-*l/98.8%
*-lft-identity98.8%
unpow-198.8%
associate-/r/99.2%
hypot-undefine50.8%
unpow250.8%
unpow250.8%
+-commutative50.8%
unpow250.8%
unpow250.8%
hypot-define99.2%
Simplified99.2%
Applied egg-rr99.3%
associate-*r/99.3%
metadata-eval99.3%
Simplified99.3%
pow1/399.6%
log-pow99.4%
Applied egg-rr99.4%
Taylor expanded in re around 0 25.2%
Final simplification25.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 50.7%
+-commutative50.7%
+-commutative50.7%
sqr-neg50.7%
sqr-neg50.7%
hypot-define99.1%
Simplified99.1%
Taylor expanded in re around 0 25.2%
herbie shell --seed 2024139
(FPCore (re im)
:name "math.log10 on complex, real part"
:precision binary64
(/ (log (sqrt (+ (* re re) (* im im)))) (log 10.0)))