
(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 13 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}
NOTE: a1, a2, and th should be sorted in increasing order before calling this function. (FPCore (a1 a2 th) :precision binary64 (/ (fma (* (* a2 (cos th)) (- a2)) (- (sqrt 2.0)) (* (sqrt 2.0) (* (* a1 (cos th)) a1))) 2.0))
assert(a1 < a2 && a2 < th);
double code(double a1, double a2, double th) {
return fma(((a2 * cos(th)) * -a2), -sqrt(2.0), (sqrt(2.0) * ((a1 * cos(th)) * a1))) / 2.0;
}
a1, a2, th = sort([a1, a2, th]) function code(a1, a2, th) return Float64(fma(Float64(Float64(a2 * cos(th)) * Float64(-a2)), Float64(-sqrt(2.0)), Float64(sqrt(2.0) * Float64(Float64(a1 * cos(th)) * a1))) / 2.0) end
NOTE: a1, a2, and th should be sorted in increasing order before calling this function. code[a1_, a2_, th_] := N[(N[(N[(N[(a2 * N[Cos[th], $MachinePrecision]), $MachinePrecision] * (-a2)), $MachinePrecision] * (-N[Sqrt[2.0], $MachinePrecision]) + N[(N[Sqrt[2.0], $MachinePrecision] * N[(N[(a1 * N[Cos[th], $MachinePrecision]), $MachinePrecision] * a1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / 2.0), $MachinePrecision]
\begin{array}{l}
[a1, a2, th] = \mathsf{sort}([a1, a2, th])\\
\\
\frac{\mathsf{fma}\left(\left(a2 \cdot \cos th\right) \cdot \left(-a2\right), -\sqrt{2}, \sqrt{2} \cdot \left(\left(a1 \cdot \cos th\right) \cdot a1\right)\right)}{2}
\end{array}
Initial program 99.3%
lift-+.f64N/A
+-commutativeN/A
lift-*.f64N/A
lift-/.f64N/A
frac-2negN/A
associate-*l/N/A
lift-*.f64N/A
lift-/.f64N/A
frac-2negN/A
associate-*l/N/A
frac-addN/A
sqr-neg-revN/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
rem-square-sqrtN/A
Applied rewrites99.7%
Final simplification99.7%
NOTE: a1, a2, and th should be sorted in increasing order before calling this function.
(FPCore (a1 a2 th)
:precision binary64
(let* ((t_1 (/ (cos th) (sqrt 2.0))))
(if (<= (+ (* t_1 (* a1 a1)) (* t_1 (* a2 a2))) -5e-274)
(* (* a2 a2) (/ (fma (* th th) -0.5 1.0) (sqrt 2.0)))
(* (* 0.5 (sqrt 2.0)) (fma a1 a1 (* a2 a2))))))assert(a1 < a2 && a2 < th);
double code(double a1, double a2, double th) {
double t_1 = cos(th) / sqrt(2.0);
double tmp;
if (((t_1 * (a1 * a1)) + (t_1 * (a2 * a2))) <= -5e-274) {
tmp = (a2 * a2) * (fma((th * th), -0.5, 1.0) / sqrt(2.0));
} else {
tmp = (0.5 * sqrt(2.0)) * fma(a1, a1, (a2 * a2));
}
return tmp;
}
a1, a2, th = sort([a1, a2, th]) function code(a1, a2, th) t_1 = Float64(cos(th) / sqrt(2.0)) tmp = 0.0 if (Float64(Float64(t_1 * Float64(a1 * a1)) + Float64(t_1 * Float64(a2 * a2))) <= -5e-274) tmp = Float64(Float64(a2 * a2) * Float64(fma(Float64(th * th), -0.5, 1.0) / sqrt(2.0))); else tmp = Float64(Float64(0.5 * sqrt(2.0)) * fma(a1, a1, Float64(a2 * a2))); end return tmp end
NOTE: a1, a2, and th should be sorted in increasing order before calling this function.
code[a1_, a2_, 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 * a1), $MachinePrecision]), $MachinePrecision] + N[(t$95$1 * N[(a2 * a2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -5e-274], N[(N[(a2 * a2), $MachinePrecision] * N[(N[(N[(th * th), $MachinePrecision] * -0.5 + 1.0), $MachinePrecision] / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(0.5 * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * N[(a1 * a1 + N[(a2 * a2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[a1, a2, th] = \mathsf{sort}([a1, a2, th])\\
\\
\begin{array}{l}
t_1 := \frac{\cos th}{\sqrt{2}}\\
\mathbf{if}\;t\_1 \cdot \left(a1 \cdot a1\right) + t\_1 \cdot \left(a2 \cdot a2\right) \leq -5 \cdot 10^{-274}:\\
\;\;\;\;\left(a2 \cdot a2\right) \cdot \frac{\mathsf{fma}\left(th \cdot th, -0.5, 1\right)}{\sqrt{2}}\\
\mathbf{else}:\\
\;\;\;\;\left(0.5 \cdot \sqrt{2}\right) \cdot \mathsf{fma}\left(a1, a1, a2 \cdot a2\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-274Initial program 98.3%
lift-+.f64N/A
lift-*.f64N/A
lift-*.f64N/A
distribute-lft-outN/A
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
lift-*.f64N/A
lower-fma.f6498.3
Applied rewrites98.3%
Taylor expanded in a1 around 0
unpow2N/A
lower-*.f6447.1
Applied rewrites47.1%
Taylor expanded in th around 0
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f6434.3
Applied rewrites34.3%
if -5e-274 < (+.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%
lift-+.f64N/A
+-commutativeN/A
lift-*.f64N/A
lift-/.f64N/A
frac-2negN/A
associate-*l/N/A
lift-*.f64N/A
lift-/.f64N/A
frac-2negN/A
associate-*l/N/A
frac-addN/A
sqr-neg-revN/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
rem-square-sqrtN/A
Applied rewrites99.7%
Taylor expanded in th around 0
distribute-rgt-outN/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f6484.2
Applied rewrites84.2%
NOTE: a1, a2, and th should be sorted in increasing order before calling this function.
(FPCore (a1 a2 th)
:precision binary64
(let* ((t_1 (/ (cos th) (sqrt 2.0))) (t_2 (fma a1 a1 (* a2 a2))))
(if (<= (+ (* t_1 (* a1 a1)) (* t_1 (* a2 a2))) -5e-274)
(* (* (sqrt 2.0) (fma -0.25 (* th th) 0.5)) t_2)
(* (* 0.5 (sqrt 2.0)) t_2))))assert(a1 < a2 && a2 < th);
double code(double a1, double a2, double th) {
double t_1 = cos(th) / sqrt(2.0);
double t_2 = fma(a1, a1, (a2 * a2));
double tmp;
if (((t_1 * (a1 * a1)) + (t_1 * (a2 * a2))) <= -5e-274) {
tmp = (sqrt(2.0) * fma(-0.25, (th * th), 0.5)) * t_2;
} else {
tmp = (0.5 * sqrt(2.0)) * t_2;
}
return tmp;
}
a1, a2, th = sort([a1, a2, th]) function code(a1, a2, th) t_1 = Float64(cos(th) / sqrt(2.0)) t_2 = fma(a1, a1, Float64(a2 * a2)) tmp = 0.0 if (Float64(Float64(t_1 * Float64(a1 * a1)) + Float64(t_1 * Float64(a2 * a2))) <= -5e-274) tmp = Float64(Float64(sqrt(2.0) * fma(-0.25, Float64(th * th), 0.5)) * t_2); else tmp = Float64(Float64(0.5 * sqrt(2.0)) * t_2); end return tmp end
NOTE: a1, a2, and th should be sorted in increasing order before calling this function.
code[a1_, a2_, th_] := Block[{t$95$1 = N[(N[Cos[th], $MachinePrecision] / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(a1 * a1 + N[(a2 * a2), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[(t$95$1 * N[(a1 * a1), $MachinePrecision]), $MachinePrecision] + N[(t$95$1 * N[(a2 * a2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -5e-274], N[(N[(N[Sqrt[2.0], $MachinePrecision] * N[(-0.25 * N[(th * th), $MachinePrecision] + 0.5), $MachinePrecision]), $MachinePrecision] * t$95$2), $MachinePrecision], N[(N[(0.5 * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * t$95$2), $MachinePrecision]]]]
\begin{array}{l}
[a1, a2, th] = \mathsf{sort}([a1, a2, th])\\
\\
\begin{array}{l}
t_1 := \frac{\cos th}{\sqrt{2}}\\
t_2 := \mathsf{fma}\left(a1, a1, a2 \cdot a2\right)\\
\mathbf{if}\;t\_1 \cdot \left(a1 \cdot a1\right) + t\_1 \cdot \left(a2 \cdot a2\right) \leq -5 \cdot 10^{-274}:\\
\;\;\;\;\left(\sqrt{2} \cdot \mathsf{fma}\left(-0.25, th \cdot th, 0.5\right)\right) \cdot t\_2\\
\mathbf{else}:\\
\;\;\;\;\left(0.5 \cdot \sqrt{2}\right) \cdot t\_2\\
\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-274Initial program 98.3%
lift-+.f64N/A
+-commutativeN/A
lift-*.f64N/A
lift-/.f64N/A
frac-2negN/A
associate-*l/N/A
lift-*.f64N/A
lift-/.f64N/A
frac-2negN/A
associate-*l/N/A
frac-addN/A
sqr-neg-revN/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
rem-square-sqrtN/A
Applied rewrites99.7%
Taylor expanded in a1 around 0
distribute-lft-inN/A
distribute-rgt-outN/A
associate-*r*N/A
lower-*.f64N/A
*-commutativeN/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-cos.f64N/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f6498.2
Applied rewrites98.2%
Taylor expanded in th around 0
Applied rewrites58.5%
if -5e-274 < (+.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%
lift-+.f64N/A
+-commutativeN/A
lift-*.f64N/A
lift-/.f64N/A
frac-2negN/A
associate-*l/N/A
lift-*.f64N/A
lift-/.f64N/A
frac-2negN/A
associate-*l/N/A
frac-addN/A
sqr-neg-revN/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
rem-square-sqrtN/A
Applied rewrites99.7%
Taylor expanded in th around 0
distribute-rgt-outN/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f6484.2
Applied rewrites84.2%
NOTE: a1, a2, and th should be sorted in increasing order before calling this function. (FPCore (a1 a2 th) :precision binary64 (/ (fma (* a2 (cos th)) (* a2 (sqrt 2.0)) (* (* a1 (cos th)) (* a1 (sqrt 2.0)))) 2.0))
assert(a1 < a2 && a2 < th);
double code(double a1, double a2, double th) {
return fma((a2 * cos(th)), (a2 * sqrt(2.0)), ((a1 * cos(th)) * (a1 * sqrt(2.0)))) / 2.0;
}
a1, a2, th = sort([a1, a2, th]) function code(a1, a2, th) return Float64(fma(Float64(a2 * cos(th)), Float64(a2 * sqrt(2.0)), Float64(Float64(a1 * cos(th)) * Float64(a1 * sqrt(2.0)))) / 2.0) end
NOTE: a1, a2, and th should be sorted in increasing order before calling this function. code[a1_, a2_, th_] := N[(N[(N[(a2 * N[Cos[th], $MachinePrecision]), $MachinePrecision] * N[(a2 * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] + N[(N[(a1 * N[Cos[th], $MachinePrecision]), $MachinePrecision] * N[(a1 * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / 2.0), $MachinePrecision]
\begin{array}{l}
[a1, a2, th] = \mathsf{sort}([a1, a2, th])\\
\\
\frac{\mathsf{fma}\left(a2 \cdot \cos th, a2 \cdot \sqrt{2}, \left(a1 \cdot \cos th\right) \cdot \left(a1 \cdot \sqrt{2}\right)\right)}{2}
\end{array}
Initial program 99.3%
lift-+.f64N/A
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
frac-addN/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
rem-square-sqrtN/A
lower-/.f64N/A
Applied rewrites99.7%
NOTE: a1, a2, and th should be sorted in increasing order before calling this function. (FPCore (a1 a2 th) :precision binary64 (/ (fma (* (cos th) a2) a2 (* (* a1 (cos th)) a1)) (sqrt 2.0)))
assert(a1 < a2 && a2 < th);
double code(double a1, double a2, double th) {
return fma((cos(th) * a2), a2, ((a1 * cos(th)) * a1)) / sqrt(2.0);
}
a1, a2, th = sort([a1, a2, th]) function code(a1, a2, th) return Float64(fma(Float64(cos(th) * a2), a2, Float64(Float64(a1 * cos(th)) * a1)) / sqrt(2.0)) end
NOTE: a1, a2, and th should be sorted in increasing order before calling this function. code[a1_, a2_, th_] := N[(N[(N[(N[Cos[th], $MachinePrecision] * a2), $MachinePrecision] * a2 + N[(N[(a1 * N[Cos[th], $MachinePrecision]), $MachinePrecision] * a1), $MachinePrecision]), $MachinePrecision] / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[a1, a2, th] = \mathsf{sort}([a1, a2, th])\\
\\
\frac{\mathsf{fma}\left(\cos th \cdot a2, a2, \left(a1 \cdot \cos th\right) \cdot a1\right)}{\sqrt{2}}
\end{array}
Initial program 99.3%
lift-+.f64N/A
+-commutativeN/A
lift-*.f64N/A
lift-/.f64N/A
frac-2negN/A
associate-*l/N/A
lift-*.f64N/A
lift-/.f64N/A
frac-2negN/A
associate-*l/N/A
frac-addN/A
sqr-neg-revN/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
rem-square-sqrtN/A
Applied rewrites99.7%
lift-/.f64N/A
lift-fma.f64N/A
lift-*.f64N/A
rem-square-sqrtN/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
sqr-neg-revN/A
lift-neg.f64N/A
lift-neg.f64N/A
frac-addN/A
lift-*.f64N/A
Applied rewrites99.6%
NOTE: a1, a2, and th should be sorted in increasing order before calling this function. (FPCore (a1 a2 th) :precision binary64 (* (* (fma a1 a1 (* a2 a2)) (* (sqrt 2.0) 0.5)) (cos th)))
assert(a1 < a2 && a2 < th);
double code(double a1, double a2, double th) {
return (fma(a1, a1, (a2 * a2)) * (sqrt(2.0) * 0.5)) * cos(th);
}
a1, a2, th = sort([a1, a2, th]) function code(a1, a2, th) return Float64(Float64(fma(a1, a1, Float64(a2 * a2)) * Float64(sqrt(2.0) * 0.5)) * cos(th)) end
NOTE: a1, a2, and th should be sorted in increasing order before calling this function. code[a1_, a2_, th_] := N[(N[(N[(a1 * a1 + N[(a2 * a2), $MachinePrecision]), $MachinePrecision] * N[(N[Sqrt[2.0], $MachinePrecision] * 0.5), $MachinePrecision]), $MachinePrecision] * N[Cos[th], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[a1, a2, th] = \mathsf{sort}([a1, a2, th])\\
\\
\left(\mathsf{fma}\left(a1, a1, a2 \cdot a2\right) \cdot \left(\sqrt{2} \cdot 0.5\right)\right) \cdot \cos th
\end{array}
Initial program 99.3%
lift-+.f64N/A
+-commutativeN/A
lift-*.f64N/A
lift-/.f64N/A
frac-2negN/A
associate-*l/N/A
lift-*.f64N/A
lift-/.f64N/A
frac-2negN/A
associate-*l/N/A
frac-addN/A
sqr-neg-revN/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
rem-square-sqrtN/A
Applied rewrites99.7%
Taylor expanded in a1 around 0
distribute-lft-inN/A
distribute-rgt-outN/A
associate-*r*N/A
lower-*.f64N/A
*-commutativeN/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-cos.f64N/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f6499.3
Applied rewrites99.3%
Applied rewrites99.3%
NOTE: a1, a2, and th should be sorted in increasing order before calling this function. (FPCore (a1 a2 th) :precision binary64 (* (* (* 0.5 (sqrt 2.0)) (cos th)) (fma a1 a1 (* a2 a2))))
assert(a1 < a2 && a2 < th);
double code(double a1, double a2, double th) {
return ((0.5 * sqrt(2.0)) * cos(th)) * fma(a1, a1, (a2 * a2));
}
a1, a2, th = sort([a1, a2, th]) function code(a1, a2, th) return Float64(Float64(Float64(0.5 * sqrt(2.0)) * cos(th)) * fma(a1, a1, Float64(a2 * a2))) end
NOTE: a1, a2, and th should be sorted in increasing order before calling this function. code[a1_, a2_, th_] := N[(N[(N[(0.5 * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * N[Cos[th], $MachinePrecision]), $MachinePrecision] * N[(a1 * a1 + N[(a2 * a2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[a1, a2, th] = \mathsf{sort}([a1, a2, th])\\
\\
\left(\left(0.5 \cdot \sqrt{2}\right) \cdot \cos th\right) \cdot \mathsf{fma}\left(a1, a1, a2 \cdot a2\right)
\end{array}
Initial program 99.3%
lift-+.f64N/A
+-commutativeN/A
lift-*.f64N/A
lift-/.f64N/A
frac-2negN/A
associate-*l/N/A
lift-*.f64N/A
lift-/.f64N/A
frac-2negN/A
associate-*l/N/A
frac-addN/A
sqr-neg-revN/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
rem-square-sqrtN/A
Applied rewrites99.7%
Taylor expanded in a1 around 0
distribute-lft-inN/A
distribute-rgt-outN/A
associate-*r*N/A
lower-*.f64N/A
*-commutativeN/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-cos.f64N/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f6499.3
Applied rewrites99.3%
NOTE: a1, a2, and th should be sorted in increasing order before calling this function. (FPCore (a1 a2 th) :precision binary64 (* (* (cos th) a2) (/ a2 (sqrt 2.0))))
assert(a1 < a2 && a2 < th);
double code(double a1, double a2, double th) {
return (cos(th) * a2) * (a2 / sqrt(2.0));
}
NOTE: a1, a2, and th should be sorted in increasing order before calling this function.
real(8) function code(a1, a2, th)
real(8), intent (in) :: a1
real(8), intent (in) :: a2
real(8), intent (in) :: th
code = (cos(th) * a2) * (a2 / sqrt(2.0d0))
end function
assert a1 < a2 && a2 < th;
public static double code(double a1, double a2, double th) {
return (Math.cos(th) * a2) * (a2 / Math.sqrt(2.0));
}
[a1, a2, th] = sort([a1, a2, th]) def code(a1, a2, th): return (math.cos(th) * a2) * (a2 / math.sqrt(2.0))
a1, a2, th = sort([a1, a2, th]) function code(a1, a2, th) return Float64(Float64(cos(th) * a2) * Float64(a2 / sqrt(2.0))) end
a1, a2, th = num2cell(sort([a1, a2, th])){:}
function tmp = code(a1, a2, th)
tmp = (cos(th) * a2) * (a2 / sqrt(2.0));
end
NOTE: a1, a2, and th should be sorted in increasing order before calling this function. code[a1_, a2_, th_] := N[(N[(N[Cos[th], $MachinePrecision] * a2), $MachinePrecision] * N[(a2 / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[a1, a2, th] = \mathsf{sort}([a1, a2, th])\\
\\
\left(\cos th \cdot a2\right) \cdot \frac{a2}{\sqrt{2}}
\end{array}
Initial program 99.3%
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.f6458.2
Applied rewrites58.2%
NOTE: a1, a2, and th should be sorted in increasing order before calling this function. (FPCore (a1 a2 th) :precision binary64 (* (* 0.5 (* a2 a2)) (* (sqrt 2.0) (cos th))))
assert(a1 < a2 && a2 < th);
double code(double a1, double a2, double th) {
return (0.5 * (a2 * a2)) * (sqrt(2.0) * cos(th));
}
NOTE: a1, a2, and th should be sorted in increasing order before calling this function.
real(8) function code(a1, a2, th)
real(8), intent (in) :: a1
real(8), intent (in) :: a2
real(8), intent (in) :: th
code = (0.5d0 * (a2 * a2)) * (sqrt(2.0d0) * cos(th))
end function
assert a1 < a2 && a2 < th;
public static double code(double a1, double a2, double th) {
return (0.5 * (a2 * a2)) * (Math.sqrt(2.0) * Math.cos(th));
}
[a1, a2, th] = sort([a1, a2, th]) def code(a1, a2, th): return (0.5 * (a2 * a2)) * (math.sqrt(2.0) * math.cos(th))
a1, a2, th = sort([a1, a2, th]) function code(a1, a2, th) return Float64(Float64(0.5 * Float64(a2 * a2)) * Float64(sqrt(2.0) * cos(th))) end
a1, a2, th = num2cell(sort([a1, a2, th])){:}
function tmp = code(a1, a2, th)
tmp = (0.5 * (a2 * a2)) * (sqrt(2.0) * cos(th));
end
NOTE: a1, a2, and th should be sorted in increasing order before calling this function. code[a1_, a2_, th_] := N[(N[(0.5 * N[(a2 * a2), $MachinePrecision]), $MachinePrecision] * N[(N[Sqrt[2.0], $MachinePrecision] * N[Cos[th], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[a1, a2, th] = \mathsf{sort}([a1, a2, th])\\
\\
\left(0.5 \cdot \left(a2 \cdot a2\right)\right) \cdot \left(\sqrt{2} \cdot \cos th\right)
\end{array}
Initial program 99.3%
lift-+.f64N/A
+-commutativeN/A
lift-*.f64N/A
lift-/.f64N/A
frac-2negN/A
associate-*l/N/A
lift-*.f64N/A
lift-/.f64N/A
frac-2negN/A
associate-*l/N/A
frac-addN/A
sqr-neg-revN/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
rem-square-sqrtN/A
Applied rewrites99.7%
Taylor expanded in a1 around 0
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-cos.f6457.9
Applied rewrites57.9%
NOTE: a1, a2, and th should be sorted in increasing order before calling this function. (FPCore (a1 a2 th) :precision binary64 (* (* 0.5 (sqrt 2.0)) (fma a1 a1 (* a2 a2))))
assert(a1 < a2 && a2 < th);
double code(double a1, double a2, double th) {
return (0.5 * sqrt(2.0)) * fma(a1, a1, (a2 * a2));
}
a1, a2, th = sort([a1, a2, th]) function code(a1, a2, th) return Float64(Float64(0.5 * sqrt(2.0)) * fma(a1, a1, Float64(a2 * a2))) end
NOTE: a1, a2, and th should be sorted in increasing order before calling this function. code[a1_, a2_, th_] := N[(N[(0.5 * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * N[(a1 * a1 + N[(a2 * a2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[a1, a2, th] = \mathsf{sort}([a1, a2, th])\\
\\
\left(0.5 \cdot \sqrt{2}\right) \cdot \mathsf{fma}\left(a1, a1, a2 \cdot a2\right)
\end{array}
Initial program 99.3%
lift-+.f64N/A
+-commutativeN/A
lift-*.f64N/A
lift-/.f64N/A
frac-2negN/A
associate-*l/N/A
lift-*.f64N/A
lift-/.f64N/A
frac-2negN/A
associate-*l/N/A
frac-addN/A
sqr-neg-revN/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
rem-square-sqrtN/A
Applied rewrites99.7%
Taylor expanded in th around 0
distribute-rgt-outN/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f6464.3
Applied rewrites64.3%
NOTE: a1, a2, and th should be sorted in increasing order before calling this function. (FPCore (a1 a2 th) :precision binary64 (/ (* a2 a2) (sqrt 2.0)))
assert(a1 < a2 && a2 < th);
double code(double a1, double a2, double th) {
return (a2 * a2) / sqrt(2.0);
}
NOTE: a1, a2, and th should be sorted in increasing order before calling this function.
real(8) function code(a1, a2, th)
real(8), intent (in) :: a1
real(8), intent (in) :: a2
real(8), intent (in) :: th
code = (a2 * a2) / sqrt(2.0d0)
end function
assert a1 < a2 && a2 < th;
public static double code(double a1, double a2, double th) {
return (a2 * a2) / Math.sqrt(2.0);
}
[a1, a2, th] = sort([a1, a2, th]) def code(a1, a2, th): return (a2 * a2) / math.sqrt(2.0)
a1, a2, th = sort([a1, a2, th]) function code(a1, a2, th) return Float64(Float64(a2 * a2) / sqrt(2.0)) end
a1, a2, th = num2cell(sort([a1, a2, th])){:}
function tmp = code(a1, a2, th)
tmp = (a2 * a2) / sqrt(2.0);
end
NOTE: a1, a2, and th should be sorted in increasing order before calling this function. code[a1_, a2_, th_] := N[(N[(a2 * a2), $MachinePrecision] / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[a1, a2, th] = \mathsf{sort}([a1, a2, th])\\
\\
\frac{a2 \cdot a2}{\sqrt{2}}
\end{array}
Initial program 99.3%
Taylor expanded in th around 0
div-add-revN/A
lower-/.f64N/A
+-commutativeN/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
lower-sqrt.f6464.3
Applied rewrites64.3%
Taylor expanded in a1 around 0
Applied rewrites41.9%
NOTE: a1, a2, and th should be sorted in increasing order before calling this function. (FPCore (a1 a2 th) :precision binary64 (* a2 (/ a2 (sqrt 2.0))))
assert(a1 < a2 && a2 < th);
double code(double a1, double a2, double th) {
return a2 * (a2 / sqrt(2.0));
}
NOTE: a1, a2, and th should be sorted in increasing order before calling this function.
real(8) function code(a1, a2, th)
real(8), intent (in) :: a1
real(8), intent (in) :: a2
real(8), intent (in) :: th
code = a2 * (a2 / sqrt(2.0d0))
end function
assert a1 < a2 && a2 < th;
public static double code(double a1, double a2, double th) {
return a2 * (a2 / Math.sqrt(2.0));
}
[a1, a2, th] = sort([a1, a2, th]) def code(a1, a2, th): return a2 * (a2 / math.sqrt(2.0))
a1, a2, th = sort([a1, a2, th]) function code(a1, a2, th) return Float64(a2 * Float64(a2 / sqrt(2.0))) end
a1, a2, th = num2cell(sort([a1, a2, th])){:}
function tmp = code(a1, a2, th)
tmp = a2 * (a2 / sqrt(2.0));
end
NOTE: a1, a2, and th should be sorted in increasing order before calling this function. code[a1_, a2_, th_] := N[(a2 * N[(a2 / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[a1, a2, th] = \mathsf{sort}([a1, a2, th])\\
\\
a2 \cdot \frac{a2}{\sqrt{2}}
\end{array}
Initial program 99.3%
Taylor expanded in th around 0
div-add-revN/A
lower-/.f64N/A
+-commutativeN/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
lower-sqrt.f6464.3
Applied rewrites64.3%
Taylor expanded in a1 around 0
Applied rewrites41.9%
NOTE: a1, a2, and th should be sorted in increasing order before calling this function. (FPCore (a1 a2 th) :precision binary64 (* a1 (/ a1 (sqrt 2.0))))
assert(a1 < a2 && a2 < th);
double code(double a1, double a2, double th) {
return a1 * (a1 / sqrt(2.0));
}
NOTE: a1, a2, and th should be sorted in increasing order before calling this function.
real(8) function code(a1, a2, th)
real(8), intent (in) :: a1
real(8), intent (in) :: a2
real(8), intent (in) :: th
code = a1 * (a1 / sqrt(2.0d0))
end function
assert a1 < a2 && a2 < th;
public static double code(double a1, double a2, double th) {
return a1 * (a1 / Math.sqrt(2.0));
}
[a1, a2, th] = sort([a1, a2, th]) def code(a1, a2, th): return a1 * (a1 / math.sqrt(2.0))
a1, a2, th = sort([a1, a2, th]) function code(a1, a2, th) return Float64(a1 * Float64(a1 / sqrt(2.0))) end
a1, a2, th = num2cell(sort([a1, a2, th])){:}
function tmp = code(a1, a2, th)
tmp = a1 * (a1 / sqrt(2.0));
end
NOTE: a1, a2, and th should be sorted in increasing order before calling this function. code[a1_, a2_, th_] := N[(a1 * N[(a1 / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[a1, a2, th] = \mathsf{sort}([a1, a2, th])\\
\\
a1 \cdot \frac{a1}{\sqrt{2}}
\end{array}
Initial program 99.3%
Taylor expanded in th around 0
div-add-revN/A
lower-/.f64N/A
+-commutativeN/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
lower-sqrt.f6464.3
Applied rewrites64.3%
Taylor expanded in a1 around inf
Applied rewrites39.4%
herbie shell --seed 2024332
(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))))