
(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}
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) (sqrt 2.0)) (* a1_m a1_m)) (* (* (cos th) (* (sqrt 2.0) 0.5)) (* 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 ((cos(th) / sqrt(2.0)) * (a1_m * a1_m)) + ((cos(th) * (sqrt(2.0) * 0.5)) * (a2_m * a2_m));
}
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) / sqrt(2.0d0)) * (a1_m * a1_m)) + ((cos(th) * (sqrt(2.0d0) * 0.5d0)) * (a2_m * a2_m))
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) / Math.sqrt(2.0)) * (a1_m * a1_m)) + ((Math.cos(th) * (Math.sqrt(2.0) * 0.5)) * (a2_m * a2_m));
}
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) / math.sqrt(2.0)) * (a1_m * a1_m)) + ((math.cos(th) * (math.sqrt(2.0) * 0.5)) * (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(Float64(Float64(cos(th) / sqrt(2.0)) * Float64(a1_m * a1_m)) + Float64(Float64(cos(th) * Float64(sqrt(2.0) * 0.5)) * Float64(a2_m * a2_m))) 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) / sqrt(2.0)) * (a1_m * a1_m)) + ((cos(th) * (sqrt(2.0) * 0.5)) * (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[(N[(N[(N[Cos[th], $MachinePrecision] / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * N[(a1$95$m * a1$95$m), $MachinePrecision]), $MachinePrecision] + N[(N[(N[Cos[th], $MachinePrecision] * N[(N[Sqrt[2.0], $MachinePrecision] * 0.5), $MachinePrecision]), $MachinePrecision] * N[(a2$95$m * a2$95$m), $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{\cos th}{\sqrt{2}} \cdot \left(a1\_m \cdot a1\_m\right) + \left(\cos th \cdot \left(\sqrt{2} \cdot 0.5\right)\right) \cdot \left(a2\_m \cdot a2\_m\right)
\end{array}
Initial program 99.6%
lift-cos.f64N/A
lift-sqrt.f64N/A
div-invN/A
*-commutativeN/A
lower-*.f64N/A
frac-2negN/A
metadata-evalN/A
neg-sub0N/A
flip--N/A
+-lft-identityN/A
associate-/r/N/A
metadata-evalN/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
rem-square-sqrtN/A
metadata-evalN/A
metadata-evalN/A
lower-*.f6499.7
Applied egg-rr99.7%
Final simplification99.7%
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))) (t_2 (fma a2_m a2_m (* a1_m a1_m))))
(if (<= (+ (* t_1 (* a1_m a1_m)) (* t_1 (* a2_m a2_m))) -2e-136)
(/ (* -0.5 (* th (* th t_2))) (sqrt 2.0))
(/ t_2 (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 t_2 = fma(a2_m, a2_m, (a1_m * a1_m));
double tmp;
if (((t_1 * (a1_m * a1_m)) + (t_1 * (a2_m * a2_m))) <= -2e-136) {
tmp = (-0.5 * (th * (th * t_2))) / sqrt(2.0);
} else {
tmp = t_2 / 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)) t_2 = fma(a2_m, a2_m, Float64(a1_m * a1_m)) tmp = 0.0 if (Float64(Float64(t_1 * Float64(a1_m * a1_m)) + Float64(t_1 * Float64(a2_m * a2_m))) <= -2e-136) tmp = Float64(Float64(-0.5 * Float64(th * Float64(th * t_2))) / sqrt(2.0)); else tmp = Float64(t_2 / 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]}, Block[{t$95$2 = N[(a2$95$m * a2$95$m + N[(a1$95$m * a1$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[(t$95$1 * N[(a1$95$m * a1$95$m), $MachinePrecision]), $MachinePrecision] + N[(t$95$1 * N[(a2$95$m * a2$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -2e-136], N[(N[(-0.5 * N[(th * N[(th * t$95$2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision], N[(t$95$2 / 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}}\\
t_2 := \mathsf{fma}\left(a2\_m, a2\_m, a1\_m \cdot a1\_m\right)\\
\mathbf{if}\;t\_1 \cdot \left(a1\_m \cdot a1\_m\right) + t\_1 \cdot \left(a2\_m \cdot a2\_m\right) \leq -2 \cdot 10^{-136}:\\
\;\;\;\;\frac{-0.5 \cdot \left(th \cdot \left(th \cdot t\_2\right)\right)}{\sqrt{2}}\\
\mathbf{else}:\\
\;\;\;\;\frac{t\_2}{\sqrt{2}}\\
\end{array}
\end{array}
if (+.f64 (*.f64 (/.f64 (cos.f64 th) (sqrt.f64 #s(literal 2 binary64))) (*.f64 a1 a1)) (*.f64 (/.f64 (cos.f64 th) (sqrt.f64 #s(literal 2 binary64))) (*.f64 a2 a2))) < -2e-136Initial program 99.6%
Taylor expanded in th around 0
+-commutativeN/A
associate-*l/N/A
associate-*l*N/A
*-commutativeN/A
unpow2N/A
associate-/l*N/A
associate-*r*N/A
*-commutativeN/A
unpow2N/A
associate-/l*N/A
associate-*r*N/A
distribute-rgt-outN/A
associate-*l/N/A
lower-/.f64N/A
Simplified56.3%
Taylor expanded in th around 0
distribute-lft-outN/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
*-rgt-identityN/A
associate-*r/N/A
*-rgt-identityN/A
Simplified54.2%
Taylor expanded in th around inf
associate-*r/N/A
lower-/.f64N/A
lower-*.f64N/A
*-commutativeN/A
unpow2N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
+-commutativeN/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
lower-sqrt.f6454.2
Simplified54.2%
if -2e-136 < (+.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.7%
Taylor expanded in th around 0
+-commutativeN/A
associate-*l/N/A
associate-*l*N/A
*-commutativeN/A
unpow2N/A
associate-/l*N/A
associate-*r*N/A
*-commutativeN/A
unpow2N/A
associate-/l*N/A
associate-*r*N/A
distribute-rgt-outN/A
associate-*l/N/A
lower-/.f64N/A
Simplified68.7%
Taylor expanded in th around 0
distribute-lft-outN/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
*-rgt-identityN/A
associate-*r/N/A
*-rgt-identityN/A
Simplified62.1%
Taylor expanded in th around 0
lower-/.f64N/A
+-commutativeN/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
lower-sqrt.f6485.2
Simplified85.2%
Final simplification79.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
(let* ((t_1 (/ (cos th) (sqrt 2.0))))
(if (<= (+ (* t_1 (* a1_m a1_m)) (* t_1 (* a2_m a2_m))) -5e-118)
(/ (* a2_m (fma a2_m (* -0.5 (* th th)) a2_m)) (sqrt 2.0))
(/ (fma a2_m a2_m (* 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) {
double t_1 = cos(th) / sqrt(2.0);
double tmp;
if (((t_1 * (a1_m * a1_m)) + (t_1 * (a2_m * a2_m))) <= -5e-118) {
tmp = (a2_m * fma(a2_m, (-0.5 * (th * th)), a2_m)) / sqrt(2.0);
} else {
tmp = fma(a2_m, a2_m, (a1_m * a1_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(t_1 * Float64(a1_m * a1_m)) + Float64(t_1 * Float64(a2_m * a2_m))) <= -5e-118) tmp = Float64(Float64(a2_m * fma(a2_m, Float64(-0.5 * Float64(th * th)), a2_m)) / sqrt(2.0)); else tmp = Float64(fma(a2_m, a2_m, Float64(a1_m * a1_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[(t$95$1 * N[(a1$95$m * a1$95$m), $MachinePrecision]), $MachinePrecision] + N[(t$95$1 * N[(a2$95$m * a2$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -5e-118], N[(N[(a2$95$m * N[(a2$95$m * N[(-0.5 * N[(th * th), $MachinePrecision]), $MachinePrecision] + a2$95$m), $MachinePrecision]), $MachinePrecision] / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision], N[(N[(a2$95$m * a2$95$m + N[(a1$95$m * a1$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}\;t\_1 \cdot \left(a1\_m \cdot a1\_m\right) + t\_1 \cdot \left(a2\_m \cdot a2\_m\right) \leq -5 \cdot 10^{-118}:\\
\;\;\;\;\frac{a2\_m \cdot \mathsf{fma}\left(a2\_m, -0.5 \cdot \left(th \cdot th\right), a2\_m\right)}{\sqrt{2}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\mathsf{fma}\left(a2\_m, a2\_m, a1\_m \cdot a1\_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))) < -5.00000000000000015e-118Initial program 99.6%
Taylor expanded in th around 0
+-commutativeN/A
associate-*l/N/A
associate-*l*N/A
*-commutativeN/A
unpow2N/A
associate-/l*N/A
associate-*r*N/A
*-commutativeN/A
unpow2N/A
associate-/l*N/A
associate-*r*N/A
distribute-rgt-outN/A
associate-*l/N/A
lower-/.f64N/A
Simplified57.4%
Taylor expanded in a1 around 0
lower-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-cos.f64N/A
unpow2N/A
lower-*.f64N/A
lower-sqrt.f6446.4
Simplified46.4%
Taylor expanded in th around 0
associate-*r/N/A
*-commutativeN/A
associate-*r*N/A
associate-*r/N/A
distribute-lft1-inN/A
+-commutativeN/A
associate-/l*N/A
*-commutativeN/A
+-commutativeN/A
distribute-lft-inN/A
associate-*r*N/A
*-commutativeN/A
*-rgt-identityN/A
lower-/.f64N/A
Simplified43.3%
if -5.00000000000000015e-118 < (+.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
+-commutativeN/A
associate-*l/N/A
associate-*l*N/A
*-commutativeN/A
unpow2N/A
associate-/l*N/A
associate-*r*N/A
*-commutativeN/A
unpow2N/A
associate-/l*N/A
associate-*r*N/A
distribute-rgt-outN/A
associate-*l/N/A
lower-/.f64N/A
Simplified68.4%
Taylor expanded in th around 0
distribute-lft-outN/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
*-rgt-identityN/A
associate-*r/N/A
*-rgt-identityN/A
Simplified61.8%
Taylor expanded in th around 0
lower-/.f64N/A
+-commutativeN/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
lower-sqrt.f6484.8
Simplified84.8%
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 (<= (+ (* t_1 (* a1_m a1_m)) (* t_1 (* a2_m a2_m))) -5e-118)
(/ (* a1_m (* -0.5 (* a1_m (* th th)))) (sqrt 2.0))
(/ (fma a2_m a2_m (* 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) {
double t_1 = cos(th) / sqrt(2.0);
double tmp;
if (((t_1 * (a1_m * a1_m)) + (t_1 * (a2_m * a2_m))) <= -5e-118) {
tmp = (a1_m * (-0.5 * (a1_m * (th * th)))) / sqrt(2.0);
} else {
tmp = fma(a2_m, a2_m, (a1_m * a1_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(t_1 * Float64(a1_m * a1_m)) + Float64(t_1 * Float64(a2_m * a2_m))) <= -5e-118) tmp = Float64(Float64(a1_m * Float64(-0.5 * Float64(a1_m * Float64(th * th)))) / sqrt(2.0)); else tmp = Float64(fma(a2_m, a2_m, Float64(a1_m * a1_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[(t$95$1 * N[(a1$95$m * a1$95$m), $MachinePrecision]), $MachinePrecision] + N[(t$95$1 * N[(a2$95$m * a2$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -5e-118], N[(N[(a1$95$m * N[(-0.5 * N[(a1$95$m * N[(th * th), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision], N[(N[(a2$95$m * a2$95$m + N[(a1$95$m * a1$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}\;t\_1 \cdot \left(a1\_m \cdot a1\_m\right) + t\_1 \cdot \left(a2\_m \cdot a2\_m\right) \leq -5 \cdot 10^{-118}:\\
\;\;\;\;\frac{a1\_m \cdot \left(-0.5 \cdot \left(a1\_m \cdot \left(th \cdot th\right)\right)\right)}{\sqrt{2}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\mathsf{fma}\left(a2\_m, a2\_m, a1\_m \cdot a1\_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))) < -5.00000000000000015e-118Initial program 99.6%
Taylor expanded in th around 0
+-commutativeN/A
associate-*l/N/A
associate-*l*N/A
*-commutativeN/A
unpow2N/A
associate-/l*N/A
associate-*r*N/A
*-commutativeN/A
unpow2N/A
associate-/l*N/A
associate-*r*N/A
distribute-rgt-outN/A
associate-*l/N/A
lower-/.f64N/A
Simplified57.4%
Taylor expanded in th around inf
associate-*r/N/A
lower-/.f64N/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
lower-sqrt.f6449.2
Simplified49.2%
if -5.00000000000000015e-118 < (+.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
+-commutativeN/A
associate-*l/N/A
associate-*l*N/A
*-commutativeN/A
unpow2N/A
associate-/l*N/A
associate-*r*N/A
*-commutativeN/A
unpow2N/A
associate-/l*N/A
associate-*r*N/A
distribute-rgt-outN/A
associate-*l/N/A
lower-/.f64N/A
Simplified68.4%
Taylor expanded in th around 0
distribute-lft-outN/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
*-rgt-identityN/A
associate-*r/N/A
*-rgt-identityN/A
Simplified61.8%
Taylor expanded in th around 0
lower-/.f64N/A
+-commutativeN/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
lower-sqrt.f6484.8
Simplified84.8%
Final simplification78.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
(let* ((t_1 (/ (cos th) (sqrt 2.0))))
(if (<= (+ (* t_1 (* a1_m a1_m)) (* t_1 (* a2_m a2_m))) -2e-136)
(* a1_m (/ (* th (* -0.5 (* th a1_m))) (sqrt 2.0)))
(/ (fma a2_m a2_m (* 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) {
double t_1 = cos(th) / sqrt(2.0);
double tmp;
if (((t_1 * (a1_m * a1_m)) + (t_1 * (a2_m * a2_m))) <= -2e-136) {
tmp = a1_m * ((th * (-0.5 * (th * a1_m))) / sqrt(2.0));
} else {
tmp = fma(a2_m, a2_m, (a1_m * a1_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(t_1 * Float64(a1_m * a1_m)) + Float64(t_1 * Float64(a2_m * a2_m))) <= -2e-136) tmp = Float64(a1_m * Float64(Float64(th * Float64(-0.5 * Float64(th * a1_m))) / sqrt(2.0))); else tmp = Float64(fma(a2_m, a2_m, Float64(a1_m * a1_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[(t$95$1 * N[(a1$95$m * a1$95$m), $MachinePrecision]), $MachinePrecision] + N[(t$95$1 * N[(a2$95$m * a2$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -2e-136], N[(a1$95$m * N[(N[(th * N[(-0.5 * N[(th * a1$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(a2$95$m * a2$95$m + N[(a1$95$m * a1$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}\;t\_1 \cdot \left(a1\_m \cdot a1\_m\right) + t\_1 \cdot \left(a2\_m \cdot a2\_m\right) \leq -2 \cdot 10^{-136}:\\
\;\;\;\;a1\_m \cdot \frac{th \cdot \left(-0.5 \cdot \left(th \cdot a1\_m\right)\right)}{\sqrt{2}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\mathsf{fma}\left(a2\_m, a2\_m, a1\_m \cdot a1\_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))) < -2e-136Initial program 99.6%
Taylor expanded in th around 0
+-commutativeN/A
associate-*l/N/A
associate-*l*N/A
*-commutativeN/A
unpow2N/A
associate-/l*N/A
associate-*r*N/A
*-commutativeN/A
unpow2N/A
associate-/l*N/A
associate-*r*N/A
distribute-rgt-outN/A
associate-*l/N/A
lower-/.f64N/A
Simplified56.3%
Taylor expanded in th around inf
associate-*r/N/A
lower-/.f64N/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
lower-sqrt.f6448.2
Simplified48.2%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-sqrt.f64N/A
associate-/l*N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f6448.2
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6442.3
Applied egg-rr42.3%
if -2e-136 < (+.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.7%
Taylor expanded in th around 0
+-commutativeN/A
associate-*l/N/A
associate-*l*N/A
*-commutativeN/A
unpow2N/A
associate-/l*N/A
associate-*r*N/A
*-commutativeN/A
unpow2N/A
associate-/l*N/A
associate-*r*N/A
distribute-rgt-outN/A
associate-*l/N/A
lower-/.f64N/A
Simplified68.7%
Taylor expanded in th around 0
distribute-lft-outN/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
*-rgt-identityN/A
associate-*r/N/A
*-rgt-identityN/A
Simplified62.1%
Taylor expanded in th around 0
lower-/.f64N/A
+-commutativeN/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
lower-sqrt.f6485.2
Simplified85.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 (/ a1_m (sqrt 2.0)) a1_m (* (* a2_m (* (cos th) a2_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 fma((a1_m / sqrt(2.0)), a1_m, ((a2_m * (cos(th) * a2_m)) * (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 fma(Float64(a1_m / sqrt(2.0)), a1_m, Float64(Float64(a2_m * Float64(cos(th) * a2_m)) * Float64(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[(N[(a1$95$m / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * a1$95$m + N[(N[(a2$95$m * N[(N[Cos[th], $MachinePrecision] * a2$95$m), $MachinePrecision]), $MachinePrecision] * 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])\\
\\
\mathsf{fma}\left(\frac{a1\_m}{\sqrt{2}}, a1\_m, \left(a2\_m \cdot \left(\cos th \cdot a2\_m\right)\right) \cdot \left(\sqrt{2} \cdot 0.5\right)\right)
\end{array}
Initial program 99.6%
lift-cos.f64N/A
lift-sqrt.f64N/A
lift-*.f64N/A
associate-*l/N/A
div-invN/A
lower-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
frac-2negN/A
metadata-evalN/A
neg-sub0N/A
flip--N/A
+-lft-identityN/A
associate-/r/N/A
Applied egg-rr99.7%
Taylor expanded in th around 0
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-sqrt.f6483.1
Simplified83.1%
lift-sqrt.f64N/A
associate-/l*N/A
*-commutativeN/A
lift-cos.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-sqrt.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lower-fma.f64N/A
lower-/.f6483.9
lift-*.f64N/A
*-commutativeN/A
lower-*.f6483.9
Applied egg-rr83.9%
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) (* (cos th) 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 (a2_m * a2_m) * (sqrt(2.0) * (cos(th) * 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 = (a2_m * a2_m) * (sqrt(2.0d0) * (cos(th) * 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 (a2_m * a2_m) * (Math.sqrt(2.0) * (Math.cos(th) * 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 (a2_m * a2_m) * (math.sqrt(2.0) * (math.cos(th) * 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(Float64(a2_m * a2_m) * Float64(sqrt(2.0) * Float64(cos(th) * 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 = (a2_m * a2_m) * (sqrt(2.0) * (cos(th) * 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[(a2$95$m * a2$95$m), $MachinePrecision] * N[(N[Sqrt[2.0], $MachinePrecision] * N[(N[Cos[th], $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])\\
\\
\left(a2\_m \cdot a2\_m\right) \cdot \left(\sqrt{2} \cdot \left(\cos th \cdot 0.5\right)\right)
\end{array}
Initial program 99.6%
lift-cos.f64N/A
lift-sqrt.f64N/A
lift-*.f64N/A
associate-*l/N/A
div-invN/A
lower-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
frac-2negN/A
metadata-evalN/A
neg-sub0N/A
flip--N/A
+-lft-identityN/A
associate-/r/N/A
Applied egg-rr99.7%
Taylor expanded in th around 0
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-sqrt.f6483.1
Simplified83.1%
Taylor expanded in a1 around 0
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-cos.f6453.7
Simplified53.7%
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)))
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);
}
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)) / 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 + N[(a1$95$m * a1$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(a2\_m, a2\_m, a1\_m \cdot a1\_m\right)}{\sqrt{2}}
\end{array}
Initial program 99.6%
Taylor expanded in th around 0
+-commutativeN/A
associate-*l/N/A
associate-*l*N/A
*-commutativeN/A
unpow2N/A
associate-/l*N/A
associate-*r*N/A
*-commutativeN/A
unpow2N/A
associate-/l*N/A
associate-*r*N/A
distribute-rgt-outN/A
associate-*l/N/A
lower-/.f64N/A
Simplified66.4%
Taylor expanded in th around 0
distribute-lft-outN/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
*-rgt-identityN/A
associate-*r/N/A
*-rgt-identityN/A
Simplified60.6%
Taylor expanded in th around 0
lower-/.f64N/A
+-commutativeN/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
lower-sqrt.f6469.3
Simplified69.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.6%
Taylor expanded in th around 0
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-sqrt.f6485.1
Simplified85.1%
Taylor expanded in a1 around 0
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-sqrt.f6438.9
Simplified38.9%
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.6%
Taylor expanded in th around 0
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-sqrt.f6485.1
Simplified85.1%
Taylor expanded in a1 around 0
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-sqrt.f6438.9
Simplified38.9%
lift-sqrt.f64N/A
associate-/l*N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f6438.9
Applied egg-rr38.9%
Final simplification38.9%
herbie shell --seed 2024219
(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))))