
(FPCore (x y) :precision binary64 (sqrt (fabs (- x y))))
double code(double x, double y) {
return sqrt(fabs((x - y)));
}
real(8) function code(x, y)
real(8), intent (in) :: x
real(8), intent (in) :: y
code = sqrt(abs((x - y)))
end function
public static double code(double x, double y) {
return Math.sqrt(Math.abs((x - y)));
}
def code(x, y): return math.sqrt(math.fabs((x - y)))
function code(x, y) return sqrt(abs(Float64(x - y))) end
function tmp = code(x, y) tmp = sqrt(abs((x - y))); end
code[x_, y_] := N[Sqrt[N[Abs[N[(x - y), $MachinePrecision]], $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\sqrt{\left|x - y\right|}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 3 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (x y) :precision binary64 (sqrt (fabs (- x y))))
double code(double x, double y) {
return sqrt(fabs((x - y)));
}
real(8) function code(x, y)
real(8), intent (in) :: x
real(8), intent (in) :: y
code = sqrt(abs((x - y)))
end function
public static double code(double x, double y) {
return Math.sqrt(Math.abs((x - y)));
}
def code(x, y): return math.sqrt(math.fabs((x - y)))
function code(x, y) return sqrt(abs(Float64(x - y))) end
function tmp = code(x, y) tmp = sqrt(abs((x - y))); end
code[x_, y_] := N[Sqrt[N[Abs[N[(x - y), $MachinePrecision]], $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\sqrt{\left|x - y\right|}
\end{array}
NOTE: x and y should be sorted in increasing order before calling this function. (FPCore (x y) :precision binary64 (sqrt (- y x)))
assert(x < y);
double code(double x, double y) {
return sqrt((y - x));
}
NOTE: x and y should be sorted in increasing order before calling this function.
real(8) function code(x, y)
real(8), intent (in) :: x
real(8), intent (in) :: y
code = sqrt((y - x))
end function
assert x < y;
public static double code(double x, double y) {
return Math.sqrt((y - x));
}
[x, y] = sort([x, y]) def code(x, y): return math.sqrt((y - x))
x, y = sort([x, y]) function code(x, y) return sqrt(Float64(y - x)) end
x, y = num2cell(sort([x, y])){:}
function tmp = code(x, y)
tmp = sqrt((y - x));
end
NOTE: x and y should be sorted in increasing order before calling this function. code[x_, y_] := N[Sqrt[N[(y - x), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\sqrt{y - x}
\end{array}
Initial program 100.0%
pow1/2N/A
sqr-powN/A
pow-prod-downN/A
sqr-absN/A
pow-lowering-pow.f64N/A
*-lowering-*.f64N/A
--lowering--.f64N/A
--lowering--.f64N/A
metadata-eval52.4%
Applied egg-rr52.4%
remove-double-divN/A
un-div-invN/A
/-lowering-/.f64N/A
--lowering--.f64N/A
/-lowering-/.f64N/A
--lowering--.f6452.4%
Applied egg-rr52.4%
frac-2negN/A
metadata-evalN/A
associate-/r/N/A
unpow-prod-downN/A
metadata-evalN/A
distribute-neg-frac2N/A
/-rgt-identityN/A
*-lowering-*.f64N/A
pow-lowering-pow.f64N/A
neg-sub0N/A
sub-negN/A
+-commutativeN/A
associate--r+N/A
neg-sub0N/A
remove-double-negN/A
--lowering--.f64N/A
pow-lowering-pow.f64N/A
Applied egg-rr54.7%
pow-prod-upN/A
metadata-evalN/A
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
--lowering--.f6455.1%
Applied egg-rr55.1%
NOTE: x and y should be sorted in increasing order before calling this function. (FPCore (x y) :precision binary64 (sqrt y))
assert(x < y);
double code(double x, double y) {
return sqrt(y);
}
NOTE: x and y should be sorted in increasing order before calling this function.
real(8) function code(x, y)
real(8), intent (in) :: x
real(8), intent (in) :: y
code = sqrt(y)
end function
assert x < y;
public static double code(double x, double y) {
return Math.sqrt(y);
}
[x, y] = sort([x, y]) def code(x, y): return math.sqrt(y)
x, y = sort([x, y]) function code(x, y) return sqrt(y) end
x, y = num2cell(sort([x, y])){:}
function tmp = code(x, y)
tmp = sqrt(y);
end
NOTE: x and y should be sorted in increasing order before calling this function. code[x_, y_] := N[Sqrt[y], $MachinePrecision]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\sqrt{y}
\end{array}
Initial program 100.0%
pow1/2N/A
sqr-powN/A
pow-prod-downN/A
sqr-absN/A
pow-lowering-pow.f64N/A
*-lowering-*.f64N/A
--lowering--.f64N/A
--lowering--.f64N/A
metadata-eval52.4%
Applied egg-rr52.4%
Taylor expanded in x around 0
+-commutativeN/A
+-lowering-+.f64N/A
unpow2N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
metadata-evalN/A
distribute-rgt-outN/A
mul-1-negN/A
sub-negN/A
+-lowering-+.f64N/A
sub-negN/A
mul-1-negN/A
distribute-rgt-outN/A
metadata-evalN/A
*-lowering-*.f6452.2%
Simplified52.2%
Taylor expanded in y around inf
sqrt-lowering-sqrt.f6430.0%
Simplified30.0%
NOTE: x and y should be sorted in increasing order before calling this function. (FPCore (x y) :precision binary64 (sqrt x))
assert(x < y);
double code(double x, double y) {
return sqrt(x);
}
NOTE: x and y should be sorted in increasing order before calling this function.
real(8) function code(x, y)
real(8), intent (in) :: x
real(8), intent (in) :: y
code = sqrt(x)
end function
assert x < y;
public static double code(double x, double y) {
return Math.sqrt(x);
}
[x, y] = sort([x, y]) def code(x, y): return math.sqrt(x)
x, y = sort([x, y]) function code(x, y) return sqrt(x) end
x, y = num2cell(sort([x, y])){:}
function tmp = code(x, y)
tmp = sqrt(x);
end
NOTE: x and y should be sorted in increasing order before calling this function. code[x_, y_] := N[Sqrt[x], $MachinePrecision]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\sqrt{x}
\end{array}
Initial program 100.0%
pow1/2N/A
sqr-powN/A
pow-prod-downN/A
sqr-absN/A
pow-lowering-pow.f64N/A
*-lowering-*.f64N/A
--lowering--.f64N/A
--lowering--.f64N/A
metadata-eval52.4%
Applied egg-rr52.4%
Taylor expanded in x around inf
sqrt-lowering-sqrt.f6422.6%
Simplified22.6%
herbie shell --seed 2024149
(FPCore (x y)
:name "Optimisation.CirclePacking:place from circle-packing-0.1.0.4, C"
:precision binary64
(sqrt (fabs (- x y))))