
(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 (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 54.5%
lift-sqrt.f64N/A
lift-+.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lower-hypot.f6499.1
Applied rewrites99.1%
(FPCore (re im) :precision binary64 (/ (* (fma (/ re im) (/ re im) (* 2.0 (log im))) 0.5) (log 10.0)))
double code(double re, double im) {
return (fma((re / im), (re / im), (2.0 * log(im))) * 0.5) / log(10.0);
}
function code(re, im) return Float64(Float64(fma(Float64(re / im), Float64(re / im), Float64(2.0 * log(im))) * 0.5) / log(10.0)) end
code[re_, im_] := N[(N[(N[(N[(re / im), $MachinePrecision] * N[(re / im), $MachinePrecision] + N[(2.0 * N[Log[im], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * 0.5), $MachinePrecision] / N[Log[10.0], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\mathsf{fma}\left(\frac{re}{im}, \frac{re}{im}, 2 \cdot \log im\right) \cdot 0.5}{\log 10}
\end{array}
Initial program 54.5%
Applied rewrites54.5%
Taylor expanded in im around inf
+-commutativeN/A
unpow2N/A
unpow2N/A
times-fracN/A
lower-fma.f64N/A
lower-/.f64N/A
lower-/.f64N/A
log-recN/A
mul-1-negN/A
associate-*r*N/A
metadata-evalN/A
lower-*.f64N/A
lower-log.f6427.7
Applied rewrites27.7%
(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 54.5%
Taylor expanded in re around 0
lower-log.f6429.5
Applied rewrites29.5%
(FPCore (re im) :precision binary64 (/ (* (* (/ re im) re) -0.5) (* (log 0.1) im)))
double code(double re, double im) {
return (((re / im) * re) * -0.5) / (log(0.1) * im);
}
real(8) function code(re, im)
real(8), intent (in) :: re
real(8), intent (in) :: im
code = (((re / im) * re) * (-0.5d0)) / (log(0.1d0) * im)
end function
public static double code(double re, double im) {
return (((re / im) * re) * -0.5) / (Math.log(0.1) * im);
}
def code(re, im): return (((re / im) * re) * -0.5) / (math.log(0.1) * im)
function code(re, im) return Float64(Float64(Float64(Float64(re / im) * re) * -0.5) / Float64(log(0.1) * im)) end
function tmp = code(re, im) tmp = (((re / im) * re) * -0.5) / (log(0.1) * im); end
code[re_, im_] := N[(N[(N[(N[(re / im), $MachinePrecision] * re), $MachinePrecision] * -0.5), $MachinePrecision] / N[(N[Log[0.1], $MachinePrecision] * im), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\left(\frac{re}{im} \cdot re\right) \cdot -0.5}{\log 0.1 \cdot im}
\end{array}
Initial program 54.5%
lift-sqrt.f64N/A
lift-+.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lower-hypot.f6499.1
Applied rewrites99.1%
Taylor expanded in re around 0
associate-*r/N/A
*-commutativeN/A
times-fracN/A
remove-double-negN/A
log-recN/A
mul-1-negN/A
associate-*r/N/A
lower-fma.f64N/A
lower-/.f64N/A
lower-log.f64N/A
unpow2N/A
unpow2N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lower-/.f64N/A
associate-*r/N/A
mul-1-negN/A
log-recN/A
remove-double-negN/A
Applied rewrites27.7%
Taylor expanded in re around inf
Applied rewrites3.0%
Applied rewrites3.5%
(FPCore (re im) :precision binary64 (* (/ (* 0.5 re) im) (/ re (* (log 10.0) im))))
double code(double re, double im) {
return ((0.5 * re) / im) * (re / (log(10.0) * im));
}
real(8) function code(re, im)
real(8), intent (in) :: re
real(8), intent (in) :: im
code = ((0.5d0 * re) / im) * (re / (log(10.0d0) * im))
end function
public static double code(double re, double im) {
return ((0.5 * re) / im) * (re / (Math.log(10.0) * im));
}
def code(re, im): return ((0.5 * re) / im) * (re / (math.log(10.0) * im))
function code(re, im) return Float64(Float64(Float64(0.5 * re) / im) * Float64(re / Float64(log(10.0) * im))) end
function tmp = code(re, im) tmp = ((0.5 * re) / im) * (re / (log(10.0) * im)); end
code[re_, im_] := N[(N[(N[(0.5 * re), $MachinePrecision] / im), $MachinePrecision] * N[(re / N[(N[Log[10.0], $MachinePrecision] * im), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{0.5 \cdot re}{im} \cdot \frac{re}{\log 10 \cdot im}
\end{array}
Initial program 54.5%
lift-sqrt.f64N/A
lift-+.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lower-hypot.f6499.1
Applied rewrites99.1%
Taylor expanded in re around 0
associate-*r/N/A
*-commutativeN/A
times-fracN/A
remove-double-negN/A
log-recN/A
mul-1-negN/A
associate-*r/N/A
lower-fma.f64N/A
lower-/.f64N/A
lower-log.f64N/A
unpow2N/A
unpow2N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lower-/.f64N/A
associate-*r/N/A
mul-1-negN/A
log-recN/A
remove-double-negN/A
Applied rewrites27.7%
Taylor expanded in re around inf
Applied rewrites3.0%
Applied rewrites3.5%
(FPCore (re im) :precision binary64 (* (* 0.5 re) (/ re (* (* (log 10.0) im) im))))
double code(double re, double im) {
return (0.5 * re) * (re / ((log(10.0) * im) * im));
}
real(8) function code(re, im)
real(8), intent (in) :: re
real(8), intent (in) :: im
code = (0.5d0 * re) * (re / ((log(10.0d0) * im) * im))
end function
public static double code(double re, double im) {
return (0.5 * re) * (re / ((Math.log(10.0) * im) * im));
}
def code(re, im): return (0.5 * re) * (re / ((math.log(10.0) * im) * im))
function code(re, im) return Float64(Float64(0.5 * re) * Float64(re / Float64(Float64(log(10.0) * im) * im))) end
function tmp = code(re, im) tmp = (0.5 * re) * (re / ((log(10.0) * im) * im)); end
code[re_, im_] := N[(N[(0.5 * re), $MachinePrecision] * N[(re / N[(N[(N[Log[10.0], $MachinePrecision] * im), $MachinePrecision] * im), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\left(0.5 \cdot re\right) \cdot \frac{re}{\left(\log 10 \cdot im\right) \cdot im}
\end{array}
Initial program 54.5%
lift-sqrt.f64N/A
lift-+.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lower-hypot.f6499.1
Applied rewrites99.1%
Taylor expanded in re around 0
associate-*r/N/A
*-commutativeN/A
times-fracN/A
remove-double-negN/A
log-recN/A
mul-1-negN/A
associate-*r/N/A
lower-fma.f64N/A
lower-/.f64N/A
lower-log.f64N/A
unpow2N/A
unpow2N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lower-/.f64N/A
associate-*r/N/A
mul-1-negN/A
log-recN/A
remove-double-negN/A
Applied rewrites27.7%
Taylor expanded in re around inf
Applied rewrites3.0%
Applied rewrites3.2%
herbie shell --seed 2024329
(FPCore (re im)
:name "math.log10 on complex, real part"
:precision binary64
(/ (log (sqrt (+ (* re re) (* im im)))) (log 10.0)))