
(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 (* (sqrt 2.0) a2_m) a2_m (* (sqrt 2.0) (* a1 a1))) 2.0) (pow (cos th) -1.0)))
a2_m = fabs(a2);
assert(a1 < a2_m && a2_m < th);
double code(double a1, double a2_m, double th) {
return (fma((sqrt(2.0) * a2_m), a2_m, (sqrt(2.0) * (a1 * a1))) / 2.0) / pow(cos(th), -1.0);
}
a2_m = abs(a2) a1, a2_m, th = sort([a1, a2_m, th]) function code(a1, a2_m, th) return Float64(Float64(fma(Float64(sqrt(2.0) * a2_m), a2_m, Float64(sqrt(2.0) * Float64(a1 * a1))) / 2.0) / (cos(th) ^ -1.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[(N[(N[Sqrt[2.0], $MachinePrecision] * a2$95$m), $MachinePrecision] * a2$95$m + N[(N[Sqrt[2.0], $MachinePrecision] * N[(a1 * a1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / 2.0), $MachinePrecision] / N[Power[N[Cos[th], $MachinePrecision], -1.0], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
a2_m = \left|a2\right|
\\
[a1, a2_m, th] = \mathsf{sort}([a1, a2_m, th])\\
\\
\frac{\frac{\mathsf{fma}\left(\sqrt{2} \cdot a2\_m, a2\_m, \sqrt{2} \cdot \left(a1 \cdot a1\right)\right)}{2}}{{\cos th}^{-1}}
\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.7%
lift-pow.f64N/A
unpow-1N/A
lower-/.f6499.7
Applied rewrites99.7%
lift-*.f64N/A
lift-fma.f64N/A
lift-*.f64N/A
+-commutativeN/A
lift-fma.f6499.7
lift-/.f64N/A
clear-numN/A
associate-/r/N/A
lift-/.f64N/A
lift-fma.f64N/A
distribute-rgt-inN/A
+-commutativeN/A
lift-/.f64N/A
un-div-invN/A
lift-/.f64N/A
un-div-invN/A
frac-addN/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
rem-square-sqrtN/A
Applied rewrites99.6%
Final simplification99.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))) -1e-196)
(* (* (fma (* th th) -0.5 1.0) a2_m) (/ a2_m (sqrt 2.0)))
(* (* 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) {
double t_1 = cos(th) / sqrt(2.0);
double tmp;
if (((t_1 * (a1 * a1)) + (t_1 * (a2_m * a2_m))) <= -1e-196) {
tmp = (fma((th * th), -0.5, 1.0) * a2_m) * (a2_m / sqrt(2.0));
} else {
tmp = (0.5 * sqrt(2.0)) * fma(a1, a1, (a2_m * a2_m));
}
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))) <= -1e-196) tmp = Float64(Float64(fma(Float64(th * th), -0.5, 1.0) * a2_m) * Float64(a2_m / sqrt(2.0))); else tmp = Float64(Float64(0.5 * sqrt(2.0)) * fma(a1, a1, Float64(a2_m * a2_m))); 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], -1e-196], N[(N[(N[(N[(th * th), $MachinePrecision] * -0.5 + 1.0), $MachinePrecision] * a2$95$m), $MachinePrecision] * N[(a2$95$m / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 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])\\
\\
\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 -1 \cdot 10^{-196}:\\
\;\;\;\;\left(\mathsf{fma}\left(th \cdot th, -0.5, 1\right) \cdot a2\_m\right) \cdot \frac{a2\_m}{\sqrt{2}}\\
\mathbf{else}:\\
\;\;\;\;\left(0.5 \cdot \sqrt{2}\right) \cdot \mathsf{fma}\left(a1, a1, a2\_m \cdot a2\_m\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))) < -1e-196Initial 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.7%
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.f6453.0
Applied rewrites53.0%
Taylor expanded in th around 0
Applied rewrites42.7%
if -1e-196 < (+.f64 (*.f64 (/.f64 (cos.f64 th) (sqrt.f64 #s(literal 2 binary64))) (*.f64 a1 a1)) (*.f64 (/.f64 (cos.f64 th) (sqrt.f64 #s(literal 2 binary64))) (*.f64 a2 a2))) Initial program 99.6%
lift-+.f64N/A
lift-*.f64N/A
lift-*.f64N/A
distribute-lft-outN/A
*-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%
lift-pow.f64N/A
unpow-1N/A
lower-/.f6499.6
Applied rewrites99.6%
lift-*.f64N/A
lift-fma.f64N/A
lift-*.f64N/A
+-commutativeN/A
lift-fma.f6499.6
lift-/.f64N/A
clear-numN/A
associate-/r/N/A
lift-/.f64N/A
lift-fma.f64N/A
distribute-rgt-inN/A
+-commutativeN/A
lift-/.f64N/A
un-div-invN/A
lift-/.f64N/A
un-div-invN/A
frac-addN/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
rem-square-sqrtN/A
Applied rewrites99.7%
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-*.f6488.5
Applied rewrites88.5%
Final simplification78.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
(let* ((t_1 (/ (cos th) (sqrt 2.0))))
(if (<= (+ (* t_1 (* a1 a1)) (* t_1 (* a2_m a2_m))) -1e-196)
(* (* (* (* th th) a1) -0.5) (/ a1 (sqrt 2.0)))
(* (* 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) {
double t_1 = cos(th) / sqrt(2.0);
double tmp;
if (((t_1 * (a1 * a1)) + (t_1 * (a2_m * a2_m))) <= -1e-196) {
tmp = (((th * th) * a1) * -0.5) * (a1 / sqrt(2.0));
} else {
tmp = (0.5 * sqrt(2.0)) * fma(a1, a1, (a2_m * a2_m));
}
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))) <= -1e-196) tmp = Float64(Float64(Float64(Float64(th * th) * a1) * -0.5) * Float64(a1 / sqrt(2.0))); else tmp = Float64(Float64(0.5 * sqrt(2.0)) * fma(a1, a1, Float64(a2_m * a2_m))); 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], -1e-196], N[(N[(N[(N[(th * th), $MachinePrecision] * a1), $MachinePrecision] * -0.5), $MachinePrecision] * N[(a1 / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 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])\\
\\
\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 -1 \cdot 10^{-196}:\\
\;\;\;\;\left(\left(\left(th \cdot th\right) \cdot a1\right) \cdot -0.5\right) \cdot \frac{a1}{\sqrt{2}}\\
\mathbf{else}:\\
\;\;\;\;\left(0.5 \cdot \sqrt{2}\right) \cdot \mathsf{fma}\left(a1, a1, a2\_m \cdot a2\_m\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))) < -1e-196Initial program 99.6%
Taylor expanded in th around 0
+-commutativeN/A
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.f640.8
Applied rewrites0.8%
Taylor expanded in th around 0
distribute-lft-inN/A
associate-*r*N/A
*-commutativeN/A
distribute-lft1-inN/A
+-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
Applied rewrites50.9%
Taylor expanded in a1 around inf
Applied rewrites49.2%
Taylor expanded in th around inf
Applied rewrites49.2%
if -1e-196 < (+.f64 (*.f64 (/.f64 (cos.f64 th) (sqrt.f64 #s(literal 2 binary64))) (*.f64 a1 a1)) (*.f64 (/.f64 (cos.f64 th) (sqrt.f64 #s(literal 2 binary64))) (*.f64 a2 a2))) Initial program 99.6%
lift-+.f64N/A
lift-*.f64N/A
lift-*.f64N/A
distribute-lft-outN/A
*-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%
lift-pow.f64N/A
unpow-1N/A
lower-/.f6499.6
Applied rewrites99.6%
lift-*.f64N/A
lift-fma.f64N/A
lift-*.f64N/A
+-commutativeN/A
lift-fma.f6499.6
lift-/.f64N/A
clear-numN/A
associate-/r/N/A
lift-/.f64N/A
lift-fma.f64N/A
distribute-rgt-inN/A
+-commutativeN/A
lift-/.f64N/A
un-div-invN/A
lift-/.f64N/A
un-div-invN/A
frac-addN/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
rem-square-sqrtN/A
Applied rewrites99.7%
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-*.f6488.5
Applied rewrites88.5%
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))) -1e-196)
(* (* (* -0.5 a1) a1) (* th (/ th (sqrt 2.0))))
(* (* 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) {
double t_1 = cos(th) / sqrt(2.0);
double tmp;
if (((t_1 * (a1 * a1)) + (t_1 * (a2_m * a2_m))) <= -1e-196) {
tmp = ((-0.5 * a1) * a1) * (th * (th / sqrt(2.0)));
} else {
tmp = (0.5 * sqrt(2.0)) * fma(a1, a1, (a2_m * a2_m));
}
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))) <= -1e-196) tmp = Float64(Float64(Float64(-0.5 * a1) * a1) * Float64(th * Float64(th / sqrt(2.0)))); else tmp = Float64(Float64(0.5 * sqrt(2.0)) * fma(a1, a1, Float64(a2_m * a2_m))); 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], -1e-196], N[(N[(N[(-0.5 * a1), $MachinePrecision] * a1), $MachinePrecision] * N[(th * N[(th / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 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])\\
\\
\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 -1 \cdot 10^{-196}:\\
\;\;\;\;\left(\left(-0.5 \cdot a1\right) \cdot a1\right) \cdot \left(th \cdot \frac{th}{\sqrt{2}}\right)\\
\mathbf{else}:\\
\;\;\;\;\left(0.5 \cdot \sqrt{2}\right) \cdot \mathsf{fma}\left(a1, a1, a2\_m \cdot a2\_m\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))) < -1e-196Initial program 99.6%
Taylor expanded in th around 0
+-commutativeN/A
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.f640.8
Applied rewrites0.8%
Taylor expanded in th around 0
distribute-lft-inN/A
associate-*r*N/A
*-commutativeN/A
distribute-lft1-inN/A
+-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
Applied rewrites50.9%
Taylor expanded in a1 around inf
Applied rewrites49.2%
Taylor expanded in th around inf
Applied rewrites47.2%
if -1e-196 < (+.f64 (*.f64 (/.f64 (cos.f64 th) (sqrt.f64 #s(literal 2 binary64))) (*.f64 a1 a1)) (*.f64 (/.f64 (cos.f64 th) (sqrt.f64 #s(literal 2 binary64))) (*.f64 a2 a2))) Initial program 99.6%
lift-+.f64N/A
lift-*.f64N/A
lift-*.f64N/A
distribute-lft-outN/A
*-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%
lift-pow.f64N/A
unpow-1N/A
lower-/.f6499.6
Applied rewrites99.6%
lift-*.f64N/A
lift-fma.f64N/A
lift-*.f64N/A
+-commutativeN/A
lift-fma.f6499.6
lift-/.f64N/A
clear-numN/A
associate-/r/N/A
lift-/.f64N/A
lift-fma.f64N/A
distribute-rgt-inN/A
+-commutativeN/A
lift-/.f64N/A
un-div-invN/A
lift-/.f64N/A
un-div-invN/A
frac-addN/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
rem-square-sqrtN/A
Applied rewrites99.7%
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-*.f6488.5
Applied rewrites88.5%
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 a2_m a2_m (* a1 a1)) (sqrt 2.0)) (pow (cos th) -1.0)))
a2_m = fabs(a2);
assert(a1 < a2_m && a2_m < th);
double code(double a1, double a2_m, double th) {
return (fma(a2_m, a2_m, (a1 * a1)) / sqrt(2.0)) / pow(cos(th), -1.0);
}
a2_m = abs(a2) a1, a2_m, th = sort([a1, a2_m, th]) function code(a1, a2_m, th) return Float64(Float64(fma(a2_m, a2_m, Float64(a1 * a1)) / sqrt(2.0)) / (cos(th) ^ -1.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[(a2$95$m * a2$95$m + N[(a1 * a1), $MachinePrecision]), $MachinePrecision] / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] / N[Power[N[Cos[th], $MachinePrecision], -1.0], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
a2_m = \left|a2\right|
\\
[a1, a2_m, th] = \mathsf{sort}([a1, a2_m, th])\\
\\
\frac{\frac{\mathsf{fma}\left(a2\_m, a2\_m, a1 \cdot a1\right)}{\sqrt{2}}}{{\cos th}^{-1}}
\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.7%
lift-pow.f64N/A
unpow-1N/A
lower-/.f6499.7
Applied rewrites99.7%
Final simplification99.7%
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 a1 a1 (* a2_m a2_m)) (cos th)) (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(a1, a1, (a2_m * a2_m)) * cos(th)) / 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(fma(a1, a1, Float64(a2_m * a2_m)) * cos(th)) / 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[(a1 * a1 + N[(a2$95$m * a2$95$m), $MachinePrecision]), $MachinePrecision] * N[Cos[th], $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])\\
\\
\frac{\mathsf{fma}\left(a1, a1, a2\_m \cdot a2\_m\right) \cdot \cos th}{\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.7%
lift-pow.f64N/A
unpow-1N/A
lower-/.f6499.7
Applied rewrites99.7%
lift-/.f64N/A
div-invN/A
lift-/.f64N/A
remove-double-divN/A
lift-*.f64N/A
lift-fma.f64N/A
lift-*.f64N/A
+-commutativeN/A
lift-fma.f64N/A
lift-/.f64N/A
associate-*l/N/A
lower-/.f64N/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 (* (/ (fma a2_m a2_m (* a1 a1)) (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 (fma(a2_m, a2_m, (a1 * a1)) / sqrt(2.0)) * cos(th);
}
a2_m = abs(a2) a1, a2_m, th = sort([a1, a2_m, th]) function code(a1, a2_m, th) return Float64(Float64(fma(a2_m, a2_m, Float64(a1 * a1)) / 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[(N[(a2$95$m * a2$95$m + N[(a1 * a1), $MachinePrecision]), $MachinePrecision] / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * N[Cos[th], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
a2_m = \left|a2\right|
\\
[a1, a2_m, th] = \mathsf{sort}([a1, a2_m, th])\\
\\
\frac{\mathsf{fma}\left(a2\_m, a2\_m, a1 \cdot a1\right)}{\sqrt{2}} \cdot \cos th
\end{array}
Initial program 99.6%
lift-+.f64N/A
lift-*.f64N/A
lift-*.f64N/A
distribute-lft-outN/A
lift-/.f64N/A
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.7
Applied rewrites99.7%
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 (* (* (sqrt 2.0) (fma a1 a1 (* a2_m a2_m))) (* 0.5 (cos th))))
a2_m = fabs(a2);
assert(a1 < a2_m && a2_m < th);
double code(double a1, double a2_m, double th) {
return (sqrt(2.0) * fma(a1, a1, (a2_m * a2_m))) * (0.5 * cos(th));
}
a2_m = abs(a2) a1, a2_m, th = sort([a1, a2_m, th]) function code(a1, a2_m, th) return Float64(Float64(sqrt(2.0) * fma(a1, a1, Float64(a2_m * a2_m))) * Float64(0.5 * 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[(N[Sqrt[2.0], $MachinePrecision] * N[(a1 * a1 + N[(a2$95$m * a2$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(0.5 * 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(\sqrt{2} \cdot \mathsf{fma}\left(a1, a1, a2\_m \cdot a2\_m\right)\right) \cdot \left(0.5 \cdot \cos th\right)
\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.7%
lift-pow.f64N/A
unpow-1N/A
lower-/.f6499.7
Applied rewrites99.7%
lift-*.f64N/A
lift-fma.f64N/A
lift-*.f64N/A
+-commutativeN/A
lift-fma.f6499.7
lift-/.f64N/A
clear-numN/A
associate-/r/N/A
lift-/.f64N/A
lift-fma.f64N/A
distribute-rgt-inN/A
+-commutativeN/A
lift-/.f64N/A
un-div-invN/A
lift-/.f64N/A
un-div-invN/A
frac-addN/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
rem-square-sqrtN/A
Applied rewrites99.6%
lift-/.f64N/A
lift-/.f64N/A
associate-/r/N/A
/-rgt-identityN/A
lift-/.f64N/A
div-invN/A
metadata-evalN/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 (* (/ (* 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 ((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 = ((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 ((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 ((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(Float64(a2_m * a2_m) / 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 = ((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[(N[(a2$95$m * a2$95$m), $MachinePrecision] / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * N[Cos[th], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
a2_m = \left|a2\right|
\\
[a1, a2_m, th] = \mathsf{sort}([a1, a2_m, th])\\
\\
\frac{a2\_m \cdot a2\_m}{\sqrt{2}} \cdot \cos th
\end{array}
Initial program 99.6%
lift-+.f64N/A
lift-*.f64N/A
lift-*.f64N/A
distribute-lft-outN/A
lift-/.f64N/A
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.7
Applied rewrites99.7%
Taylor expanded in a1 around 0
unpow2N/A
lower-*.f6457.3
Applied rewrites57.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 (* (* 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.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.7%
lift-pow.f64N/A
unpow-1N/A
lower-/.f6499.7
Applied rewrites99.7%
lift-*.f64N/A
lift-fma.f64N/A
lift-*.f64N/A
+-commutativeN/A
lift-fma.f6499.7
lift-/.f64N/A
clear-numN/A
associate-/r/N/A
lift-/.f64N/A
lift-fma.f64N/A
distribute-rgt-inN/A
+-commutativeN/A
lift-/.f64N/A
un-div-invN/A
lift-/.f64N/A
un-div-invN/A
frac-addN/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
rem-square-sqrtN/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.f6457.3
Applied rewrites57.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 (* (* 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.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.7%
lift-pow.f64N/A
unpow-1N/A
lower-/.f6499.7
Applied rewrites99.7%
lift-*.f64N/A
lift-fma.f64N/A
lift-*.f64N/A
+-commutativeN/A
lift-fma.f6499.7
lift-/.f64N/A
clear-numN/A
associate-/r/N/A
lift-/.f64N/A
lift-fma.f64N/A
distribute-rgt-inN/A
+-commutativeN/A
lift-/.f64N/A
un-div-invN/A
lift-/.f64N/A
un-div-invN/A
frac-addN/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
rem-square-sqrtN/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-*.f6468.7
Applied rewrites68.7%
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 (* (* 1.0 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 (1.0 * 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 = (1.0d0 * 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 (1.0 * 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 (1.0 * 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(Float64(1.0 * 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 = (1.0 * 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[(1.0 * a2$95$m), $MachinePrecision] * 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])\\
\\
\left(1 \cdot a2\_m\right) \cdot \frac{a2\_m}{\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.7%
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.3
Applied rewrites57.3%
Taylor expanded in th around 0
Applied rewrites42.2%
Taylor expanded in th around 0
Applied rewrites42.7%
Final simplification42.7%
herbie shell --seed 2024323
(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))))