
(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) NOTE: a1, a2_m, and th should be sorted in increasing order before calling this function. (FPCore (a1 a2_m th) :precision binary64 (fma (* (cos th) (/ a2_m (sqrt 2.0))) a2_m (* (* a1 (cos th)) (/ a1 (sqrt 2.0)))))
a2_m = fabs(a2);
assert(a1 < a2_m && a2_m < th);
double code(double a1, double a2_m, double th) {
return fma((cos(th) * (a2_m / sqrt(2.0))), a2_m, ((a1 * cos(th)) * (a1 / sqrt(2.0))));
}
a2_m = abs(a2) a1, a2_m, th = sort([a1, a2_m, th]) function code(a1, a2_m, th) return fma(Float64(cos(th) * Float64(a2_m / sqrt(2.0))), a2_m, Float64(Float64(a1 * cos(th)) * Float64(a1 / sqrt(2.0)))) end
a2_m = N[Abs[a2], $MachinePrecision] NOTE: a1, a2_m, and th should be sorted in increasing order before calling this function. code[a1_, 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[(a1 * N[Cos[th], $MachinePrecision]), $MachinePrecision] * N[(a1 / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
a2_m = \left|a2\right|
\\
[a1, a2_m, th] = \mathsf{sort}([a1, a2_m, th])\\
\\
\mathsf{fma}\left(\cos th \cdot \frac{a2\_m}{\sqrt{2}}, a2\_m, \left(a1 \cdot \cos th\right) \cdot \frac{a1}{\sqrt{2}}\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
associate-*l/N/A
associate-/l*N/A
lower-*.f64N/A
lower-/.f6499.6
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
lift-*.f64N/A
associate-*r*N/A
associate-/l*N/A
lower-*.f64N/A
Applied rewrites99.6%
a2_m = (fabs.f64 a2)
NOTE: a1, a2_m, and th should be sorted in increasing order before calling this function.
(FPCore (a1 a2_m th)
:precision binary64
(let* ((t_1 (/ (cos th) (sqrt 2.0))))
(if (<= (+ (* t_1 (* a1 a1)) (* t_1 (* a2_m a2_m))) -5e-112)
(* (* (* a2_m th) th) (* (/ -0.5 (sqrt 2.0)) a2_m))
(* (* 0.5 (fma a1 a1 (* a2_m a2_m))) (sqrt 2.0)))))a2_m = fabs(a2);
assert(a1 < a2_m && a2_m < th);
double code(double a1, double a2_m, double th) {
double t_1 = cos(th) / sqrt(2.0);
double tmp;
if (((t_1 * (a1 * a1)) + (t_1 * (a2_m * a2_m))) <= -5e-112) {
tmp = ((a2_m * th) * th) * ((-0.5 / sqrt(2.0)) * a2_m);
} else {
tmp = (0.5 * fma(a1, a1, (a2_m * a2_m))) * sqrt(2.0);
}
return tmp;
}
a2_m = abs(a2) a1, a2_m, th = sort([a1, a2_m, th]) function code(a1, a2_m, th) t_1 = Float64(cos(th) / sqrt(2.0)) tmp = 0.0 if (Float64(Float64(t_1 * Float64(a1 * a1)) + Float64(t_1 * Float64(a2_m * a2_m))) <= -5e-112) tmp = Float64(Float64(Float64(a2_m * th) * th) * Float64(Float64(-0.5 / sqrt(2.0)) * a2_m)); else tmp = Float64(Float64(0.5 * fma(a1, a1, Float64(a2_m * a2_m))) * sqrt(2.0)); end return tmp end
a2_m = N[Abs[a2], $MachinePrecision]
NOTE: a1, a2_m, and th should be sorted in increasing order before calling this function.
code[a1_, a2$95$m_, th_] := Block[{t$95$1 = N[(N[Cos[th], $MachinePrecision] / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[(t$95$1 * N[(a1 * a1), $MachinePrecision]), $MachinePrecision] + N[(t$95$1 * N[(a2$95$m * a2$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -5e-112], N[(N[(N[(a2$95$m * th), $MachinePrecision] * th), $MachinePrecision] * N[(N[(-0.5 / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * a2$95$m), $MachinePrecision]), $MachinePrecision], N[(N[(0.5 * N[(a1 * a1 + N[(a2$95$m * a2$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
a2_m = \left|a2\right|
\\
[a1, a2_m, th] = \mathsf{sort}([a1, a2_m, th])\\
\\
\begin{array}{l}
t_1 := \frac{\cos th}{\sqrt{2}}\\
\mathbf{if}\;t\_1 \cdot \left(a1 \cdot a1\right) + t\_1 \cdot \left(a2\_m \cdot a2\_m\right) \leq -5 \cdot 10^{-112}:\\
\;\;\;\;\left(\left(a2\_m \cdot th\right) \cdot th\right) \cdot \left(\frac{-0.5}{\sqrt{2}} \cdot a2\_m\right)\\
\mathbf{else}:\\
\;\;\;\;\left(0.5 \cdot \mathsf{fma}\left(a1, a1, a2\_m \cdot a2\_m\right)\right) \cdot \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))) < -5.00000000000000044e-112Initial 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.f6471.3
Applied rewrites71.3%
Taylor expanded in th around 0
Applied rewrites14.1%
Taylor expanded in th around inf
Applied rewrites43.6%
Applied rewrites44.0%
if -5.00000000000000044e-112 < (+.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
lower-/.f64N/A
Applied rewrites99.6%
Taylor expanded in a1 around 0
distribute-lft-inN/A
distribute-rgt-outN/A
associate-*r*N/A
lower-*.f64N/A
*-commutativeN/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-cos.f64N/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f6499.6
Applied rewrites99.6%
Taylor expanded in th around 0
distribute-rgt-inN/A
*-commutativeN/A
associate-*r*N/A
metadata-evalN/A
lower-*.f64N/A
metadata-evalN/A
lower-*.f64N/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
lower-sqrt.f6483.4
Applied rewrites83.4%
a2_m = (fabs.f64 a2)
NOTE: a1, a2_m, and th should be sorted in increasing order before calling this function.
(FPCore (a1 a2_m th)
:precision binary64
(let* ((t_1 (/ (cos th) (sqrt 2.0))))
(if (<= (+ (* t_1 (* a1 a1)) (* t_1 (* a2_m a2_m))) -5e-112)
(* a2_m (* a2_m (* (* (/ -0.5 (sqrt 2.0)) th) th)))
(* (* 0.5 (fma a1 a1 (* a2_m a2_m))) (sqrt 2.0)))))a2_m = fabs(a2);
assert(a1 < a2_m && a2_m < th);
double code(double a1, double a2_m, double th) {
double t_1 = cos(th) / sqrt(2.0);
double tmp;
if (((t_1 * (a1 * a1)) + (t_1 * (a2_m * a2_m))) <= -5e-112) {
tmp = a2_m * (a2_m * (((-0.5 / sqrt(2.0)) * th) * th));
} else {
tmp = (0.5 * fma(a1, a1, (a2_m * a2_m))) * sqrt(2.0);
}
return tmp;
}
a2_m = abs(a2) a1, a2_m, th = sort([a1, a2_m, th]) function code(a1, a2_m, th) t_1 = Float64(cos(th) / sqrt(2.0)) tmp = 0.0 if (Float64(Float64(t_1 * Float64(a1 * a1)) + Float64(t_1 * Float64(a2_m * a2_m))) <= -5e-112) tmp = Float64(a2_m * Float64(a2_m * Float64(Float64(Float64(-0.5 / sqrt(2.0)) * th) * th))); else tmp = Float64(Float64(0.5 * fma(a1, a1, Float64(a2_m * a2_m))) * sqrt(2.0)); end return tmp end
a2_m = N[Abs[a2], $MachinePrecision]
NOTE: a1, a2_m, and th should be sorted in increasing order before calling this function.
code[a1_, a2$95$m_, th_] := Block[{t$95$1 = N[(N[Cos[th], $MachinePrecision] / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[(t$95$1 * N[(a1 * a1), $MachinePrecision]), $MachinePrecision] + N[(t$95$1 * N[(a2$95$m * a2$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -5e-112], N[(a2$95$m * N[(a2$95$m * N[(N[(N[(-0.5 / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * th), $MachinePrecision] * th), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(0.5 * N[(a1 * a1 + N[(a2$95$m * a2$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
a2_m = \left|a2\right|
\\
[a1, a2_m, th] = \mathsf{sort}([a1, a2_m, th])\\
\\
\begin{array}{l}
t_1 := \frac{\cos th}{\sqrt{2}}\\
\mathbf{if}\;t\_1 \cdot \left(a1 \cdot a1\right) + t\_1 \cdot \left(a2\_m \cdot a2\_m\right) \leq -5 \cdot 10^{-112}:\\
\;\;\;\;a2\_m \cdot \left(a2\_m \cdot \left(\left(\frac{-0.5}{\sqrt{2}} \cdot th\right) \cdot th\right)\right)\\
\mathbf{else}:\\
\;\;\;\;\left(0.5 \cdot \mathsf{fma}\left(a1, a1, a2\_m \cdot a2\_m\right)\right) \cdot \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))) < -5.00000000000000044e-112Initial 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.f6471.3
Applied rewrites71.3%
Taylor expanded in th around 0
Applied rewrites14.1%
Taylor expanded in th around inf
Applied rewrites43.6%
Applied rewrites46.0%
if -5.00000000000000044e-112 < (+.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
lower-/.f64N/A
Applied rewrites99.6%
Taylor expanded in a1 around 0
distribute-lft-inN/A
distribute-rgt-outN/A
associate-*r*N/A
lower-*.f64N/A
*-commutativeN/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-cos.f64N/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f6499.6
Applied rewrites99.6%
Taylor expanded in th around 0
distribute-rgt-inN/A
*-commutativeN/A
associate-*r*N/A
metadata-evalN/A
lower-*.f64N/A
metadata-evalN/A
lower-*.f64N/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
lower-sqrt.f6483.4
Applied rewrites83.4%
a2_m = (fabs.f64 a2) NOTE: a1, a2_m, and th should be sorted in increasing order before calling this function. (FPCore (a1 a2_m th) :precision binary64 (* (* (* 0.5 (sqrt 2.0)) (cos th)) (fma a1 a1 (* a2_m a2_m))))
a2_m = fabs(a2);
assert(a1 < a2_m && a2_m < th);
double code(double a1, double a2_m, double th) {
return ((0.5 * sqrt(2.0)) * cos(th)) * fma(a1, a1, (a2_m * a2_m));
}
a2_m = abs(a2) a1, a2_m, th = sort([a1, a2_m, th]) function code(a1, a2_m, th) return Float64(Float64(Float64(0.5 * sqrt(2.0)) * cos(th)) * fma(a1, a1, Float64(a2_m * a2_m))) end
a2_m = N[Abs[a2], $MachinePrecision] NOTE: a1, a2_m, and th should be sorted in increasing order before calling this function. code[a1_, a2$95$m_, th_] := N[(N[(N[(0.5 * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * N[Cos[th], $MachinePrecision]), $MachinePrecision] * N[(a1 * a1 + N[(a2$95$m * a2$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
a2_m = \left|a2\right|
\\
[a1, a2_m, th] = \mathsf{sort}([a1, a2_m, th])\\
\\
\left(\left(0.5 \cdot \sqrt{2}\right) \cdot \cos th\right) \cdot \mathsf{fma}\left(a1, a1, a2\_m \cdot a2\_m\right)
\end{array}
Initial 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
lower-/.f64N/A
Applied rewrites99.6%
Taylor expanded in a1 around 0
distribute-lft-inN/A
distribute-rgt-outN/A
associate-*r*N/A
lower-*.f64N/A
*-commutativeN/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-cos.f64N/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f6499.6
Applied rewrites99.6%
a2_m = (fabs.f64 a2) NOTE: a1, a2_m, and th should be sorted in increasing order before calling this function. (FPCore (a1 a2_m th) :precision binary64 (* (* (cos th) a2_m) (sqrt (/ (* a2_m a2_m) 2.0))))
a2_m = fabs(a2);
assert(a1 < a2_m && a2_m < th);
double code(double a1, double a2_m, double th) {
return (cos(th) * a2_m) * sqrt(((a2_m * a2_m) / 2.0));
}
a2_m = abs(a2)
NOTE: a1, a2_m, and th should be sorted in increasing order before calling this function.
real(8) function code(a1, a2_m, th)
real(8), intent (in) :: a1
real(8), intent (in) :: a2_m
real(8), intent (in) :: th
code = (cos(th) * a2_m) * sqrt(((a2_m * a2_m) / 2.0d0))
end function
a2_m = Math.abs(a2);
assert a1 < a2_m && a2_m < th;
public static double code(double a1, double a2_m, double th) {
return (Math.cos(th) * a2_m) * Math.sqrt(((a2_m * a2_m) / 2.0));
}
a2_m = math.fabs(a2) [a1, a2_m, th] = sort([a1, a2_m, th]) def code(a1, a2_m, th): return (math.cos(th) * a2_m) * math.sqrt(((a2_m * a2_m) / 2.0))
a2_m = abs(a2) a1, a2_m, th = sort([a1, a2_m, th]) function code(a1, a2_m, th) return Float64(Float64(cos(th) * a2_m) * sqrt(Float64(Float64(a2_m * a2_m) / 2.0))) end
a2_m = abs(a2);
a1, a2_m, th = num2cell(sort([a1, a2_m, th])){:}
function tmp = code(a1, a2_m, th)
tmp = (cos(th) * a2_m) * sqrt(((a2_m * a2_m) / 2.0));
end
a2_m = N[Abs[a2], $MachinePrecision] NOTE: a1, a2_m, and th should be sorted in increasing order before calling this function. code[a1_, a2$95$m_, th_] := N[(N[(N[Cos[th], $MachinePrecision] * a2$95$m), $MachinePrecision] * N[Sqrt[N[(N[(a2$95$m * a2$95$m), $MachinePrecision] / 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
a2_m = \left|a2\right|
\\
[a1, a2_m, th] = \mathsf{sort}([a1, a2_m, th])\\
\\
\left(\cos th \cdot a2\_m\right) \cdot \sqrt{\frac{a2\_m \cdot a2\_m}{2}}
\end{array}
Initial 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%
Applied rewrites34.3%
a2_m = (fabs.f64 a2) NOTE: a1, a2_m, and th should be sorted in increasing order before calling this function. (FPCore (a1 a2_m th) :precision binary64 (* (* (/ a2_m (sqrt 2.0)) (cos th)) a2_m))
a2_m = fabs(a2);
assert(a1 < a2_m && a2_m < th);
double code(double a1, double a2_m, double th) {
return ((a2_m / sqrt(2.0)) * cos(th)) * a2_m;
}
a2_m = abs(a2)
NOTE: a1, a2_m, and th should be sorted in increasing order before calling this function.
real(8) function code(a1, a2_m, th)
real(8), intent (in) :: a1
real(8), intent (in) :: a2_m
real(8), intent (in) :: th
code = ((a2_m / sqrt(2.0d0)) * cos(th)) * a2_m
end function
a2_m = Math.abs(a2);
assert a1 < a2_m && a2_m < th;
public static double code(double a1, double a2_m, double th) {
return ((a2_m / Math.sqrt(2.0)) * Math.cos(th)) * a2_m;
}
a2_m = math.fabs(a2) [a1, a2_m, th] = sort([a1, a2_m, th]) def code(a1, a2_m, th): return ((a2_m / math.sqrt(2.0)) * math.cos(th)) * a2_m
a2_m = abs(a2) a1, a2_m, th = sort([a1, a2_m, th]) function code(a1, a2_m, th) return Float64(Float64(Float64(a2_m / sqrt(2.0)) * cos(th)) * a2_m) end
a2_m = abs(a2);
a1, a2_m, th = num2cell(sort([a1, a2_m, th])){:}
function tmp = code(a1, a2_m, th)
tmp = ((a2_m / sqrt(2.0)) * cos(th)) * a2_m;
end
a2_m = N[Abs[a2], $MachinePrecision] NOTE: a1, a2_m, and th should be sorted in increasing order before calling this function. code[a1_, a2$95$m_, th_] := N[(N[(N[(a2$95$m / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * N[Cos[th], $MachinePrecision]), $MachinePrecision] * a2$95$m), $MachinePrecision]
\begin{array}{l}
a2_m = \left|a2\right|
\\
[a1, a2_m, th] = \mathsf{sort}([a1, a2_m, th])\\
\\
\left(\frac{a2\_m}{\sqrt{2}} \cdot \cos th\right) \cdot a2\_m
\end{array}
Initial 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%
Applied rewrites56.6%
a2_m = (fabs.f64 a2) NOTE: a1, a2_m, and th should be sorted in increasing order before calling this function. (FPCore (a1 a2_m th) :precision binary64 (* (* 0.5 (* a2_m a2_m)) (* (sqrt 2.0) (cos th))))
a2_m = fabs(a2);
assert(a1 < a2_m && a2_m < th);
double code(double a1, double a2_m, double th) {
return (0.5 * (a2_m * a2_m)) * (sqrt(2.0) * cos(th));
}
a2_m = abs(a2)
NOTE: a1, a2_m, and th should be sorted in increasing order before calling this function.
real(8) function code(a1, a2_m, th)
real(8), intent (in) :: a1
real(8), intent (in) :: a2_m
real(8), intent (in) :: th
code = (0.5d0 * (a2_m * a2_m)) * (sqrt(2.0d0) * cos(th))
end function
a2_m = Math.abs(a2);
assert a1 < a2_m && a2_m < th;
public static double code(double a1, double a2_m, double th) {
return (0.5 * (a2_m * a2_m)) * (Math.sqrt(2.0) * Math.cos(th));
}
a2_m = math.fabs(a2) [a1, a2_m, th] = sort([a1, a2_m, th]) def code(a1, a2_m, th): return (0.5 * (a2_m * a2_m)) * (math.sqrt(2.0) * math.cos(th))
a2_m = abs(a2) a1, a2_m, th = sort([a1, a2_m, th]) function code(a1, a2_m, th) return Float64(Float64(0.5 * Float64(a2_m * a2_m)) * Float64(sqrt(2.0) * cos(th))) end
a2_m = abs(a2);
a1, a2_m, th = num2cell(sort([a1, a2_m, th])){:}
function tmp = code(a1, a2_m, th)
tmp = (0.5 * (a2_m * a2_m)) * (sqrt(2.0) * cos(th));
end
a2_m = N[Abs[a2], $MachinePrecision] NOTE: a1, a2_m, and th should be sorted in increasing order before calling this function. code[a1_, a2$95$m_, th_] := N[(N[(0.5 * N[(a2$95$m * a2$95$m), $MachinePrecision]), $MachinePrecision] * N[(N[Sqrt[2.0], $MachinePrecision] * N[Cos[th], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
a2_m = \left|a2\right|
\\
[a1, a2_m, th] = \mathsf{sort}([a1, a2_m, th])\\
\\
\left(0.5 \cdot \left(a2\_m \cdot a2\_m\right)\right) \cdot \left(\sqrt{2} \cdot \cos th\right)
\end{array}
Initial 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
lower-/.f64N/A
Applied rewrites99.6%
Taylor expanded in a1 around 0
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-cos.f6456.6
Applied rewrites56.6%
a2_m = (fabs.f64 a2) NOTE: a1, a2_m, and th should be sorted in increasing order before calling this function. (FPCore (a1 a2_m th) :precision binary64 (* (* 0.5 (fma a1 a1 (* a2_m a2_m))) (sqrt 2.0)))
a2_m = fabs(a2);
assert(a1 < a2_m && a2_m < th);
double code(double a1, double a2_m, double th) {
return (0.5 * fma(a1, a1, (a2_m * a2_m))) * sqrt(2.0);
}
a2_m = abs(a2) a1, a2_m, th = sort([a1, a2_m, th]) function code(a1, a2_m, th) return Float64(Float64(0.5 * fma(a1, a1, Float64(a2_m * a2_m))) * sqrt(2.0)) end
a2_m = N[Abs[a2], $MachinePrecision] NOTE: a1, a2_m, and th should be sorted in increasing order before calling this function. code[a1_, a2$95$m_, th_] := N[(N[(0.5 * N[(a1 * a1 + N[(a2$95$m * a2$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
a2_m = \left|a2\right|
\\
[a1, a2_m, th] = \mathsf{sort}([a1, a2_m, th])\\
\\
\left(0.5 \cdot \mathsf{fma}\left(a1, a1, a2\_m \cdot a2\_m\right)\right) \cdot \sqrt{2}
\end{array}
Initial 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
lower-/.f64N/A
Applied rewrites99.6%
Taylor expanded in a1 around 0
distribute-lft-inN/A
distribute-rgt-outN/A
associate-*r*N/A
lower-*.f64N/A
*-commutativeN/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-cos.f64N/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f6499.6
Applied rewrites99.6%
Taylor expanded in th around 0
distribute-rgt-inN/A
*-commutativeN/A
associate-*r*N/A
metadata-evalN/A
lower-*.f64N/A
metadata-evalN/A
lower-*.f64N/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
lower-sqrt.f6469.2
Applied rewrites69.2%
a2_m = (fabs.f64 a2) NOTE: a1, a2_m, and th should be sorted in increasing order before calling this function. (FPCore (a1 a2_m th) :precision binary64 (* (* 0.5 (sqrt 2.0)) (fma a1 a1 (* a2_m a2_m))))
a2_m = fabs(a2);
assert(a1 < a2_m && a2_m < th);
double code(double a1, double a2_m, double th) {
return (0.5 * sqrt(2.0)) * fma(a1, a1, (a2_m * a2_m));
}
a2_m = abs(a2) a1, a2_m, th = sort([a1, a2_m, th]) function code(a1, a2_m, th) return Float64(Float64(0.5 * sqrt(2.0)) * fma(a1, a1, Float64(a2_m * a2_m))) end
a2_m = N[Abs[a2], $MachinePrecision] NOTE: a1, a2_m, and th should be sorted in increasing order before calling this function. code[a1_, a2$95$m_, th_] := N[(N[(0.5 * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * N[(a1 * a1 + N[(a2$95$m * a2$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
a2_m = \left|a2\right|
\\
[a1, a2_m, th] = \mathsf{sort}([a1, a2_m, th])\\
\\
\left(0.5 \cdot \sqrt{2}\right) \cdot \mathsf{fma}\left(a1, a1, a2\_m \cdot a2\_m\right)
\end{array}
Initial 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
lower-/.f64N/A
Applied rewrites99.6%
Taylor expanded in th around 0
distribute-rgt-outN/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f6469.2
Applied rewrites69.2%
a2_m = (fabs.f64 a2) NOTE: a1, a2_m, and th should be sorted in increasing order before calling this function. (FPCore (a1 a2_m th) :precision binary64 (* a2_m (sqrt (/ (* a2_m a2_m) 2.0))))
a2_m = fabs(a2);
assert(a1 < a2_m && a2_m < th);
double code(double a1, double a2_m, double th) {
return a2_m * sqrt(((a2_m * a2_m) / 2.0));
}
a2_m = abs(a2)
NOTE: a1, a2_m, and th should be sorted in increasing order before calling this function.
real(8) function code(a1, a2_m, th)
real(8), intent (in) :: a1
real(8), intent (in) :: a2_m
real(8), intent (in) :: th
code = a2_m * sqrt(((a2_m * a2_m) / 2.0d0))
end function
a2_m = Math.abs(a2);
assert a1 < a2_m && a2_m < th;
public static double code(double a1, double a2_m, double th) {
return a2_m * Math.sqrt(((a2_m * a2_m) / 2.0));
}
a2_m = math.fabs(a2) [a1, a2_m, th] = sort([a1, a2_m, th]) def code(a1, a2_m, th): return a2_m * math.sqrt(((a2_m * a2_m) / 2.0))
a2_m = abs(a2) a1, a2_m, th = sort([a1, a2_m, th]) function code(a1, a2_m, th) return Float64(a2_m * sqrt(Float64(Float64(a2_m * a2_m) / 2.0))) end
a2_m = abs(a2);
a1, a2_m, th = num2cell(sort([a1, a2_m, th])){:}
function tmp = code(a1, a2_m, th)
tmp = a2_m * sqrt(((a2_m * a2_m) / 2.0));
end
a2_m = N[Abs[a2], $MachinePrecision] NOTE: a1, a2_m, and th should be sorted in increasing order before calling this function. code[a1_, a2$95$m_, th_] := N[(a2$95$m * N[Sqrt[N[(N[(a2$95$m * a2$95$m), $MachinePrecision] / 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
a2_m = \left|a2\right|
\\
[a1, a2_m, th] = \mathsf{sort}([a1, a2_m, th])\\
\\
a2\_m \cdot \sqrt{\frac{a2\_m \cdot a2\_m}{2}}
\end{array}
Initial program 99.5%
Taylor expanded in th around 0
div-add-revN/A
lower-/.f64N/A
+-commutativeN/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
lower-sqrt.f6469.2
Applied rewrites69.2%
Taylor expanded in a1 around 0
Applied rewrites39.1%
Applied rewrites28.2%
a2_m = (fabs.f64 a2) NOTE: a1, a2_m, and th should be sorted in increasing order before calling this function. (FPCore (a1 a2_m th) :precision binary64 (* a2_m (/ a2_m (sqrt 2.0))))
a2_m = fabs(a2);
assert(a1 < a2_m && a2_m < th);
double code(double a1, double a2_m, double th) {
return a2_m * (a2_m / sqrt(2.0));
}
a2_m = abs(a2)
NOTE: a1, a2_m, and th should be sorted in increasing order before calling this function.
real(8) function code(a1, a2_m, th)
real(8), intent (in) :: a1
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);
assert a1 < a2_m && a2_m < th;
public static double code(double a1, double a2_m, double th) {
return a2_m * (a2_m / Math.sqrt(2.0));
}
a2_m = math.fabs(a2) [a1, a2_m, th] = sort([a1, a2_m, th]) def code(a1, a2_m, th): return a2_m * (a2_m / math.sqrt(2.0))
a2_m = abs(a2) a1, a2_m, th = sort([a1, a2_m, th]) function code(a1, a2_m, th) return Float64(a2_m * Float64(a2_m / sqrt(2.0))) end
a2_m = abs(a2);
a1, a2_m, th = num2cell(sort([a1, a2_m, th])){:}
function tmp = code(a1, a2_m, th)
tmp = a2_m * (a2_m / sqrt(2.0));
end
a2_m = N[Abs[a2], $MachinePrecision] NOTE: a1, a2_m, and th should be sorted in increasing order before calling this function. code[a1_, 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, a2_m, th] = \mathsf{sort}([a1, a2_m, th])\\
\\
a2\_m \cdot \frac{a2\_m}{\sqrt{2}}
\end{array}
Initial program 99.5%
Taylor expanded in th around 0
div-add-revN/A
lower-/.f64N/A
+-commutativeN/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
lower-sqrt.f6469.2
Applied rewrites69.2%
Taylor expanded in a1 around 0
Applied rewrites39.1%
a2_m = (fabs.f64 a2) NOTE: a1, a2_m, and th should be sorted in increasing order before calling this function. (FPCore (a1 a2_m th) :precision binary64 (* a1 (/ a1 (sqrt 2.0))))
a2_m = fabs(a2);
assert(a1 < a2_m && a2_m < th);
double code(double a1, double a2_m, double th) {
return a1 * (a1 / sqrt(2.0));
}
a2_m = abs(a2)
NOTE: a1, a2_m, and th should be sorted in increasing order before calling this function.
real(8) function code(a1, a2_m, th)
real(8), intent (in) :: a1
real(8), intent (in) :: a2_m
real(8), intent (in) :: th
code = a1 * (a1 / sqrt(2.0d0))
end function
a2_m = Math.abs(a2);
assert a1 < a2_m && a2_m < th;
public static double code(double a1, double a2_m, double th) {
return a1 * (a1 / Math.sqrt(2.0));
}
a2_m = math.fabs(a2) [a1, a2_m, th] = sort([a1, a2_m, th]) def code(a1, a2_m, th): return a1 * (a1 / math.sqrt(2.0))
a2_m = abs(a2) a1, a2_m, th = sort([a1, a2_m, th]) function code(a1, a2_m, th) return Float64(a1 * Float64(a1 / sqrt(2.0))) end
a2_m = abs(a2);
a1, a2_m, th = num2cell(sort([a1, a2_m, th])){:}
function tmp = code(a1, a2_m, th)
tmp = a1 * (a1 / sqrt(2.0));
end
a2_m = N[Abs[a2], $MachinePrecision] NOTE: a1, a2_m, and th should be sorted in increasing order before calling this function. code[a1_, a2$95$m_, th_] := N[(a1 * N[(a1 / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
a2_m = \left|a2\right|
\\
[a1, a2_m, th] = \mathsf{sort}([a1, a2_m, th])\\
\\
a1 \cdot \frac{a1}{\sqrt{2}}
\end{array}
Initial program 99.5%
Taylor expanded in th around 0
div-add-revN/A
lower-/.f64N/A
+-commutativeN/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
lower-sqrt.f6469.2
Applied rewrites69.2%
Taylor expanded in a1 around inf
Applied rewrites40.9%
herbie shell --seed 2024333
(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))))