
(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 12 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}
a1_m = (fabs.f64 a1) NOTE: a1_m, a2, and th should be sorted in increasing order before calling this function. (FPCore (a1_m a2 th) :precision binary64 (* (fma (sqrt 2.0) (* (cos th) (* a2 a2)) (* (sqrt 2.0) (* (cos th) (* a1_m a1_m)))) 0.5))
a1_m = fabs(a1);
assert(a1_m < a2 && a2 < th);
double code(double a1_m, double a2, double th) {
return fma(sqrt(2.0), (cos(th) * (a2 * a2)), (sqrt(2.0) * (cos(th) * (a1_m * a1_m)))) * 0.5;
}
a1_m = abs(a1) a1_m, a2, th = sort([a1_m, a2, th]) function code(a1_m, a2, th) return Float64(fma(sqrt(2.0), Float64(cos(th) * Float64(a2 * a2)), Float64(sqrt(2.0) * Float64(cos(th) * Float64(a1_m * a1_m)))) * 0.5) end
a1_m = N[Abs[a1], $MachinePrecision] NOTE: a1_m, a2, and th should be sorted in increasing order before calling this function. code[a1$95$m_, a2_, th_] := N[(N[(N[Sqrt[2.0], $MachinePrecision] * N[(N[Cos[th], $MachinePrecision] * N[(a2 * a2), $MachinePrecision]), $MachinePrecision] + N[(N[Sqrt[2.0], $MachinePrecision] * N[(N[Cos[th], $MachinePrecision] * N[(a1$95$m * a1$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * 0.5), $MachinePrecision]
\begin{array}{l}
a1_m = \left|a1\right|
\\
[a1_m, a2, th] = \mathsf{sort}([a1_m, a2, th])\\
\\
\mathsf{fma}\left(\sqrt{2}, \cos th \cdot \left(a2 \cdot a2\right), \sqrt{2} \cdot \left(\cos th \cdot \left(a1\_m \cdot a1\_m\right)\right)\right) \cdot 0.5
\end{array}
Initial program 99.6%
associate-*l/N/A
associate-*l/N/A
frac-addN/A
rem-square-sqrtN/A
div-invN/A
metadata-evalN/A
*-lowering-*.f64N/A
Applied egg-rr99.7%
a1_m = (fabs.f64 a1)
NOTE: a1_m, a2, and th should be sorted in increasing order before calling this function.
(FPCore (a1_m a2 th)
:precision binary64
(let* ((t_1 (/ (cos th) (sqrt 2.0))))
(if (<= (+ (* (* a1_m a1_m) t_1) (* (* a2 a2) t_1)) -2e-232)
(* (* (sqrt 2.0) (* a2 a2)) (fma -0.25 (* th th) 0.5))
(fma a2 (/ a2 (sqrt 2.0)) 0.0))))a1_m = fabs(a1);
assert(a1_m < a2 && a2 < th);
double code(double a1_m, double a2, double th) {
double t_1 = cos(th) / sqrt(2.0);
double tmp;
if ((((a1_m * a1_m) * t_1) + ((a2 * a2) * t_1)) <= -2e-232) {
tmp = (sqrt(2.0) * (a2 * a2)) * fma(-0.25, (th * th), 0.5);
} else {
tmp = fma(a2, (a2 / sqrt(2.0)), 0.0);
}
return tmp;
}
a1_m = abs(a1) a1_m, a2, th = sort([a1_m, a2, th]) function code(a1_m, a2, th) t_1 = Float64(cos(th) / sqrt(2.0)) tmp = 0.0 if (Float64(Float64(Float64(a1_m * a1_m) * t_1) + Float64(Float64(a2 * a2) * t_1)) <= -2e-232) tmp = Float64(Float64(sqrt(2.0) * Float64(a2 * a2)) * fma(-0.25, Float64(th * th), 0.5)); else tmp = fma(a2, Float64(a2 / sqrt(2.0)), 0.0); end return tmp end
a1_m = N[Abs[a1], $MachinePrecision]
NOTE: a1_m, a2, and th should be sorted in increasing order before calling this function.
code[a1$95$m_, a2_, th_] := Block[{t$95$1 = N[(N[Cos[th], $MachinePrecision] / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[(N[(a1$95$m * a1$95$m), $MachinePrecision] * t$95$1), $MachinePrecision] + N[(N[(a2 * a2), $MachinePrecision] * t$95$1), $MachinePrecision]), $MachinePrecision], -2e-232], N[(N[(N[Sqrt[2.0], $MachinePrecision] * N[(a2 * a2), $MachinePrecision]), $MachinePrecision] * N[(-0.25 * N[(th * th), $MachinePrecision] + 0.5), $MachinePrecision]), $MachinePrecision], N[(a2 * N[(a2 / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] + 0.0), $MachinePrecision]]]
\begin{array}{l}
a1_m = \left|a1\right|
\\
[a1_m, a2, th] = \mathsf{sort}([a1_m, a2, th])\\
\\
\begin{array}{l}
t_1 := \frac{\cos th}{\sqrt{2}}\\
\mathbf{if}\;\left(a1\_m \cdot a1\_m\right) \cdot t\_1 + \left(a2 \cdot a2\right) \cdot t\_1 \leq -2 \cdot 10^{-232}:\\
\;\;\;\;\left(\sqrt{2} \cdot \left(a2 \cdot a2\right)\right) \cdot \mathsf{fma}\left(-0.25, th \cdot th, 0.5\right)\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(a2, \frac{a2}{\sqrt{2}}, 0\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))) < -2.00000000000000005e-232Initial program 99.4%
associate-*l/N/A
associate-*l/N/A
frac-addN/A
rem-square-sqrtN/A
div-invN/A
metadata-evalN/A
*-lowering-*.f64N/A
Applied egg-rr99.6%
Taylor expanded in th around 0
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
Simplified3.0%
Taylor expanded in a1 around 0
*-commutativeN/A
associate-*r*N/A
associate-*r*N/A
associate-*l*N/A
*-commutativeN/A
distribute-rgt-outN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
unpow2N/A
*-lowering-*.f64N/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f6436.8
Simplified36.8%
if -2.00000000000000005e-232 < (+.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.6%
distribute-lft-outN/A
*-commutativeN/A
flip3-+N/A
frac-timesN/A
/-lowering-/.f64N/A
Applied egg-rr12.6%
Taylor expanded in th around 0
Simplified9.7%
Taylor expanded in a1 around 0
*-rgt-identityN/A
associate-*r/N/A
+-rgt-identityN/A
distribute-rgt-inN/A
associate-*l/N/A
*-lft-identityN/A
mul0-lftN/A
unpow2N/A
associate-/l*N/A
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f6453.1
Simplified53.1%
Final simplification49.2%
a1_m = (fabs.f64 a1)
NOTE: a1_m, a2, and th should be sorted in increasing order before calling this function.
(FPCore (a1_m a2 th)
:precision binary64
(let* ((t_1 (/ (cos th) (sqrt 2.0))))
(if (<= (+ (* (* a1_m a1_m) t_1) (* (* a2 a2) t_1)) -2e-96)
(* (* a1_m a1_m) (* (sqrt 2.0) (fma -0.25 (* th th) 0.5)))
(fma a2 (/ a2 (sqrt 2.0)) 0.0))))a1_m = fabs(a1);
assert(a1_m < a2 && a2 < th);
double code(double a1_m, double a2, double th) {
double t_1 = cos(th) / sqrt(2.0);
double tmp;
if ((((a1_m * a1_m) * t_1) + ((a2 * a2) * t_1)) <= -2e-96) {
tmp = (a1_m * a1_m) * (sqrt(2.0) * fma(-0.25, (th * th), 0.5));
} else {
tmp = fma(a2, (a2 / sqrt(2.0)), 0.0);
}
return tmp;
}
a1_m = abs(a1) a1_m, a2, th = sort([a1_m, a2, th]) function code(a1_m, a2, th) t_1 = Float64(cos(th) / sqrt(2.0)) tmp = 0.0 if (Float64(Float64(Float64(a1_m * a1_m) * t_1) + Float64(Float64(a2 * a2) * t_1)) <= -2e-96) tmp = Float64(Float64(a1_m * a1_m) * Float64(sqrt(2.0) * fma(-0.25, Float64(th * th), 0.5))); else tmp = fma(a2, Float64(a2 / sqrt(2.0)), 0.0); end return tmp end
a1_m = N[Abs[a1], $MachinePrecision]
NOTE: a1_m, a2, and th should be sorted in increasing order before calling this function.
code[a1$95$m_, a2_, th_] := Block[{t$95$1 = N[(N[Cos[th], $MachinePrecision] / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[(N[(a1$95$m * a1$95$m), $MachinePrecision] * t$95$1), $MachinePrecision] + N[(N[(a2 * a2), $MachinePrecision] * t$95$1), $MachinePrecision]), $MachinePrecision], -2e-96], N[(N[(a1$95$m * a1$95$m), $MachinePrecision] * N[(N[Sqrt[2.0], $MachinePrecision] * N[(-0.25 * N[(th * th), $MachinePrecision] + 0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(a2 * N[(a2 / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] + 0.0), $MachinePrecision]]]
\begin{array}{l}
a1_m = \left|a1\right|
\\
[a1_m, a2, th] = \mathsf{sort}([a1_m, a2, th])\\
\\
\begin{array}{l}
t_1 := \frac{\cos th}{\sqrt{2}}\\
\mathbf{if}\;\left(a1\_m \cdot a1\_m\right) \cdot t\_1 + \left(a2 \cdot a2\right) \cdot t\_1 \leq -2 \cdot 10^{-96}:\\
\;\;\;\;\left(a1\_m \cdot a1\_m\right) \cdot \left(\sqrt{2} \cdot \mathsf{fma}\left(-0.25, th \cdot th, 0.5\right)\right)\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(a2, \frac{a2}{\sqrt{2}}, 0\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))) < -1.9999999999999998e-96Initial program 99.4%
associate-*l/N/A
associate-*l/N/A
frac-addN/A
rem-square-sqrtN/A
div-invN/A
metadata-evalN/A
*-lowering-*.f64N/A
Applied egg-rr99.6%
Taylor expanded in th around 0
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
Simplified2.9%
Taylor expanded in a1 around inf
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
associate-*r*N/A
distribute-rgt-outN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f6441.2
Simplified41.2%
if -1.9999999999999998e-96 < (+.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.6%
distribute-lft-outN/A
*-commutativeN/A
flip3-+N/A
frac-timesN/A
/-lowering-/.f64N/A
Applied egg-rr12.1%
Taylor expanded in th around 0
Simplified9.4%
Taylor expanded in a1 around 0
*-rgt-identityN/A
associate-*r/N/A
+-rgt-identityN/A
distribute-rgt-inN/A
associate-*l/N/A
*-lft-identityN/A
mul0-lftN/A
unpow2N/A
associate-/l*N/A
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f6451.2
Simplified51.2%
Final simplification49.1%
a1_m = (fabs.f64 a1)
NOTE: a1_m, a2, and th should be sorted in increasing order before calling this function.
(FPCore (a1_m a2 th)
:precision binary64
(let* ((t_1 (/ (cos th) (sqrt 2.0))))
(if (<= (+ (* (* a1_m a1_m) t_1) (* (* a2 a2) t_1)) -5e-285)
(* th (* th (* -0.25 (* a1_m (* (sqrt 2.0) a1_m)))))
(fma a2 (/ a2 (sqrt 2.0)) 0.0))))a1_m = fabs(a1);
assert(a1_m < a2 && a2 < th);
double code(double a1_m, double a2, double th) {
double t_1 = cos(th) / sqrt(2.0);
double tmp;
if ((((a1_m * a1_m) * t_1) + ((a2 * a2) * t_1)) <= -5e-285) {
tmp = th * (th * (-0.25 * (a1_m * (sqrt(2.0) * a1_m))));
} else {
tmp = fma(a2, (a2 / sqrt(2.0)), 0.0);
}
return tmp;
}
a1_m = abs(a1) a1_m, a2, th = sort([a1_m, a2, th]) function code(a1_m, a2, th) t_1 = Float64(cos(th) / sqrt(2.0)) tmp = 0.0 if (Float64(Float64(Float64(a1_m * a1_m) * t_1) + Float64(Float64(a2 * a2) * t_1)) <= -5e-285) tmp = Float64(th * Float64(th * Float64(-0.25 * Float64(a1_m * Float64(sqrt(2.0) * a1_m))))); else tmp = fma(a2, Float64(a2 / sqrt(2.0)), 0.0); end return tmp end
a1_m = N[Abs[a1], $MachinePrecision]
NOTE: a1_m, a2, and th should be sorted in increasing order before calling this function.
code[a1$95$m_, a2_, th_] := Block[{t$95$1 = N[(N[Cos[th], $MachinePrecision] / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[(N[(a1$95$m * a1$95$m), $MachinePrecision] * t$95$1), $MachinePrecision] + N[(N[(a2 * a2), $MachinePrecision] * t$95$1), $MachinePrecision]), $MachinePrecision], -5e-285], N[(th * N[(th * N[(-0.25 * N[(a1$95$m * N[(N[Sqrt[2.0], $MachinePrecision] * a1$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(a2 * N[(a2 / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] + 0.0), $MachinePrecision]]]
\begin{array}{l}
a1_m = \left|a1\right|
\\
[a1_m, a2, th] = \mathsf{sort}([a1_m, a2, th])\\
\\
\begin{array}{l}
t_1 := \frac{\cos th}{\sqrt{2}}\\
\mathbf{if}\;\left(a1\_m \cdot a1\_m\right) \cdot t\_1 + \left(a2 \cdot a2\right) \cdot t\_1 \leq -5 \cdot 10^{-285}:\\
\;\;\;\;th \cdot \left(th \cdot \left(-0.25 \cdot \left(a1\_m \cdot \left(\sqrt{2} \cdot a1\_m\right)\right)\right)\right)\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(a2, \frac{a2}{\sqrt{2}}, 0\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))) < -5.00000000000000018e-285Initial program 99.4%
associate-*l/N/A
associate-*l/N/A
frac-addN/A
rem-square-sqrtN/A
div-invN/A
metadata-evalN/A
*-lowering-*.f64N/A
Applied egg-rr99.6%
Taylor expanded in th around 0
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
Simplified3.0%
Taylor expanded in a1 around inf
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f642.3
Simplified2.3%
Taylor expanded in th around inf
*-commutativeN/A
associate-*r*N/A
associate-*l*N/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f6433.8
Simplified33.8%
if -5.00000000000000018e-285 < (+.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.6%
distribute-lft-outN/A
*-commutativeN/A
flip3-+N/A
frac-timesN/A
/-lowering-/.f64N/A
Applied egg-rr12.8%
Taylor expanded in th around 0
Simplified9.9%
Taylor expanded in a1 around 0
*-rgt-identityN/A
associate-*r/N/A
+-rgt-identityN/A
distribute-rgt-inN/A
associate-*l/N/A
*-lft-identityN/A
mul0-lftN/A
unpow2N/A
associate-/l*N/A
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f6453.8
Simplified53.8%
Final simplification48.7%
a1_m = (fabs.f64 a1) NOTE: a1_m, a2, and th should be sorted in increasing order before calling this function. (FPCore (a1_m a2 th) :precision binary64 (* 0.5 (* (* (sqrt 2.0) (cos th)) (fma a2 a2 (* a1_m a1_m)))))
a1_m = fabs(a1);
assert(a1_m < a2 && a2 < th);
double code(double a1_m, double a2, double th) {
return 0.5 * ((sqrt(2.0) * cos(th)) * fma(a2, a2, (a1_m * a1_m)));
}
a1_m = abs(a1) a1_m, a2, th = sort([a1_m, a2, th]) function code(a1_m, a2, th) return Float64(0.5 * Float64(Float64(sqrt(2.0) * cos(th)) * fma(a2, a2, Float64(a1_m * a1_m)))) end
a1_m = N[Abs[a1], $MachinePrecision] NOTE: a1_m, a2, and th should be sorted in increasing order before calling this function. code[a1$95$m_, a2_, th_] := N[(0.5 * N[(N[(N[Sqrt[2.0], $MachinePrecision] * N[Cos[th], $MachinePrecision]), $MachinePrecision] * N[(a2 * a2 + N[(a1$95$m * a1$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
a1_m = \left|a1\right|
\\
[a1_m, a2, th] = \mathsf{sort}([a1_m, a2, th])\\
\\
0.5 \cdot \left(\left(\sqrt{2} \cdot \cos th\right) \cdot \mathsf{fma}\left(a2, a2, a1\_m \cdot a1\_m\right)\right)
\end{array}
Initial program 99.6%
associate-*l/N/A
associate-*l/N/A
frac-addN/A
rem-square-sqrtN/A
div-invN/A
metadata-evalN/A
*-lowering-*.f64N/A
Applied egg-rr99.7%
associate-*r*N/A
associate-*r*N/A
distribute-lft-outN/A
+-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
cos-lowering-cos.f64N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f6499.6
Applied egg-rr99.6%
Final simplification99.6%
a1_m = (fabs.f64 a1) NOTE: a1_m, a2, and th should be sorted in increasing order before calling this function. (FPCore (a1_m a2 th) :precision binary64 (* 0.5 (* (* (sqrt 2.0) a2) (* (cos th) a2))))
a1_m = fabs(a1);
assert(a1_m < a2 && a2 < th);
double code(double a1_m, double a2, double th) {
return 0.5 * ((sqrt(2.0) * a2) * (cos(th) * a2));
}
a1_m = abs(a1)
NOTE: a1_m, a2, and th should be sorted in increasing order before calling this function.
real(8) function code(a1_m, a2, th)
real(8), intent (in) :: a1_m
real(8), intent (in) :: a2
real(8), intent (in) :: th
code = 0.5d0 * ((sqrt(2.0d0) * a2) * (cos(th) * a2))
end function
a1_m = Math.abs(a1);
assert a1_m < a2 && a2 < th;
public static double code(double a1_m, double a2, double th) {
return 0.5 * ((Math.sqrt(2.0) * a2) * (Math.cos(th) * a2));
}
a1_m = math.fabs(a1) [a1_m, a2, th] = sort([a1_m, a2, th]) def code(a1_m, a2, th): return 0.5 * ((math.sqrt(2.0) * a2) * (math.cos(th) * a2))
a1_m = abs(a1) a1_m, a2, th = sort([a1_m, a2, th]) function code(a1_m, a2, th) return Float64(0.5 * Float64(Float64(sqrt(2.0) * a2) * Float64(cos(th) * a2))) end
a1_m = abs(a1);
a1_m, a2, th = num2cell(sort([a1_m, a2, th])){:}
function tmp = code(a1_m, a2, th)
tmp = 0.5 * ((sqrt(2.0) * a2) * (cos(th) * a2));
end
a1_m = N[Abs[a1], $MachinePrecision] NOTE: a1_m, a2, and th should be sorted in increasing order before calling this function. code[a1$95$m_, a2_, th_] := N[(0.5 * N[(N[(N[Sqrt[2.0], $MachinePrecision] * a2), $MachinePrecision] * N[(N[Cos[th], $MachinePrecision] * a2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
a1_m = \left|a1\right|
\\
[a1_m, a2, th] = \mathsf{sort}([a1_m, a2, th])\\
\\
0.5 \cdot \left(\left(\sqrt{2} \cdot a2\right) \cdot \left(\cos th \cdot a2\right)\right)
\end{array}
Initial program 99.6%
associate-*l/N/A
associate-*l/N/A
frac-addN/A
rem-square-sqrtN/A
div-invN/A
metadata-evalN/A
*-lowering-*.f64N/A
Applied egg-rr99.7%
Taylor expanded in a2 around inf
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
cos-lowering-cos.f6453.5
Simplified53.5%
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
cos-lowering-cos.f6453.5
Applied egg-rr53.5%
Final simplification53.5%
a1_m = (fabs.f64 a1) NOTE: a1_m, a2, and th should be sorted in increasing order before calling this function. (FPCore (a1_m a2 th) :precision binary64 (* 0.5 (* (sqrt 2.0) (* (cos th) (* a2 a2)))))
a1_m = fabs(a1);
assert(a1_m < a2 && a2 < th);
double code(double a1_m, double a2, double th) {
return 0.5 * (sqrt(2.0) * (cos(th) * (a2 * a2)));
}
a1_m = abs(a1)
NOTE: a1_m, a2, and th should be sorted in increasing order before calling this function.
real(8) function code(a1_m, a2, th)
real(8), intent (in) :: a1_m
real(8), intent (in) :: a2
real(8), intent (in) :: th
code = 0.5d0 * (sqrt(2.0d0) * (cos(th) * (a2 * a2)))
end function
a1_m = Math.abs(a1);
assert a1_m < a2 && a2 < th;
public static double code(double a1_m, double a2, double th) {
return 0.5 * (Math.sqrt(2.0) * (Math.cos(th) * (a2 * a2)));
}
a1_m = math.fabs(a1) [a1_m, a2, th] = sort([a1_m, a2, th]) def code(a1_m, a2, th): return 0.5 * (math.sqrt(2.0) * (math.cos(th) * (a2 * a2)))
a1_m = abs(a1) a1_m, a2, th = sort([a1_m, a2, th]) function code(a1_m, a2, th) return Float64(0.5 * Float64(sqrt(2.0) * Float64(cos(th) * Float64(a2 * a2)))) end
a1_m = abs(a1);
a1_m, a2, th = num2cell(sort([a1_m, a2, th])){:}
function tmp = code(a1_m, a2, th)
tmp = 0.5 * (sqrt(2.0) * (cos(th) * (a2 * a2)));
end
a1_m = N[Abs[a1], $MachinePrecision] NOTE: a1_m, a2, and th should be sorted in increasing order before calling this function. code[a1$95$m_, a2_, th_] := N[(0.5 * N[(N[Sqrt[2.0], $MachinePrecision] * N[(N[Cos[th], $MachinePrecision] * N[(a2 * a2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
a1_m = \left|a1\right|
\\
[a1_m, a2, th] = \mathsf{sort}([a1_m, a2, th])\\
\\
0.5 \cdot \left(\sqrt{2} \cdot \left(\cos th \cdot \left(a2 \cdot a2\right)\right)\right)
\end{array}
Initial program 99.6%
associate-*l/N/A
associate-*l/N/A
frac-addN/A
rem-square-sqrtN/A
div-invN/A
metadata-evalN/A
*-lowering-*.f64N/A
Applied egg-rr99.7%
Taylor expanded in a2 around inf
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
cos-lowering-cos.f6453.5
Simplified53.5%
*-commutativeN/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f6453.5
Applied egg-rr53.5%
Final simplification53.5%
a1_m = (fabs.f64 a1) NOTE: a1_m, a2, and th should be sorted in increasing order before calling this function. (FPCore (a1_m a2 th) :precision binary64 (* 0.5 (* (sqrt 2.0) (* a2 (* (cos th) a2)))))
a1_m = fabs(a1);
assert(a1_m < a2 && a2 < th);
double code(double a1_m, double a2, double th) {
return 0.5 * (sqrt(2.0) * (a2 * (cos(th) * a2)));
}
a1_m = abs(a1)
NOTE: a1_m, a2, and th should be sorted in increasing order before calling this function.
real(8) function code(a1_m, a2, th)
real(8), intent (in) :: a1_m
real(8), intent (in) :: a2
real(8), intent (in) :: th
code = 0.5d0 * (sqrt(2.0d0) * (a2 * (cos(th) * a2)))
end function
a1_m = Math.abs(a1);
assert a1_m < a2 && a2 < th;
public static double code(double a1_m, double a2, double th) {
return 0.5 * (Math.sqrt(2.0) * (a2 * (Math.cos(th) * a2)));
}
a1_m = math.fabs(a1) [a1_m, a2, th] = sort([a1_m, a2, th]) def code(a1_m, a2, th): return 0.5 * (math.sqrt(2.0) * (a2 * (math.cos(th) * a2)))
a1_m = abs(a1) a1_m, a2, th = sort([a1_m, a2, th]) function code(a1_m, a2, th) return Float64(0.5 * Float64(sqrt(2.0) * Float64(a2 * Float64(cos(th) * a2)))) end
a1_m = abs(a1);
a1_m, a2, th = num2cell(sort([a1_m, a2, th])){:}
function tmp = code(a1_m, a2, th)
tmp = 0.5 * (sqrt(2.0) * (a2 * (cos(th) * a2)));
end
a1_m = N[Abs[a1], $MachinePrecision] NOTE: a1_m, a2, and th should be sorted in increasing order before calling this function. code[a1$95$m_, a2_, th_] := N[(0.5 * N[(N[Sqrt[2.0], $MachinePrecision] * N[(a2 * N[(N[Cos[th], $MachinePrecision] * a2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
a1_m = \left|a1\right|
\\
[a1_m, a2, th] = \mathsf{sort}([a1_m, a2, th])\\
\\
0.5 \cdot \left(\sqrt{2} \cdot \left(a2 \cdot \left(\cos th \cdot a2\right)\right)\right)
\end{array}
Initial program 99.6%
associate-*l/N/A
associate-*l/N/A
frac-addN/A
rem-square-sqrtN/A
div-invN/A
metadata-evalN/A
*-lowering-*.f64N/A
Applied egg-rr99.7%
Taylor expanded in a2 around inf
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
cos-lowering-cos.f6453.5
Simplified53.5%
Final simplification53.5%
a1_m = (fabs.f64 a1) NOTE: a1_m, a2, and th should be sorted in increasing order before calling this function. (FPCore (a1_m a2 th) :precision binary64 (* (* a2 a2) (* (sqrt 2.0) (* (cos th) 0.5))))
a1_m = fabs(a1);
assert(a1_m < a2 && a2 < th);
double code(double a1_m, double a2, double th) {
return (a2 * a2) * (sqrt(2.0) * (cos(th) * 0.5));
}
a1_m = abs(a1)
NOTE: a1_m, a2, and th should be sorted in increasing order before calling this function.
real(8) function code(a1_m, a2, th)
real(8), intent (in) :: a1_m
real(8), intent (in) :: a2
real(8), intent (in) :: th
code = (a2 * a2) * (sqrt(2.0d0) * (cos(th) * 0.5d0))
end function
a1_m = Math.abs(a1);
assert a1_m < a2 && a2 < th;
public static double code(double a1_m, double a2, double th) {
return (a2 * a2) * (Math.sqrt(2.0) * (Math.cos(th) * 0.5));
}
a1_m = math.fabs(a1) [a1_m, a2, th] = sort([a1_m, a2, th]) def code(a1_m, a2, th): return (a2 * a2) * (math.sqrt(2.0) * (math.cos(th) * 0.5))
a1_m = abs(a1) a1_m, a2, th = sort([a1_m, a2, th]) function code(a1_m, a2, th) return Float64(Float64(a2 * a2) * Float64(sqrt(2.0) * Float64(cos(th) * 0.5))) end
a1_m = abs(a1);
a1_m, a2, th = num2cell(sort([a1_m, a2, th])){:}
function tmp = code(a1_m, a2, th)
tmp = (a2 * a2) * (sqrt(2.0) * (cos(th) * 0.5));
end
a1_m = N[Abs[a1], $MachinePrecision] NOTE: a1_m, a2, and th should be sorted in increasing order before calling this function. code[a1$95$m_, a2_, th_] := N[(N[(a2 * a2), $MachinePrecision] * N[(N[Sqrt[2.0], $MachinePrecision] * N[(N[Cos[th], $MachinePrecision] * 0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
a1_m = \left|a1\right|
\\
[a1_m, a2, th] = \mathsf{sort}([a1_m, a2, th])\\
\\
\left(a2 \cdot a2\right) \cdot \left(\sqrt{2} \cdot \left(\cos th \cdot 0.5\right)\right)
\end{array}
Initial program 99.6%
associate-*l/N/A
associate-*l/N/A
frac-addN/A
rem-square-sqrtN/A
div-invN/A
metadata-evalN/A
*-lowering-*.f64N/A
Applied egg-rr99.7%
associate-*r*N/A
associate-*r*N/A
distribute-lft-outN/A
+-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
cos-lowering-cos.f64N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f6499.6
Applied egg-rr99.6%
Taylor expanded in a2 around inf
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
cos-lowering-cos.f6453.5
Simplified53.5%
Final simplification53.5%
a1_m = (fabs.f64 a1) NOTE: a1_m, a2, and th should be sorted in increasing order before calling this function. (FPCore (a1_m a2 th) :precision binary64 (fma a2 (/ a2 (sqrt 2.0)) 0.0))
a1_m = fabs(a1);
assert(a1_m < a2 && a2 < th);
double code(double a1_m, double a2, double th) {
return fma(a2, (a2 / sqrt(2.0)), 0.0);
}
a1_m = abs(a1) a1_m, a2, th = sort([a1_m, a2, th]) function code(a1_m, a2, th) return fma(a2, Float64(a2 / sqrt(2.0)), 0.0) end
a1_m = N[Abs[a1], $MachinePrecision] NOTE: a1_m, a2, and th should be sorted in increasing order before calling this function. code[a1$95$m_, a2_, th_] := N[(a2 * N[(a2 / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] + 0.0), $MachinePrecision]
\begin{array}{l}
a1_m = \left|a1\right|
\\
[a1_m, a2, th] = \mathsf{sort}([a1_m, a2, th])\\
\\
\mathsf{fma}\left(a2, \frac{a2}{\sqrt{2}}, 0\right)
\end{array}
Initial program 99.6%
distribute-lft-outN/A
*-commutativeN/A
flip3-+N/A
frac-timesN/A
/-lowering-/.f64N/A
Applied egg-rr14.3%
Taylor expanded in th around 0
Simplified7.5%
Taylor expanded in a1 around 0
*-rgt-identityN/A
associate-*r/N/A
+-rgt-identityN/A
distribute-rgt-inN/A
associate-*l/N/A
*-lft-identityN/A
mul0-lftN/A
unpow2N/A
associate-/l*N/A
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f6440.6
Simplified40.6%
a1_m = (fabs.f64 a1) NOTE: a1_m, a2, and th should be sorted in increasing order before calling this function. (FPCore (a1_m a2 th) :precision binary64 (/ (* a2 a2) (sqrt 2.0)))
a1_m = fabs(a1);
assert(a1_m < a2 && a2 < th);
double code(double a1_m, double a2, double th) {
return (a2 * a2) / sqrt(2.0);
}
a1_m = abs(a1)
NOTE: a1_m, a2, and th should be sorted in increasing order before calling this function.
real(8) function code(a1_m, a2, th)
real(8), intent (in) :: a1_m
real(8), intent (in) :: a2
real(8), intent (in) :: th
code = (a2 * a2) / sqrt(2.0d0)
end function
a1_m = Math.abs(a1);
assert a1_m < a2 && a2 < th;
public static double code(double a1_m, double a2, double th) {
return (a2 * a2) / Math.sqrt(2.0);
}
a1_m = math.fabs(a1) [a1_m, a2, th] = sort([a1_m, a2, th]) def code(a1_m, a2, th): return (a2 * a2) / math.sqrt(2.0)
a1_m = abs(a1) a1_m, a2, th = sort([a1_m, a2, th]) function code(a1_m, a2, th) return Float64(Float64(a2 * a2) / sqrt(2.0)) end
a1_m = abs(a1);
a1_m, a2, th = num2cell(sort([a1_m, a2, th])){:}
function tmp = code(a1_m, a2, th)
tmp = (a2 * a2) / sqrt(2.0);
end
a1_m = N[Abs[a1], $MachinePrecision] NOTE: a1_m, a2, and th should be sorted in increasing order before calling this function. code[a1$95$m_, a2_, th_] := N[(N[(a2 * a2), $MachinePrecision] / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
a1_m = \left|a1\right|
\\
[a1_m, a2, th] = \mathsf{sort}([a1_m, a2, th])\\
\\
\frac{a2 \cdot a2}{\sqrt{2}}
\end{array}
Initial program 99.6%
Taylor expanded in th around 0
unpow2N/A
associate-/l*N/A
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f6465.7
Simplified65.7%
Taylor expanded in a1 around 0
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f6440.6
Simplified40.6%
a1_m = (fabs.f64 a1) NOTE: a1_m, a2, and th should be sorted in increasing order before calling this function. (FPCore (a1_m a2 th) :precision binary64 (* 0.5 (* (sqrt 2.0) (* a2 a2))))
a1_m = fabs(a1);
assert(a1_m < a2 && a2 < th);
double code(double a1_m, double a2, double th) {
return 0.5 * (sqrt(2.0) * (a2 * a2));
}
a1_m = abs(a1)
NOTE: a1_m, a2, and th should be sorted in increasing order before calling this function.
real(8) function code(a1_m, a2, th)
real(8), intent (in) :: a1_m
real(8), intent (in) :: a2
real(8), intent (in) :: th
code = 0.5d0 * (sqrt(2.0d0) * (a2 * a2))
end function
a1_m = Math.abs(a1);
assert a1_m < a2 && a2 < th;
public static double code(double a1_m, double a2, double th) {
return 0.5 * (Math.sqrt(2.0) * (a2 * a2));
}
a1_m = math.fabs(a1) [a1_m, a2, th] = sort([a1_m, a2, th]) def code(a1_m, a2, th): return 0.5 * (math.sqrt(2.0) * (a2 * a2))
a1_m = abs(a1) a1_m, a2, th = sort([a1_m, a2, th]) function code(a1_m, a2, th) return Float64(0.5 * Float64(sqrt(2.0) * Float64(a2 * a2))) end
a1_m = abs(a1);
a1_m, a2, th = num2cell(sort([a1_m, a2, th])){:}
function tmp = code(a1_m, a2, th)
tmp = 0.5 * (sqrt(2.0) * (a2 * a2));
end
a1_m = N[Abs[a1], $MachinePrecision] NOTE: a1_m, a2, and th should be sorted in increasing order before calling this function. code[a1$95$m_, a2_, th_] := N[(0.5 * N[(N[Sqrt[2.0], $MachinePrecision] * N[(a2 * a2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
a1_m = \left|a1\right|
\\
[a1_m, a2, th] = \mathsf{sort}([a1_m, a2, th])\\
\\
0.5 \cdot \left(\sqrt{2} \cdot \left(a2 \cdot a2\right)\right)
\end{array}
Initial program 99.6%
associate-*l/N/A
associate-*l/N/A
frac-addN/A
rem-square-sqrtN/A
div-invN/A
metadata-evalN/A
*-lowering-*.f64N/A
Applied egg-rr99.7%
Taylor expanded in a2 around inf
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
cos-lowering-cos.f6453.5
Simplified53.5%
Taylor expanded in th around 0
unpow2N/A
*-lowering-*.f6440.6
Simplified40.6%
Final simplification40.6%
herbie shell --seed 2024199
(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))))