
(FPCore (x) :precision binary64 (sqrt (+ (* x x) (* x x))))
double code(double x) {
return sqrt(((x * x) + (x * x)));
}
real(8) function code(x)
real(8), intent (in) :: x
code = sqrt(((x * x) + (x * x)))
end function
public static double code(double x) {
return Math.sqrt(((x * x) + (x * x)));
}
def code(x): return math.sqrt(((x * x) + (x * x)))
function code(x) return sqrt(Float64(Float64(x * x) + Float64(x * x))) end
function tmp = code(x) tmp = sqrt(((x * x) + (x * x))); end
code[x_] := N[Sqrt[N[(N[(x * x), $MachinePrecision] + N[(x * x), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\sqrt{x \cdot x + x \cdot x}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 6 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (x) :precision binary64 (sqrt (+ (* x x) (* x x))))
double code(double x) {
return sqrt(((x * x) + (x * x)));
}
real(8) function code(x)
real(8), intent (in) :: x
code = sqrt(((x * x) + (x * x)))
end function
public static double code(double x) {
return Math.sqrt(((x * x) + (x * x)));
}
def code(x): return math.sqrt(((x * x) + (x * x)))
function code(x) return sqrt(Float64(Float64(x * x) + Float64(x * x))) end
function tmp = code(x) tmp = sqrt(((x * x) + (x * x))); end
code[x_] := N[Sqrt[N[(N[(x * x), $MachinePrecision] + N[(x * x), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\sqrt{x \cdot x + x \cdot x}
\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.9%
accelerator-lowering-hypot.f64100.0
Applied egg-rr100.0%
(FPCore (x) :precision binary64 (let* ((t_0 (sqrt (sqrt 2.0))) (t_1 (sqrt t_0))) (* (* t_0 t_1) (* x t_1))))
double code(double x) {
double t_0 = sqrt(sqrt(2.0));
double t_1 = sqrt(t_0);
return (t_0 * t_1) * (x * t_1);
}
real(8) function code(x)
real(8), intent (in) :: x
real(8) :: t_0
real(8) :: t_1
t_0 = sqrt(sqrt(2.0d0))
t_1 = sqrt(t_0)
code = (t_0 * t_1) * (x * t_1)
end function
public static double code(double x) {
double t_0 = Math.sqrt(Math.sqrt(2.0));
double t_1 = Math.sqrt(t_0);
return (t_0 * t_1) * (x * t_1);
}
def code(x): t_0 = math.sqrt(math.sqrt(2.0)) t_1 = math.sqrt(t_0) return (t_0 * t_1) * (x * t_1)
function code(x) t_0 = sqrt(sqrt(2.0)) t_1 = sqrt(t_0) return Float64(Float64(t_0 * t_1) * Float64(x * t_1)) end
function tmp = code(x) t_0 = sqrt(sqrt(2.0)); t_1 = sqrt(t_0); tmp = (t_0 * t_1) * (x * t_1); end
code[x_] := Block[{t$95$0 = N[Sqrt[N[Sqrt[2.0], $MachinePrecision]], $MachinePrecision]}, Block[{t$95$1 = N[Sqrt[t$95$0], $MachinePrecision]}, N[(N[(t$95$0 * t$95$1), $MachinePrecision] * N[(x * t$95$1), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \sqrt{\sqrt{2}}\\
t_1 := \sqrt{t\_0}\\
\left(t\_0 \cdot t\_1\right) \cdot \left(x \cdot t\_1\right)
\end{array}
\end{array}
Initial program 51.9%
Taylor expanded in x around 0
+-rgt-identityN/A
accelerator-lowering-fma.f64N/A
sqrt-lowering-sqrt.f6447.3
Simplified47.3%
pow1/2N/A
sqr-powN/A
pow2N/A
pow-lowering-pow.f64N/A
pow-lowering-pow.f64N/A
metadata-eval47.3
Applied egg-rr47.3%
+-rgt-identityN/A
*-commutativeN/A
unpow2N/A
sqr-powN/A
associate-*r*N/A
associate-*l*N/A
*-lowering-*.f64N/A
Applied egg-rr47.5%
Final simplification47.5%
(FPCore (x) :precision binary64 (* (sqrt x) (sqrt (+ x x))))
double code(double x) {
return sqrt(x) * sqrt((x + x));
}
real(8) function code(x)
real(8), intent (in) :: x
code = sqrt(x) * sqrt((x + x))
end function
public static double code(double x) {
return Math.sqrt(x) * Math.sqrt((x + x));
}
def code(x): return math.sqrt(x) * math.sqrt((x + x))
function code(x) return Float64(sqrt(x) * sqrt(Float64(x + x))) end
function tmp = code(x) tmp = sqrt(x) * sqrt((x + x)); end
code[x_] := N[(N[Sqrt[x], $MachinePrecision] * N[Sqrt[N[(x + x), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\sqrt{x} \cdot \sqrt{x + x}
\end{array}
Initial program 51.9%
distribute-lft-outN/A
sqrt-prodN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f6446.3
Applied egg-rr46.3%
(FPCore (x) :precision binary64 (* 2.0 (/ x (sqrt 2.0))))
double code(double x) {
return 2.0 * (x / sqrt(2.0));
}
real(8) function code(x)
real(8), intent (in) :: x
code = 2.0d0 * (x / sqrt(2.0d0))
end function
public static double code(double x) {
return 2.0 * (x / Math.sqrt(2.0));
}
def code(x): return 2.0 * (x / math.sqrt(2.0))
function code(x) return Float64(2.0 * Float64(x / sqrt(2.0))) end
function tmp = code(x) tmp = 2.0 * (x / sqrt(2.0)); end
code[x_] := N[(2.0 * N[(x / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
2 \cdot \frac{x}{\sqrt{2}}
\end{array}
Initial program 51.9%
Taylor expanded in x around 0
+-rgt-identityN/A
accelerator-lowering-fma.f64N/A
sqrt-lowering-sqrt.f6447.3
Simplified47.3%
pow1/2N/A
sqr-powN/A
pow2N/A
pow-lowering-pow.f64N/A
pow-lowering-pow.f64N/A
metadata-eval47.3
Applied egg-rr47.3%
+-rgt-identityN/A
*-commutativeN/A
unpow2N/A
sqr-powN/A
associate-*r*N/A
associate-*l*N/A
*-lowering-*.f64N/A
Applied egg-rr47.5%
associate-*r*N/A
*-commutativeN/A
pow1/2N/A
pow-plusN/A
pow1/2N/A
pow-prod-upN/A
metadata-evalN/A
metadata-evalN/A
pow2N/A
rem-square-sqrtN/A
+-rgt-identityN/A
unpow1N/A
metadata-evalN/A
pow-prod-upN/A
Applied egg-rr47.4%
Final simplification47.4%
(FPCore (x) :precision binary64 (* x (sqrt 2.0)))
double code(double x) {
return x * sqrt(2.0);
}
real(8) function code(x)
real(8), intent (in) :: x
code = x * sqrt(2.0d0)
end function
public static double code(double x) {
return x * Math.sqrt(2.0);
}
def code(x): return x * math.sqrt(2.0)
function code(x) return Float64(x * sqrt(2.0)) end
function tmp = code(x) tmp = x * sqrt(2.0); end
code[x_] := N[(x * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
x \cdot \sqrt{2}
\end{array}
Initial program 51.9%
Taylor expanded in x around 0
+-rgt-identityN/A
accelerator-lowering-fma.f64N/A
sqrt-lowering-sqrt.f6447.3
Simplified47.3%
pow1/2N/A
sqr-powN/A
pow2N/A
pow-lowering-pow.f64N/A
pow-lowering-pow.f64N/A
metadata-eval47.3
Applied egg-rr47.3%
+-rgt-identityN/A
*-commutativeN/A
*-lowering-*.f64N/A
pow-powN/A
metadata-evalN/A
unpow1/2N/A
sqrt-lowering-sqrt.f6447.3
Applied egg-rr47.3%
Final simplification47.3%
(FPCore (x) :precision binary64 0.0)
double code(double x) {
return 0.0;
}
real(8) function code(x)
real(8), intent (in) :: x
code = 0.0d0
end function
public static double code(double x) {
return 0.0;
}
def code(x): return 0.0
function code(x) return 0.0 end
function tmp = code(x) tmp = 0.0; end
code[x_] := 0.0
\begin{array}{l}
\\
0
\end{array}
Initial program 51.9%
distribute-lft-outN/A
*-commutativeN/A
*-lowering-*.f64N/A
+-lowering-+.f6451.9
Applied egg-rr51.9%
pow1/2N/A
*-commutativeN/A
distribute-lft-outN/A
flip-+N/A
+-inversesN/A
+-inversesN/A
metadata-evalN/A
metadata-evalN/A
metadata-evalN/A
metadata-evalN/A
flip--N/A
metadata-evalN/A
metadata-eval3.8
Applied egg-rr3.8%
herbie shell --seed 2024199
(FPCore (x)
:name "sqrt A (should all be same)"
:precision binary64
(sqrt (+ (* x x) (* x x))))