
(FPCore (a1 a2 th) :precision binary64 (let* ((t_1 (/ (cos th) (sqrt 2.0)))) (+ (* t_1 (* a1 a1)) (* t_1 (* a2 a2)))))
double code(double a1, double a2, double th) {
double t_1 = cos(th) / sqrt(2.0);
return (t_1 * (a1 * a1)) + (t_1 * (a2 * a2));
}
real(8) function code(a1, a2, th)
real(8), intent (in) :: a1
real(8), intent (in) :: a2
real(8), intent (in) :: th
real(8) :: t_1
t_1 = cos(th) / sqrt(2.0d0)
code = (t_1 * (a1 * a1)) + (t_1 * (a2 * a2))
end function
public static double code(double a1, double a2, double th) {
double t_1 = Math.cos(th) / Math.sqrt(2.0);
return (t_1 * (a1 * a1)) + (t_1 * (a2 * a2));
}
def code(a1, a2, th): t_1 = math.cos(th) / math.sqrt(2.0) return (t_1 * (a1 * a1)) + (t_1 * (a2 * a2))
function code(a1, a2, th) t_1 = Float64(cos(th) / sqrt(2.0)) return Float64(Float64(t_1 * Float64(a1 * a1)) + Float64(t_1 * Float64(a2 * a2))) end
function tmp = code(a1, a2, th) t_1 = cos(th) / sqrt(2.0); tmp = (t_1 * (a1 * a1)) + (t_1 * (a2 * a2)); end
code[a1_, a2_, th_] := Block[{t$95$1 = N[(N[Cos[th], $MachinePrecision] / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]}, N[(N[(t$95$1 * N[(a1 * a1), $MachinePrecision]), $MachinePrecision] + N[(t$95$1 * N[(a2 * a2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := \frac{\cos th}{\sqrt{2}}\\
t\_1 \cdot \left(a1 \cdot a1\right) + t\_1 \cdot \left(a2 \cdot a2\right)
\end{array}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 11 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (a1 a2 th) :precision binary64 (let* ((t_1 (/ (cos th) (sqrt 2.0)))) (+ (* t_1 (* a1 a1)) (* t_1 (* a2 a2)))))
double code(double a1, double a2, double th) {
double t_1 = cos(th) / sqrt(2.0);
return (t_1 * (a1 * a1)) + (t_1 * (a2 * a2));
}
real(8) function code(a1, a2, th)
real(8), intent (in) :: a1
real(8), intent (in) :: a2
real(8), intent (in) :: th
real(8) :: t_1
t_1 = cos(th) / sqrt(2.0d0)
code = (t_1 * (a1 * a1)) + (t_1 * (a2 * a2))
end function
public static double code(double a1, double a2, double th) {
double t_1 = Math.cos(th) / Math.sqrt(2.0);
return (t_1 * (a1 * a1)) + (t_1 * (a2 * a2));
}
def code(a1, a2, th): t_1 = math.cos(th) / math.sqrt(2.0) return (t_1 * (a1 * a1)) + (t_1 * (a2 * a2))
function code(a1, a2, th) t_1 = Float64(cos(th) / sqrt(2.0)) return Float64(Float64(t_1 * Float64(a1 * a1)) + Float64(t_1 * Float64(a2 * a2))) end
function tmp = code(a1, a2, th) t_1 = cos(th) / sqrt(2.0); tmp = (t_1 * (a1 * a1)) + (t_1 * (a2 * a2)); end
code[a1_, a2_, th_] := Block[{t$95$1 = N[(N[Cos[th], $MachinePrecision] / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]}, N[(N[(t$95$1 * N[(a1 * a1), $MachinePrecision]), $MachinePrecision] + N[(t$95$1 * N[(a2 * a2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := \frac{\cos th}{\sqrt{2}}\\
t\_1 \cdot \left(a1 \cdot a1\right) + t\_1 \cdot \left(a2 \cdot a2\right)
\end{array}
\end{array}
a2_m = (fabs.f64 a2) a1_m = (fabs.f64 a1) NOTE: a1_m, a2_m, and th should be sorted in increasing order before calling this function. (FPCore (a1_m a2_m th) :precision binary64 (fma (/ (cos th) (sqrt 2.0)) (* a1_m a1_m) (* (* (/ a2_m (sqrt 2.0)) a2_m) (cos th))))
a2_m = fabs(a2);
a1_m = fabs(a1);
assert(a1_m < a2_m && a2_m < th);
double code(double a1_m, double a2_m, double th) {
return fma((cos(th) / sqrt(2.0)), (a1_m * a1_m), (((a2_m / sqrt(2.0)) * a2_m) * cos(th)));
}
a2_m = abs(a2) a1_m = abs(a1) a1_m, a2_m, th = sort([a1_m, a2_m, th]) function code(a1_m, a2_m, th) return fma(Float64(cos(th) / sqrt(2.0)), Float64(a1_m * a1_m), Float64(Float64(Float64(a2_m / sqrt(2.0)) * a2_m) * cos(th))) end
a2_m = N[Abs[a2], $MachinePrecision] a1_m = N[Abs[a1], $MachinePrecision] NOTE: a1_m, a2_m, and th should be sorted in increasing order before calling this function. code[a1$95$m_, a2$95$m_, th_] := N[(N[(N[Cos[th], $MachinePrecision] / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * N[(a1$95$m * a1$95$m), $MachinePrecision] + N[(N[(N[(a2$95$m / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * a2$95$m), $MachinePrecision] * N[Cos[th], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
a2_m = \left|a2\right|
\\
a1_m = \left|a1\right|
\\
[a1_m, a2_m, th] = \mathsf{sort}([a1_m, a2_m, th])\\
\\
\mathsf{fma}\left(\frac{\cos th}{\sqrt{2}}, a1\_m \cdot a1\_m, \left(\frac{a2\_m}{\sqrt{2}} \cdot a2\_m\right) \cdot \cos th\right)
\end{array}
Initial program 99.2%
lift-+.f64N/A
lift-*.f64N/A
lower-fma.f6499.2
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
associate-/l*N/A
*-commutativeN/A
lower-*.f64N/A
*-lft-identityN/A
associate-*l/N/A
lift-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
associate-*l/N/A
*-lft-identityN/A
lower-/.f6499.3
Applied rewrites99.3%
a2_m = (fabs.f64 a2)
a1_m = (fabs.f64 a1)
NOTE: a1_m, a2_m, and th should be sorted in increasing order before calling this function.
(FPCore (a1_m a2_m th)
:precision binary64
(let* ((t_1 (/ (cos th) (sqrt 2.0))))
(if (<= (+ (* t_1 (* a1_m a1_m)) (* t_1 (* a2_m a2_m))) -5e-166)
(* (* (* (* (/ a2_m (sqrt 2.0)) a2_m) -0.5) th) th)
(fma (pow (/ (sqrt 2.0) a2_m) -1.0) a2_m (* (/ a1_m (sqrt 2.0)) a1_m)))))a2_m = fabs(a2);
a1_m = fabs(a1);
assert(a1_m < a2_m && a2_m < th);
double code(double a1_m, double a2_m, double th) {
double t_1 = cos(th) / sqrt(2.0);
double tmp;
if (((t_1 * (a1_m * a1_m)) + (t_1 * (a2_m * a2_m))) <= -5e-166) {
tmp = ((((a2_m / sqrt(2.0)) * a2_m) * -0.5) * th) * th;
} else {
tmp = fma(pow((sqrt(2.0) / a2_m), -1.0), a2_m, ((a1_m / sqrt(2.0)) * a1_m));
}
return tmp;
}
a2_m = abs(a2) a1_m = abs(a1) a1_m, a2_m, th = sort([a1_m, a2_m, th]) function code(a1_m, a2_m, th) t_1 = Float64(cos(th) / sqrt(2.0)) tmp = 0.0 if (Float64(Float64(t_1 * Float64(a1_m * a1_m)) + Float64(t_1 * Float64(a2_m * a2_m))) <= -5e-166) tmp = Float64(Float64(Float64(Float64(Float64(a2_m / sqrt(2.0)) * a2_m) * -0.5) * th) * th); else tmp = fma((Float64(sqrt(2.0) / a2_m) ^ -1.0), a2_m, Float64(Float64(a1_m / sqrt(2.0)) * a1_m)); end return tmp end
a2_m = N[Abs[a2], $MachinePrecision]
a1_m = N[Abs[a1], $MachinePrecision]
NOTE: a1_m, a2_m, and th should be sorted in increasing order before calling this function.
code[a1$95$m_, a2$95$m_, th_] := Block[{t$95$1 = N[(N[Cos[th], $MachinePrecision] / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[(t$95$1 * N[(a1$95$m * a1$95$m), $MachinePrecision]), $MachinePrecision] + N[(t$95$1 * N[(a2$95$m * a2$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -5e-166], N[(N[(N[(N[(N[(a2$95$m / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * a2$95$m), $MachinePrecision] * -0.5), $MachinePrecision] * th), $MachinePrecision] * th), $MachinePrecision], N[(N[Power[N[(N[Sqrt[2.0], $MachinePrecision] / a2$95$m), $MachinePrecision], -1.0], $MachinePrecision] * a2$95$m + N[(N[(a1$95$m / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * a1$95$m), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
a2_m = \left|a2\right|
\\
a1_m = \left|a1\right|
\\
[a1_m, a2_m, th] = \mathsf{sort}([a1_m, a2_m, th])\\
\\
\begin{array}{l}
t_1 := \frac{\cos th}{\sqrt{2}}\\
\mathbf{if}\;t\_1 \cdot \left(a1\_m \cdot a1\_m\right) + t\_1 \cdot \left(a2\_m \cdot a2\_m\right) \leq -5 \cdot 10^{-166}:\\
\;\;\;\;\left(\left(\left(\frac{a2\_m}{\sqrt{2}} \cdot a2\_m\right) \cdot -0.5\right) \cdot th\right) \cdot th\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left({\left(\frac{\sqrt{2}}{a2\_m}\right)}^{-1}, a2\_m, \frac{a1\_m}{\sqrt{2}} \cdot a1\_m\right)\\
\end{array}
\end{array}
if (+.f64 (*.f64 (/.f64 (cos.f64 th) (sqrt.f64 #s(literal 2 binary64))) (*.f64 a1 a1)) (*.f64 (/.f64 (cos.f64 th) (sqrt.f64 #s(literal 2 binary64))) (*.f64 a2 a2))) < -5e-166Initial program 99.5%
Taylor expanded in a1 around 0
*-commutativeN/A
unpow2N/A
associate-*r*N/A
associate-/l*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-cos.f64N/A
lower-/.f64N/A
lower-sqrt.f6453.1
Applied rewrites53.1%
Taylor expanded in th around 0
Applied rewrites43.6%
Taylor expanded in th around inf
Applied rewrites40.8%
if -5e-166 < (+.f64 (*.f64 (/.f64 (cos.f64 th) (sqrt.f64 #s(literal 2 binary64))) (*.f64 a1 a1)) (*.f64 (/.f64 (cos.f64 th) (sqrt.f64 #s(literal 2 binary64))) (*.f64 a2 a2))) Initial program 99.2%
Taylor expanded in th around 0
+-commutativeN/A
unpow2N/A
associate-*l/N/A
lower-fma.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
unpow2N/A
associate-*l/N/A
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.f6487.1
Applied rewrites87.1%
Applied rewrites87.1%
Final simplification75.2%
a2_m = (fabs.f64 a2)
a1_m = (fabs.f64 a1)
NOTE: a1_m, a2_m, and th should be sorted in increasing order before calling this function.
(FPCore (a1_m a2_m th)
:precision binary64
(let* ((t_1 (/ a2_m (sqrt 2.0))) (t_2 (/ (cos th) (sqrt 2.0))))
(if (<= (+ (* t_2 (* a1_m a1_m)) (* t_2 (* a2_m a2_m))) -5e-166)
(* (* (* (* t_1 a2_m) -0.5) th) th)
(fma t_1 a2_m (* (/ a1_m (sqrt 2.0)) a1_m)))))a2_m = fabs(a2);
a1_m = fabs(a1);
assert(a1_m < a2_m && a2_m < th);
double code(double a1_m, double a2_m, double th) {
double t_1 = a2_m / sqrt(2.0);
double t_2 = cos(th) / sqrt(2.0);
double tmp;
if (((t_2 * (a1_m * a1_m)) + (t_2 * (a2_m * a2_m))) <= -5e-166) {
tmp = (((t_1 * a2_m) * -0.5) * th) * th;
} else {
tmp = fma(t_1, a2_m, ((a1_m / sqrt(2.0)) * a1_m));
}
return tmp;
}
a2_m = abs(a2) a1_m = abs(a1) a1_m, a2_m, th = sort([a1_m, a2_m, th]) function code(a1_m, a2_m, th) t_1 = Float64(a2_m / sqrt(2.0)) t_2 = Float64(cos(th) / sqrt(2.0)) tmp = 0.0 if (Float64(Float64(t_2 * Float64(a1_m * a1_m)) + Float64(t_2 * Float64(a2_m * a2_m))) <= -5e-166) tmp = Float64(Float64(Float64(Float64(t_1 * a2_m) * -0.5) * th) * th); else tmp = fma(t_1, a2_m, Float64(Float64(a1_m / sqrt(2.0)) * a1_m)); end return tmp end
a2_m = N[Abs[a2], $MachinePrecision]
a1_m = N[Abs[a1], $MachinePrecision]
NOTE: a1_m, a2_m, and th should be sorted in increasing order before calling this function.
code[a1$95$m_, a2$95$m_, th_] := Block[{t$95$1 = N[(a2$95$m / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[Cos[th], $MachinePrecision] / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[(t$95$2 * N[(a1$95$m * a1$95$m), $MachinePrecision]), $MachinePrecision] + N[(t$95$2 * N[(a2$95$m * a2$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -5e-166], N[(N[(N[(N[(t$95$1 * a2$95$m), $MachinePrecision] * -0.5), $MachinePrecision] * th), $MachinePrecision] * th), $MachinePrecision], N[(t$95$1 * a2$95$m + N[(N[(a1$95$m / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * a1$95$m), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
a2_m = \left|a2\right|
\\
a1_m = \left|a1\right|
\\
[a1_m, a2_m, th] = \mathsf{sort}([a1_m, a2_m, th])\\
\\
\begin{array}{l}
t_1 := \frac{a2\_m}{\sqrt{2}}\\
t_2 := \frac{\cos th}{\sqrt{2}}\\
\mathbf{if}\;t\_2 \cdot \left(a1\_m \cdot a1\_m\right) + t\_2 \cdot \left(a2\_m \cdot a2\_m\right) \leq -5 \cdot 10^{-166}:\\
\;\;\;\;\left(\left(\left(t\_1 \cdot a2\_m\right) \cdot -0.5\right) \cdot th\right) \cdot th\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(t\_1, a2\_m, \frac{a1\_m}{\sqrt{2}} \cdot a1\_m\right)\\
\end{array}
\end{array}
if (+.f64 (*.f64 (/.f64 (cos.f64 th) (sqrt.f64 #s(literal 2 binary64))) (*.f64 a1 a1)) (*.f64 (/.f64 (cos.f64 th) (sqrt.f64 #s(literal 2 binary64))) (*.f64 a2 a2))) < -5e-166Initial program 99.5%
Taylor expanded in a1 around 0
*-commutativeN/A
unpow2N/A
associate-*r*N/A
associate-/l*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-cos.f64N/A
lower-/.f64N/A
lower-sqrt.f6453.1
Applied rewrites53.1%
Taylor expanded in th around 0
Applied rewrites43.6%
Taylor expanded in th around inf
Applied rewrites40.8%
if -5e-166 < (+.f64 (*.f64 (/.f64 (cos.f64 th) (sqrt.f64 #s(literal 2 binary64))) (*.f64 a1 a1)) (*.f64 (/.f64 (cos.f64 th) (sqrt.f64 #s(literal 2 binary64))) (*.f64 a2 a2))) Initial program 99.2%
Taylor expanded in th around 0
+-commutativeN/A
unpow2N/A
associate-*l/N/A
lower-fma.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
unpow2N/A
associate-*l/N/A
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.f6487.1
Applied rewrites87.1%
a2_m = (fabs.f64 a2)
a1_m = (fabs.f64 a1)
NOTE: a1_m, a2_m, and th should be sorted in increasing order before calling this function.
(FPCore (a1_m a2_m th)
:precision binary64
(let* ((t_1 (/ (cos th) (sqrt 2.0))))
(if (<= (+ (* t_1 (* a1_m a1_m)) (* t_1 (* a2_m a2_m))) -5e-166)
(* (* (* (* (/ a2_m (sqrt 2.0)) a2_m) -0.5) th) th)
(* (* (sqrt 0.5) a2_m) a2_m))))a2_m = fabs(a2);
a1_m = fabs(a1);
assert(a1_m < a2_m && a2_m < th);
double code(double a1_m, double a2_m, double th) {
double t_1 = cos(th) / sqrt(2.0);
double tmp;
if (((t_1 * (a1_m * a1_m)) + (t_1 * (a2_m * a2_m))) <= -5e-166) {
tmp = ((((a2_m / sqrt(2.0)) * a2_m) * -0.5) * th) * th;
} else {
tmp = (sqrt(0.5) * a2_m) * a2_m;
}
return tmp;
}
a2_m = abs(a2)
a1_m = abs(a1)
NOTE: a1_m, a2_m, and th should be sorted in increasing order before calling this function.
real(8) function code(a1_m, a2_m, th)
real(8), intent (in) :: a1_m
real(8), intent (in) :: a2_m
real(8), intent (in) :: th
real(8) :: t_1
real(8) :: tmp
t_1 = cos(th) / sqrt(2.0d0)
if (((t_1 * (a1_m * a1_m)) + (t_1 * (a2_m * a2_m))) <= (-5d-166)) then
tmp = ((((a2_m / sqrt(2.0d0)) * a2_m) * (-0.5d0)) * th) * th
else
tmp = (sqrt(0.5d0) * a2_m) * a2_m
end if
code = tmp
end function
a2_m = Math.abs(a2);
a1_m = Math.abs(a1);
assert a1_m < a2_m && a2_m < th;
public static double code(double a1_m, double a2_m, double th) {
double t_1 = Math.cos(th) / Math.sqrt(2.0);
double tmp;
if (((t_1 * (a1_m * a1_m)) + (t_1 * (a2_m * a2_m))) <= -5e-166) {
tmp = ((((a2_m / Math.sqrt(2.0)) * a2_m) * -0.5) * th) * th;
} else {
tmp = (Math.sqrt(0.5) * a2_m) * a2_m;
}
return tmp;
}
a2_m = math.fabs(a2) a1_m = math.fabs(a1) [a1_m, a2_m, th] = sort([a1_m, a2_m, th]) def code(a1_m, a2_m, th): t_1 = math.cos(th) / math.sqrt(2.0) tmp = 0 if ((t_1 * (a1_m * a1_m)) + (t_1 * (a2_m * a2_m))) <= -5e-166: tmp = ((((a2_m / math.sqrt(2.0)) * a2_m) * -0.5) * th) * th else: tmp = (math.sqrt(0.5) * a2_m) * a2_m return tmp
a2_m = abs(a2) a1_m = abs(a1) a1_m, a2_m, th = sort([a1_m, a2_m, th]) function code(a1_m, a2_m, th) t_1 = Float64(cos(th) / sqrt(2.0)) tmp = 0.0 if (Float64(Float64(t_1 * Float64(a1_m * a1_m)) + Float64(t_1 * Float64(a2_m * a2_m))) <= -5e-166) tmp = Float64(Float64(Float64(Float64(Float64(a2_m / sqrt(2.0)) * a2_m) * -0.5) * th) * th); else tmp = Float64(Float64(sqrt(0.5) * a2_m) * a2_m); end return tmp end
a2_m = abs(a2);
a1_m = abs(a1);
a1_m, a2_m, th = num2cell(sort([a1_m, a2_m, th])){:}
function tmp_2 = code(a1_m, a2_m, th)
t_1 = cos(th) / sqrt(2.0);
tmp = 0.0;
if (((t_1 * (a1_m * a1_m)) + (t_1 * (a2_m * a2_m))) <= -5e-166)
tmp = ((((a2_m / sqrt(2.0)) * a2_m) * -0.5) * th) * th;
else
tmp = (sqrt(0.5) * a2_m) * a2_m;
end
tmp_2 = tmp;
end
a2_m = N[Abs[a2], $MachinePrecision]
a1_m = N[Abs[a1], $MachinePrecision]
NOTE: a1_m, a2_m, and th should be sorted in increasing order before calling this function.
code[a1$95$m_, a2$95$m_, th_] := Block[{t$95$1 = N[(N[Cos[th], $MachinePrecision] / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[(t$95$1 * N[(a1$95$m * a1$95$m), $MachinePrecision]), $MachinePrecision] + N[(t$95$1 * N[(a2$95$m * a2$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -5e-166], N[(N[(N[(N[(N[(a2$95$m / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * a2$95$m), $MachinePrecision] * -0.5), $MachinePrecision] * th), $MachinePrecision] * th), $MachinePrecision], N[(N[(N[Sqrt[0.5], $MachinePrecision] * a2$95$m), $MachinePrecision] * a2$95$m), $MachinePrecision]]]
\begin{array}{l}
a2_m = \left|a2\right|
\\
a1_m = \left|a1\right|
\\
[a1_m, a2_m, th] = \mathsf{sort}([a1_m, a2_m, th])\\
\\
\begin{array}{l}
t_1 := \frac{\cos th}{\sqrt{2}}\\
\mathbf{if}\;t\_1 \cdot \left(a1\_m \cdot a1\_m\right) + t\_1 \cdot \left(a2\_m \cdot a2\_m\right) \leq -5 \cdot 10^{-166}:\\
\;\;\;\;\left(\left(\left(\frac{a2\_m}{\sqrt{2}} \cdot a2\_m\right) \cdot -0.5\right) \cdot th\right) \cdot th\\
\mathbf{else}:\\
\;\;\;\;\left(\sqrt{0.5} \cdot a2\_m\right) \cdot a2\_m\\
\end{array}
\end{array}
if (+.f64 (*.f64 (/.f64 (cos.f64 th) (sqrt.f64 #s(literal 2 binary64))) (*.f64 a1 a1)) (*.f64 (/.f64 (cos.f64 th) (sqrt.f64 #s(literal 2 binary64))) (*.f64 a2 a2))) < -5e-166Initial program 99.5%
Taylor expanded in a1 around 0
*-commutativeN/A
unpow2N/A
associate-*r*N/A
associate-/l*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-cos.f64N/A
lower-/.f64N/A
lower-sqrt.f6453.1
Applied rewrites53.1%
Taylor expanded in th around 0
Applied rewrites43.6%
Taylor expanded in th around inf
Applied rewrites40.8%
if -5e-166 < (+.f64 (*.f64 (/.f64 (cos.f64 th) (sqrt.f64 #s(literal 2 binary64))) (*.f64 a1 a1)) (*.f64 (/.f64 (cos.f64 th) (sqrt.f64 #s(literal 2 binary64))) (*.f64 a2 a2))) Initial program 99.2%
lift-+.f64N/A
lift-*.f64N/A
lift-*.f64N/A
distribute-lft-outN/A
lift-/.f64N/A
clear-numN/A
associate-/r/N/A
associate-*l*N/A
lower-*.f64N/A
lift-sqrt.f64N/A
pow1/2N/A
pow-flipN/A
lower-pow.f64N/A
metadata-evalN/A
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
lift-*.f64N/A
lower-fma.f6499.3
Applied rewrites99.3%
Taylor expanded in th around 0
lower-*.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f6486.8
Applied rewrites86.8%
Taylor expanded in a1 around 0
Applied rewrites53.2%
a2_m = (fabs.f64 a2) a1_m = (fabs.f64 a1) NOTE: a1_m, a2_m, and th should be sorted in increasing order before calling this function. (FPCore (a1_m a2_m th) :precision binary64 (* a2_m (* (pow 4.0 -0.25) (* a2_m (cos th)))))
a2_m = fabs(a2);
a1_m = fabs(a1);
assert(a1_m < a2_m && a2_m < th);
double code(double a1_m, double a2_m, double th) {
return a2_m * (pow(4.0, -0.25) * (a2_m * cos(th)));
}
a2_m = abs(a2)
a1_m = abs(a1)
NOTE: a1_m, a2_m, and th should be sorted in increasing order before calling this function.
real(8) function code(a1_m, a2_m, th)
real(8), intent (in) :: a1_m
real(8), intent (in) :: a2_m
real(8), intent (in) :: th
code = a2_m * ((4.0d0 ** (-0.25d0)) * (a2_m * cos(th)))
end function
a2_m = Math.abs(a2);
a1_m = Math.abs(a1);
assert a1_m < a2_m && a2_m < th;
public static double code(double a1_m, double a2_m, double th) {
return a2_m * (Math.pow(4.0, -0.25) * (a2_m * Math.cos(th)));
}
a2_m = math.fabs(a2) a1_m = math.fabs(a1) [a1_m, a2_m, th] = sort([a1_m, a2_m, th]) def code(a1_m, a2_m, th): return a2_m * (math.pow(4.0, -0.25) * (a2_m * math.cos(th)))
a2_m = abs(a2) a1_m = abs(a1) a1_m, a2_m, th = sort([a1_m, a2_m, th]) function code(a1_m, a2_m, th) return Float64(a2_m * Float64((4.0 ^ -0.25) * Float64(a2_m * cos(th)))) end
a2_m = abs(a2);
a1_m = abs(a1);
a1_m, a2_m, th = num2cell(sort([a1_m, a2_m, th])){:}
function tmp = code(a1_m, a2_m, th)
tmp = a2_m * ((4.0 ^ -0.25) * (a2_m * cos(th)));
end
a2_m = N[Abs[a2], $MachinePrecision] a1_m = N[Abs[a1], $MachinePrecision] NOTE: a1_m, a2_m, and th should be sorted in increasing order before calling this function. code[a1$95$m_, a2$95$m_, th_] := N[(a2$95$m * N[(N[Power[4.0, -0.25], $MachinePrecision] * N[(a2$95$m * N[Cos[th], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
a2_m = \left|a2\right|
\\
a1_m = \left|a1\right|
\\
[a1_m, a2_m, th] = \mathsf{sort}([a1_m, a2_m, th])\\
\\
a2\_m \cdot \left({4}^{-0.25} \cdot \left(a2\_m \cdot \cos th\right)\right)
\end{array}
Initial program 99.2%
Taylor expanded in a1 around 0
*-commutativeN/A
unpow2N/A
associate-*r*N/A
associate-/l*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-cos.f64N/A
lower-/.f64N/A
lower-sqrt.f6457.1
Applied rewrites57.1%
Applied rewrites57.1%
a2_m = (fabs.f64 a2) a1_m = (fabs.f64 a1) NOTE: a1_m, a2_m, and th should be sorted in increasing order before calling this function. (FPCore (a1_m a2_m th) :precision binary64 (* (* (/ a2_m (sqrt 2.0)) (cos th)) a2_m))
a2_m = fabs(a2);
a1_m = fabs(a1);
assert(a1_m < a2_m && a2_m < th);
double code(double a1_m, double a2_m, double th) {
return ((a2_m / sqrt(2.0)) * cos(th)) * a2_m;
}
a2_m = abs(a2)
a1_m = abs(a1)
NOTE: a1_m, a2_m, and th should be sorted in increasing order before calling this function.
real(8) function code(a1_m, a2_m, th)
real(8), intent (in) :: a1_m
real(8), intent (in) :: a2_m
real(8), intent (in) :: th
code = ((a2_m / sqrt(2.0d0)) * cos(th)) * a2_m
end function
a2_m = Math.abs(a2);
a1_m = Math.abs(a1);
assert a1_m < a2_m && a2_m < th;
public static double code(double a1_m, double a2_m, double th) {
return ((a2_m / Math.sqrt(2.0)) * Math.cos(th)) * a2_m;
}
a2_m = math.fabs(a2) a1_m = math.fabs(a1) [a1_m, a2_m, th] = sort([a1_m, a2_m, th]) def code(a1_m, a2_m, th): return ((a2_m / math.sqrt(2.0)) * math.cos(th)) * a2_m
a2_m = abs(a2) a1_m = abs(a1) a1_m, a2_m, th = sort([a1_m, a2_m, th]) function code(a1_m, a2_m, th) return Float64(Float64(Float64(a2_m / sqrt(2.0)) * cos(th)) * a2_m) end
a2_m = abs(a2);
a1_m = abs(a1);
a1_m, a2_m, th = num2cell(sort([a1_m, a2_m, th])){:}
function tmp = code(a1_m, a2_m, th)
tmp = ((a2_m / sqrt(2.0)) * cos(th)) * a2_m;
end
a2_m = N[Abs[a2], $MachinePrecision] a1_m = N[Abs[a1], $MachinePrecision] NOTE: a1_m, a2_m, and th should be sorted in increasing order before calling this function. code[a1$95$m_, a2$95$m_, th_] := N[(N[(N[(a2$95$m / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * N[Cos[th], $MachinePrecision]), $MachinePrecision] * a2$95$m), $MachinePrecision]
\begin{array}{l}
a2_m = \left|a2\right|
\\
a1_m = \left|a1\right|
\\
[a1_m, a2_m, th] = \mathsf{sort}([a1_m, a2_m, th])\\
\\
\left(\frac{a2\_m}{\sqrt{2}} \cdot \cos th\right) \cdot a2\_m
\end{array}
Initial program 99.2%
Taylor expanded in a1 around 0
*-commutativeN/A
unpow2N/A
associate-*r*N/A
associate-/l*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-cos.f64N/A
lower-/.f64N/A
lower-sqrt.f6457.1
Applied rewrites57.1%
Applied rewrites57.1%
a2_m = (fabs.f64 a2) a1_m = (fabs.f64 a1) NOTE: a1_m, a2_m, and th should be sorted in increasing order before calling this function. (FPCore (a1_m a2_m th) :precision binary64 (* (* (cos th) a2_m) (/ a2_m (sqrt 2.0))))
a2_m = fabs(a2);
a1_m = fabs(a1);
assert(a1_m < a2_m && a2_m < th);
double code(double a1_m, double a2_m, double th) {
return (cos(th) * a2_m) * (a2_m / sqrt(2.0));
}
a2_m = abs(a2)
a1_m = abs(a1)
NOTE: a1_m, a2_m, and th should be sorted in increasing order before calling this function.
real(8) function code(a1_m, a2_m, th)
real(8), intent (in) :: a1_m
real(8), intent (in) :: a2_m
real(8), intent (in) :: th
code = (cos(th) * a2_m) * (a2_m / sqrt(2.0d0))
end function
a2_m = Math.abs(a2);
a1_m = Math.abs(a1);
assert a1_m < a2_m && a2_m < th;
public static double code(double a1_m, double a2_m, double th) {
return (Math.cos(th) * a2_m) * (a2_m / Math.sqrt(2.0));
}
a2_m = math.fabs(a2) a1_m = math.fabs(a1) [a1_m, a2_m, th] = sort([a1_m, a2_m, th]) def code(a1_m, a2_m, th): return (math.cos(th) * a2_m) * (a2_m / math.sqrt(2.0))
a2_m = abs(a2) a1_m = abs(a1) a1_m, a2_m, th = sort([a1_m, a2_m, th]) function code(a1_m, a2_m, th) return Float64(Float64(cos(th) * a2_m) * Float64(a2_m / sqrt(2.0))) end
a2_m = abs(a2);
a1_m = abs(a1);
a1_m, a2_m, th = num2cell(sort([a1_m, a2_m, th])){:}
function tmp = code(a1_m, a2_m, th)
tmp = (cos(th) * a2_m) * (a2_m / sqrt(2.0));
end
a2_m = N[Abs[a2], $MachinePrecision] a1_m = N[Abs[a1], $MachinePrecision] NOTE: a1_m, a2_m, and th should be sorted in increasing order before calling this function. code[a1$95$m_, a2$95$m_, th_] := N[(N[(N[Cos[th], $MachinePrecision] * a2$95$m), $MachinePrecision] * N[(a2$95$m / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
a2_m = \left|a2\right|
\\
a1_m = \left|a1\right|
\\
[a1_m, a2_m, th] = \mathsf{sort}([a1_m, a2_m, th])\\
\\
\left(\cos th \cdot a2\_m\right) \cdot \frac{a2\_m}{\sqrt{2}}
\end{array}
Initial program 99.2%
Taylor expanded in a1 around 0
*-commutativeN/A
unpow2N/A
associate-*r*N/A
associate-/l*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-cos.f64N/A
lower-/.f64N/A
lower-sqrt.f6457.1
Applied rewrites57.1%
a2_m = (fabs.f64 a2) a1_m = (fabs.f64 a1) NOTE: a1_m, a2_m, and th should be sorted in increasing order before calling this function. (FPCore (a1_m a2_m th) :precision binary64 (* (* (fma a2_m a2_m (* a1_m a1_m)) (cos th)) (sqrt 0.5)))
a2_m = fabs(a2);
a1_m = fabs(a1);
assert(a1_m < a2_m && a2_m < th);
double code(double a1_m, double a2_m, double th) {
return (fma(a2_m, a2_m, (a1_m * a1_m)) * cos(th)) * sqrt(0.5);
}
a2_m = abs(a2) a1_m = abs(a1) a1_m, a2_m, th = sort([a1_m, a2_m, th]) function code(a1_m, a2_m, th) return Float64(Float64(fma(a2_m, a2_m, Float64(a1_m * a1_m)) * cos(th)) * sqrt(0.5)) end
a2_m = N[Abs[a2], $MachinePrecision] a1_m = N[Abs[a1], $MachinePrecision] NOTE: a1_m, a2_m, and th should be sorted in increasing order before calling this function. code[a1$95$m_, a2$95$m_, th_] := N[(N[(N[(a2$95$m * a2$95$m + N[(a1$95$m * a1$95$m), $MachinePrecision]), $MachinePrecision] * N[Cos[th], $MachinePrecision]), $MachinePrecision] * N[Sqrt[0.5], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
a2_m = \left|a2\right|
\\
a1_m = \left|a1\right|
\\
[a1_m, a2_m, th] = \mathsf{sort}([a1_m, a2_m, th])\\
\\
\left(\mathsf{fma}\left(a2\_m, a2\_m, a1\_m \cdot a1\_m\right) \cdot \cos th\right) \cdot \sqrt{0.5}
\end{array}
Initial program 99.2%
lift-+.f64N/A
lift-*.f64N/A
lift-*.f64N/A
distribute-lft-outN/A
lift-/.f64N/A
clear-numN/A
associate-/r/N/A
associate-*l*N/A
lower-*.f64N/A
lift-sqrt.f64N/A
pow1/2N/A
pow-flipN/A
lower-pow.f64N/A
metadata-evalN/A
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
lift-*.f64N/A
lower-fma.f6499.4
Applied rewrites99.4%
Taylor expanded in a1 around 0
distribute-rgt-outN/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
lower-cos.f64N/A
lower-sqrt.f6499.4
Applied rewrites99.4%
a2_m = (fabs.f64 a2) a1_m = (fabs.f64 a1) NOTE: a1_m, a2_m, and th should be sorted in increasing order before calling this function. (FPCore (a1_m a2_m th) :precision binary64 (* (* (sqrt 0.5) (cos th)) (* a2_m a2_m)))
a2_m = fabs(a2);
a1_m = fabs(a1);
assert(a1_m < a2_m && a2_m < th);
double code(double a1_m, double a2_m, double th) {
return (sqrt(0.5) * cos(th)) * (a2_m * a2_m);
}
a2_m = abs(a2)
a1_m = abs(a1)
NOTE: a1_m, a2_m, and th should be sorted in increasing order before calling this function.
real(8) function code(a1_m, a2_m, th)
real(8), intent (in) :: a1_m
real(8), intent (in) :: a2_m
real(8), intent (in) :: th
code = (sqrt(0.5d0) * cos(th)) * (a2_m * a2_m)
end function
a2_m = Math.abs(a2);
a1_m = Math.abs(a1);
assert a1_m < a2_m && a2_m < th;
public static double code(double a1_m, double a2_m, double th) {
return (Math.sqrt(0.5) * Math.cos(th)) * (a2_m * a2_m);
}
a2_m = math.fabs(a2) a1_m = math.fabs(a1) [a1_m, a2_m, th] = sort([a1_m, a2_m, th]) def code(a1_m, a2_m, th): return (math.sqrt(0.5) * math.cos(th)) * (a2_m * a2_m)
a2_m = abs(a2) a1_m = abs(a1) a1_m, a2_m, th = sort([a1_m, a2_m, th]) function code(a1_m, a2_m, th) return Float64(Float64(sqrt(0.5) * cos(th)) * Float64(a2_m * a2_m)) end
a2_m = abs(a2);
a1_m = abs(a1);
a1_m, a2_m, th = num2cell(sort([a1_m, a2_m, th])){:}
function tmp = code(a1_m, a2_m, th)
tmp = (sqrt(0.5) * cos(th)) * (a2_m * a2_m);
end
a2_m = N[Abs[a2], $MachinePrecision] a1_m = N[Abs[a1], $MachinePrecision] NOTE: a1_m, a2_m, and th should be sorted in increasing order before calling this function. code[a1$95$m_, a2$95$m_, th_] := N[(N[(N[Sqrt[0.5], $MachinePrecision] * N[Cos[th], $MachinePrecision]), $MachinePrecision] * N[(a2$95$m * a2$95$m), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
a2_m = \left|a2\right|
\\
a1_m = \left|a1\right|
\\
[a1_m, a2_m, th] = \mathsf{sort}([a1_m, a2_m, th])\\
\\
\left(\sqrt{0.5} \cdot \cos th\right) \cdot \left(a2\_m \cdot a2\_m\right)
\end{array}
Initial program 99.2%
lift-+.f64N/A
lift-*.f64N/A
lift-*.f64N/A
distribute-lft-outN/A
lift-/.f64N/A
clear-numN/A
associate-/r/N/A
associate-*l*N/A
lower-*.f64N/A
lift-sqrt.f64N/A
pow1/2N/A
pow-flipN/A
lower-pow.f64N/A
metadata-evalN/A
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
lift-*.f64N/A
lower-fma.f6499.4
Applied rewrites99.4%
Taylor expanded in a1 around 0
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-cos.f64N/A
unpow2N/A
lower-*.f6457.2
Applied rewrites57.2%
a2_m = (fabs.f64 a2) a1_m = (fabs.f64 a1) NOTE: a1_m, a2_m, and th should be sorted in increasing order before calling this function. (FPCore (a1_m a2_m th) :precision binary64 (* (* (sqrt 0.5) a2_m) a2_m))
a2_m = fabs(a2);
a1_m = fabs(a1);
assert(a1_m < a2_m && a2_m < th);
double code(double a1_m, double a2_m, double th) {
return (sqrt(0.5) * a2_m) * a2_m;
}
a2_m = abs(a2)
a1_m = abs(a1)
NOTE: a1_m, a2_m, and th should be sorted in increasing order before calling this function.
real(8) function code(a1_m, a2_m, th)
real(8), intent (in) :: a1_m
real(8), intent (in) :: a2_m
real(8), intent (in) :: th
code = (sqrt(0.5d0) * a2_m) * a2_m
end function
a2_m = Math.abs(a2);
a1_m = Math.abs(a1);
assert a1_m < a2_m && a2_m < th;
public static double code(double a1_m, double a2_m, double th) {
return (Math.sqrt(0.5) * a2_m) * a2_m;
}
a2_m = math.fabs(a2) a1_m = math.fabs(a1) [a1_m, a2_m, th] = sort([a1_m, a2_m, th]) def code(a1_m, a2_m, th): return (math.sqrt(0.5) * a2_m) * a2_m
a2_m = abs(a2) a1_m = abs(a1) a1_m, a2_m, th = sort([a1_m, a2_m, th]) function code(a1_m, a2_m, th) return Float64(Float64(sqrt(0.5) * a2_m) * a2_m) end
a2_m = abs(a2);
a1_m = abs(a1);
a1_m, a2_m, th = num2cell(sort([a1_m, a2_m, th])){:}
function tmp = code(a1_m, a2_m, th)
tmp = (sqrt(0.5) * a2_m) * a2_m;
end
a2_m = N[Abs[a2], $MachinePrecision] a1_m = N[Abs[a1], $MachinePrecision] NOTE: a1_m, a2_m, and th should be sorted in increasing order before calling this function. code[a1$95$m_, a2$95$m_, th_] := N[(N[(N[Sqrt[0.5], $MachinePrecision] * a2$95$m), $MachinePrecision] * a2$95$m), $MachinePrecision]
\begin{array}{l}
a2_m = \left|a2\right|
\\
a1_m = \left|a1\right|
\\
[a1_m, a2_m, th] = \mathsf{sort}([a1_m, a2_m, th])\\
\\
\left(\sqrt{0.5} \cdot a2\_m\right) \cdot a2\_m
\end{array}
Initial program 99.2%
lift-+.f64N/A
lift-*.f64N/A
lift-*.f64N/A
distribute-lft-outN/A
lift-/.f64N/A
clear-numN/A
associate-/r/N/A
associate-*l*N/A
lower-*.f64N/A
lift-sqrt.f64N/A
pow1/2N/A
pow-flipN/A
lower-pow.f64N/A
metadata-evalN/A
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
lift-*.f64N/A
lower-fma.f6499.4
Applied rewrites99.4%
Taylor expanded in th around 0
lower-*.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f6464.6
Applied rewrites64.6%
Taylor expanded in a1 around 0
Applied rewrites39.8%
a2_m = (fabs.f64 a2) a1_m = (fabs.f64 a1) NOTE: a1_m, a2_m, and th should be sorted in increasing order before calling this function. (FPCore (a1_m a2_m th) :precision binary64 (* (* a1_m a1_m) (sqrt 0.5)))
a2_m = fabs(a2);
a1_m = fabs(a1);
assert(a1_m < a2_m && a2_m < th);
double code(double a1_m, double a2_m, double th) {
return (a1_m * a1_m) * sqrt(0.5);
}
a2_m = abs(a2)
a1_m = abs(a1)
NOTE: a1_m, a2_m, and th should be sorted in increasing order before calling this function.
real(8) function code(a1_m, a2_m, th)
real(8), intent (in) :: a1_m
real(8), intent (in) :: a2_m
real(8), intent (in) :: th
code = (a1_m * a1_m) * sqrt(0.5d0)
end function
a2_m = Math.abs(a2);
a1_m = Math.abs(a1);
assert a1_m < a2_m && a2_m < th;
public static double code(double a1_m, double a2_m, double th) {
return (a1_m * a1_m) * Math.sqrt(0.5);
}
a2_m = math.fabs(a2) a1_m = math.fabs(a1) [a1_m, a2_m, th] = sort([a1_m, a2_m, th]) def code(a1_m, a2_m, th): return (a1_m * a1_m) * math.sqrt(0.5)
a2_m = abs(a2) a1_m = abs(a1) a1_m, a2_m, th = sort([a1_m, a2_m, th]) function code(a1_m, a2_m, th) return Float64(Float64(a1_m * a1_m) * sqrt(0.5)) end
a2_m = abs(a2);
a1_m = abs(a1);
a1_m, a2_m, th = num2cell(sort([a1_m, a2_m, th])){:}
function tmp = code(a1_m, a2_m, th)
tmp = (a1_m * a1_m) * sqrt(0.5);
end
a2_m = N[Abs[a2], $MachinePrecision] a1_m = N[Abs[a1], $MachinePrecision] NOTE: a1_m, a2_m, and th should be sorted in increasing order before calling this function. code[a1$95$m_, a2$95$m_, th_] := N[(N[(a1$95$m * a1$95$m), $MachinePrecision] * N[Sqrt[0.5], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
a2_m = \left|a2\right|
\\
a1_m = \left|a1\right|
\\
[a1_m, a2_m, th] = \mathsf{sort}([a1_m, a2_m, th])\\
\\
\left(a1\_m \cdot a1\_m\right) \cdot \sqrt{0.5}
\end{array}
Initial program 99.2%
lift-+.f64N/A
lift-*.f64N/A
lift-*.f64N/A
distribute-lft-outN/A
lift-/.f64N/A
clear-numN/A
associate-/r/N/A
associate-*l*N/A
lower-*.f64N/A
lift-sqrt.f64N/A
pow1/2N/A
pow-flipN/A
lower-pow.f64N/A
metadata-evalN/A
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
lift-*.f64N/A
lower-fma.f6499.4
Applied rewrites99.4%
Taylor expanded in th around 0
lower-*.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f6464.6
Applied rewrites64.6%
Taylor expanded in a1 around inf
Applied rewrites39.1%
Applied rewrites38.8%
herbie shell --seed 2024307
(FPCore (a1 a2 th)
:name "Migdal et al, Equation (64)"
:precision binary64
(+ (* (/ (cos th) (sqrt 2.0)) (* a1 a1)) (* (/ (cos th) (sqrt 2.0)) (* a2 a2))))