
(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}
NOTE: a1, a2, and th should be sorted in increasing order before calling this function. (FPCore (a1 a2 th) :precision binary64 (/ (/ (fma a2 a2 (* a1 a1)) (sqrt 2.0)) (/ 1.0 (cos th))))
assert(a1 < a2 && a2 < th);
double code(double a1, double a2, double th) {
return (fma(a2, a2, (a1 * a1)) / sqrt(2.0)) / (1.0 / cos(th));
}
a1, a2, th = sort([a1, a2, th]) function code(a1, a2, th) return Float64(Float64(fma(a2, a2, Float64(a1 * a1)) / sqrt(2.0)) / Float64(1.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[(N[(a2 * a2 + N[(a1 * a1), $MachinePrecision]), $MachinePrecision] / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] / N[(1.0 / N[Cos[th], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[a1, a2, th] = \mathsf{sort}([a1, a2, th])\\
\\
\frac{\frac{\mathsf{fma}\left(a2, a2, a1 \cdot a1\right)}{\sqrt{2}}}{\frac{1}{\cos th}}
\end{array}
Initial program 99.6%
lift-+.f64N/A
lift-*.f64N/A
lift-*.f64N/A
distribute-lft-outN/A
*-commutativeN/A
lift-/.f64N/A
clear-numN/A
un-div-invN/A
div-invN/A
associate-/r*N/A
*-lft-identityN/A
associate-*l/N/A
lower-/.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
(let* ((t_1 (/ (cos th) (sqrt 2.0))))
(if (<= (+ (* t_1 (* a2 a2)) (* t_1 (* a1 a1))) -4e-241)
(* (* a2 a2) (/ (fma (* th th) -0.5 1.0) (sqrt 2.0)))
(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))) <= -4e-241) {
tmp = (a2 * a2) * (fma((th * th), -0.5, 1.0) / sqrt(2.0));
} 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))) <= -4e-241) tmp = Float64(Float64(a2 * a2) * Float64(fma(Float64(th * th), -0.5, 1.0) / sqrt(2.0))); 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], -4e-241], 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[(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 -4 \cdot 10^{-241}:\\
\;\;\;\;\left(a2 \cdot a2\right) \cdot \frac{\mathsf{fma}\left(th \cdot th, -0.5, 1\right)}{\sqrt{2}}\\
\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))) < -3.9999999999999999e-241Initial program 99.7%
lift-+.f64N/A
lift-*.f64N/A
lift-*.f64N/A
distribute-lft-outN/A
*-commutativeN/A
lift-/.f64N/A
clear-numN/A
un-div-invN/A
div-invN/A
associate-/r*N/A
*-lft-identityN/A
associate-*l/N/A
lower-/.f64N/A
Applied rewrites99.6%
Taylor expanded in a1 around 0
associate-/l*N/A
associate-/l*N/A
distribute-rgt-outN/A
lower-*.f64N/A
lower-/.f64N/A
lower-cos.f64N/A
lower-sqrt.f64N/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f6499.7
Applied rewrites99.7%
Taylor expanded in th around 0
Applied rewrites56.7%
Taylor expanded in a1 around 0
Applied rewrites45.7%
if -3.9999999999999999e-241 < (+.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
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.1
Applied rewrites84.1%
Applied rewrites84.2%
Final simplification77.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))))
(if (<= (+ (* t_1 (* a2 a2)) (* t_1 (* a1 a1))) -4e-241)
(* (* a2 a2) (/ (fma (* th th) -0.5 1.0) (sqrt 2.0)))
(/ (fma a2 a2 (* a1 a1)) (sqrt 2.0)))))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))) <= -4e-241) {
tmp = (a2 * a2) * (fma((th * th), -0.5, 1.0) / sqrt(2.0));
} else {
tmp = fma(a2, a2, (a1 * a1)) / sqrt(2.0);
}
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))) <= -4e-241) tmp = Float64(Float64(a2 * a2) * Float64(fma(Float64(th * th), -0.5, 1.0) / sqrt(2.0))); else tmp = Float64(fma(a2, a2, Float64(a1 * a1)) / sqrt(2.0)); 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], -4e-241], 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[(a2 * a2 + N[(a1 * a1), $MachinePrecision]), $MachinePrecision] / N[Sqrt[2.0], $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 -4 \cdot 10^{-241}:\\
\;\;\;\;\left(a2 \cdot a2\right) \cdot \frac{\mathsf{fma}\left(th \cdot th, -0.5, 1\right)}{\sqrt{2}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\mathsf{fma}\left(a2, a2, a1 \cdot a1\right)}{\sqrt{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))) < -3.9999999999999999e-241Initial program 99.7%
lift-+.f64N/A
lift-*.f64N/A
lift-*.f64N/A
distribute-lft-outN/A
*-commutativeN/A
lift-/.f64N/A
clear-numN/A
un-div-invN/A
div-invN/A
associate-/r*N/A
*-lft-identityN/A
associate-*l/N/A
lower-/.f64N/A
Applied rewrites99.6%
Taylor expanded in a1 around 0
associate-/l*N/A
associate-/l*N/A
distribute-rgt-outN/A
lower-*.f64N/A
lower-/.f64N/A
lower-cos.f64N/A
lower-sqrt.f64N/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f6499.7
Applied rewrites99.7%
Taylor expanded in th around 0
Applied rewrites56.7%
Taylor expanded in a1 around 0
Applied rewrites45.7%
if -3.9999999999999999e-241 < (+.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
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.1
Applied rewrites84.1%
Applied rewrites84.1%
Applied rewrites84.1%
Final simplification77.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))))
(if (<= (+ (* t_1 (* a2 a2)) (* t_1 (* a1 a1))) -2e-107)
(* (* a1 a1) (/ (fma (* th th) -0.5 1.0) (sqrt 2.0)))
(/ (fma a2 a2 (* a1 a1)) (sqrt 2.0)))))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-107) {
tmp = (a1 * a1) * (fma((th * th), -0.5, 1.0) / sqrt(2.0));
} else {
tmp = fma(a2, a2, (a1 * a1)) / sqrt(2.0);
}
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-107) tmp = Float64(Float64(a1 * a1) * Float64(fma(Float64(th * th), -0.5, 1.0) / sqrt(2.0))); else tmp = Float64(fma(a2, a2, Float64(a1 * a1)) / sqrt(2.0)); 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-107], N[(N[(a1 * a1), $MachinePrecision] * N[(N[(N[(th * th), $MachinePrecision] * -0.5 + 1.0), $MachinePrecision] / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(a2 * a2 + N[(a1 * a1), $MachinePrecision]), $MachinePrecision] / N[Sqrt[2.0], $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^{-107}:\\
\;\;\;\;\left(a1 \cdot a1\right) \cdot \frac{\mathsf{fma}\left(th \cdot th, -0.5, 1\right)}{\sqrt{2}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\mathsf{fma}\left(a2, a2, a1 \cdot a1\right)}{\sqrt{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))) < -2e-107Initial program 99.8%
lift-+.f64N/A
lift-*.f64N/A
lift-*.f64N/A
distribute-lft-outN/A
*-commutativeN/A
lift-/.f64N/A
clear-numN/A
un-div-invN/A
div-invN/A
associate-/r*N/A
*-lft-identityN/A
associate-*l/N/A
lower-/.f64N/A
Applied rewrites99.7%
Taylor expanded in a1 around 0
associate-/l*N/A
associate-/l*N/A
distribute-rgt-outN/A
lower-*.f64N/A
lower-/.f64N/A
lower-cos.f64N/A
lower-sqrt.f64N/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f6499.8
Applied rewrites99.8%
Taylor expanded in th around 0
Applied rewrites63.2%
Taylor expanded in a1 around inf
Applied rewrites46.2%
if -2e-107 < (+.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
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.f6482.3
Applied rewrites82.3%
Applied rewrites82.2%
Applied rewrites82.3%
Final simplification76.5%
NOTE: a1, a2, and th should be sorted in increasing order before calling this function. (FPCore (a1 a2 th) :precision binary64 (/ (- (fma a2 a2 (* a1 a1))) (* (/ -1.0 (cos th)) (sqrt 2.0))))
assert(a1 < a2 && a2 < th);
double code(double a1, double a2, double th) {
return -fma(a2, a2, (a1 * a1)) / ((-1.0 / cos(th)) * sqrt(2.0));
}
a1, a2, th = sort([a1, a2, th]) function code(a1, a2, th) return Float64(Float64(-fma(a2, a2, Float64(a1 * a1))) / Float64(Float64(-1.0 / cos(th)) * 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 + N[(a1 * a1), $MachinePrecision]), $MachinePrecision]) / N[(N[(-1.0 / N[Cos[th], $MachinePrecision]), $MachinePrecision] * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[a1, a2, th] = \mathsf{sort}([a1, a2, th])\\
\\
\frac{-\mathsf{fma}\left(a2, a2, a1 \cdot a1\right)}{\frac{-1}{\cos th} \cdot \sqrt{2}}
\end{array}
Initial program 99.6%
lift-+.f64N/A
lift-*.f64N/A
lift-*.f64N/A
distribute-lft-outN/A
*-commutativeN/A
lift-/.f64N/A
clear-numN/A
un-div-invN/A
div-invN/A
associate-/r*N/A
*-lft-identityN/A
associate-*l/N/A
lower-/.f64N/A
Applied rewrites99.6%
lift-/.f64N/A
lift-/.f64N/A
frac-2negN/A
associate-/l/N/A
lower-/.f64N/A
lower-neg.f64N/A
lower-*.f64N/A
lower-neg.f6499.6
Applied rewrites99.6%
lift-*.f64N/A
lift-neg.f64N/A
distribute-rgt-neg-outN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lift-/.f64N/A
distribute-neg-fracN/A
metadata-evalN/A
lower-/.f6499.6
Applied rewrites99.6%
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)) (sqrt 2.0))))
assert(a1 < a2 && a2 < th);
double code(double a1, double a2, double th) {
return cos(th) * (fma(a2, a2, (a1 * a1)) / sqrt(2.0));
}
a1, a2, th = sort([a1, a2, th]) function code(a1, a2, th) return Float64(cos(th) * Float64(fma(a2, a2, Float64(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[(N[Cos[th], $MachinePrecision] * N[(N[(a2 * a2 + N[(a1 * a1), $MachinePrecision]), $MachinePrecision] / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[a1, a2, th] = \mathsf{sort}([a1, a2, th])\\
\\
\cos th \cdot \frac{\mathsf{fma}\left(a2, a2, a1 \cdot a1\right)}{\sqrt{2}}
\end{array}
Initial program 99.6%
lift-+.f64N/A
lift-*.f64N/A
lift-*.f64N/A
distribute-lft-outN/A
lift-/.f64N/A
div-invN/A
associate-*l*N/A
*-commutativeN/A
lower-*.f64N/A
associate-*l/N/A
*-lft-identityN/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 (* (/ (cos th) (sqrt 2.0)) (fma a1 a1 (* a2 a2))))
assert(a1 < a2 && a2 < th);
double code(double a1, double a2, double th) {
return (cos(th) / sqrt(2.0)) * fma(a1, a1, (a2 * a2));
}
a1, a2, th = sort([a1, a2, th]) function code(a1, a2, th) return Float64(Float64(cos(th) / 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[(N[Cos[th], $MachinePrecision] / 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])\\
\\
\frac{\cos th}{\sqrt{2}} \cdot \mathsf{fma}\left(a1, a1, a2 \cdot a2\right)
\end{array}
Initial program 99.6%
Taylor expanded in a1 around 0
associate-/l*N/A
associate-/l*N/A
distribute-rgt-outN/A
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
lower-/.f64N/A
lower-cos.f64N/A
lower-sqrt.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 (/ (* (* (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(Float64(cos(th) * a2) * 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[(N[Cos[th], $MachinePrecision] * a2), $MachinePrecision] * a2), $MachinePrecision] / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[a1, a2, th] = \mathsf{sort}([a1, a2, th])\\
\\
\frac{\left(\cos th \cdot a2\right) \cdot a2}{\sqrt{2}}
\end{array}
Initial program 99.6%
lift-+.f64N/A
lift-*.f64N/A
lift-*.f64N/A
distribute-lft-outN/A
*-commutativeN/A
lift-/.f64N/A
clear-numN/A
un-div-invN/A
div-invN/A
associate-/r*N/A
*-lft-identityN/A
associate-*l/N/A
lower-/.f64N/A
Applied rewrites99.6%
Taylor expanded in a1 around 0
lower-/.f64N/A
*-commutativeN/A
unpow2N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-cos.f64N/A
lower-sqrt.f6457.6
Applied rewrites57.6%
NOTE: a1, a2, and th should be sorted in increasing order before calling this function. (FPCore (a1 a2 th) :precision binary64 (* (/ a2 (sqrt 2.0)) (* (cos th) a2)))
assert(a1 < a2 && a2 < th);
double code(double a1, double a2, double th) {
return (a2 / sqrt(2.0)) * (cos(th) * 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 = (a2 / sqrt(2.0d0)) * (cos(th) * a2)
end function
assert a1 < a2 && a2 < th;
public static double code(double a1, double a2, double th) {
return (a2 / Math.sqrt(2.0)) * (Math.cos(th) * a2);
}
[a1, a2, th] = sort([a1, a2, th]) def code(a1, a2, th): return (a2 / math.sqrt(2.0)) * (math.cos(th) * a2)
a1, a2, th = sort([a1, a2, th]) function code(a1, a2, th) return Float64(Float64(a2 / sqrt(2.0)) * Float64(cos(th) * a2)) end
a1, a2, th = num2cell(sort([a1, a2, th])){:}
function tmp = code(a1, a2, th)
tmp = (a2 / sqrt(2.0)) * (cos(th) * a2);
end
NOTE: a1, a2, and th should be sorted in increasing order before calling this function. code[a1_, a2_, th_] := N[(N[(a2 / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * N[(N[Cos[th], $MachinePrecision] * a2), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[a1, a2, th] = \mathsf{sort}([a1, a2, th])\\
\\
\frac{a2}{\sqrt{2}} \cdot \left(\cos th \cdot a2\right)
\end{array}
Initial program 99.6%
Taylor expanded in a1 around 0
*-commutativeN/A
unpow2N/A
associate-*r*N/A
associate-/l*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-cos.f64N/A
lower-/.f64N/A
lower-sqrt.f6457.6
Applied rewrites57.6%
Final simplification57.6%
NOTE: a1, a2, and th should be sorted in increasing order before calling this function. (FPCore (a1 a2 th) :precision binary64 (/ (fma a2 a2 (* a1 a1)) (sqrt 2.0)))
assert(a1 < a2 && a2 < th);
double code(double a1, double a2, double th) {
return fma(a2, a2, (a1 * a1)) / sqrt(2.0);
}
a1, a2, th = sort([a1, a2, th]) function code(a1, a2, th) return Float64(fma(a2, a2, Float64(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[(N[(a2 * a2 + N[(a1 * a1), $MachinePrecision]), $MachinePrecision] / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[a1, a2, th] = \mathsf{sort}([a1, a2, th])\\
\\
\frac{\mathsf{fma}\left(a2, a2, a1 \cdot a1\right)}{\sqrt{2}}
\end{array}
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.f6469.1
Applied rewrites69.1%
Applied rewrites69.1%
Applied rewrites69.2%
NOTE: a1, a2, and th should be sorted in increasing order before calling this function. (FPCore (a1 a2 th) :precision binary64 (* (/ a2 (sqrt 2.0)) a2))
assert(a1 < a2 && a2 < th);
double code(double a1, double a2, double th) {
return (a2 / sqrt(2.0)) * 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 = (a2 / sqrt(2.0d0)) * a2
end function
assert a1 < a2 && a2 < th;
public static double code(double a1, double a2, double th) {
return (a2 / Math.sqrt(2.0)) * a2;
}
[a1, a2, th] = sort([a1, a2, th]) def code(a1, a2, th): return (a2 / math.sqrt(2.0)) * a2
a1, a2, th = sort([a1, a2, th]) function code(a1, a2, th) return Float64(Float64(a2 / sqrt(2.0)) * a2) end
a1, a2, th = num2cell(sort([a1, a2, th])){:}
function tmp = code(a1, a2, th)
tmp = (a2 / sqrt(2.0)) * a2;
end
NOTE: a1, a2, and th should be sorted in increasing order before calling this function. code[a1_, a2_, th_] := N[(N[(a2 / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * a2), $MachinePrecision]
\begin{array}{l}
[a1, a2, th] = \mathsf{sort}([a1, a2, th])\\
\\
\frac{a2}{\sqrt{2}} \cdot a2
\end{array}
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.f6469.1
Applied rewrites69.1%
Taylor expanded in a1 around 0
Applied rewrites40.2%
Final simplification40.2%
NOTE: a1, a2, and th should be sorted in increasing order before calling this function. (FPCore (a1 a2 th) :precision binary64 (* (/ a1 (sqrt 2.0)) a1))
assert(a1 < a2 && a2 < th);
double code(double a1, double a2, double th) {
return (a1 / sqrt(2.0)) * 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 = (a1 / sqrt(2.0d0)) * a1
end function
assert a1 < a2 && a2 < th;
public static double code(double a1, double a2, double th) {
return (a1 / Math.sqrt(2.0)) * a1;
}
[a1, a2, th] = sort([a1, a2, th]) def code(a1, a2, th): return (a1 / math.sqrt(2.0)) * a1
a1, a2, th = sort([a1, a2, th]) function code(a1, a2, th) return Float64(Float64(a1 / sqrt(2.0)) * a1) end
a1, a2, th = num2cell(sort([a1, a2, th])){:}
function tmp = code(a1, a2, th)
tmp = (a1 / sqrt(2.0)) * a1;
end
NOTE: a1, a2, and th should be sorted in increasing order before calling this function. code[a1_, a2_, th_] := N[(N[(a1 / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * a1), $MachinePrecision]
\begin{array}{l}
[a1, a2, th] = \mathsf{sort}([a1, a2, th])\\
\\
\frac{a1}{\sqrt{2}} \cdot a1
\end{array}
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.f6469.1
Applied rewrites69.1%
Taylor expanded in a1 around inf
Applied rewrites42.1%
Final simplification42.1%
herbie shell --seed 2024235
(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))))