
(FPCore (re im) :precision binary64 (log (sqrt (+ (* re re) (* im im)))))
double code(double re, double im) {
return log(sqrt(((re * re) + (im * im))));
}
real(8) function code(re, im)
real(8), intent (in) :: re
real(8), intent (in) :: im
code = log(sqrt(((re * re) + (im * im))))
end function
public static double code(double re, double im) {
return Math.log(Math.sqrt(((re * re) + (im * im))));
}
def code(re, im): return math.log(math.sqrt(((re * re) + (im * im))))
function code(re, im) return log(sqrt(Float64(Float64(re * re) + Float64(im * im)))) end
function tmp = code(re, im) tmp = log(sqrt(((re * re) + (im * im)))); end
code[re_, im_] := N[Log[N[Sqrt[N[(N[(re * re), $MachinePrecision] + N[(im * im), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\log \left(\sqrt{re \cdot re + im \cdot im}\right)
\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)))))
double code(double re, double im) {
return log(sqrt(((re * re) + (im * im))));
}
real(8) function code(re, im)
real(8), intent (in) :: re
real(8), intent (in) :: im
code = log(sqrt(((re * re) + (im * im))))
end function
public static double code(double re, double im) {
return Math.log(Math.sqrt(((re * re) + (im * im))));
}
def code(re, im): return math.log(math.sqrt(((re * re) + (im * im))))
function code(re, im) return log(sqrt(Float64(Float64(re * re) + Float64(im * im)))) end
function tmp = code(re, im) tmp = log(sqrt(((re * re) + (im * im)))); end
code[re_, im_] := N[Log[N[Sqrt[N[(N[(re * re), $MachinePrecision] + N[(im * im), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\log \left(\sqrt{re \cdot re + im \cdot im}\right)
\end{array}
re_m = (fabs.f64 re) im_m = (fabs.f64 im) NOTE: re_m and im_m should be sorted in increasing order before calling this function. (FPCore (re_m im_m) :precision binary64 (+ (log im_m) (* 0.5 (* re_m (/ (/ re_m im_m) im_m)))))
re_m = fabs(re);
im_m = fabs(im);
assert(re_m < im_m);
double code(double re_m, double im_m) {
return log(im_m) + (0.5 * (re_m * ((re_m / im_m) / im_m)));
}
re_m = abs(re)
im_m = abs(im)
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 = log(im_m) + (0.5d0 * (re_m * ((re_m / im_m) / im_m)))
end function
re_m = Math.abs(re);
im_m = Math.abs(im);
assert re_m < im_m;
public static double code(double re_m, double im_m) {
return Math.log(im_m) + (0.5 * (re_m * ((re_m / im_m) / im_m)));
}
re_m = math.fabs(re) im_m = math.fabs(im) [re_m, im_m] = sort([re_m, im_m]) def code(re_m, im_m): return math.log(im_m) + (0.5 * (re_m * ((re_m / im_m) / im_m)))
re_m = abs(re) im_m = abs(im) re_m, im_m = sort([re_m, im_m]) function code(re_m, im_m) return Float64(log(im_m) + Float64(0.5 * Float64(re_m * Float64(Float64(re_m / im_m) / im_m)))) end
re_m = abs(re);
im_m = abs(im);
re_m, im_m = num2cell(sort([re_m, im_m])){:}
function tmp = code(re_m, im_m)
tmp = log(im_m) + (0.5 * (re_m * ((re_m / im_m) / im_m)));
end
re_m = N[Abs[re], $MachinePrecision] im_m = N[Abs[im], $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[im$95$m], $MachinePrecision] + N[(0.5 * N[(re$95$m * N[(N[(re$95$m / im$95$m), $MachinePrecision] / im$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
re_m = \left|re\right|
\\
im_m = \left|im\right|
\\
[re_m, im_m] = \mathsf{sort}([re_m, im_m])\\
\\
\log im\_m + 0.5 \cdot \left(re\_m \cdot \frac{\frac{re\_m}{im\_m}}{im\_m}\right)
\end{array}
Initial program 47.3%
log-lowering-log.f64N/A
hypot-defineN/A
hypot-lowering-hypot.f64100.0%
Simplified100.0%
Taylor expanded in re around 0
+-lowering-+.f64N/A
log-lowering-log.f64N/A
*-lowering-*.f64N/A
unpow2N/A
associate-/l*N/A
*-lowering-*.f64N/A
unpow2N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f6427.6%
Simplified27.6%
re_m = (fabs.f64 re) im_m = (fabs.f64 im) NOTE: re_m and im_m should be sorted in increasing order before calling this function. (FPCore (re_m im_m) :precision binary64 (log im_m))
re_m = fabs(re);
im_m = fabs(im);
assert(re_m < im_m);
double code(double re_m, double im_m) {
return log(im_m);
}
re_m = abs(re)
im_m = abs(im)
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 = log(im_m)
end function
re_m = Math.abs(re);
im_m = Math.abs(im);
assert re_m < im_m;
public static double code(double re_m, double im_m) {
return Math.log(im_m);
}
re_m = math.fabs(re) im_m = math.fabs(im) [re_m, im_m] = sort([re_m, im_m]) def code(re_m, im_m): return math.log(im_m)
re_m = abs(re) im_m = abs(im) re_m, im_m = sort([re_m, im_m]) function code(re_m, im_m) return log(im_m) end
re_m = abs(re);
im_m = abs(im);
re_m, im_m = num2cell(sort([re_m, im_m])){:}
function tmp = code(re_m, im_m)
tmp = log(im_m);
end
re_m = N[Abs[re], $MachinePrecision] im_m = N[Abs[im], $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[Log[im$95$m], $MachinePrecision]
\begin{array}{l}
re_m = \left|re\right|
\\
im_m = \left|im\right|
\\
[re_m, im_m] = \mathsf{sort}([re_m, im_m])\\
\\
\log im\_m
\end{array}
Initial program 47.3%
log-lowering-log.f64N/A
hypot-defineN/A
hypot-lowering-hypot.f64100.0%
Simplified100.0%
Taylor expanded in re around 0
log-lowering-log.f6429.2%
Simplified29.2%
re_m = (fabs.f64 re) im_m = (fabs.f64 im) NOTE: re_m and im_m should be sorted in increasing order before calling this function. (FPCore (re_m im_m) :precision binary64 (/ (/ 0.5 im_m) (/ (/ im_m re_m) re_m)))
re_m = fabs(re);
im_m = fabs(im);
assert(re_m < im_m);
double code(double re_m, double im_m) {
return (0.5 / im_m) / ((im_m / re_m) / re_m);
}
re_m = abs(re)
im_m = abs(im)
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 = (0.5d0 / im_m) / ((im_m / re_m) / re_m)
end function
re_m = Math.abs(re);
im_m = Math.abs(im);
assert re_m < im_m;
public static double code(double re_m, double im_m) {
return (0.5 / im_m) / ((im_m / re_m) / re_m);
}
re_m = math.fabs(re) im_m = math.fabs(im) [re_m, im_m] = sort([re_m, im_m]) def code(re_m, im_m): return (0.5 / im_m) / ((im_m / re_m) / re_m)
re_m = abs(re) im_m = abs(im) re_m, im_m = sort([re_m, im_m]) function code(re_m, im_m) return Float64(Float64(0.5 / im_m) / Float64(Float64(im_m / re_m) / re_m)) end
re_m = abs(re);
im_m = abs(im);
re_m, im_m = num2cell(sort([re_m, im_m])){:}
function tmp = code(re_m, im_m)
tmp = (0.5 / im_m) / ((im_m / re_m) / re_m);
end
re_m = N[Abs[re], $MachinePrecision] im_m = N[Abs[im], $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[(0.5 / im$95$m), $MachinePrecision] / N[(N[(im$95$m / re$95$m), $MachinePrecision] / re$95$m), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
re_m = \left|re\right|
\\
im_m = \left|im\right|
\\
[re_m, im_m] = \mathsf{sort}([re_m, im_m])\\
\\
\frac{\frac{0.5}{im\_m}}{\frac{\frac{im\_m}{re\_m}}{re\_m}}
\end{array}
Initial program 47.3%
log-lowering-log.f64N/A
hypot-defineN/A
hypot-lowering-hypot.f64100.0%
Simplified100.0%
Taylor expanded in re around 0
+-lowering-+.f64N/A
log-lowering-log.f64N/A
*-lowering-*.f64N/A
unpow2N/A
associate-/l*N/A
*-lowering-*.f64N/A
unpow2N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f6427.6%
Simplified27.6%
Taylor expanded in im around 0
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f642.8%
Simplified2.8%
*-lft-identityN/A
associate-*r/N/A
frac-timesN/A
frac-2negN/A
frac-2negN/A
remove-double-negN/A
associate-*r*N/A
associate-/l*N/A
distribute-rgt-neg-inN/A
distribute-lft-neg-inN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
distribute-frac-neg2N/A
/-lowering-/.f64N/A
neg-sub0N/A
--lowering--.f643.3%
Applied egg-rr3.3%
associate-*r/N/A
*-commutativeN/A
un-div-invN/A
associate-/r/N/A
associate-/l/N/A
*-commutativeN/A
times-fracN/A
metadata-evalN/A
sub0-negN/A
frac-2negN/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f643.3%
Applied egg-rr3.3%
re_m = (fabs.f64 re) im_m = (fabs.f64 im) NOTE: re_m and im_m should be sorted in increasing order before calling this function. (FPCore (re_m im_m) :precision binary64 (* (/ 0.5 im_m) (/ re_m (/ im_m re_m))))
re_m = fabs(re);
im_m = fabs(im);
assert(re_m < im_m);
double code(double re_m, double im_m) {
return (0.5 / im_m) * (re_m / (im_m / re_m));
}
re_m = abs(re)
im_m = abs(im)
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 = (0.5d0 / im_m) * (re_m / (im_m / re_m))
end function
re_m = Math.abs(re);
im_m = Math.abs(im);
assert re_m < im_m;
public static double code(double re_m, double im_m) {
return (0.5 / im_m) * (re_m / (im_m / re_m));
}
re_m = math.fabs(re) im_m = math.fabs(im) [re_m, im_m] = sort([re_m, im_m]) def code(re_m, im_m): return (0.5 / im_m) * (re_m / (im_m / re_m))
re_m = abs(re) im_m = abs(im) re_m, im_m = sort([re_m, im_m]) function code(re_m, im_m) return Float64(Float64(0.5 / im_m) * Float64(re_m / Float64(im_m / re_m))) end
re_m = abs(re);
im_m = abs(im);
re_m, im_m = num2cell(sort([re_m, im_m])){:}
function tmp = code(re_m, im_m)
tmp = (0.5 / im_m) * (re_m / (im_m / re_m));
end
re_m = N[Abs[re], $MachinePrecision] im_m = N[Abs[im], $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[(0.5 / im$95$m), $MachinePrecision] * N[(re$95$m / N[(im$95$m / re$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
re_m = \left|re\right|
\\
im_m = \left|im\right|
\\
[re_m, im_m] = \mathsf{sort}([re_m, im_m])\\
\\
\frac{0.5}{im\_m} \cdot \frac{re\_m}{\frac{im\_m}{re\_m}}
\end{array}
Initial program 47.3%
log-lowering-log.f64N/A
hypot-defineN/A
hypot-lowering-hypot.f64100.0%
Simplified100.0%
Taylor expanded in re around 0
+-lowering-+.f64N/A
log-lowering-log.f64N/A
*-lowering-*.f64N/A
unpow2N/A
associate-/l*N/A
*-lowering-*.f64N/A
unpow2N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f6427.6%
Simplified27.6%
Taylor expanded in im around 0
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f642.8%
Simplified2.8%
*-lft-identityN/A
associate-*r/N/A
frac-timesN/A
frac-2negN/A
frac-2negN/A
remove-double-negN/A
associate-*r*N/A
associate-/l*N/A
distribute-rgt-neg-inN/A
distribute-lft-neg-inN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
distribute-frac-neg2N/A
/-lowering-/.f64N/A
neg-sub0N/A
--lowering--.f643.3%
Applied egg-rr3.3%
associate-*r/N/A
*-commutativeN/A
un-div-invN/A
associate-/r/N/A
associate-/r*N/A
times-fracN/A
metadata-evalN/A
sub0-negN/A
frac-2negN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f643.3%
Applied egg-rr3.3%
Final simplification3.3%
re_m = (fabs.f64 re) im_m = (fabs.f64 im) NOTE: re_m and im_m should be sorted in increasing order before calling this function. (FPCore (re_m im_m) :precision binary64 (* (/ 0.5 (* im_m im_m)) (* re_m re_m)))
re_m = fabs(re);
im_m = fabs(im);
assert(re_m < im_m);
double code(double re_m, double im_m) {
return (0.5 / (im_m * im_m)) * (re_m * re_m);
}
re_m = abs(re)
im_m = abs(im)
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 = (0.5d0 / (im_m * im_m)) * (re_m * re_m)
end function
re_m = Math.abs(re);
im_m = Math.abs(im);
assert re_m < im_m;
public static double code(double re_m, double im_m) {
return (0.5 / (im_m * im_m)) * (re_m * re_m);
}
re_m = math.fabs(re) im_m = math.fabs(im) [re_m, im_m] = sort([re_m, im_m]) def code(re_m, im_m): return (0.5 / (im_m * im_m)) * (re_m * re_m)
re_m = abs(re) im_m = abs(im) re_m, im_m = sort([re_m, im_m]) function code(re_m, im_m) return Float64(Float64(0.5 / Float64(im_m * im_m)) * Float64(re_m * re_m)) end
re_m = abs(re);
im_m = abs(im);
re_m, im_m = num2cell(sort([re_m, im_m])){:}
function tmp = code(re_m, im_m)
tmp = (0.5 / (im_m * im_m)) * (re_m * re_m);
end
re_m = N[Abs[re], $MachinePrecision] im_m = N[Abs[im], $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[(0.5 / N[(im$95$m * im$95$m), $MachinePrecision]), $MachinePrecision] * N[(re$95$m * re$95$m), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
re_m = \left|re\right|
\\
im_m = \left|im\right|
\\
[re_m, im_m] = \mathsf{sort}([re_m, im_m])\\
\\
\frac{0.5}{im\_m \cdot im\_m} \cdot \left(re\_m \cdot re\_m\right)
\end{array}
Initial program 47.3%
log-lowering-log.f64N/A
hypot-defineN/A
hypot-lowering-hypot.f64100.0%
Simplified100.0%
Taylor expanded in re around 0
+-lowering-+.f64N/A
log-lowering-log.f64N/A
*-lowering-*.f64N/A
unpow2N/A
associate-/l*N/A
*-lowering-*.f64N/A
unpow2N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f6427.6%
Simplified27.6%
Taylor expanded in im around 0
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f642.8%
Simplified2.8%
associate-*l/N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f642.7%
Applied egg-rr2.7%
herbie shell --seed 2024158
(FPCore (re im)
:name "math.log/1 on complex, real part"
:precision binary64
(log (sqrt (+ (* re re) (* im im)))))