
(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}
im_m = (fabs.f64 im) re_m = (fabs.f64 re) NOTE: re_m and im_m should be sorted in increasing order before calling this function. (FPCore (re_m im_m) :precision binary64 (* (pow (sqrt (/ 1.0 (log 10.0))) 2.0) (log im_m)))
im_m = fabs(im);
re_m = fabs(re);
assert(re_m < im_m);
double code(double re_m, double im_m) {
return pow(sqrt((1.0 / log(10.0))), 2.0) * log(im_m);
}
im_m = abs(im)
re_m = abs(re)
NOTE: re_m and im_m should be sorted in increasing order before calling this function.
real(8) function code(re_m, im_m)
real(8), intent (in) :: re_m
real(8), intent (in) :: im_m
code = (sqrt((1.0d0 / log(10.0d0))) ** 2.0d0) * log(im_m)
end function
im_m = Math.abs(im);
re_m = Math.abs(re);
assert re_m < im_m;
public static double code(double re_m, double im_m) {
return Math.pow(Math.sqrt((1.0 / Math.log(10.0))), 2.0) * Math.log(im_m);
}
im_m = math.fabs(im) re_m = math.fabs(re) [re_m, im_m] = sort([re_m, im_m]) def code(re_m, im_m): return math.pow(math.sqrt((1.0 / math.log(10.0))), 2.0) * math.log(im_m)
im_m = abs(im) re_m = abs(re) re_m, im_m = sort([re_m, im_m]) function code(re_m, im_m) return Float64((sqrt(Float64(1.0 / log(10.0))) ^ 2.0) * log(im_m)) end
im_m = abs(im);
re_m = abs(re);
re_m, im_m = num2cell(sort([re_m, im_m])){:}
function tmp = code(re_m, im_m)
tmp = (sqrt((1.0 / log(10.0))) ^ 2.0) * log(im_m);
end
im_m = N[Abs[im], $MachinePrecision] re_m = N[Abs[re], $MachinePrecision] NOTE: re_m and im_m should be sorted in increasing order before calling this function. code[re$95$m_, im$95$m_] := N[(N[Power[N[Sqrt[N[(1.0 / N[Log[10.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision], 2.0], $MachinePrecision] * N[Log[im$95$m], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
im_m = \left|im\right|
\\
re_m = \left|re\right|
\\
[re_m, im_m] = \mathsf{sort}([re_m, im_m])\\
\\
{\left(\sqrt{\frac{1}{\log 10}}\right)}^{2} \cdot \log im\_m
\end{array}
Initial program 49.9%
Taylor expanded in re around 0
lower-log.f6498.5
Applied rewrites98.5%
lift-/.f64N/A
frac-2negN/A
lift-log.f64N/A
neg-logN/A
metadata-evalN/A
lift-log.f64N/A
lower-/.f64N/A
lower-neg.f6498.6
Applied rewrites98.6%
lift-/.f64N/A
lift-neg.f64N/A
neg-mul-1N/A
associate-*l/N/A
lift-/.f64N/A
lower-*.f6498.5
lift-/.f64N/A
metadata-evalN/A
lift-log.f64N/A
metadata-evalN/A
neg-logN/A
lift-log.f64N/A
frac-2negN/A
lower-/.f6498.0
Applied rewrites98.0%
lift-/.f64N/A
frac-2negN/A
metadata-evalN/A
lift-log.f64N/A
neg-logN/A
metadata-evalN/A
lift-log.f64N/A
lift-/.f6498.5
rem-square-sqrtN/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
pow2N/A
lower-pow.f6499.0
lift-/.f64N/A
frac-2negN/A
metadata-evalN/A
lift-log.f64N/A
neg-logN/A
metadata-evalN/A
lift-log.f64N/A
lift-/.f6499.0
Applied rewrites99.0%
im_m = (fabs.f64 im) re_m = (fabs.f64 re) NOTE: re_m and im_m should be sorted in increasing order before calling this function. (FPCore (re_m im_m) :precision binary64 (/ (log (fma re_m (* re_m (/ 0.5 im_m)) im_m)) (- (log 0.1))))
im_m = fabs(im);
re_m = fabs(re);
assert(re_m < im_m);
double code(double re_m, double im_m) {
return log(fma(re_m, (re_m * (0.5 / im_m)), im_m)) / -log(0.1);
}
im_m = abs(im) re_m = abs(re) re_m, im_m = sort([re_m, im_m]) function code(re_m, im_m) return Float64(log(fma(re_m, Float64(re_m * Float64(0.5 / im_m)), im_m)) / Float64(-log(0.1))) end
im_m = N[Abs[im], $MachinePrecision] re_m = N[Abs[re], $MachinePrecision] NOTE: re_m and im_m should be sorted in increasing order before calling this function. code[re$95$m_, im$95$m_] := N[(N[Log[N[(re$95$m * N[(re$95$m * N[(0.5 / im$95$m), $MachinePrecision]), $MachinePrecision] + im$95$m), $MachinePrecision]], $MachinePrecision] / (-N[Log[0.1], $MachinePrecision])), $MachinePrecision]
\begin{array}{l}
im_m = \left|im\right|
\\
re_m = \left|re\right|
\\
[re_m, im_m] = \mathsf{sort}([re_m, im_m])\\
\\
\frac{\log \left(\mathsf{fma}\left(re\_m, re\_m \cdot \frac{0.5}{im\_m}, im\_m\right)\right)}{-\log 0.1}
\end{array}
Initial program 51.7%
Taylor expanded in re around 0
+-commutativeN/A
*-lft-identityN/A
associate-*l/N/A
associate-*l*N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
associate-*r/N/A
metadata-evalN/A
lower-/.f6498.8
Applied rewrites98.8%
lift-/.f64N/A
frac-2negN/A
lift-log.f64N/A
neg-logN/A
metadata-evalN/A
lift-log.f64N/A
lower-/.f64N/A
lower-neg.f6498.7
Applied rewrites98.7%
Final simplification98.7%
herbie shell --seed 2024230
(FPCore (re im)
:name "math.log10 on complex, real part"
:precision binary64
(/ (log (sqrt (+ (* re re) (* im im)))) (log 10.0)))