
(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}
a2_m = (fabs.f64 a2) a1_m = (fabs.f64 a1) NOTE: a1_m, a2_m, and th should be sorted in increasing order before calling this function. (FPCore (a1_m a2_m th) :precision binary64 (fma (* (cos th) (/ a2_m (sqrt 2.0))) a2_m (* (cos th) (* a1_m (/ a1_m (sqrt 2.0))))))
a2_m = fabs(a2);
a1_m = fabs(a1);
assert(a1_m < a2_m && a2_m < th);
double code(double a1_m, double a2_m, double th) {
return fma((cos(th) * (a2_m / sqrt(2.0))), a2_m, (cos(th) * (a1_m * (a1_m / sqrt(2.0)))));
}
a2_m = abs(a2) a1_m = abs(a1) a1_m, a2_m, th = sort([a1_m, a2_m, th]) function code(a1_m, a2_m, th) return fma(Float64(cos(th) * Float64(a2_m / sqrt(2.0))), a2_m, Float64(cos(th) * Float64(a1_m * Float64(a1_m / sqrt(2.0))))) end
a2_m = N[Abs[a2], $MachinePrecision] a1_m = N[Abs[a1], $MachinePrecision] NOTE: a1_m, a2_m, and th should be sorted in increasing order before calling this function. code[a1$95$m_, a2$95$m_, th_] := N[(N[(N[Cos[th], $MachinePrecision] * N[(a2$95$m / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * a2$95$m + N[(N[Cos[th], $MachinePrecision] * N[(a1$95$m * N[(a1$95$m / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
a2_m = \left|a2\right|
\\
a1_m = \left|a1\right|
\\
[a1_m, a2_m, th] = \mathsf{sort}([a1_m, a2_m, th])\\
\\
\mathsf{fma}\left(\cos th \cdot \frac{a2\_m}{\sqrt{2}}, a2\_m, \cos th \cdot \left(a1\_m \cdot \frac{a1\_m}{\sqrt{2}}\right)\right)
\end{array}
Initial program 99.5%
lift-+.f64N/A
+-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lower-fma.f64N/A
lift-/.f64N/A
div-invN/A
associate-*l*N/A
lower-*.f64N/A
associate-*l/N/A
*-lft-identityN/A
lower-/.f6499.6
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
associate-/l*N/A
lower-*.f64N/A
Applied rewrites99.6%
a2_m = (fabs.f64 a2)
a1_m = (fabs.f64 a1)
NOTE: a1_m, a2_m, and th should be sorted in increasing order before calling this function.
(FPCore (a1_m a2_m th)
:precision binary64
(let* ((t_1 (/ (cos th) (sqrt 2.0))))
(if (<= (+ (* (* a1_m a1_m) t_1) (* (* a2_m a2_m) t_1)) -4e-120)
(* (/ (fma -0.5 (* th th) 1.0) (sqrt 2.0)) (* a2_m a2_m))
(/ (fma a1_m a1_m (* a2_m a2_m)) (sqrt 2.0)))))a2_m = fabs(a2);
a1_m = fabs(a1);
assert(a1_m < a2_m && a2_m < th);
double code(double a1_m, double a2_m, double th) {
double t_1 = cos(th) / sqrt(2.0);
double tmp;
if ((((a1_m * a1_m) * t_1) + ((a2_m * a2_m) * t_1)) <= -4e-120) {
tmp = (fma(-0.5, (th * th), 1.0) / sqrt(2.0)) * (a2_m * a2_m);
} else {
tmp = fma(a1_m, a1_m, (a2_m * a2_m)) / sqrt(2.0);
}
return tmp;
}
a2_m = abs(a2) a1_m = abs(a1) a1_m, a2_m, th = sort([a1_m, a2_m, th]) function code(a1_m, a2_m, 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_m * a2_m) * t_1)) <= -4e-120) tmp = Float64(Float64(fma(-0.5, Float64(th * th), 1.0) / sqrt(2.0)) * Float64(a2_m * a2_m)); else tmp = Float64(fma(a1_m, a1_m, Float64(a2_m * a2_m)) / sqrt(2.0)); end return tmp end
a2_m = N[Abs[a2], $MachinePrecision]
a1_m = N[Abs[a1], $MachinePrecision]
NOTE: a1_m, a2_m, and th should be sorted in increasing order before calling this function.
code[a1$95$m_, a2$95$m_, th_] := Block[{t$95$1 = N[(N[Cos[th], $MachinePrecision] / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[(N[(a1$95$m * a1$95$m), $MachinePrecision] * t$95$1), $MachinePrecision] + N[(N[(a2$95$m * a2$95$m), $MachinePrecision] * t$95$1), $MachinePrecision]), $MachinePrecision], -4e-120], N[(N[(N[(-0.5 * N[(th * th), $MachinePrecision] + 1.0), $MachinePrecision] / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * N[(a2$95$m * a2$95$m), $MachinePrecision]), $MachinePrecision], N[(N[(a1$95$m * a1$95$m + N[(a2$95$m * a2$95$m), $MachinePrecision]), $MachinePrecision] / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
a2_m = \left|a2\right|
\\
a1_m = \left|a1\right|
\\
[a1_m, a2_m, th] = \mathsf{sort}([a1_m, a2_m, 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\_m \cdot a2\_m\right) \cdot t\_1 \leq -4 \cdot 10^{-120}:\\
\;\;\;\;\frac{\mathsf{fma}\left(-0.5, th \cdot th, 1\right)}{\sqrt{2}} \cdot \left(a2\_m \cdot a2\_m\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\mathsf{fma}\left(a1\_m, a1\_m, a2\_m \cdot a2\_m\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.99999999999999991e-120Initial program 99.4%
lift-+.f64N/A
lift-*.f64N/A
lift-*.f64N/A
distribute-lft-outN/A
lift-/.f64N/A
associate-*l/N/A
clear-numN/A
lower-/.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lift-*.f64N/A
lower-fma.f6499.6
Applied rewrites99.6%
Taylor expanded in a1 around 0
unpow2N/A
lower-*.f6460.6
Applied rewrites60.6%
lift-/.f64N/A
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
associate-/r/N/A
clear-numN/A
lift-cos.f64N/A
lift-sqrt.f64N/A
lower-*.f64N/A
Applied rewrites60.5%
Taylor expanded in th around 0
+-commutativeN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f6446.8
Applied rewrites46.8%
if -3.99999999999999991e-120 < (+.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%
lift-+.f64N/A
lift-*.f64N/A
lift-*.f64N/A
distribute-lft-outN/A
lift-/.f64N/A
associate-*l/N/A
clear-numN/A
lower-/.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lift-*.f64N/A
lower-fma.f6499.6
Applied rewrites99.6%
Taylor expanded in th around 0
lower-/.f64N/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
lower-sqrt.f6485.2
Applied rewrites85.2%
Final simplification77.1%
a2_m = (fabs.f64 a2) a1_m = (fabs.f64 a1) NOTE: a1_m, a2_m, and th should be sorted in increasing order before calling this function. (FPCore (a1_m a2_m th) :precision binary64 (/ (fma a2_m a2_m (* a1_m a1_m)) (* (sqrt 2.0) (/ 1.0 (cos th)))))
a2_m = fabs(a2);
a1_m = fabs(a1);
assert(a1_m < a2_m && a2_m < th);
double code(double a1_m, double a2_m, double th) {
return fma(a2_m, a2_m, (a1_m * a1_m)) / (sqrt(2.0) * (1.0 / cos(th)));
}
a2_m = abs(a2) a1_m = abs(a1) a1_m, a2_m, th = sort([a1_m, a2_m, th]) function code(a1_m, a2_m, th) return Float64(fma(a2_m, a2_m, Float64(a1_m * a1_m)) / Float64(sqrt(2.0) * Float64(1.0 / cos(th)))) end
a2_m = N[Abs[a2], $MachinePrecision] a1_m = N[Abs[a1], $MachinePrecision] NOTE: a1_m, a2_m, and th should be sorted in increasing order before calling this function. code[a1$95$m_, a2$95$m_, th_] := N[(N[(a2$95$m * a2$95$m + N[(a1$95$m * a1$95$m), $MachinePrecision]), $MachinePrecision] / N[(N[Sqrt[2.0], $MachinePrecision] * N[(1.0 / N[Cos[th], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
a2_m = \left|a2\right|
\\
a1_m = \left|a1\right|
\\
[a1_m, a2_m, th] = \mathsf{sort}([a1_m, a2_m, th])\\
\\
\frac{\mathsf{fma}\left(a2\_m, a2\_m, a1\_m \cdot a1\_m\right)}{\sqrt{2} \cdot \frac{1}{\cos th}}
\end{array}
Initial program 99.5%
lift-+.f64N/A
+-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lower-fma.f64N/A
lift-/.f64N/A
div-invN/A
associate-*l*N/A
lower-*.f64N/A
associate-*l/N/A
*-lft-identityN/A
lower-/.f6499.6
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
associate-/l*N/A
lower-*.f64N/A
Applied rewrites99.6%
lift-fma.f64N/A
+-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
lift-/.f64N/A
associate-*r/N/A
associate-*r/N/A
lift-*.f64N/A
lift-/.f64N/A
associate-*r/N/A
associate-*l/N/A
associate-*r*N/A
lift-*.f64N/A
div-invN/A
lift-/.f64N/A
Applied rewrites99.6%
Final simplification99.6%
a2_m = (fabs.f64 a2) a1_m = (fabs.f64 a1) NOTE: a1_m, a2_m, and th should be sorted in increasing order before calling this function. (FPCore (a1_m a2_m th) :precision binary64 (* (cos th) (/ (fma a1_m a1_m (* a2_m a2_m)) (sqrt 2.0))))
a2_m = fabs(a2);
a1_m = fabs(a1);
assert(a1_m < a2_m && a2_m < th);
double code(double a1_m, double a2_m, double th) {
return cos(th) * (fma(a1_m, a1_m, (a2_m * a2_m)) / sqrt(2.0));
}
a2_m = abs(a2) a1_m = abs(a1) a1_m, a2_m, th = sort([a1_m, a2_m, th]) function code(a1_m, a2_m, th) return Float64(cos(th) * Float64(fma(a1_m, a1_m, Float64(a2_m * a2_m)) / sqrt(2.0))) end
a2_m = N[Abs[a2], $MachinePrecision] a1_m = N[Abs[a1], $MachinePrecision] NOTE: a1_m, a2_m, and th should be sorted in increasing order before calling this function. code[a1$95$m_, a2$95$m_, th_] := N[(N[Cos[th], $MachinePrecision] * N[(N[(a1$95$m * a1$95$m + N[(a2$95$m * a2$95$m), $MachinePrecision]), $MachinePrecision] / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
a2_m = \left|a2\right|
\\
a1_m = \left|a1\right|
\\
[a1_m, a2_m, th] = \mathsf{sort}([a1_m, a2_m, th])\\
\\
\cos th \cdot \frac{\mathsf{fma}\left(a1\_m, a1\_m, a2\_m \cdot a2\_m\right)}{\sqrt{2}}
\end{array}
Initial program 99.5%
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
lift-*.f64N/A
lower-fma.f6499.6
Applied rewrites99.6%
Final simplification99.6%
a2_m = (fabs.f64 a2) a1_m = (fabs.f64 a1) NOTE: a1_m, a2_m, and th should be sorted in increasing order before calling this function. (FPCore (a1_m a2_m th) :precision binary64 (/ (* (cos th) (* a2_m a2_m)) (sqrt 2.0)))
a2_m = fabs(a2);
a1_m = fabs(a1);
assert(a1_m < a2_m && a2_m < th);
double code(double a1_m, double a2_m, double th) {
return (cos(th) * (a2_m * a2_m)) / sqrt(2.0);
}
a2_m = abs(a2)
a1_m = abs(a1)
NOTE: a1_m, a2_m, and th should be sorted in increasing order before calling this function.
real(8) function code(a1_m, a2_m, th)
real(8), intent (in) :: a1_m
real(8), intent (in) :: a2_m
real(8), intent (in) :: th
code = (cos(th) * (a2_m * a2_m)) / sqrt(2.0d0)
end function
a2_m = Math.abs(a2);
a1_m = Math.abs(a1);
assert a1_m < a2_m && a2_m < th;
public static double code(double a1_m, double a2_m, double th) {
return (Math.cos(th) * (a2_m * a2_m)) / Math.sqrt(2.0);
}
a2_m = math.fabs(a2) a1_m = math.fabs(a1) [a1_m, a2_m, th] = sort([a1_m, a2_m, th]) def code(a1_m, a2_m, th): return (math.cos(th) * (a2_m * a2_m)) / math.sqrt(2.0)
a2_m = abs(a2) a1_m = abs(a1) a1_m, a2_m, th = sort([a1_m, a2_m, th]) function code(a1_m, a2_m, th) return Float64(Float64(cos(th) * Float64(a2_m * a2_m)) / sqrt(2.0)) end
a2_m = abs(a2);
a1_m = abs(a1);
a1_m, a2_m, th = num2cell(sort([a1_m, a2_m, th])){:}
function tmp = code(a1_m, a2_m, th)
tmp = (cos(th) * (a2_m * a2_m)) / sqrt(2.0);
end
a2_m = N[Abs[a2], $MachinePrecision] a1_m = N[Abs[a1], $MachinePrecision] NOTE: a1_m, a2_m, and th should be sorted in increasing order before calling this function. code[a1$95$m_, a2$95$m_, th_] := N[(N[(N[Cos[th], $MachinePrecision] * N[(a2$95$m * a2$95$m), $MachinePrecision]), $MachinePrecision] / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
a2_m = \left|a2\right|
\\
a1_m = \left|a1\right|
\\
[a1_m, a2_m, th] = \mathsf{sort}([a1_m, a2_m, th])\\
\\
\frac{\cos th \cdot \left(a2\_m \cdot a2\_m\right)}{\sqrt{2}}
\end{array}
Initial program 99.5%
Taylor expanded in a1 around 0
lower-/.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
lower-cos.f64N/A
lower-sqrt.f6458.4
Applied rewrites58.4%
Final simplification58.4%
a2_m = (fabs.f64 a2) a1_m = (fabs.f64 a1) NOTE: a1_m, a2_m, and th should be sorted in increasing order before calling this function. (FPCore (a1_m a2_m th) :precision binary64 (/ (fma a1_m a1_m (* a2_m a2_m)) (sqrt 2.0)))
a2_m = fabs(a2);
a1_m = fabs(a1);
assert(a1_m < a2_m && a2_m < th);
double code(double a1_m, double a2_m, double th) {
return fma(a1_m, a1_m, (a2_m * a2_m)) / sqrt(2.0);
}
a2_m = abs(a2) a1_m = abs(a1) a1_m, a2_m, th = sort([a1_m, a2_m, th]) function code(a1_m, a2_m, th) return Float64(fma(a1_m, a1_m, Float64(a2_m * a2_m)) / sqrt(2.0)) end
a2_m = N[Abs[a2], $MachinePrecision] a1_m = N[Abs[a1], $MachinePrecision] NOTE: a1_m, a2_m, and th should be sorted in increasing order before calling this function. code[a1$95$m_, a2$95$m_, th_] := N[(N[(a1$95$m * a1$95$m + N[(a2$95$m * a2$95$m), $MachinePrecision]), $MachinePrecision] / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
a2_m = \left|a2\right|
\\
a1_m = \left|a1\right|
\\
[a1_m, a2_m, th] = \mathsf{sort}([a1_m, a2_m, th])\\
\\
\frac{\mathsf{fma}\left(a1\_m, a1\_m, a2\_m \cdot a2\_m\right)}{\sqrt{2}}
\end{array}
Initial program 99.5%
lift-+.f64N/A
lift-*.f64N/A
lift-*.f64N/A
distribute-lft-outN/A
lift-/.f64N/A
associate-*l/N/A
clear-numN/A
lower-/.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lift-*.f64N/A
lower-fma.f6499.6
Applied rewrites99.6%
Taylor expanded in th around 0
lower-/.f64N/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
lower-sqrt.f6467.3
Applied rewrites67.3%
a2_m = (fabs.f64 a2) a1_m = (fabs.f64 a1) NOTE: a1_m, a2_m, and th should be sorted in increasing order before calling this function. (FPCore (a1_m a2_m th) :precision binary64 (* 0.5 (* (sqrt 2.0) (fma a1_m a1_m (* a2_m a2_m)))))
a2_m = fabs(a2);
a1_m = fabs(a1);
assert(a1_m < a2_m && a2_m < th);
double code(double a1_m, double a2_m, double th) {
return 0.5 * (sqrt(2.0) * fma(a1_m, a1_m, (a2_m * a2_m)));
}
a2_m = abs(a2) a1_m = abs(a1) a1_m, a2_m, th = sort([a1_m, a2_m, th]) function code(a1_m, a2_m, th) return Float64(0.5 * Float64(sqrt(2.0) * fma(a1_m, a1_m, Float64(a2_m * a2_m)))) end
a2_m = N[Abs[a2], $MachinePrecision] a1_m = N[Abs[a1], $MachinePrecision] NOTE: a1_m, a2_m, and th should be sorted in increasing order before calling this function. code[a1$95$m_, a2$95$m_, th_] := N[(0.5 * N[(N[Sqrt[2.0], $MachinePrecision] * N[(a1$95$m * a1$95$m + N[(a2$95$m * a2$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
a2_m = \left|a2\right|
\\
a1_m = \left|a1\right|
\\
[a1_m, a2_m, th] = \mathsf{sort}([a1_m, a2_m, th])\\
\\
0.5 \cdot \left(\sqrt{2} \cdot \mathsf{fma}\left(a1\_m, a1\_m, a2\_m \cdot a2\_m\right)\right)
\end{array}
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
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-sqrt.f6467.3
Applied rewrites67.3%
Applied rewrites16.7%
Taylor expanded in a1 around 0
Applied rewrites67.3%
a2_m = (fabs.f64 a2) a1_m = (fabs.f64 a1) NOTE: a1_m, a2_m, and th should be sorted in increasing order before calling this function. (FPCore (a1_m a2_m th) :precision binary64 (/ (* a2_m a2_m) (sqrt 2.0)))
a2_m = fabs(a2);
a1_m = fabs(a1);
assert(a1_m < a2_m && a2_m < th);
double code(double a1_m, double a2_m, double th) {
return (a2_m * a2_m) / sqrt(2.0);
}
a2_m = abs(a2)
a1_m = abs(a1)
NOTE: a1_m, a2_m, and th should be sorted in increasing order before calling this function.
real(8) function code(a1_m, a2_m, th)
real(8), intent (in) :: a1_m
real(8), intent (in) :: a2_m
real(8), intent (in) :: th
code = (a2_m * a2_m) / sqrt(2.0d0)
end function
a2_m = Math.abs(a2);
a1_m = Math.abs(a1);
assert a1_m < a2_m && a2_m < th;
public static double code(double a1_m, double a2_m, double th) {
return (a2_m * a2_m) / Math.sqrt(2.0);
}
a2_m = math.fabs(a2) a1_m = math.fabs(a1) [a1_m, a2_m, th] = sort([a1_m, a2_m, th]) def code(a1_m, a2_m, th): return (a2_m * a2_m) / math.sqrt(2.0)
a2_m = abs(a2) a1_m = abs(a1) a1_m, a2_m, th = sort([a1_m, a2_m, th]) function code(a1_m, a2_m, th) return Float64(Float64(a2_m * a2_m) / sqrt(2.0)) end
a2_m = abs(a2);
a1_m = abs(a1);
a1_m, a2_m, th = num2cell(sort([a1_m, a2_m, th])){:}
function tmp = code(a1_m, a2_m, th)
tmp = (a2_m * a2_m) / sqrt(2.0);
end
a2_m = N[Abs[a2], $MachinePrecision] a1_m = N[Abs[a1], $MachinePrecision] NOTE: a1_m, a2_m, and th should be sorted in increasing order before calling this function. code[a1$95$m_, a2$95$m_, th_] := N[(N[(a2$95$m * a2$95$m), $MachinePrecision] / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
a2_m = \left|a2\right|
\\
a1_m = \left|a1\right|
\\
[a1_m, a2_m, th] = \mathsf{sort}([a1_m, a2_m, th])\\
\\
\frac{a2\_m \cdot a2\_m}{\sqrt{2}}
\end{array}
Initial program 99.5%
Taylor expanded in th around 0
unpow2N/A
associate-/l*N/A
lower-fma.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-sqrt.f6467.3
Applied rewrites67.3%
Taylor expanded in a1 around 0
Applied rewrites40.1%
a2_m = (fabs.f64 a2) a1_m = (fabs.f64 a1) NOTE: a1_m, a2_m, and th should be sorted in increasing order before calling this function. (FPCore (a1_m a2_m th) :precision binary64 (* a2_m (/ a2_m (sqrt 2.0))))
a2_m = fabs(a2);
a1_m = fabs(a1);
assert(a1_m < a2_m && a2_m < th);
double code(double a1_m, double a2_m, double th) {
return a2_m * (a2_m / sqrt(2.0));
}
a2_m = abs(a2)
a1_m = abs(a1)
NOTE: a1_m, a2_m, and th should be sorted in increasing order before calling this function.
real(8) function code(a1_m, a2_m, th)
real(8), intent (in) :: a1_m
real(8), intent (in) :: a2_m
real(8), intent (in) :: th
code = a2_m * (a2_m / sqrt(2.0d0))
end function
a2_m = Math.abs(a2);
a1_m = Math.abs(a1);
assert a1_m < a2_m && a2_m < th;
public static double code(double a1_m, double a2_m, double th) {
return a2_m * (a2_m / Math.sqrt(2.0));
}
a2_m = math.fabs(a2) a1_m = math.fabs(a1) [a1_m, a2_m, th] = sort([a1_m, a2_m, th]) def code(a1_m, a2_m, th): return a2_m * (a2_m / math.sqrt(2.0))
a2_m = abs(a2) a1_m = abs(a1) a1_m, a2_m, th = sort([a1_m, a2_m, th]) function code(a1_m, a2_m, th) return Float64(a2_m * Float64(a2_m / sqrt(2.0))) end
a2_m = abs(a2);
a1_m = abs(a1);
a1_m, a2_m, th = num2cell(sort([a1_m, a2_m, th])){:}
function tmp = code(a1_m, a2_m, th)
tmp = a2_m * (a2_m / sqrt(2.0));
end
a2_m = N[Abs[a2], $MachinePrecision] a1_m = N[Abs[a1], $MachinePrecision] NOTE: a1_m, a2_m, and th should be sorted in increasing order before calling this function. code[a1$95$m_, a2$95$m_, th_] := N[(a2$95$m * N[(a2$95$m / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
a2_m = \left|a2\right|
\\
a1_m = \left|a1\right|
\\
[a1_m, a2_m, th] = \mathsf{sort}([a1_m, a2_m, th])\\
\\
a2\_m \cdot \frac{a2\_m}{\sqrt{2}}
\end{array}
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
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-sqrt.f6467.3
Applied rewrites67.3%
Taylor expanded in a1 around inf
Applied rewrites38.8%
Taylor expanded in a1 around 0
Applied rewrites40.1%
a2_m = (fabs.f64 a2) a1_m = (fabs.f64 a1) NOTE: a1_m, a2_m, and th should be sorted in increasing order before calling this function. (FPCore (a1_m a2_m th) :precision binary64 (* 0.5 (* a2_m (* a2_m (sqrt 2.0)))))
a2_m = fabs(a2);
a1_m = fabs(a1);
assert(a1_m < a2_m && a2_m < th);
double code(double a1_m, double a2_m, double th) {
return 0.5 * (a2_m * (a2_m * sqrt(2.0)));
}
a2_m = abs(a2)
a1_m = abs(a1)
NOTE: a1_m, a2_m, and th should be sorted in increasing order before calling this function.
real(8) function code(a1_m, a2_m, th)
real(8), intent (in) :: a1_m
real(8), intent (in) :: a2_m
real(8), intent (in) :: th
code = 0.5d0 * (a2_m * (a2_m * sqrt(2.0d0)))
end function
a2_m = Math.abs(a2);
a1_m = Math.abs(a1);
assert a1_m < a2_m && a2_m < th;
public static double code(double a1_m, double a2_m, double th) {
return 0.5 * (a2_m * (a2_m * Math.sqrt(2.0)));
}
a2_m = math.fabs(a2) a1_m = math.fabs(a1) [a1_m, a2_m, th] = sort([a1_m, a2_m, th]) def code(a1_m, a2_m, th): return 0.5 * (a2_m * (a2_m * math.sqrt(2.0)))
a2_m = abs(a2) a1_m = abs(a1) a1_m, a2_m, th = sort([a1_m, a2_m, th]) function code(a1_m, a2_m, th) return Float64(0.5 * Float64(a2_m * Float64(a2_m * sqrt(2.0)))) end
a2_m = abs(a2);
a1_m = abs(a1);
a1_m, a2_m, th = num2cell(sort([a1_m, a2_m, th])){:}
function tmp = code(a1_m, a2_m, th)
tmp = 0.5 * (a2_m * (a2_m * sqrt(2.0)));
end
a2_m = N[Abs[a2], $MachinePrecision] a1_m = N[Abs[a1], $MachinePrecision] NOTE: a1_m, a2_m, and th should be sorted in increasing order before calling this function. code[a1$95$m_, a2$95$m_, th_] := N[(0.5 * N[(a2$95$m * N[(a2$95$m * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
a2_m = \left|a2\right|
\\
a1_m = \left|a1\right|
\\
[a1_m, a2_m, th] = \mathsf{sort}([a1_m, a2_m, th])\\
\\
0.5 \cdot \left(a2\_m \cdot \left(a2\_m \cdot \sqrt{2}\right)\right)
\end{array}
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
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-sqrt.f6467.3
Applied rewrites67.3%
Applied rewrites16.7%
Taylor expanded in a1 around inf
Applied rewrites38.8%
Taylor expanded in a1 around 0
Applied rewrites40.0%
Final simplification40.0%
a2_m = (fabs.f64 a2) a1_m = (fabs.f64 a1) NOTE: a1_m, a2_m, and th should be sorted in increasing order before calling this function. (FPCore (a1_m a2_m th) :precision binary64 (* (sqrt 2.0) (* a2_m (* a2_m 0.5))))
a2_m = fabs(a2);
a1_m = fabs(a1);
assert(a1_m < a2_m && a2_m < th);
double code(double a1_m, double a2_m, double th) {
return sqrt(2.0) * (a2_m * (a2_m * 0.5));
}
a2_m = abs(a2)
a1_m = abs(a1)
NOTE: a1_m, a2_m, and th should be sorted in increasing order before calling this function.
real(8) function code(a1_m, a2_m, th)
real(8), intent (in) :: a1_m
real(8), intent (in) :: a2_m
real(8), intent (in) :: th
code = sqrt(2.0d0) * (a2_m * (a2_m * 0.5d0))
end function
a2_m = Math.abs(a2);
a1_m = Math.abs(a1);
assert a1_m < a2_m && a2_m < th;
public static double code(double a1_m, double a2_m, double th) {
return Math.sqrt(2.0) * (a2_m * (a2_m * 0.5));
}
a2_m = math.fabs(a2) a1_m = math.fabs(a1) [a1_m, a2_m, th] = sort([a1_m, a2_m, th]) def code(a1_m, a2_m, th): return math.sqrt(2.0) * (a2_m * (a2_m * 0.5))
a2_m = abs(a2) a1_m = abs(a1) a1_m, a2_m, th = sort([a1_m, a2_m, th]) function code(a1_m, a2_m, th) return Float64(sqrt(2.0) * Float64(a2_m * Float64(a2_m * 0.5))) end
a2_m = abs(a2);
a1_m = abs(a1);
a1_m, a2_m, th = num2cell(sort([a1_m, a2_m, th])){:}
function tmp = code(a1_m, a2_m, th)
tmp = sqrt(2.0) * (a2_m * (a2_m * 0.5));
end
a2_m = N[Abs[a2], $MachinePrecision] a1_m = N[Abs[a1], $MachinePrecision] NOTE: a1_m, a2_m, and th should be sorted in increasing order before calling this function. code[a1$95$m_, a2$95$m_, th_] := N[(N[Sqrt[2.0], $MachinePrecision] * N[(a2$95$m * N[(a2$95$m * 0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
a2_m = \left|a2\right|
\\
a1_m = \left|a1\right|
\\
[a1_m, a2_m, th] = \mathsf{sort}([a1_m, a2_m, th])\\
\\
\sqrt{2} \cdot \left(a2\_m \cdot \left(a2\_m \cdot 0.5\right)\right)
\end{array}
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
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-sqrt.f6467.3
Applied rewrites67.3%
Applied rewrites16.7%
Taylor expanded in a1 around 0
Applied rewrites40.0%
a2_m = (fabs.f64 a2) a1_m = (fabs.f64 a1) NOTE: a1_m, a2_m, and th should be sorted in increasing order before calling this function. (FPCore (a1_m a2_m th) :precision binary64 (* a1_m (* a1_m (* (sqrt 2.0) 0.5))))
a2_m = fabs(a2);
a1_m = fabs(a1);
assert(a1_m < a2_m && a2_m < th);
double code(double a1_m, double a2_m, double th) {
return a1_m * (a1_m * (sqrt(2.0) * 0.5));
}
a2_m = abs(a2)
a1_m = abs(a1)
NOTE: a1_m, a2_m, and th should be sorted in increasing order before calling this function.
real(8) function code(a1_m, a2_m, th)
real(8), intent (in) :: a1_m
real(8), intent (in) :: a2_m
real(8), intent (in) :: th
code = a1_m * (a1_m * (sqrt(2.0d0) * 0.5d0))
end function
a2_m = Math.abs(a2);
a1_m = Math.abs(a1);
assert a1_m < a2_m && a2_m < th;
public static double code(double a1_m, double a2_m, double th) {
return a1_m * (a1_m * (Math.sqrt(2.0) * 0.5));
}
a2_m = math.fabs(a2) a1_m = math.fabs(a1) [a1_m, a2_m, th] = sort([a1_m, a2_m, th]) def code(a1_m, a2_m, th): return a1_m * (a1_m * (math.sqrt(2.0) * 0.5))
a2_m = abs(a2) a1_m = abs(a1) a1_m, a2_m, th = sort([a1_m, a2_m, th]) function code(a1_m, a2_m, th) return Float64(a1_m * Float64(a1_m * Float64(sqrt(2.0) * 0.5))) end
a2_m = abs(a2);
a1_m = abs(a1);
a1_m, a2_m, th = num2cell(sort([a1_m, a2_m, th])){:}
function tmp = code(a1_m, a2_m, th)
tmp = a1_m * (a1_m * (sqrt(2.0) * 0.5));
end
a2_m = N[Abs[a2], $MachinePrecision] a1_m = N[Abs[a1], $MachinePrecision] NOTE: a1_m, a2_m, and th should be sorted in increasing order before calling this function. code[a1$95$m_, a2$95$m_, th_] := N[(a1$95$m * N[(a1$95$m * N[(N[Sqrt[2.0], $MachinePrecision] * 0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
a2_m = \left|a2\right|
\\
a1_m = \left|a1\right|
\\
[a1_m, a2_m, th] = \mathsf{sort}([a1_m, a2_m, th])\\
\\
a1\_m \cdot \left(a1\_m \cdot \left(\sqrt{2} \cdot 0.5\right)\right)
\end{array}
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
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-sqrt.f6467.3
Applied rewrites67.3%
Applied rewrites16.7%
Taylor expanded in a1 around inf
Applied rewrites38.8%
herbie shell --seed 2024226
(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))))