
(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 10 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) NOTE: a1, a2_m, and th should be sorted in increasing order before calling this function. (FPCore (a1 a2_m th) :precision binary64 (* (* (fma (* (cos th) a2_m) a2_m (* (cos th) (* a1 a1))) (sqrt 2.0)) 0.5))
a2_m = fabs(a2);
assert(a1 < a2_m && a2_m < th);
double code(double a1, double a2_m, double th) {
return (fma((cos(th) * a2_m), a2_m, (cos(th) * (a1 * a1))) * sqrt(2.0)) * 0.5;
}
a2_m = abs(a2) a1, a2_m, th = sort([a1, a2_m, th]) function code(a1, a2_m, th) return Float64(Float64(fma(Float64(cos(th) * a2_m), a2_m, Float64(cos(th) * Float64(a1 * a1))) * sqrt(2.0)) * 0.5) end
a2_m = N[Abs[a2], $MachinePrecision] NOTE: a1, a2_m, and th should be sorted in increasing order before calling this function. code[a1_, a2$95$m_, th_] := N[(N[(N[(N[(N[Cos[th], $MachinePrecision] * a2$95$m), $MachinePrecision] * a2$95$m + N[(N[Cos[th], $MachinePrecision] * N[(a1 * a1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * 0.5), $MachinePrecision]
\begin{array}{l}
a2_m = \left|a2\right|
\\
[a1, a2_m, th] = \mathsf{sort}([a1, a2_m, th])\\
\\
\left(\mathsf{fma}\left(\cos th \cdot a2\_m, a2\_m, \cos th \cdot \left(a1 \cdot a1\right)\right) \cdot \sqrt{2}\right) \cdot 0.5
\end{array}
Initial program 99.5%
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%
distribute-lft-outN/A
*-commutativeN/A
*-lowering-*.f64N/A
distribute-lft-outN/A
+-commutativeN/A
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f6499.7
Applied egg-rr99.7%
+-commutativeN/A
distribute-lft-inN/A
associate-*r*N/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
*-lowering-*.f6499.7
Applied egg-rr99.7%
a2_m = (fabs.f64 a2)
NOTE: a1, a2_m, and th should be sorted in increasing order before calling this function.
(FPCore (a1 a2_m th)
:precision binary64
(let* ((t_1 (/ (cos th) (sqrt 2.0))))
(if (<= (+ (* (* a1 a1) t_1) (* (* a2_m a2_m) t_1)) -2e-114)
(* 0.5 (* (sqrt 2.0) (* a2_m (* a2_m (fma (* th th) -0.5 1.0)))))
(fma a1 (/ a1 (sqrt 2.0)) (/ 1.0 (/ (sqrt 2.0) (* a2_m a2_m)))))))a2_m = fabs(a2);
assert(a1 < a2_m && a2_m < th);
double code(double a1, double a2_m, double th) {
double t_1 = cos(th) / sqrt(2.0);
double tmp;
if ((((a1 * a1) * t_1) + ((a2_m * a2_m) * t_1)) <= -2e-114) {
tmp = 0.5 * (sqrt(2.0) * (a2_m * (a2_m * fma((th * th), -0.5, 1.0))));
} else {
tmp = fma(a1, (a1 / sqrt(2.0)), (1.0 / (sqrt(2.0) / (a2_m * a2_m))));
}
return tmp;
}
a2_m = abs(a2) a1, a2_m, th = sort([a1, a2_m, th]) function code(a1, a2_m, th) t_1 = Float64(cos(th) / sqrt(2.0)) tmp = 0.0 if (Float64(Float64(Float64(a1 * a1) * t_1) + Float64(Float64(a2_m * a2_m) * t_1)) <= -2e-114) tmp = Float64(0.5 * Float64(sqrt(2.0) * Float64(a2_m * Float64(a2_m * fma(Float64(th * th), -0.5, 1.0))))); else tmp = fma(a1, Float64(a1 / sqrt(2.0)), Float64(1.0 / Float64(sqrt(2.0) / Float64(a2_m * a2_m)))); end return tmp end
a2_m = N[Abs[a2], $MachinePrecision]
NOTE: a1, a2_m, and th should be sorted in increasing order before calling this function.
code[a1_, a2$95$m_, th_] := Block[{t$95$1 = N[(N[Cos[th], $MachinePrecision] / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[(N[(a1 * a1), $MachinePrecision] * t$95$1), $MachinePrecision] + N[(N[(a2$95$m * a2$95$m), $MachinePrecision] * t$95$1), $MachinePrecision]), $MachinePrecision], -2e-114], N[(0.5 * N[(N[Sqrt[2.0], $MachinePrecision] * N[(a2$95$m * N[(a2$95$m * N[(N[(th * th), $MachinePrecision] * -0.5 + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(a1 * N[(a1 / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] + N[(1.0 / N[(N[Sqrt[2.0], $MachinePrecision] / N[(a2$95$m * a2$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
a2_m = \left|a2\right|
\\
[a1, a2_m, th] = \mathsf{sort}([a1, a2_m, th])\\
\\
\begin{array}{l}
t_1 := \frac{\cos th}{\sqrt{2}}\\
\mathbf{if}\;\left(a1 \cdot a1\right) \cdot t\_1 + \left(a2\_m \cdot a2\_m\right) \cdot t\_1 \leq -2 \cdot 10^{-114}:\\
\;\;\;\;0.5 \cdot \left(\sqrt{2} \cdot \left(a2\_m \cdot \left(a2\_m \cdot \mathsf{fma}\left(th \cdot th, -0.5, 1\right)\right)\right)\right)\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(a1, \frac{a1}{\sqrt{2}}, \frac{1}{\frac{\sqrt{2}}{a2\_m \cdot a2\_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))) < -2.0000000000000001e-114Initial program 99.7%
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%
distribute-lft-outN/A
*-commutativeN/A
*-lowering-*.f64N/A
distribute-lft-outN/A
+-commutativeN/A
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f6499.6
Applied egg-rr99.6%
Taylor expanded in th around 0
+-commutativeN/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f6457.0
Simplified57.0%
Taylor expanded in a1 around 0
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f6450.6
Simplified50.6%
if -2.0000000000000001e-114 < (+.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.5%
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.f6485.3
Simplified85.3%
clear-numN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f6485.3
Applied egg-rr85.3%
Final simplification78.8%
a2_m = (fabs.f64 a2)
NOTE: a1, a2_m, and th should be sorted in increasing order before calling this function.
(FPCore (a1 a2_m th)
:precision binary64
(let* ((t_1 (/ (cos th) (sqrt 2.0))))
(if (<= (+ (* (* a1 a1) t_1) (* (* a2_m a2_m) t_1)) -2e-114)
(* 0.5 (* (sqrt 2.0) (* a2_m (* a2_m (fma (* th th) -0.5 1.0)))))
(* (fma a1 a1 (* a2_m a2_m)) (* (sqrt 2.0) 0.5)))))a2_m = fabs(a2);
assert(a1 < a2_m && a2_m < th);
double code(double a1, double a2_m, double th) {
double t_1 = cos(th) / sqrt(2.0);
double tmp;
if ((((a1 * a1) * t_1) + ((a2_m * a2_m) * t_1)) <= -2e-114) {
tmp = 0.5 * (sqrt(2.0) * (a2_m * (a2_m * fma((th * th), -0.5, 1.0))));
} else {
tmp = fma(a1, a1, (a2_m * a2_m)) * (sqrt(2.0) * 0.5);
}
return tmp;
}
a2_m = abs(a2) a1, a2_m, th = sort([a1, a2_m, th]) function code(a1, a2_m, th) t_1 = Float64(cos(th) / sqrt(2.0)) tmp = 0.0 if (Float64(Float64(Float64(a1 * a1) * t_1) + Float64(Float64(a2_m * a2_m) * t_1)) <= -2e-114) tmp = Float64(0.5 * Float64(sqrt(2.0) * Float64(a2_m * Float64(a2_m * fma(Float64(th * th), -0.5, 1.0))))); else tmp = Float64(fma(a1, a1, Float64(a2_m * a2_m)) * Float64(sqrt(2.0) * 0.5)); end return tmp end
a2_m = N[Abs[a2], $MachinePrecision]
NOTE: a1, a2_m, and th should be sorted in increasing order before calling this function.
code[a1_, a2$95$m_, th_] := Block[{t$95$1 = N[(N[Cos[th], $MachinePrecision] / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[(N[(a1 * a1), $MachinePrecision] * t$95$1), $MachinePrecision] + N[(N[(a2$95$m * a2$95$m), $MachinePrecision] * t$95$1), $MachinePrecision]), $MachinePrecision], -2e-114], N[(0.5 * N[(N[Sqrt[2.0], $MachinePrecision] * N[(a2$95$m * N[(a2$95$m * N[(N[(th * th), $MachinePrecision] * -0.5 + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(a1 * a1 + N[(a2$95$m * a2$95$m), $MachinePrecision]), $MachinePrecision] * N[(N[Sqrt[2.0], $MachinePrecision] * 0.5), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
a2_m = \left|a2\right|
\\
[a1, a2_m, th] = \mathsf{sort}([a1, a2_m, th])\\
\\
\begin{array}{l}
t_1 := \frac{\cos th}{\sqrt{2}}\\
\mathbf{if}\;\left(a1 \cdot a1\right) \cdot t\_1 + \left(a2\_m \cdot a2\_m\right) \cdot t\_1 \leq -2 \cdot 10^{-114}:\\
\;\;\;\;0.5 \cdot \left(\sqrt{2} \cdot \left(a2\_m \cdot \left(a2\_m \cdot \mathsf{fma}\left(th \cdot th, -0.5, 1\right)\right)\right)\right)\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(a1, a1, a2\_m \cdot a2\_m\right) \cdot \left(\sqrt{2} \cdot 0.5\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.0000000000000001e-114Initial program 99.7%
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%
distribute-lft-outN/A
*-commutativeN/A
*-lowering-*.f64N/A
distribute-lft-outN/A
+-commutativeN/A
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f6499.6
Applied egg-rr99.6%
Taylor expanded in th around 0
+-commutativeN/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f6457.0
Simplified57.0%
Taylor expanded in a1 around 0
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f6450.6
Simplified50.6%
if -2.0000000000000001e-114 < (+.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.5%
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%
distribute-lft-outN/A
*-commutativeN/A
*-lowering-*.f64N/A
distribute-lft-outN/A
+-commutativeN/A
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f6499.7
Applied egg-rr99.7%
+-commutativeN/A
distribute-lft-inN/A
associate-*r*N/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
*-lowering-*.f6499.7
Applied egg-rr99.7%
Taylor expanded in th around 0
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f6485.3
Simplified85.3%
Final simplification78.8%
a2_m = (fabs.f64 a2) NOTE: a1, a2_m, and th should be sorted in increasing order before calling this function. (FPCore (a1 a2_m th) :precision binary64 (* 0.5 (* (sqrt 2.0) (* (cos th) (fma a1 a1 (* a2_m a2_m))))))
a2_m = fabs(a2);
assert(a1 < a2_m && a2_m < th);
double code(double a1, double a2_m, double th) {
return 0.5 * (sqrt(2.0) * (cos(th) * fma(a1, a1, (a2_m * a2_m))));
}
a2_m = abs(a2) a1, a2_m, th = sort([a1, a2_m, th]) function code(a1, a2_m, th) return Float64(0.5 * Float64(sqrt(2.0) * Float64(cos(th) * fma(a1, a1, Float64(a2_m * a2_m))))) end
a2_m = N[Abs[a2], $MachinePrecision] NOTE: a1, a2_m, and th should be sorted in increasing order before calling this function. code[a1_, a2$95$m_, th_] := N[(0.5 * N[(N[Sqrt[2.0], $MachinePrecision] * N[(N[Cos[th], $MachinePrecision] * N[(a1 * a1 + N[(a2$95$m * a2$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
a2_m = \left|a2\right|
\\
[a1, a2_m, th] = \mathsf{sort}([a1, a2_m, th])\\
\\
0.5 \cdot \left(\sqrt{2} \cdot \left(\cos th \cdot \mathsf{fma}\left(a1, a1, a2\_m \cdot a2\_m\right)\right)\right)
\end{array}
Initial program 99.5%
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%
distribute-lft-outN/A
*-commutativeN/A
*-lowering-*.f64N/A
distribute-lft-outN/A
+-commutativeN/A
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f6499.7
Applied egg-rr99.7%
Final simplification99.7%
a2_m = (fabs.f64 a2) NOTE: a1, a2_m, and th should be sorted in increasing order before calling this function. (FPCore (a1 a2_m th) :precision binary64 (* 0.5 (* (sqrt 2.0) (* a2_m (* (cos th) a2_m)))))
a2_m = fabs(a2);
assert(a1 < a2_m && a2_m < th);
double code(double a1, double a2_m, double th) {
return 0.5 * (sqrt(2.0) * (a2_m * (cos(th) * a2_m)));
}
a2_m = abs(a2)
NOTE: a1, a2_m, and th should be sorted in increasing order before calling this function.
real(8) function code(a1, a2_m, th)
real(8), intent (in) :: a1
real(8), intent (in) :: a2_m
real(8), intent (in) :: th
code = 0.5d0 * (sqrt(2.0d0) * (a2_m * (cos(th) * a2_m)))
end function
a2_m = Math.abs(a2);
assert a1 < a2_m && a2_m < th;
public static double code(double a1, double a2_m, double th) {
return 0.5 * (Math.sqrt(2.0) * (a2_m * (Math.cos(th) * a2_m)));
}
a2_m = math.fabs(a2) [a1, a2_m, th] = sort([a1, a2_m, th]) def code(a1, a2_m, th): return 0.5 * (math.sqrt(2.0) * (a2_m * (math.cos(th) * a2_m)))
a2_m = abs(a2) a1, a2_m, th = sort([a1, a2_m, th]) function code(a1, a2_m, th) return Float64(0.5 * Float64(sqrt(2.0) * Float64(a2_m * Float64(cos(th) * a2_m)))) end
a2_m = abs(a2);
a1, a2_m, th = num2cell(sort([a1, a2_m, th])){:}
function tmp = code(a1, a2_m, th)
tmp = 0.5 * (sqrt(2.0) * (a2_m * (cos(th) * a2_m)));
end
a2_m = N[Abs[a2], $MachinePrecision] NOTE: a1, a2_m, and th should be sorted in increasing order before calling this function. code[a1_, a2$95$m_, th_] := N[(0.5 * N[(N[Sqrt[2.0], $MachinePrecision] * N[(a2$95$m * N[(N[Cos[th], $MachinePrecision] * a2$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
a2_m = \left|a2\right|
\\
[a1, a2_m, th] = \mathsf{sort}([a1, a2_m, th])\\
\\
0.5 \cdot \left(\sqrt{2} \cdot \left(a2\_m \cdot \left(\cos th \cdot a2\_m\right)\right)\right)
\end{array}
Initial program 99.5%
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%
distribute-lft-outN/A
*-commutativeN/A
*-lowering-*.f64N/A
distribute-lft-outN/A
+-commutativeN/A
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f6499.7
Applied egg-rr99.7%
+-commutativeN/A
distribute-lft-inN/A
associate-*r*N/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
*-lowering-*.f6499.7
Applied egg-rr99.7%
Taylor expanded in a2 around inf
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
cos-lowering-cos.f6456.2
Simplified56.2%
Final simplification56.2%
a2_m = (fabs.f64 a2) NOTE: a1, a2_m, and th should be sorted in increasing order before calling this function. (FPCore (a1 a2_m th) :precision binary64 (* (* (cos th) 0.5) (* (sqrt 2.0) (* a2_m a2_m))))
a2_m = fabs(a2);
assert(a1 < a2_m && a2_m < th);
double code(double a1, double a2_m, double th) {
return (cos(th) * 0.5) * (sqrt(2.0) * (a2_m * a2_m));
}
a2_m = abs(a2)
NOTE: a1, a2_m, and th should be sorted in increasing order before calling this function.
real(8) function code(a1, a2_m, th)
real(8), intent (in) :: a1
real(8), intent (in) :: a2_m
real(8), intent (in) :: th
code = (cos(th) * 0.5d0) * (sqrt(2.0d0) * (a2_m * a2_m))
end function
a2_m = Math.abs(a2);
assert a1 < a2_m && a2_m < th;
public static double code(double a1, double a2_m, double th) {
return (Math.cos(th) * 0.5) * (Math.sqrt(2.0) * (a2_m * a2_m));
}
a2_m = math.fabs(a2) [a1, a2_m, th] = sort([a1, a2_m, th]) def code(a1, a2_m, th): return (math.cos(th) * 0.5) * (math.sqrt(2.0) * (a2_m * a2_m))
a2_m = abs(a2) a1, a2_m, th = sort([a1, a2_m, th]) function code(a1, a2_m, th) return Float64(Float64(cos(th) * 0.5) * Float64(sqrt(2.0) * Float64(a2_m * a2_m))) end
a2_m = abs(a2);
a1, a2_m, th = num2cell(sort([a1, a2_m, th])){:}
function tmp = code(a1, a2_m, th)
tmp = (cos(th) * 0.5) * (sqrt(2.0) * (a2_m * a2_m));
end
a2_m = N[Abs[a2], $MachinePrecision] NOTE: a1, a2_m, and th should be sorted in increasing order before calling this function. code[a1_, a2$95$m_, th_] := N[(N[(N[Cos[th], $MachinePrecision] * 0.5), $MachinePrecision] * N[(N[Sqrt[2.0], $MachinePrecision] * N[(a2$95$m * a2$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
a2_m = \left|a2\right|
\\
[a1, a2_m, th] = \mathsf{sort}([a1, a2_m, th])\\
\\
\left(\cos th \cdot 0.5\right) \cdot \left(\sqrt{2} \cdot \left(a2\_m \cdot a2\_m\right)\right)
\end{array}
Initial program 99.5%
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%
distribute-lft-outN/A
*-commutativeN/A
*-lowering-*.f64N/A
distribute-lft-outN/A
+-commutativeN/A
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f6499.7
Applied egg-rr99.7%
Taylor expanded in a1 around 0
*-commutativeN/A
associate-*r*N/A
associate-*r*N/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
unpow2N/A
*-lowering-*.f6456.2
Simplified56.2%
Final simplification56.2%
a2_m = (fabs.f64 a2) NOTE: a1, a2_m, and th should be sorted in increasing order before calling this function. (FPCore (a1 a2_m th) :precision binary64 (* (fma a1 a1 (* a2_m a2_m)) (* (sqrt 2.0) 0.5)))
a2_m = fabs(a2);
assert(a1 < a2_m && a2_m < th);
double code(double a1, double a2_m, double th) {
return fma(a1, a1, (a2_m * a2_m)) * (sqrt(2.0) * 0.5);
}
a2_m = abs(a2) a1, a2_m, th = sort([a1, a2_m, th]) function code(a1, a2_m, th) return Float64(fma(a1, a1, Float64(a2_m * a2_m)) * Float64(sqrt(2.0) * 0.5)) end
a2_m = N[Abs[a2], $MachinePrecision] NOTE: a1, a2_m, and th should be sorted in increasing order before calling this function. code[a1_, a2$95$m_, th_] := N[(N[(a1 * a1 + N[(a2$95$m * a2$95$m), $MachinePrecision]), $MachinePrecision] * N[(N[Sqrt[2.0], $MachinePrecision] * 0.5), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
a2_m = \left|a2\right|
\\
[a1, a2_m, th] = \mathsf{sort}([a1, a2_m, th])\\
\\
\mathsf{fma}\left(a1, a1, a2\_m \cdot a2\_m\right) \cdot \left(\sqrt{2} \cdot 0.5\right)
\end{array}
Initial program 99.5%
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%
distribute-lft-outN/A
*-commutativeN/A
*-lowering-*.f64N/A
distribute-lft-outN/A
+-commutativeN/A
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f6499.7
Applied egg-rr99.7%
+-commutativeN/A
distribute-lft-inN/A
associate-*r*N/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
*-lowering-*.f6499.7
Applied egg-rr99.7%
Taylor expanded in th around 0
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f6469.4
Simplified69.4%
Final simplification69.4%
a2_m = (fabs.f64 a2) NOTE: a1, a2_m, and th should be sorted in increasing order before calling this function. (FPCore (a1 a2_m th) :precision binary64 (* 0.5 (* (sqrt 2.0) (fma a1 a1 (* a2_m a2_m)))))
a2_m = fabs(a2);
assert(a1 < a2_m && a2_m < th);
double code(double a1, double a2_m, double th) {
return 0.5 * (sqrt(2.0) * fma(a1, a1, (a2_m * a2_m)));
}
a2_m = abs(a2) a1, a2_m, th = sort([a1, a2_m, th]) function code(a1, a2_m, th) return Float64(0.5 * Float64(sqrt(2.0) * fma(a1, a1, Float64(a2_m * a2_m)))) end
a2_m = N[Abs[a2], $MachinePrecision] NOTE: a1, a2_m, and th should be sorted in increasing order before calling this function. code[a1_, a2$95$m_, th_] := N[(0.5 * N[(N[Sqrt[2.0], $MachinePrecision] * N[(a1 * a1 + N[(a2$95$m * a2$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
a2_m = \left|a2\right|
\\
[a1, a2_m, th] = \mathsf{sort}([a1, a2_m, th])\\
\\
0.5 \cdot \left(\sqrt{2} \cdot \mathsf{fma}\left(a1, a1, a2\_m \cdot a2\_m\right)\right)
\end{array}
Initial program 99.5%
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 th around 0
distribute-rgt-outN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
unpow2N/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f6469.4
Simplified69.4%
Final simplification69.4%
a2_m = (fabs.f64 a2) NOTE: a1, a2_m, and th should be sorted in increasing order before calling this function. (FPCore (a1 a2_m th) :precision binary64 (/ (* a2_m a2_m) (sqrt 2.0)))
a2_m = fabs(a2);
assert(a1 < a2_m && a2_m < th);
double code(double a1, double a2_m, double th) {
return (a2_m * a2_m) / sqrt(2.0);
}
a2_m = abs(a2)
NOTE: a1, a2_m, and th should be sorted in increasing order before calling this function.
real(8) function code(a1, a2_m, th)
real(8), intent (in) :: a1
real(8), intent (in) :: a2_m
real(8), intent (in) :: th
code = (a2_m * a2_m) / sqrt(2.0d0)
end function
a2_m = Math.abs(a2);
assert a1 < a2_m && a2_m < th;
public static double code(double a1, double a2_m, double th) {
return (a2_m * a2_m) / Math.sqrt(2.0);
}
a2_m = math.fabs(a2) [a1, a2_m, th] = sort([a1, a2_m, th]) def code(a1, a2_m, th): return (a2_m * a2_m) / math.sqrt(2.0)
a2_m = abs(a2) a1, a2_m, th = sort([a1, a2_m, th]) function code(a1, a2_m, th) return Float64(Float64(a2_m * a2_m) / sqrt(2.0)) end
a2_m = abs(a2);
a1, a2_m, th = num2cell(sort([a1, a2_m, th])){:}
function tmp = code(a1, a2_m, th)
tmp = (a2_m * a2_m) / sqrt(2.0);
end
a2_m = N[Abs[a2], $MachinePrecision] NOTE: a1, a2_m, and th should be sorted in increasing order before calling this function. code[a1_, a2$95$m_, th_] := N[(N[(a2$95$m * a2$95$m), $MachinePrecision] / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
a2_m = \left|a2\right|
\\
[a1, a2_m, th] = \mathsf{sort}([a1, a2_m, th])\\
\\
\frac{a2\_m \cdot a2\_m}{\sqrt{2}}
\end{array}
Initial program 99.5%
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.f6469.4
Simplified69.4%
Taylor expanded in a1 around 0
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f6439.8
Simplified39.8%
a2_m = (fabs.f64 a2) NOTE: a1, a2_m, and th should be sorted in increasing order before calling this function. (FPCore (a1 a2_m th) :precision binary64 (* a1 (/ a1 (sqrt 2.0))))
a2_m = fabs(a2);
assert(a1 < a2_m && a2_m < th);
double code(double a1, double a2_m, double th) {
return a1 * (a1 / sqrt(2.0));
}
a2_m = abs(a2)
NOTE: a1, a2_m, and th should be sorted in increasing order before calling this function.
real(8) function code(a1, a2_m, th)
real(8), intent (in) :: a1
real(8), intent (in) :: a2_m
real(8), intent (in) :: th
code = a1 * (a1 / sqrt(2.0d0))
end function
a2_m = Math.abs(a2);
assert a1 < a2_m && a2_m < th;
public static double code(double a1, double a2_m, double th) {
return a1 * (a1 / Math.sqrt(2.0));
}
a2_m = math.fabs(a2) [a1, a2_m, th] = sort([a1, a2_m, th]) def code(a1, a2_m, th): return a1 * (a1 / math.sqrt(2.0))
a2_m = abs(a2) a1, a2_m, th = sort([a1, a2_m, th]) function code(a1, a2_m, th) return Float64(a1 * Float64(a1 / sqrt(2.0))) end
a2_m = abs(a2);
a1, a2_m, th = num2cell(sort([a1, a2_m, th])){:}
function tmp = code(a1, a2_m, th)
tmp = a1 * (a1 / sqrt(2.0));
end
a2_m = N[Abs[a2], $MachinePrecision] NOTE: a1, a2_m, and th should be sorted in increasing order before calling this function. code[a1_, a2$95$m_, th_] := N[(a1 * N[(a1 / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
a2_m = \left|a2\right|
\\
[a1, a2_m, th] = \mathsf{sort}([a1, a2_m, th])\\
\\
a1 \cdot \frac{a1}{\sqrt{2}}
\end{array}
Initial program 99.5%
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.f6469.4
Simplified69.4%
Taylor expanded in a1 around inf
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f6443.6
Simplified43.6%
associate-/l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f6443.6
Applied egg-rr43.6%
Final simplification43.6%
herbie shell --seed 2024196
(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))))