
(FPCore (x) :precision binary64 (sqrt (* 2.0 (* x x))))
double code(double x) {
return sqrt((2.0 * (x * x)));
}
real(8) function code(x)
real(8), intent (in) :: x
code = sqrt((2.0d0 * (x * x)))
end function
public static double code(double x) {
return Math.sqrt((2.0 * (x * x)));
}
def code(x): return math.sqrt((2.0 * (x * x)))
function code(x) return sqrt(Float64(2.0 * Float64(x * x))) end
function tmp = code(x) tmp = sqrt((2.0 * (x * x))); end
code[x_] := N[Sqrt[N[(2.0 * N[(x * x), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\sqrt{2 \cdot \left(x \cdot x\right)}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 3 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (x) :precision binary64 (sqrt (* 2.0 (* x x))))
double code(double x) {
return sqrt((2.0 * (x * x)));
}
real(8) function code(x)
real(8), intent (in) :: x
code = sqrt((2.0d0 * (x * x)))
end function
public static double code(double x) {
return Math.sqrt((2.0 * (x * x)));
}
def code(x): return math.sqrt((2.0 * (x * x)))
function code(x) return sqrt(Float64(2.0 * Float64(x * x))) end
function tmp = code(x) tmp = sqrt((2.0 * (x * x))); end
code[x_] := N[Sqrt[N[(2.0 * N[(x * x), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\sqrt{2 \cdot \left(x \cdot x\right)}
\end{array}
(FPCore (x) :precision binary64 (hypot x x))
double code(double x) {
return hypot(x, x);
}
public static double code(double x) {
return Math.hypot(x, x);
}
def code(x): return math.hypot(x, x)
function code(x) return hypot(x, x) end
function tmp = code(x) tmp = hypot(x, x); end
code[x_] := N[Sqrt[x ^ 2 + x ^ 2], $MachinePrecision]
\begin{array}{l}
\\
\mathsf{hypot}\left(x, x\right)
\end{array}
Initial program 51.8%
Taylor expanded in x around 0 50.8%
rem-square-sqrt49.5%
fabs-sqr49.5%
rem-square-sqrt99.4%
rem-sqrt-square51.7%
swap-sqr51.5%
unpow251.5%
rem-square-sqrt51.8%
*-commutative51.8%
count-251.8%
unpow251.8%
unpow251.8%
hypot-define100.0%
Simplified100.0%
Final simplification100.0%
(FPCore (x) :precision binary64 (* x (* x 2.0)))
double code(double x) {
return x * (x * 2.0);
}
real(8) function code(x)
real(8), intent (in) :: x
code = x * (x * 2.0d0)
end function
public static double code(double x) {
return x * (x * 2.0);
}
def code(x): return x * (x * 2.0)
function code(x) return Float64(x * Float64(x * 2.0)) end
function tmp = code(x) tmp = x * (x * 2.0); end
code[x_] := N[(x * N[(x * 2.0), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
x \cdot \left(x \cdot 2\right)
\end{array}
Initial program 51.8%
Taylor expanded in x around 0 50.8%
rem-square-sqrt49.5%
fabs-sqr49.5%
rem-square-sqrt99.4%
rem-sqrt-square51.7%
swap-sqr51.5%
unpow251.5%
rem-square-sqrt51.8%
*-commutative51.8%
count-251.8%
unpow251.8%
unpow251.8%
hypot-define100.0%
Simplified100.0%
hypot-undefine51.8%
flip-+0.0%
+-inverses0.0%
metadata-eval0.0%
+-inverses0.0%
+-inverses0.0%
+-inverses0.0%
metadata-eval0.0%
+-inverses0.0%
+-inverses0.0%
frac-times0.0%
flip-+0.0%
flip-+6.7%
sqrt-unprod7.0%
add-sqr-sqrt7.0%
count-27.0%
associate-*r*7.0%
Applied egg-rr7.0%
Final simplification7.0%
(FPCore (x) :precision binary64 32.0)
double code(double x) {
return 32.0;
}
real(8) function code(x)
real(8), intent (in) :: x
code = 32.0d0
end function
public static double code(double x) {
return 32.0;
}
def code(x): return 32.0
function code(x) return 32.0 end
function tmp = code(x) tmp = 32.0; end
code[x_] := 32.0
\begin{array}{l}
\\
32
\end{array}
Initial program 51.8%
sqrt-prod51.6%
sqrt-prod49.5%
add-sqr-sqrt50.8%
Applied egg-rr50.8%
Applied egg-rr0.0%
Simplified5.4%
Final simplification5.4%
herbie shell --seed 2024044
(FPCore (x)
:name "sqrt C (should all be same)"
:precision binary64
(sqrt (* 2.0 (* x x))))