
(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 im re)) (/ (pow (log 10.0) -0.5) (sqrt (log 10.0)))))
double code(double re, double im) {
return log(hypot(im, re)) * (pow(log(10.0), -0.5) / sqrt(log(10.0)));
}
public static double code(double re, double im) {
return Math.log(Math.hypot(im, re)) * (Math.pow(Math.log(10.0), -0.5) / Math.sqrt(Math.log(10.0)));
}
def code(re, im): return math.log(math.hypot(im, re)) * (math.pow(math.log(10.0), -0.5) / math.sqrt(math.log(10.0)))
function code(re, im) return Float64(log(hypot(im, re)) * Float64((log(10.0) ^ -0.5) / sqrt(log(10.0)))) end
function tmp = code(re, im) tmp = log(hypot(im, re)) * ((log(10.0) ^ -0.5) / sqrt(log(10.0))); end
code[re_, im_] := N[(N[Log[N[Sqrt[im ^ 2 + re ^ 2], $MachinePrecision]], $MachinePrecision] * N[(N[Power[N[Log[10.0], $MachinePrecision], -0.5], $MachinePrecision] / N[Sqrt[N[Log[10.0], $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\log \left(\mathsf{hypot}\left(im, re\right)\right) \cdot \frac{{\log 10}^{-0.5}}{\sqrt{\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-define99.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%
*-commutative99.1%
associate-*l/99.2%
associate-/l*99.5%
hypot-undefine51.9%
unpow251.9%
unpow251.9%
+-commutative51.9%
unpow251.9%
unpow251.9%
hypot-define99.5%
Simplified99.5%
Final simplification99.5%
(FPCore (re im) :precision binary64 (* (sqrt (pow (log 10.0) -2.0)) (log im)))
double code(double re, double im) {
return sqrt(pow(log(10.0), -2.0)) * log(im);
}
real(8) function code(re, im)
real(8), intent (in) :: re
real(8), intent (in) :: im
code = sqrt((log(10.0d0) ** (-2.0d0))) * log(im)
end function
public static double code(double re, double im) {
return Math.sqrt(Math.pow(Math.log(10.0), -2.0)) * Math.log(im);
}
def code(re, im): return math.sqrt(math.pow(math.log(10.0), -2.0)) * math.log(im)
function code(re, im) return Float64(sqrt((log(10.0) ^ -2.0)) * log(im)) end
function tmp = code(re, im) tmp = sqrt((log(10.0) ^ -2.0)) * log(im); end
code[re_, im_] := N[(N[Sqrt[N[Power[N[Log[10.0], $MachinePrecision], -2.0], $MachinePrecision]], $MachinePrecision] * N[Log[im], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\sqrt{{\log 10}^{-2}} \cdot \log im
\end{array}
Initial program 51.7%
+-commutative51.7%
+-commutative51.7%
sqr-neg51.7%
sqr-neg51.7%
sqr-neg51.7%
sqr-neg51.7%
hypot-define99.1%
Simplified99.1%
clear-num99.1%
inv-pow99.1%
Applied egg-rr99.1%
Taylor expanded in re around 0 27.4%
unpow-127.4%
associate-/r/27.3%
Applied egg-rr27.3%
add-sqr-sqrt27.5%
sqrt-unprod27.3%
inv-pow27.3%
inv-pow27.3%
pow-prod-up27.5%
metadata-eval27.5%
Applied egg-rr27.5%
Final simplification27.5%
(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-define99.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 51.7%
+-commutative51.7%
+-commutative51.7%
sqr-neg51.7%
sqr-neg51.7%
sqr-neg51.7%
sqr-neg51.7%
hypot-define99.1%
Simplified99.1%
clear-num99.1%
inv-pow99.1%
Applied egg-rr99.1%
Taylor expanded in re around 0 27.4%
unpow-127.4%
Applied egg-rr27.4%
Final simplification27.4%
(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-define99.1%
Simplified99.1%
Taylor expanded in re around 0 27.4%
Final simplification27.4%
herbie shell --seed 2024071
(FPCore (re im)
:name "math.log10 on complex, real part"
:precision binary64
(/ (log (sqrt (+ (* re re) (* im im)))) (log 10.0)))