
(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}
NOTE: a1, a2, and th should be sorted in increasing order before calling this function. (FPCore (a1 a2 th) :precision binary64 (* (* (cos th) (fma a2 a2 (* a1 a1))) (pow 2.0 -0.5)))
assert(a1 < a2 && a2 < th);
double code(double a1, double a2, double th) {
return (cos(th) * fma(a2, a2, (a1 * a1))) * pow(2.0, -0.5);
}
a1, a2, th = sort([a1, a2, th]) function code(a1, a2, th) return Float64(Float64(cos(th) * fma(a2, a2, Float64(a1 * a1))) * (2.0 ^ -0.5)) 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] * N[(a2 * a2 + N[(a1 * a1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[Power[2.0, -0.5], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[a1, a2, th] = \mathsf{sort}([a1, a2, th])\\
\\
\left(\cos th \cdot \mathsf{fma}\left(a2, a2, a1 \cdot a1\right)\right) \cdot {2}^{-0.5}
\end{array}
Initial program 99.6%
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.6
Applied rewrites99.6%
Final simplification99.6%
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 (* a2 a2)) (* t_1 (* a1 a1))) -2e-182)
(* (fma (* th th) -0.5 1.0) (* (sqrt 0.5) (fma a1 a1 (* a2 a2))))
(fma (/ a1 (sqrt 2.0)) a1 (/ a2 (/ (sqrt 2.0) 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 * (a2 * a2)) + (t_1 * (a1 * a1))) <= -2e-182) {
tmp = fma((th * th), -0.5, 1.0) * (sqrt(0.5) * fma(a1, a1, (a2 * a2)));
} else {
tmp = fma((a1 / sqrt(2.0)), a1, (a2 / (sqrt(2.0) / 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(a2 * a2)) + Float64(t_1 * Float64(a1 * a1))) <= -2e-182) tmp = Float64(fma(Float64(th * th), -0.5, 1.0) * Float64(sqrt(0.5) * fma(a1, a1, Float64(a2 * a2)))); else tmp = fma(Float64(a1 / sqrt(2.0)), a1, Float64(a2 / Float64(sqrt(2.0) / 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[(a2 * a2), $MachinePrecision]), $MachinePrecision] + N[(t$95$1 * N[(a1 * a1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -2e-182], N[(N[(N[(th * th), $MachinePrecision] * -0.5 + 1.0), $MachinePrecision] * N[(N[Sqrt[0.5], $MachinePrecision] * N[(a1 * a1 + N[(a2 * a2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(a1 / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * a1 + N[(a2 / N[(N[Sqrt[2.0], $MachinePrecision] / 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(a2 \cdot a2\right) + t\_1 \cdot \left(a1 \cdot a1\right) \leq -2 \cdot 10^{-182}:\\
\;\;\;\;\mathsf{fma}\left(th \cdot th, -0.5, 1\right) \cdot \left(\sqrt{0.5} \cdot \mathsf{fma}\left(a1, a1, a2 \cdot a2\right)\right)\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(\frac{a1}{\sqrt{2}}, a1, \frac{a2}{\frac{\sqrt{2}}{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))) < -2.0000000000000001e-182Initial program 99.5%
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.5
Applied rewrites99.5%
Taylor expanded in th around 0
associate-*r*N/A
distribute-lft1-inN/A
+-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
lower-sqrt.f6451.2
Applied rewrites51.2%
if -2.0000000000000001e-182 < (+.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%
Taylor expanded in th around 0
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.f6484.2
Applied rewrites84.2%
Applied rewrites84.2%
Final simplification76.5%
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 (* a2 a2)) (* t_1 (* a1 a1))) -2e-182)
(* (fma (* th th) -0.5 1.0) (* (sqrt 0.5) (fma a1 a1 (* a2 a2))))
(fma (/ a1 (sqrt 2.0)) a1 (* (/ a2 (sqrt 2.0)) 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 * (a2 * a2)) + (t_1 * (a1 * a1))) <= -2e-182) {
tmp = fma((th * th), -0.5, 1.0) * (sqrt(0.5) * fma(a1, a1, (a2 * a2)));
} else {
tmp = fma((a1 / sqrt(2.0)), a1, ((a2 / sqrt(2.0)) * 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(a2 * a2)) + Float64(t_1 * Float64(a1 * a1))) <= -2e-182) tmp = Float64(fma(Float64(th * th), -0.5, 1.0) * Float64(sqrt(0.5) * fma(a1, a1, Float64(a2 * a2)))); else tmp = fma(Float64(a1 / sqrt(2.0)), a1, Float64(Float64(a2 / sqrt(2.0)) * 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[(a2 * a2), $MachinePrecision]), $MachinePrecision] + N[(t$95$1 * N[(a1 * a1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -2e-182], N[(N[(N[(th * th), $MachinePrecision] * -0.5 + 1.0), $MachinePrecision] * N[(N[Sqrt[0.5], $MachinePrecision] * N[(a1 * a1 + N[(a2 * a2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(a1 / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * a1 + N[(N[(a2 / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * a2), $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(a2 \cdot a2\right) + t\_1 \cdot \left(a1 \cdot a1\right) \leq -2 \cdot 10^{-182}:\\
\;\;\;\;\mathsf{fma}\left(th \cdot th, -0.5, 1\right) \cdot \left(\sqrt{0.5} \cdot \mathsf{fma}\left(a1, a1, a2 \cdot a2\right)\right)\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(\frac{a1}{\sqrt{2}}, a1, \frac{a2}{\sqrt{2}} \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))) < -2.0000000000000001e-182Initial program 99.5%
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.5
Applied rewrites99.5%
Taylor expanded in th around 0
associate-*r*N/A
distribute-lft1-inN/A
+-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
lower-sqrt.f6451.2
Applied rewrites51.2%
if -2.0000000000000001e-182 < (+.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%
Taylor expanded in th around 0
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.f6484.2
Applied rewrites84.2%
Final simplification76.5%
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 (* (sqrt 0.5) (fma a1 a1 (* a2 a2)))))
(if (<= (+ (* t_1 (* a2 a2)) (* t_1 (* a1 a1))) -2e-182)
(* (fma (* th th) -0.5 1.0) t_2)
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 = sqrt(0.5) * fma(a1, a1, (a2 * a2));
double tmp;
if (((t_1 * (a2 * a2)) + (t_1 * (a1 * a1))) <= -2e-182) {
tmp = fma((th * th), -0.5, 1.0) * t_2;
} else {
tmp = 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 = Float64(sqrt(0.5) * fma(a1, a1, Float64(a2 * a2))) tmp = 0.0 if (Float64(Float64(t_1 * Float64(a2 * a2)) + Float64(t_1 * Float64(a1 * a1))) <= -2e-182) tmp = Float64(fma(Float64(th * th), -0.5, 1.0) * t_2); else tmp = 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[(N[Sqrt[0.5], $MachinePrecision] * N[(a1 * a1 + N[(a2 * a2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[(t$95$1 * N[(a2 * a2), $MachinePrecision]), $MachinePrecision] + N[(t$95$1 * N[(a1 * a1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -2e-182], N[(N[(N[(th * th), $MachinePrecision] * -0.5 + 1.0), $MachinePrecision] * t$95$2), $MachinePrecision], t$95$2]]]
\begin{array}{l}
[a1, a2, th] = \mathsf{sort}([a1, a2, th])\\
\\
\begin{array}{l}
t_1 := \frac{\cos th}{\sqrt{2}}\\
t_2 := \sqrt{0.5} \cdot \mathsf{fma}\left(a1, a1, a2 \cdot a2\right)\\
\mathbf{if}\;t\_1 \cdot \left(a2 \cdot a2\right) + t\_1 \cdot \left(a1 \cdot a1\right) \leq -2 \cdot 10^{-182}:\\
\;\;\;\;\mathsf{fma}\left(th \cdot th, -0.5, 1\right) \cdot t\_2\\
\mathbf{else}:\\
\;\;\;\;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))) < -2.0000000000000001e-182Initial program 99.5%
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.5
Applied rewrites99.5%
Taylor expanded in th around 0
associate-*r*N/A
distribute-lft1-inN/A
+-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
lower-sqrt.f6451.2
Applied rewrites51.2%
if -2.0000000000000001e-182 < (+.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
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.6
Applied rewrites99.6%
Taylor expanded in th around 0
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
lower-sqrt.f6484.2
Applied rewrites84.2%
Final simplification76.5%
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 (* a2 a2)) (* t_1 (* a1 a1))) -2e-182)
(* (* (* th th) -0.5) (* (/ a2 (sqrt 2.0)) a2))
(* (sqrt 0.5) (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 * (a2 * a2)) + (t_1 * (a1 * a1))) <= -2e-182) {
tmp = ((th * th) * -0.5) * ((a2 / sqrt(2.0)) * a2);
} else {
tmp = sqrt(0.5) * 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(a2 * a2)) + Float64(t_1 * Float64(a1 * a1))) <= -2e-182) tmp = Float64(Float64(Float64(th * th) * -0.5) * Float64(Float64(a2 / sqrt(2.0)) * a2)); else tmp = Float64(sqrt(0.5) * 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[(a2 * a2), $MachinePrecision]), $MachinePrecision] + N[(t$95$1 * N[(a1 * a1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -2e-182], N[(N[(N[(th * th), $MachinePrecision] * -0.5), $MachinePrecision] * N[(N[(a2 / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * a2), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[0.5], $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(a2 \cdot a2\right) + t\_1 \cdot \left(a1 \cdot a1\right) \leq -2 \cdot 10^{-182}:\\
\;\;\;\;\left(\left(th \cdot th\right) \cdot -0.5\right) \cdot \left(\frac{a2}{\sqrt{2}} \cdot a2\right)\\
\mathbf{else}:\\
\;\;\;\;\sqrt{0.5} \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))) < -2.0000000000000001e-182Initial 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.f6456.6
Applied rewrites56.6%
Taylor expanded in th around 0
Applied rewrites42.8%
Taylor expanded in th around inf
Applied rewrites42.8%
if -2.0000000000000001e-182 < (+.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
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.6
Applied rewrites99.6%
Taylor expanded in th around 0
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
lower-sqrt.f6484.2
Applied rewrites84.2%
Final simplification74.5%
NOTE: a1, a2, and th should be sorted in increasing order before calling this function. (FPCore (a1 a2 th) :precision binary64 (* (* (sqrt 0.5) (fma a1 a1 (* a2 a2))) (cos th)))
assert(a1 < a2 && a2 < th);
double code(double a1, double a2, double th) {
return (sqrt(0.5) * fma(a1, a1, (a2 * a2))) * cos(th);
}
a1, a2, th = sort([a1, a2, th]) function code(a1, a2, th) return Float64(Float64(sqrt(0.5) * fma(a1, a1, Float64(a2 * a2))) * 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[Sqrt[0.5], $MachinePrecision] * N[(a1 * a1 + N[(a2 * a2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[Cos[th], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[a1, a2, th] = \mathsf{sort}([a1, a2, th])\\
\\
\left(\sqrt{0.5} \cdot \mathsf{fma}\left(a1, a1, a2 \cdot a2\right)\right) \cdot \cos th
\end{array}
Initial program 99.6%
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.6
Applied rewrites99.6%
Taylor expanded in a1 around 0
distribute-rgt-outN/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-cos.f6499.6
Applied rewrites99.6%
Final simplification99.6%
NOTE: a1, a2, and th should be sorted in increasing order before calling this function. (FPCore (a1 a2 th) :precision binary64 (* (* (* (sqrt 0.5) a2) a2) (cos th)))
assert(a1 < a2 && a2 < th);
double code(double a1, double a2, double th) {
return ((sqrt(0.5) * a2) * a2) * 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 = ((sqrt(0.5d0) * a2) * a2) * cos(th)
end function
assert a1 < a2 && a2 < th;
public static double code(double a1, double a2, double th) {
return ((Math.sqrt(0.5) * a2) * a2) * Math.cos(th);
}
[a1, a2, th] = sort([a1, a2, th]) def code(a1, a2, th): return ((math.sqrt(0.5) * a2) * a2) * math.cos(th)
a1, a2, th = sort([a1, a2, th]) function code(a1, a2, th) return Float64(Float64(Float64(sqrt(0.5) * a2) * a2) * cos(th)) end
a1, a2, th = num2cell(sort([a1, a2, th])){:}
function tmp = code(a1, a2, th)
tmp = ((sqrt(0.5) * a2) * a2) * 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[(N[Sqrt[0.5], $MachinePrecision] * a2), $MachinePrecision] * a2), $MachinePrecision] * N[Cos[th], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[a1, a2, th] = \mathsf{sort}([a1, a2, th])\\
\\
\left(\left(\sqrt{0.5} \cdot a2\right) \cdot a2\right) \cdot \cos th
\end{array}
Initial program 99.6%
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.6
Applied rewrites99.6%
Taylor expanded in a1 around 0
distribute-rgt-outN/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-cos.f6499.6
Applied rewrites99.6%
Taylor expanded in a1 around 0
Applied rewrites57.0%
NOTE: a1, a2, and th should be sorted in increasing order before calling this function. (FPCore (a1 a2 th) :precision binary64 (* (sqrt 0.5) (fma a1 a1 (* a2 a2))))
assert(a1 < a2 && a2 < th);
double code(double a1, double a2, double th) {
return sqrt(0.5) * fma(a1, a1, (a2 * a2));
}
a1, a2, th = sort([a1, a2, th]) function code(a1, a2, th) return Float64(sqrt(0.5) * 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[Sqrt[0.5], $MachinePrecision] * N[(a1 * a1 + N[(a2 * a2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[a1, a2, th] = \mathsf{sort}([a1, a2, th])\\
\\
\sqrt{0.5} \cdot \mathsf{fma}\left(a1, a1, a2 \cdot a2\right)
\end{array}
Initial program 99.6%
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.6
Applied rewrites99.6%
Taylor expanded in th around 0
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
lower-sqrt.f6464.6
Applied rewrites64.6%
Final simplification64.6%
NOTE: a1, a2, and th should be sorted in increasing order before calling this function. (FPCore (a1 a2 th) :precision binary64 (* (* (sqrt 0.5) a2) a2))
assert(a1 < a2 && a2 < th);
double code(double a1, double a2, double th) {
return (sqrt(0.5) * a2) * a2;
}
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 = (sqrt(0.5d0) * a2) * a2
end function
assert a1 < a2 && a2 < th;
public static double code(double a1, double a2, double th) {
return (Math.sqrt(0.5) * a2) * a2;
}
[a1, a2, th] = sort([a1, a2, th]) def code(a1, a2, th): return (math.sqrt(0.5) * a2) * a2
a1, a2, th = sort([a1, a2, th]) function code(a1, a2, th) return Float64(Float64(sqrt(0.5) * a2) * a2) end
a1, a2, th = num2cell(sort([a1, a2, th])){:}
function tmp = code(a1, a2, th)
tmp = (sqrt(0.5) * 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[Sqrt[0.5], $MachinePrecision] * a2), $MachinePrecision] * a2), $MachinePrecision]
\begin{array}{l}
[a1, a2, th] = \mathsf{sort}([a1, a2, th])\\
\\
\left(\sqrt{0.5} \cdot a2\right) \cdot a2
\end{array}
Initial program 99.6%
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.6
Applied rewrites99.6%
Taylor expanded in th around 0
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
lower-sqrt.f6464.6
Applied rewrites64.6%
Taylor expanded in a1 around 0
Applied rewrites38.9%
NOTE: a1, a2, and th should be sorted in increasing order before calling this function. (FPCore (a1 a2 th) :precision binary64 (* (* (sqrt 0.5) a1) a1))
assert(a1 < a2 && a2 < th);
double code(double a1, double a2, double th) {
return (sqrt(0.5) * a1) * a1;
}
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 = (sqrt(0.5d0) * a1) * a1
end function
assert a1 < a2 && a2 < th;
public static double code(double a1, double a2, double th) {
return (Math.sqrt(0.5) * a1) * a1;
}
[a1, a2, th] = sort([a1, a2, th]) def code(a1, a2, th): return (math.sqrt(0.5) * a1) * a1
a1, a2, th = sort([a1, a2, th]) function code(a1, a2, th) return Float64(Float64(sqrt(0.5) * a1) * a1) end
a1, a2, th = num2cell(sort([a1, a2, th])){:}
function tmp = code(a1, a2, th)
tmp = (sqrt(0.5) * a1) * a1;
end
NOTE: a1, a2, and th should be sorted in increasing order before calling this function. code[a1_, a2_, th_] := N[(N[(N[Sqrt[0.5], $MachinePrecision] * a1), $MachinePrecision] * a1), $MachinePrecision]
\begin{array}{l}
[a1, a2, th] = \mathsf{sort}([a1, a2, th])\\
\\
\left(\sqrt{0.5} \cdot a1\right) \cdot a1
\end{array}
Initial program 99.6%
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.6
Applied rewrites99.6%
Taylor expanded in th around 0
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
lower-sqrt.f6464.6
Applied rewrites64.6%
Taylor expanded in a1 around inf
Applied rewrites39.5%
herbie shell --seed 2024256
(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))))