
(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}
a1_m = (fabs.f64 a1) NOTE: a1_m, a2, and th should be sorted in increasing order before calling this function. (FPCore (a1_m a2 th) :precision binary64 (* (fma (cos th) (* (* a2 a2) (sqrt 2.0)) (* (sqrt 2.0) (* (cos th) (* a1_m a1_m)))) 0.5))
a1_m = fabs(a1);
assert(a1_m < a2 && a2 < th);
double code(double a1_m, double a2, double th) {
return fma(cos(th), ((a2 * a2) * sqrt(2.0)), (sqrt(2.0) * (cos(th) * (a1_m * a1_m)))) * 0.5;
}
a1_m = abs(a1) a1_m, a2, th = sort([a1_m, a2, th]) function code(a1_m, a2, th) return Float64(fma(cos(th), Float64(Float64(a2 * a2) * sqrt(2.0)), Float64(sqrt(2.0) * Float64(cos(th) * Float64(a1_m * a1_m)))) * 0.5) end
a1_m = N[Abs[a1], $MachinePrecision] NOTE: a1_m, a2, and th should be sorted in increasing order before calling this function. code[a1$95$m_, a2_, th_] := N[(N[(N[Cos[th], $MachinePrecision] * N[(N[(a2 * a2), $MachinePrecision] * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] + N[(N[Sqrt[2.0], $MachinePrecision] * N[(N[Cos[th], $MachinePrecision] * N[(a1$95$m * a1$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * 0.5), $MachinePrecision]
\begin{array}{l}
a1_m = \left|a1\right|
\\
[a1_m, a2, th] = \mathsf{sort}([a1_m, a2, th])\\
\\
\mathsf{fma}\left(\cos th, \left(a2 \cdot a2\right) \cdot \sqrt{2}, \sqrt{2} \cdot \left(\cos th \cdot \left(a1\_m \cdot a1\_m\right)\right)\right) \cdot 0.5
\end{array}
Initial program 99.6%
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
div-invN/A
metadata-evalN/A
lower-*.f64N/A
Applied rewrites99.7%
a1_m = (fabs.f64 a1)
NOTE: a1_m, a2, and th should be sorted in increasing order before calling this function.
(FPCore (a1_m a2 th)
:precision binary64
(let* ((t_1 (/ (cos th) (sqrt 2.0))))
(if (<= (+ (* (* a1_m a1_m) t_1) (* (* a2 a2) t_1)) -5e-138)
(* 0.5 (* (sqrt 2.0) (* a2 (* a2 (fma (* th th) -0.5 1.0)))))
(fma a1_m (/ a1_m (sqrt 2.0)) (* a2 (/ a2 (sqrt 2.0)))))))a1_m = fabs(a1);
assert(a1_m < a2 && a2 < th);
double code(double a1_m, double a2, double th) {
double t_1 = cos(th) / sqrt(2.0);
double tmp;
if ((((a1_m * a1_m) * t_1) + ((a2 * a2) * t_1)) <= -5e-138) {
tmp = 0.5 * (sqrt(2.0) * (a2 * (a2 * fma((th * th), -0.5, 1.0))));
} else {
tmp = fma(a1_m, (a1_m / sqrt(2.0)), (a2 * (a2 / sqrt(2.0))));
}
return tmp;
}
a1_m = abs(a1) a1_m, a2, th = sort([a1_m, a2, th]) function code(a1_m, a2, th) t_1 = Float64(cos(th) / sqrt(2.0)) tmp = 0.0 if (Float64(Float64(Float64(a1_m * a1_m) * t_1) + Float64(Float64(a2 * a2) * t_1)) <= -5e-138) tmp = Float64(0.5 * Float64(sqrt(2.0) * Float64(a2 * Float64(a2 * fma(Float64(th * th), -0.5, 1.0))))); else tmp = fma(a1_m, Float64(a1_m / sqrt(2.0)), Float64(a2 * Float64(a2 / sqrt(2.0)))); end return tmp end
a1_m = N[Abs[a1], $MachinePrecision]
NOTE: a1_m, a2, and th should be sorted in increasing order before calling this function.
code[a1$95$m_, a2_, th_] := Block[{t$95$1 = N[(N[Cos[th], $MachinePrecision] / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[(N[(a1$95$m * a1$95$m), $MachinePrecision] * t$95$1), $MachinePrecision] + N[(N[(a2 * a2), $MachinePrecision] * t$95$1), $MachinePrecision]), $MachinePrecision], -5e-138], N[(0.5 * N[(N[Sqrt[2.0], $MachinePrecision] * N[(a2 * N[(a2 * N[(N[(th * th), $MachinePrecision] * -0.5 + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(a1$95$m * N[(a1$95$m / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] + N[(a2 * N[(a2 / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
a1_m = \left|a1\right|
\\
[a1_m, a2, th] = \mathsf{sort}([a1_m, a2, th])\\
\\
\begin{array}{l}
t_1 := \frac{\cos th}{\sqrt{2}}\\
\mathbf{if}\;\left(a1\_m \cdot a1\_m\right) \cdot t\_1 + \left(a2 \cdot a2\right) \cdot t\_1 \leq -5 \cdot 10^{-138}:\\
\;\;\;\;0.5 \cdot \left(\sqrt{2} \cdot \left(a2 \cdot \left(a2 \cdot \mathsf{fma}\left(th \cdot th, -0.5, 1\right)\right)\right)\right)\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(a1\_m, \frac{a1\_m}{\sqrt{2}}, a2 \cdot \frac{a2}{\sqrt{2}}\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))) < -4.99999999999999989e-138Initial program 99.5%
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
div-invN/A
metadata-evalN/A
lower-*.f64N/A
Applied rewrites99.6%
Taylor expanded in a2 around inf
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-cos.f6448.4
Applied rewrites48.4%
Taylor expanded in th around 0
Applied rewrites36.7%
if -4.99999999999999989e-138 < (+.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
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-sqrt.f6483.2
Applied rewrites83.2%
Applied rewrites83.3%
Final simplification74.7%
a1_m = (fabs.f64 a1)
NOTE: a1_m, a2, and th should be sorted in increasing order before calling this function.
(FPCore (a1_m a2 th)
:precision binary64
(let* ((t_1 (/ (cos th) (sqrt 2.0))))
(if (<= (+ (* (* a1_m a1_m) t_1) (* (* a2 a2) t_1)) -5e-138)
(* 0.5 (* (sqrt 2.0) (* a2 (* a2 (fma (* th th) -0.5 1.0)))))
(* 0.5 (* (sqrt 2.0) (fma a1_m a1_m (* a2 a2)))))))a1_m = fabs(a1);
assert(a1_m < a2 && a2 < th);
double code(double a1_m, double a2, double th) {
double t_1 = cos(th) / sqrt(2.0);
double tmp;
if ((((a1_m * a1_m) * t_1) + ((a2 * a2) * t_1)) <= -5e-138) {
tmp = 0.5 * (sqrt(2.0) * (a2 * (a2 * fma((th * th), -0.5, 1.0))));
} else {
tmp = 0.5 * (sqrt(2.0) * fma(a1_m, a1_m, (a2 * a2)));
}
return tmp;
}
a1_m = abs(a1) a1_m, a2, th = sort([a1_m, a2, th]) function code(a1_m, a2, th) t_1 = Float64(cos(th) / sqrt(2.0)) tmp = 0.0 if (Float64(Float64(Float64(a1_m * a1_m) * t_1) + Float64(Float64(a2 * a2) * t_1)) <= -5e-138) tmp = Float64(0.5 * Float64(sqrt(2.0) * Float64(a2 * Float64(a2 * fma(Float64(th * th), -0.5, 1.0))))); else tmp = Float64(0.5 * Float64(sqrt(2.0) * fma(a1_m, a1_m, Float64(a2 * a2)))); end return tmp end
a1_m = N[Abs[a1], $MachinePrecision]
NOTE: a1_m, a2, and th should be sorted in increasing order before calling this function.
code[a1$95$m_, a2_, th_] := Block[{t$95$1 = N[(N[Cos[th], $MachinePrecision] / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[(N[(a1$95$m * a1$95$m), $MachinePrecision] * t$95$1), $MachinePrecision] + N[(N[(a2 * a2), $MachinePrecision] * t$95$1), $MachinePrecision]), $MachinePrecision], -5e-138], N[(0.5 * N[(N[Sqrt[2.0], $MachinePrecision] * N[(a2 * N[(a2 * N[(N[(th * th), $MachinePrecision] * -0.5 + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(0.5 * N[(N[Sqrt[2.0], $MachinePrecision] * N[(a1$95$m * a1$95$m + N[(a2 * a2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
a1_m = \left|a1\right|
\\
[a1_m, a2, th] = \mathsf{sort}([a1_m, a2, th])\\
\\
\begin{array}{l}
t_1 := \frac{\cos th}{\sqrt{2}}\\
\mathbf{if}\;\left(a1\_m \cdot a1\_m\right) \cdot t\_1 + \left(a2 \cdot a2\right) \cdot t\_1 \leq -5 \cdot 10^{-138}:\\
\;\;\;\;0.5 \cdot \left(\sqrt{2} \cdot \left(a2 \cdot \left(a2 \cdot \mathsf{fma}\left(th \cdot th, -0.5, 1\right)\right)\right)\right)\\
\mathbf{else}:\\
\;\;\;\;0.5 \cdot \left(\sqrt{2} \cdot \mathsf{fma}\left(a1\_m, a1\_m, a2 \cdot a2\right)\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))) < -4.99999999999999989e-138Initial program 99.5%
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
div-invN/A
metadata-evalN/A
lower-*.f64N/A
Applied rewrites99.6%
Taylor expanded in a2 around inf
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-cos.f6448.4
Applied rewrites48.4%
Taylor expanded in th around 0
Applied rewrites36.7%
if -4.99999999999999989e-138 < (+.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
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
div-invN/A
metadata-evalN/A
lower-*.f64N/A
Applied rewrites99.7%
Taylor expanded in th around 0
distribute-rgt-outN/A
lower-*.f64N/A
lower-sqrt.f64N/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f6483.3
Applied rewrites83.3%
Final simplification74.7%
a1_m = (fabs.f64 a1) NOTE: a1_m, a2, and th should be sorted in increasing order before calling this function. (FPCore (a1_m a2 th) :precision binary64 (* (* (cos th) (sqrt 2.0)) (* 0.5 (fma a1_m a1_m (* a2 a2)))))
a1_m = fabs(a1);
assert(a1_m < a2 && a2 < th);
double code(double a1_m, double a2, double th) {
return (cos(th) * sqrt(2.0)) * (0.5 * fma(a1_m, a1_m, (a2 * a2)));
}
a1_m = abs(a1) a1_m, a2, th = sort([a1_m, a2, th]) function code(a1_m, a2, th) return Float64(Float64(cos(th) * sqrt(2.0)) * Float64(0.5 * fma(a1_m, a1_m, Float64(a2 * a2)))) end
a1_m = N[Abs[a1], $MachinePrecision] NOTE: a1_m, a2, and th should be sorted in increasing order before calling this function. code[a1$95$m_, a2_, th_] := N[(N[(N[Cos[th], $MachinePrecision] * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * N[(0.5 * N[(a1$95$m * a1$95$m + N[(a2 * a2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
a1_m = \left|a1\right|
\\
[a1_m, a2, th] = \mathsf{sort}([a1_m, a2, th])\\
\\
\left(\cos th \cdot \sqrt{2}\right) \cdot \left(0.5 \cdot \mathsf{fma}\left(a1\_m, a1\_m, a2 \cdot a2\right)\right)
\end{array}
Initial program 99.6%
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
div-invN/A
metadata-evalN/A
lower-*.f64N/A
Applied rewrites99.7%
Taylor expanded in th around inf
distribute-lft-inN/A
associate-*r*N/A
associate-*r*N/A
distribute-rgt-outN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-cos.f64N/A
distribute-lft-outN/A
lower-*.f64N/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f6499.6
Applied rewrites99.6%
Final simplification99.6%
a1_m = (fabs.f64 a1) NOTE: a1_m, a2, and th should be sorted in increasing order before calling this function. (FPCore (a1_m a2 th) :precision binary64 (* 0.5 (* (cos th) (* (* a2 a2) (sqrt 2.0)))))
a1_m = fabs(a1);
assert(a1_m < a2 && a2 < th);
double code(double a1_m, double a2, double th) {
return 0.5 * (cos(th) * ((a2 * a2) * sqrt(2.0)));
}
a1_m = abs(a1)
NOTE: a1_m, a2, and th should be sorted in increasing order before calling this function.
real(8) function code(a1_m, a2, th)
real(8), intent (in) :: a1_m
real(8), intent (in) :: a2
real(8), intent (in) :: th
code = 0.5d0 * (cos(th) * ((a2 * a2) * sqrt(2.0d0)))
end function
a1_m = Math.abs(a1);
assert a1_m < a2 && a2 < th;
public static double code(double a1_m, double a2, double th) {
return 0.5 * (Math.cos(th) * ((a2 * a2) * Math.sqrt(2.0)));
}
a1_m = math.fabs(a1) [a1_m, a2, th] = sort([a1_m, a2, th]) def code(a1_m, a2, th): return 0.5 * (math.cos(th) * ((a2 * a2) * math.sqrt(2.0)))
a1_m = abs(a1) a1_m, a2, th = sort([a1_m, a2, th]) function code(a1_m, a2, th) return Float64(0.5 * Float64(cos(th) * Float64(Float64(a2 * a2) * sqrt(2.0)))) end
a1_m = abs(a1);
a1_m, a2, th = num2cell(sort([a1_m, a2, th])){:}
function tmp = code(a1_m, a2, th)
tmp = 0.5 * (cos(th) * ((a2 * a2) * sqrt(2.0)));
end
a1_m = N[Abs[a1], $MachinePrecision] NOTE: a1_m, a2, and th should be sorted in increasing order before calling this function. code[a1$95$m_, a2_, th_] := N[(0.5 * N[(N[Cos[th], $MachinePrecision] * N[(N[(a2 * a2), $MachinePrecision] * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
a1_m = \left|a1\right|
\\
[a1_m, a2, th] = \mathsf{sort}([a1_m, a2, th])\\
\\
0.5 \cdot \left(\cos th \cdot \left(\left(a2 \cdot a2\right) \cdot \sqrt{2}\right)\right)
\end{array}
Initial program 99.6%
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
div-invN/A
metadata-evalN/A
lower-*.f64N/A
Applied rewrites99.7%
Taylor expanded in a2 around inf
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-cos.f6457.9
Applied rewrites57.9%
Taylor expanded in a2 around inf
*-commutativeN/A
associate-*r*N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
unpow2N/A
lower-*.f64N/A
lower-cos.f6458.0
Applied rewrites58.0%
Final simplification58.0%
a1_m = (fabs.f64 a1) NOTE: a1_m, a2, and th should be sorted in increasing order before calling this function. (FPCore (a1_m a2 th) :precision binary64 (* 0.5 (* (sqrt 2.0) (* (cos th) (* a2 a2)))))
a1_m = fabs(a1);
assert(a1_m < a2 && a2 < th);
double code(double a1_m, double a2, double th) {
return 0.5 * (sqrt(2.0) * (cos(th) * (a2 * a2)));
}
a1_m = abs(a1)
NOTE: a1_m, a2, and th should be sorted in increasing order before calling this function.
real(8) function code(a1_m, a2, th)
real(8), intent (in) :: a1_m
real(8), intent (in) :: a2
real(8), intent (in) :: th
code = 0.5d0 * (sqrt(2.0d0) * (cos(th) * (a2 * a2)))
end function
a1_m = Math.abs(a1);
assert a1_m < a2 && a2 < th;
public static double code(double a1_m, double a2, double th) {
return 0.5 * (Math.sqrt(2.0) * (Math.cos(th) * (a2 * a2)));
}
a1_m = math.fabs(a1) [a1_m, a2, th] = sort([a1_m, a2, th]) def code(a1_m, a2, th): return 0.5 * (math.sqrt(2.0) * (math.cos(th) * (a2 * a2)))
a1_m = abs(a1) a1_m, a2, th = sort([a1_m, a2, th]) function code(a1_m, a2, th) return Float64(0.5 * Float64(sqrt(2.0) * Float64(cos(th) * Float64(a2 * a2)))) end
a1_m = abs(a1);
a1_m, a2, th = num2cell(sort([a1_m, a2, th])){:}
function tmp = code(a1_m, a2, th)
tmp = 0.5 * (sqrt(2.0) * (cos(th) * (a2 * a2)));
end
a1_m = N[Abs[a1], $MachinePrecision] NOTE: a1_m, a2, and th should be sorted in increasing order before calling this function. code[a1$95$m_, a2_, th_] := N[(0.5 * N[(N[Sqrt[2.0], $MachinePrecision] * N[(N[Cos[th], $MachinePrecision] * N[(a2 * a2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
a1_m = \left|a1\right|
\\
[a1_m, a2, th] = \mathsf{sort}([a1_m, a2, th])\\
\\
0.5 \cdot \left(\sqrt{2} \cdot \left(\cos th \cdot \left(a2 \cdot a2\right)\right)\right)
\end{array}
Initial program 99.6%
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
div-invN/A
metadata-evalN/A
lower-*.f64N/A
Applied rewrites99.7%
Taylor expanded in a2 around inf
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-cos.f6457.9
Applied rewrites57.9%
Applied rewrites58.0%
Final simplification58.0%
a1_m = (fabs.f64 a1) NOTE: a1_m, a2, and th should be sorted in increasing order before calling this function. (FPCore (a1_m a2 th) :precision binary64 (* 0.5 (* (sqrt 2.0) (* a2 (* (cos th) a2)))))
a1_m = fabs(a1);
assert(a1_m < a2 && a2 < th);
double code(double a1_m, double a2, double th) {
return 0.5 * (sqrt(2.0) * (a2 * (cos(th) * a2)));
}
a1_m = abs(a1)
NOTE: a1_m, a2, and th should be sorted in increasing order before calling this function.
real(8) function code(a1_m, a2, th)
real(8), intent (in) :: a1_m
real(8), intent (in) :: a2
real(8), intent (in) :: th
code = 0.5d0 * (sqrt(2.0d0) * (a2 * (cos(th) * a2)))
end function
a1_m = Math.abs(a1);
assert a1_m < a2 && a2 < th;
public static double code(double a1_m, double a2, double th) {
return 0.5 * (Math.sqrt(2.0) * (a2 * (Math.cos(th) * a2)));
}
a1_m = math.fabs(a1) [a1_m, a2, th] = sort([a1_m, a2, th]) def code(a1_m, a2, th): return 0.5 * (math.sqrt(2.0) * (a2 * (math.cos(th) * a2)))
a1_m = abs(a1) a1_m, a2, th = sort([a1_m, a2, th]) function code(a1_m, a2, th) return Float64(0.5 * Float64(sqrt(2.0) * Float64(a2 * Float64(cos(th) * a2)))) end
a1_m = abs(a1);
a1_m, a2, th = num2cell(sort([a1_m, a2, th])){:}
function tmp = code(a1_m, a2, th)
tmp = 0.5 * (sqrt(2.0) * (a2 * (cos(th) * a2)));
end
a1_m = N[Abs[a1], $MachinePrecision] NOTE: a1_m, a2, and th should be sorted in increasing order before calling this function. code[a1$95$m_, a2_, th_] := N[(0.5 * N[(N[Sqrt[2.0], $MachinePrecision] * N[(a2 * N[(N[Cos[th], $MachinePrecision] * a2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
a1_m = \left|a1\right|
\\
[a1_m, a2, th] = \mathsf{sort}([a1_m, a2, th])\\
\\
0.5 \cdot \left(\sqrt{2} \cdot \left(a2 \cdot \left(\cos th \cdot a2\right)\right)\right)
\end{array}
Initial program 99.6%
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
div-invN/A
metadata-evalN/A
lower-*.f64N/A
Applied rewrites99.7%
Taylor expanded in a2 around inf
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-cos.f6457.9
Applied rewrites57.9%
Final simplification57.9%
a1_m = (fabs.f64 a1) NOTE: a1_m, a2, and th should be sorted in increasing order before calling this function. (FPCore (a1_m a2 th) :precision binary64 (* 0.5 (* (sqrt 2.0) (fma a1_m a1_m (* a2 a2)))))
a1_m = fabs(a1);
assert(a1_m < a2 && a2 < th);
double code(double a1_m, double a2, double th) {
return 0.5 * (sqrt(2.0) * fma(a1_m, a1_m, (a2 * a2)));
}
a1_m = abs(a1) a1_m, a2, th = sort([a1_m, a2, th]) function code(a1_m, a2, th) return Float64(0.5 * Float64(sqrt(2.0) * fma(a1_m, a1_m, Float64(a2 * a2)))) end
a1_m = N[Abs[a1], $MachinePrecision] NOTE: a1_m, a2, and th should be sorted in increasing order before calling this function. code[a1$95$m_, a2_, th_] := N[(0.5 * N[(N[Sqrt[2.0], $MachinePrecision] * N[(a1$95$m * a1$95$m + N[(a2 * a2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
a1_m = \left|a1\right|
\\
[a1_m, a2, th] = \mathsf{sort}([a1_m, a2, th])\\
\\
0.5 \cdot \left(\sqrt{2} \cdot \mathsf{fma}\left(a1\_m, a1\_m, a2 \cdot a2\right)\right)
\end{array}
Initial program 99.6%
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
div-invN/A
metadata-evalN/A
lower-*.f64N/A
Applied rewrites99.7%
Taylor expanded in th around 0
distribute-rgt-outN/A
lower-*.f64N/A
lower-sqrt.f64N/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f6468.1
Applied rewrites68.1%
Final simplification68.1%
a1_m = (fabs.f64 a1) NOTE: a1_m, a2, and th should be sorted in increasing order before calling this function. (FPCore (a1_m a2 th) :precision binary64 (* 0.5 (* (sqrt 2.0) (* a2 a2))))
a1_m = fabs(a1);
assert(a1_m < a2 && a2 < th);
double code(double a1_m, double a2, double th) {
return 0.5 * (sqrt(2.0) * (a2 * a2));
}
a1_m = abs(a1)
NOTE: a1_m, a2, and th should be sorted in increasing order before calling this function.
real(8) function code(a1_m, a2, th)
real(8), intent (in) :: a1_m
real(8), intent (in) :: a2
real(8), intent (in) :: th
code = 0.5d0 * (sqrt(2.0d0) * (a2 * a2))
end function
a1_m = Math.abs(a1);
assert a1_m < a2 && a2 < th;
public static double code(double a1_m, double a2, double th) {
return 0.5 * (Math.sqrt(2.0) * (a2 * a2));
}
a1_m = math.fabs(a1) [a1_m, a2, th] = sort([a1_m, a2, th]) def code(a1_m, a2, th): return 0.5 * (math.sqrt(2.0) * (a2 * a2))
a1_m = abs(a1) a1_m, a2, th = sort([a1_m, a2, th]) function code(a1_m, a2, th) return Float64(0.5 * Float64(sqrt(2.0) * Float64(a2 * a2))) end
a1_m = abs(a1);
a1_m, a2, th = num2cell(sort([a1_m, a2, th])){:}
function tmp = code(a1_m, a2, th)
tmp = 0.5 * (sqrt(2.0) * (a2 * a2));
end
a1_m = N[Abs[a1], $MachinePrecision] NOTE: a1_m, a2, and th should be sorted in increasing order before calling this function. code[a1$95$m_, a2_, th_] := N[(0.5 * N[(N[Sqrt[2.0], $MachinePrecision] * N[(a2 * a2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
a1_m = \left|a1\right|
\\
[a1_m, a2, th] = \mathsf{sort}([a1_m, a2, th])\\
\\
0.5 \cdot \left(\sqrt{2} \cdot \left(a2 \cdot a2\right)\right)
\end{array}
Initial program 99.6%
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
div-invN/A
metadata-evalN/A
lower-*.f64N/A
Applied rewrites99.7%
Taylor expanded in a2 around inf
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-cos.f6457.9
Applied rewrites57.9%
Taylor expanded in th around 0
Applied rewrites42.4%
Final simplification42.4%
a1_m = (fabs.f64 a1) NOTE: a1_m, a2, and th should be sorted in increasing order before calling this function. (FPCore (a1_m a2 th) :precision binary64 (* a2 (* a2 (* (sqrt 2.0) 0.5))))
a1_m = fabs(a1);
assert(a1_m < a2 && a2 < th);
double code(double a1_m, double a2, double th) {
return a2 * (a2 * (sqrt(2.0) * 0.5));
}
a1_m = abs(a1)
NOTE: a1_m, a2, and th should be sorted in increasing order before calling this function.
real(8) function code(a1_m, a2, th)
real(8), intent (in) :: a1_m
real(8), intent (in) :: a2
real(8), intent (in) :: th
code = a2 * (a2 * (sqrt(2.0d0) * 0.5d0))
end function
a1_m = Math.abs(a1);
assert a1_m < a2 && a2 < th;
public static double code(double a1_m, double a2, double th) {
return a2 * (a2 * (Math.sqrt(2.0) * 0.5));
}
a1_m = math.fabs(a1) [a1_m, a2, th] = sort([a1_m, a2, th]) def code(a1_m, a2, th): return a2 * (a2 * (math.sqrt(2.0) * 0.5))
a1_m = abs(a1) a1_m, a2, th = sort([a1_m, a2, th]) function code(a1_m, a2, th) return Float64(a2 * Float64(a2 * Float64(sqrt(2.0) * 0.5))) end
a1_m = abs(a1);
a1_m, a2, th = num2cell(sort([a1_m, a2, th])){:}
function tmp = code(a1_m, a2, th)
tmp = a2 * (a2 * (sqrt(2.0) * 0.5));
end
a1_m = N[Abs[a1], $MachinePrecision] NOTE: a1_m, a2, and th should be sorted in increasing order before calling this function. code[a1$95$m_, a2_, th_] := N[(a2 * N[(a2 * N[(N[Sqrt[2.0], $MachinePrecision] * 0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
a1_m = \left|a1\right|
\\
[a1_m, a2, th] = \mathsf{sort}([a1_m, a2, th])\\
\\
a2 \cdot \left(a2 \cdot \left(\sqrt{2} \cdot 0.5\right)\right)
\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
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-sqrt.f6468.1
Applied rewrites68.1%
Applied rewrites15.0%
Taylor expanded in a2 around 0
Applied rewrites40.5%
Taylor expanded in a2 around inf
Applied rewrites42.4%
Final simplification42.4%
herbie shell --seed 2024223
(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))))