
(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 15 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (a1 a2 th) :precision binary64 (let* ((t_1 (/ (cos th) (sqrt 2.0)))) (+ (* t_1 (* a1 a1)) (* t_1 (* a2 a2)))))
double code(double a1, double a2, double th) {
double t_1 = cos(th) / sqrt(2.0);
return (t_1 * (a1 * a1)) + (t_1 * (a2 * a2));
}
real(8) function code(a1, a2, th)
real(8), intent (in) :: a1
real(8), intent (in) :: a2
real(8), intent (in) :: th
real(8) :: t_1
t_1 = cos(th) / sqrt(2.0d0)
code = (t_1 * (a1 * a1)) + (t_1 * (a2 * a2))
end function
public static double code(double a1, double a2, double th) {
double t_1 = Math.cos(th) / Math.sqrt(2.0);
return (t_1 * (a1 * a1)) + (t_1 * (a2 * a2));
}
def code(a1, a2, th): t_1 = math.cos(th) / math.sqrt(2.0) return (t_1 * (a1 * a1)) + (t_1 * (a2 * a2))
function code(a1, a2, th) t_1 = Float64(cos(th) / sqrt(2.0)) return Float64(Float64(t_1 * Float64(a1 * a1)) + Float64(t_1 * Float64(a2 * a2))) end
function tmp = code(a1, a2, th) t_1 = cos(th) / sqrt(2.0); tmp = (t_1 * (a1 * a1)) + (t_1 * (a2 * a2)); end
code[a1_, a2_, th_] := Block[{t$95$1 = N[(N[Cos[th], $MachinePrecision] / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]}, N[(N[(t$95$1 * N[(a1 * a1), $MachinePrecision]), $MachinePrecision] + N[(t$95$1 * N[(a2 * a2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := \frac{\cos th}{\sqrt{2}}\\
t\_1 \cdot \left(a1 \cdot a1\right) + t\_1 \cdot \left(a2 \cdot a2\right)
\end{array}
\end{array}
a1_m = (fabs.f64 a1) a2_m = (fabs.f64 a2) 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)) (* a2_m (/ (* (cos th) a2_m) (sqrt 2.0)))))
a1_m = fabs(a1);
a2_m = fabs(a2);
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)) + (a2_m * ((cos(th) * a2_m) / sqrt(2.0)));
}
a1_m = abs(a1)
a2_m = abs(a2)
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)) + (a2_m * ((cos(th) * a2_m) / sqrt(2.0d0)))
end function
a1_m = Math.abs(a1);
a2_m = Math.abs(a2);
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)) + (a2_m * ((Math.cos(th) * a2_m) / Math.sqrt(2.0)));
}
a1_m = math.fabs(a1) a2_m = math.fabs(a2) [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)) + (a2_m * ((math.cos(th) * a2_m) / math.sqrt(2.0)))
a1_m = abs(a1) a2_m = abs(a2) 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(a2_m * Float64(Float64(cos(th) * a2_m) / sqrt(2.0)))) end
a1_m = abs(a1);
a2_m = abs(a2);
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)) + (a2_m * ((cos(th) * a2_m) / sqrt(2.0)));
end
a1_m = N[Abs[a1], $MachinePrecision] a2_m = N[Abs[a2], $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[(a2$95$m * N[(N[(N[Cos[th], $MachinePrecision] * a2$95$m), $MachinePrecision] / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
a1_m = \left|a1\right|
\\
a2_m = \left|a2\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) + a2\_m \cdot \frac{\cos th \cdot a2\_m}{\sqrt{2}}
\end{array}
Initial program 99.5%
associate-*r*N/A
*-lowering-*.f64N/A
associate-*l/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
sqrt-lowering-sqrt.f6499.6%
Applied egg-rr99.6%
Final simplification99.6%
a1_m = (fabs.f64 a1) a2_m = (fabs.f64 a2) NOTE: a1_m, a2_m, and th should be sorted in increasing order before calling this function. (FPCore (a1_m a2_m th) :precision binary64 (/ (+ (* a1_m a1_m) (* a2_m a2_m)) (/ (sqrt 2.0) (cos th))))
a1_m = fabs(a1);
a2_m = fabs(a2);
assert(a1_m < a2_m && a2_m < th);
double code(double a1_m, double a2_m, double th) {
return ((a1_m * a1_m) + (a2_m * a2_m)) / (sqrt(2.0) / cos(th));
}
a1_m = abs(a1)
a2_m = abs(a2)
NOTE: a1_m, a2_m, and th should be sorted in increasing order before calling this function.
real(8) function code(a1_m, a2_m, th)
real(8), intent (in) :: a1_m
real(8), intent (in) :: a2_m
real(8), intent (in) :: th
code = ((a1_m * a1_m) + (a2_m * a2_m)) / (sqrt(2.0d0) / cos(th))
end function
a1_m = Math.abs(a1);
a2_m = Math.abs(a2);
assert a1_m < a2_m && a2_m < th;
public static double code(double a1_m, double a2_m, double th) {
return ((a1_m * a1_m) + (a2_m * a2_m)) / (Math.sqrt(2.0) / Math.cos(th));
}
a1_m = math.fabs(a1) a2_m = math.fabs(a2) [a1_m, a2_m, th] = sort([a1_m, a2_m, th]) def code(a1_m, a2_m, th): return ((a1_m * a1_m) + (a2_m * a2_m)) / (math.sqrt(2.0) / math.cos(th))
a1_m = abs(a1) a2_m = abs(a2) a1_m, a2_m, th = sort([a1_m, a2_m, th]) function code(a1_m, a2_m, th) return Float64(Float64(Float64(a1_m * a1_m) + Float64(a2_m * a2_m)) / Float64(sqrt(2.0) / cos(th))) end
a1_m = abs(a1);
a2_m = abs(a2);
a1_m, a2_m, th = num2cell(sort([a1_m, a2_m, th])){:}
function tmp = code(a1_m, a2_m, th)
tmp = ((a1_m * a1_m) + (a2_m * a2_m)) / (sqrt(2.0) / cos(th));
end
a1_m = N[Abs[a1], $MachinePrecision] a2_m = N[Abs[a2], $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[(a1$95$m * a1$95$m), $MachinePrecision] + N[(a2$95$m * a2$95$m), $MachinePrecision]), $MachinePrecision] / N[(N[Sqrt[2.0], $MachinePrecision] / N[Cos[th], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
a1_m = \left|a1\right|
\\
a2_m = \left|a2\right|
\\
[a1_m, a2_m, th] = \mathsf{sort}([a1_m, a2_m, th])\\
\\
\frac{a1\_m \cdot a1\_m + a2\_m \cdot a2\_m}{\frac{\sqrt{2}}{\cos th}}
\end{array}
Initial program 99.5%
distribute-lft-outN/A
*-commutativeN/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
cos-lowering-cos.f6499.6%
Applied egg-rr99.6%
a1_m = (fabs.f64 a1) a2_m = (fabs.f64 a2) 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) (/ (+ (* a1_m a1_m) (* a2_m a2_m)) (sqrt 2.0))))
a1_m = fabs(a1);
a2_m = fabs(a2);
assert(a1_m < a2_m && a2_m < th);
double code(double a1_m, double a2_m, double th) {
return cos(th) * (((a1_m * a1_m) + (a2_m * a2_m)) / sqrt(2.0));
}
a1_m = abs(a1)
a2_m = abs(a2)
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) * (((a1_m * a1_m) + (a2_m * a2_m)) / sqrt(2.0d0))
end function
a1_m = Math.abs(a1);
a2_m = Math.abs(a2);
assert a1_m < a2_m && a2_m < th;
public static double code(double a1_m, double a2_m, double th) {
return Math.cos(th) * (((a1_m * a1_m) + (a2_m * a2_m)) / Math.sqrt(2.0));
}
a1_m = math.fabs(a1) a2_m = math.fabs(a2) [a1_m, a2_m, th] = sort([a1_m, a2_m, th]) def code(a1_m, a2_m, th): return math.cos(th) * (((a1_m * a1_m) + (a2_m * a2_m)) / math.sqrt(2.0))
a1_m = abs(a1) a2_m = abs(a2) a1_m, a2_m, th = sort([a1_m, a2_m, th]) function code(a1_m, a2_m, th) return Float64(cos(th) * Float64(Float64(Float64(a1_m * a1_m) + Float64(a2_m * a2_m)) / sqrt(2.0))) end
a1_m = abs(a1);
a2_m = abs(a2);
a1_m, a2_m, th = num2cell(sort([a1_m, a2_m, th])){:}
function tmp = code(a1_m, a2_m, th)
tmp = cos(th) * (((a1_m * a1_m) + (a2_m * a2_m)) / sqrt(2.0));
end
a1_m = N[Abs[a1], $MachinePrecision] a2_m = N[Abs[a2], $MachinePrecision] NOTE: a1_m, a2_m, and th should be sorted in increasing order before calling this function. code[a1$95$m_, a2$95$m_, th_] := N[(N[Cos[th], $MachinePrecision] * N[(N[(N[(a1$95$m * a1$95$m), $MachinePrecision] + N[(a2$95$m * a2$95$m), $MachinePrecision]), $MachinePrecision] / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
a1_m = \left|a1\right|
\\
a2_m = \left|a2\right|
\\
[a1_m, a2_m, th] = \mathsf{sort}([a1_m, a2_m, th])\\
\\
\cos th \cdot \frac{a1\_m \cdot a1\_m + a2\_m \cdot a2\_m}{\sqrt{2}}
\end{array}
Initial program 99.5%
distribute-lft-outN/A
div-invN/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
associate-*l/N/A
*-lft-identityN/A
/-lowering-/.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
cos-lowering-cos.f6499.6%
Applied egg-rr99.6%
Final simplification99.6%
a1_m = (fabs.f64 a1) a2_m = (fabs.f64 a2) 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) (* a2_m a2_m))))
a1_m = fabs(a1);
a2_m = fabs(a2);
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) + (a2_m * a2_m));
}
a1_m = abs(a1)
a2_m = abs(a2)
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) + (a2_m * a2_m))
end function
a1_m = Math.abs(a1);
a2_m = Math.abs(a2);
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) + (a2_m * a2_m));
}
a1_m = math.fabs(a1) a2_m = math.fabs(a2) [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) + (a2_m * a2_m))
a1_m = abs(a1) a2_m = abs(a2) a1_m, a2_m, th = sort([a1_m, a2_m, th]) function code(a1_m, a2_m, th) return Float64(Float64(cos(th) / sqrt(2.0)) * Float64(Float64(a1_m * a1_m) + Float64(a2_m * a2_m))) end
a1_m = abs(a1);
a2_m = abs(a2);
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) + (a2_m * a2_m));
end
a1_m = N[Abs[a1], $MachinePrecision] a2_m = N[Abs[a2], $MachinePrecision] NOTE: a1_m, a2_m, and th should be sorted in increasing order before calling this function. code[a1$95$m_, a2$95$m_, th_] := N[(N[(N[Cos[th], $MachinePrecision] / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * N[(N[(a1$95$m * a1$95$m), $MachinePrecision] + N[(a2$95$m * a2$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
a1_m = \left|a1\right|
\\
a2_m = \left|a2\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 + a2\_m \cdot a2\_m\right)
\end{array}
Initial program 99.5%
distribute-lft-outN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
cos-lowering-cos.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6499.5%
Applied egg-rr99.5%
a1_m = (fabs.f64 a1) a2_m = (fabs.f64 a2) 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 (/ (sqrt 2.0) (* (cos th) a2_m))))
a1_m = fabs(a1);
a2_m = fabs(a2);
assert(a1_m < a2_m && a2_m < th);
double code(double a1_m, double a2_m, double th) {
return a2_m / (sqrt(2.0) / (cos(th) * a2_m));
}
a1_m = abs(a1)
a2_m = abs(a2)
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 / (sqrt(2.0d0) / (cos(th) * a2_m))
end function
a1_m = Math.abs(a1);
a2_m = Math.abs(a2);
assert a1_m < a2_m && a2_m < th;
public static double code(double a1_m, double a2_m, double th) {
return a2_m / (Math.sqrt(2.0) / (Math.cos(th) * a2_m));
}
a1_m = math.fabs(a1) a2_m = math.fabs(a2) [a1_m, a2_m, th] = sort([a1_m, a2_m, th]) def code(a1_m, a2_m, th): return a2_m / (math.sqrt(2.0) / (math.cos(th) * a2_m))
a1_m = abs(a1) a2_m = abs(a2) a1_m, a2_m, th = sort([a1_m, a2_m, th]) function code(a1_m, a2_m, th) return Float64(a2_m / Float64(sqrt(2.0) / Float64(cos(th) * a2_m))) end
a1_m = abs(a1);
a2_m = abs(a2);
a1_m, a2_m, th = num2cell(sort([a1_m, a2_m, th])){:}
function tmp = code(a1_m, a2_m, th)
tmp = a2_m / (sqrt(2.0) / (cos(th) * a2_m));
end
a1_m = N[Abs[a1], $MachinePrecision] a2_m = N[Abs[a2], $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[(N[Sqrt[2.0], $MachinePrecision] / N[(N[Cos[th], $MachinePrecision] * a2$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
a1_m = \left|a1\right|
\\
a2_m = \left|a2\right|
\\
[a1_m, a2_m, th] = \mathsf{sort}([a1_m, a2_m, th])\\
\\
\frac{a2\_m}{\frac{\sqrt{2}}{\cos th \cdot a2\_m}}
\end{array}
Initial program 99.5%
Taylor expanded in a1 around 0
/-lowering-/.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
sqrt-lowering-sqrt.f6456.3%
Simplified56.3%
associate-*l*N/A
*-commutativeN/A
associate-*r/N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
cos-lowering-cos.f6456.2%
Applied egg-rr56.2%
a1_m = (fabs.f64 a1) a2_m = (fabs.f64 a2) NOTE: a1_m, a2_m, and th should be sorted in increasing order before calling this function. (FPCore (a1_m a2_m th) :precision binary64 (* (cos th) (* (* a2_m a2_m) (sqrt 0.5))))
a1_m = fabs(a1);
a2_m = fabs(a2);
assert(a1_m < a2_m && a2_m < th);
double code(double a1_m, double a2_m, double th) {
return cos(th) * ((a2_m * a2_m) * sqrt(0.5));
}
a1_m = abs(a1)
a2_m = abs(a2)
NOTE: a1_m, a2_m, and th should be sorted in increasing order before calling this function.
real(8) function code(a1_m, a2_m, th)
real(8), intent (in) :: a1_m
real(8), intent (in) :: a2_m
real(8), intent (in) :: th
code = cos(th) * ((a2_m * a2_m) * sqrt(0.5d0))
end function
a1_m = Math.abs(a1);
a2_m = Math.abs(a2);
assert a1_m < a2_m && a2_m < th;
public static double code(double a1_m, double a2_m, double th) {
return Math.cos(th) * ((a2_m * a2_m) * Math.sqrt(0.5));
}
a1_m = math.fabs(a1) a2_m = math.fabs(a2) [a1_m, a2_m, th] = sort([a1_m, a2_m, th]) def code(a1_m, a2_m, th): return math.cos(th) * ((a2_m * a2_m) * math.sqrt(0.5))
a1_m = abs(a1) a2_m = abs(a2) a1_m, a2_m, th = sort([a1_m, a2_m, th]) function code(a1_m, a2_m, th) return Float64(cos(th) * Float64(Float64(a2_m * a2_m) * sqrt(0.5))) end
a1_m = abs(a1);
a2_m = abs(a2);
a1_m, a2_m, th = num2cell(sort([a1_m, a2_m, th])){:}
function tmp = code(a1_m, a2_m, th)
tmp = cos(th) * ((a2_m * a2_m) * sqrt(0.5));
end
a1_m = N[Abs[a1], $MachinePrecision] a2_m = N[Abs[a2], $MachinePrecision] NOTE: a1_m, a2_m, and th should be sorted in increasing order before calling this function. code[a1$95$m_, a2$95$m_, th_] := N[(N[Cos[th], $MachinePrecision] * N[(N[(a2$95$m * a2$95$m), $MachinePrecision] * N[Sqrt[0.5], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
a1_m = \left|a1\right|
\\
a2_m = \left|a2\right|
\\
[a1_m, a2_m, th] = \mathsf{sort}([a1_m, a2_m, th])\\
\\
\cos th \cdot \left(\left(a2\_m \cdot a2\_m\right) \cdot \sqrt{0.5}\right)
\end{array}
Initial program 99.5%
Taylor expanded in a1 around 0
/-lowering-/.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
sqrt-lowering-sqrt.f6456.3%
Simplified56.3%
clear-numN/A
associate-/r/N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
pow1/2N/A
pow-flipN/A
metadata-evalN/A
pow-lowering-pow.f64N/A
*-lowering-*.f64N/A
cos-lowering-cos.f6456.2%
Applied egg-rr56.2%
Taylor expanded in a2 around 0
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f6456.2%
Simplified56.2%
Final simplification56.2%
a1_m = (fabs.f64 a1) a2_m = (fabs.f64 a2) 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) (* (cos th) (sqrt 0.5))))
a1_m = fabs(a1);
a2_m = fabs(a2);
assert(a1_m < a2_m && a2_m < th);
double code(double a1_m, double a2_m, double th) {
return (a2_m * a2_m) * (cos(th) * sqrt(0.5));
}
a1_m = abs(a1)
a2_m = abs(a2)
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) * (cos(th) * sqrt(0.5d0))
end function
a1_m = Math.abs(a1);
a2_m = Math.abs(a2);
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.cos(th) * Math.sqrt(0.5));
}
a1_m = math.fabs(a1) a2_m = math.fabs(a2) [a1_m, a2_m, th] = sort([a1_m, a2_m, th]) def code(a1_m, a2_m, th): return (a2_m * a2_m) * (math.cos(th) * math.sqrt(0.5))
a1_m = abs(a1) a2_m = abs(a2) 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(cos(th) * sqrt(0.5))) end
a1_m = abs(a1);
a2_m = abs(a2);
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) * (cos(th) * sqrt(0.5));
end
a1_m = N[Abs[a1], $MachinePrecision] a2_m = N[Abs[a2], $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[Cos[th], $MachinePrecision] * N[Sqrt[0.5], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
a1_m = \left|a1\right|
\\
a2_m = \left|a2\right|
\\
[a1_m, a2_m, th] = \mathsf{sort}([a1_m, a2_m, th])\\
\\
\left(a2\_m \cdot a2\_m\right) \cdot \left(\cos th \cdot \sqrt{0.5}\right)
\end{array}
Initial program 99.5%
distribute-lft-outN/A
clear-numN/A
associate-/r/N/A
associate-*l*N/A
*-lowering-*.f64N/A
pow1/2N/A
pow-flipN/A
pow-lowering-pow.f64N/A
metadata-evalN/A
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6499.6%
Applied egg-rr99.6%
Taylor expanded in a1 around 0
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
sqrt-lowering-sqrt.f6456.2%
Simplified56.2%
a1_m = (fabs.f64 a1)
a2_m = (fabs.f64 a2)
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
(if (<= th 3e+33)
(*
(pow 2.0 -0.5)
(*
(+ (* a1_m a1_m) (* a2_m a2_m))
(+
1.0
(*
(* th th)
(+
-0.5
(*
(* th th)
(+ 0.041666666666666664 (* (* th th) -0.001388888888888889))))))))
(if (<= th 2e+141)
(* a2_m (* a2_m (sqrt 0.5)))
(/ (- 0.0 -1.0) (/ (sqrt 2.0) (* a2_m a2_m))))))a1_m = fabs(a1);
a2_m = fabs(a2);
assert(a1_m < a2_m && a2_m < th);
double code(double a1_m, double a2_m, double th) {
double tmp;
if (th <= 3e+33) {
tmp = pow(2.0, -0.5) * (((a1_m * a1_m) + (a2_m * a2_m)) * (1.0 + ((th * th) * (-0.5 + ((th * th) * (0.041666666666666664 + ((th * th) * -0.001388888888888889)))))));
} else if (th <= 2e+141) {
tmp = a2_m * (a2_m * sqrt(0.5));
} else {
tmp = (0.0 - -1.0) / (sqrt(2.0) / (a2_m * a2_m));
}
return tmp;
}
a1_m = abs(a1)
a2_m = abs(a2)
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
real(8) :: tmp
if (th <= 3d+33) then
tmp = (2.0d0 ** (-0.5d0)) * (((a1_m * a1_m) + (a2_m * a2_m)) * (1.0d0 + ((th * th) * ((-0.5d0) + ((th * th) * (0.041666666666666664d0 + ((th * th) * (-0.001388888888888889d0))))))))
else if (th <= 2d+141) then
tmp = a2_m * (a2_m * sqrt(0.5d0))
else
tmp = (0.0d0 - (-1.0d0)) / (sqrt(2.0d0) / (a2_m * a2_m))
end if
code = tmp
end function
a1_m = Math.abs(a1);
a2_m = Math.abs(a2);
assert a1_m < a2_m && a2_m < th;
public static double code(double a1_m, double a2_m, double th) {
double tmp;
if (th <= 3e+33) {
tmp = Math.pow(2.0, -0.5) * (((a1_m * a1_m) + (a2_m * a2_m)) * (1.0 + ((th * th) * (-0.5 + ((th * th) * (0.041666666666666664 + ((th * th) * -0.001388888888888889)))))));
} else if (th <= 2e+141) {
tmp = a2_m * (a2_m * Math.sqrt(0.5));
} else {
tmp = (0.0 - -1.0) / (Math.sqrt(2.0) / (a2_m * a2_m));
}
return tmp;
}
a1_m = math.fabs(a1) a2_m = math.fabs(a2) [a1_m, a2_m, th] = sort([a1_m, a2_m, th]) def code(a1_m, a2_m, th): tmp = 0 if th <= 3e+33: tmp = math.pow(2.0, -0.5) * (((a1_m * a1_m) + (a2_m * a2_m)) * (1.0 + ((th * th) * (-0.5 + ((th * th) * (0.041666666666666664 + ((th * th) * -0.001388888888888889))))))) elif th <= 2e+141: tmp = a2_m * (a2_m * math.sqrt(0.5)) else: tmp = (0.0 - -1.0) / (math.sqrt(2.0) / (a2_m * a2_m)) return tmp
a1_m = abs(a1) a2_m = abs(a2) a1_m, a2_m, th = sort([a1_m, a2_m, th]) function code(a1_m, a2_m, th) tmp = 0.0 if (th <= 3e+33) tmp = Float64((2.0 ^ -0.5) * Float64(Float64(Float64(a1_m * a1_m) + Float64(a2_m * a2_m)) * Float64(1.0 + Float64(Float64(th * th) * Float64(-0.5 + Float64(Float64(th * th) * Float64(0.041666666666666664 + Float64(Float64(th * th) * -0.001388888888888889)))))))); elseif (th <= 2e+141) tmp = Float64(a2_m * Float64(a2_m * sqrt(0.5))); else tmp = Float64(Float64(0.0 - -1.0) / Float64(sqrt(2.0) / Float64(a2_m * a2_m))); end return tmp end
a1_m = abs(a1);
a2_m = abs(a2);
a1_m, a2_m, th = num2cell(sort([a1_m, a2_m, th])){:}
function tmp_2 = code(a1_m, a2_m, th)
tmp = 0.0;
if (th <= 3e+33)
tmp = (2.0 ^ -0.5) * (((a1_m * a1_m) + (a2_m * a2_m)) * (1.0 + ((th * th) * (-0.5 + ((th * th) * (0.041666666666666664 + ((th * th) * -0.001388888888888889)))))));
elseif (th <= 2e+141)
tmp = a2_m * (a2_m * sqrt(0.5));
else
tmp = (0.0 - -1.0) / (sqrt(2.0) / (a2_m * a2_m));
end
tmp_2 = tmp;
end
a1_m = N[Abs[a1], $MachinePrecision] a2_m = N[Abs[a2], $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_] := If[LessEqual[th, 3e+33], N[(N[Power[2.0, -0.5], $MachinePrecision] * N[(N[(N[(a1$95$m * a1$95$m), $MachinePrecision] + N[(a2$95$m * a2$95$m), $MachinePrecision]), $MachinePrecision] * N[(1.0 + N[(N[(th * th), $MachinePrecision] * N[(-0.5 + N[(N[(th * th), $MachinePrecision] * N[(0.041666666666666664 + N[(N[(th * th), $MachinePrecision] * -0.001388888888888889), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[th, 2e+141], N[(a2$95$m * N[(a2$95$m * N[Sqrt[0.5], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(0.0 - -1.0), $MachinePrecision] / N[(N[Sqrt[2.0], $MachinePrecision] / N[(a2$95$m * a2$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
a1_m = \left|a1\right|
\\
a2_m = \left|a2\right|
\\
[a1_m, a2_m, th] = \mathsf{sort}([a1_m, a2_m, th])\\
\\
\begin{array}{l}
\mathbf{if}\;th \leq 3 \cdot 10^{+33}:\\
\;\;\;\;{2}^{-0.5} \cdot \left(\left(a1\_m \cdot a1\_m + a2\_m \cdot a2\_m\right) \cdot \left(1 + \left(th \cdot th\right) \cdot \left(-0.5 + \left(th \cdot th\right) \cdot \left(0.041666666666666664 + \left(th \cdot th\right) \cdot -0.001388888888888889\right)\right)\right)\right)\\
\mathbf{elif}\;th \leq 2 \cdot 10^{+141}:\\
\;\;\;\;a2\_m \cdot \left(a2\_m \cdot \sqrt{0.5}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{0 - -1}{\frac{\sqrt{2}}{a2\_m \cdot a2\_m}}\\
\end{array}
\end{array}
if th < 2.99999999999999984e33Initial program 99.5%
distribute-lft-outN/A
clear-numN/A
associate-/r/N/A
associate-*l*N/A
*-lowering-*.f64N/A
pow1/2N/A
pow-flipN/A
pow-lowering-pow.f64N/A
metadata-evalN/A
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6499.5%
Applied egg-rr99.5%
Taylor expanded in th around 0
+-lowering-+.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
sub-negN/A
metadata-evalN/A
+-commutativeN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6467.0%
Simplified67.0%
if 2.99999999999999984e33 < th < 2.00000000000000003e141Initial program 99.5%
Taylor expanded in a1 around 0
/-lowering-/.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
sqrt-lowering-sqrt.f6444.3%
Simplified44.3%
clear-numN/A
associate-/r/N/A
associate-*l*N/A
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
pow1/2N/A
pow-flipN/A
metadata-evalN/A
pow-lowering-pow.f64N/A
*-lowering-*.f64N/A
cos-lowering-cos.f6444.3%
Applied egg-rr44.3%
Taylor expanded in th around 0
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f6412.8%
Simplified12.8%
if 2.00000000000000003e141 < th Initial program 99.7%
Taylor expanded in a1 around 0
/-lowering-/.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
sqrt-lowering-sqrt.f6439.4%
Simplified39.4%
Taylor expanded in th around 0
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f6413.0%
Simplified13.0%
clear-numN/A
frac-2negN/A
metadata-evalN/A
/-lowering-/.f64N/A
neg-sub0N/A
--lowering--.f64N/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f6417.2%
Applied egg-rr17.2%
Final simplification56.4%
a1_m = (fabs.f64 a1)
a2_m = (fabs.f64 a2)
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
(if (<= th 3e+33)
(*
(+ 1.0 (* -0.5 (* th th)))
(* (+ (* a1_m a1_m) (* a2_m a2_m)) (sqrt 0.5)))
(if (<= th 2e+141)
(* a2_m (* a2_m (sqrt 0.5)))
(/ (- 0.0 -1.0) (/ (sqrt 2.0) (* a2_m a2_m))))))a1_m = fabs(a1);
a2_m = fabs(a2);
assert(a1_m < a2_m && a2_m < th);
double code(double a1_m, double a2_m, double th) {
double tmp;
if (th <= 3e+33) {
tmp = (1.0 + (-0.5 * (th * th))) * (((a1_m * a1_m) + (a2_m * a2_m)) * sqrt(0.5));
} else if (th <= 2e+141) {
tmp = a2_m * (a2_m * sqrt(0.5));
} else {
tmp = (0.0 - -1.0) / (sqrt(2.0) / (a2_m * a2_m));
}
return tmp;
}
a1_m = abs(a1)
a2_m = abs(a2)
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
real(8) :: tmp
if (th <= 3d+33) then
tmp = (1.0d0 + ((-0.5d0) * (th * th))) * (((a1_m * a1_m) + (a2_m * a2_m)) * sqrt(0.5d0))
else if (th <= 2d+141) then
tmp = a2_m * (a2_m * sqrt(0.5d0))
else
tmp = (0.0d0 - (-1.0d0)) / (sqrt(2.0d0) / (a2_m * a2_m))
end if
code = tmp
end function
a1_m = Math.abs(a1);
a2_m = Math.abs(a2);
assert a1_m < a2_m && a2_m < th;
public static double code(double a1_m, double a2_m, double th) {
double tmp;
if (th <= 3e+33) {
tmp = (1.0 + (-0.5 * (th * th))) * (((a1_m * a1_m) + (a2_m * a2_m)) * Math.sqrt(0.5));
} else if (th <= 2e+141) {
tmp = a2_m * (a2_m * Math.sqrt(0.5));
} else {
tmp = (0.0 - -1.0) / (Math.sqrt(2.0) / (a2_m * a2_m));
}
return tmp;
}
a1_m = math.fabs(a1) a2_m = math.fabs(a2) [a1_m, a2_m, th] = sort([a1_m, a2_m, th]) def code(a1_m, a2_m, th): tmp = 0 if th <= 3e+33: tmp = (1.0 + (-0.5 * (th * th))) * (((a1_m * a1_m) + (a2_m * a2_m)) * math.sqrt(0.5)) elif th <= 2e+141: tmp = a2_m * (a2_m * math.sqrt(0.5)) else: tmp = (0.0 - -1.0) / (math.sqrt(2.0) / (a2_m * a2_m)) return tmp
a1_m = abs(a1) a2_m = abs(a2) a1_m, a2_m, th = sort([a1_m, a2_m, th]) function code(a1_m, a2_m, th) tmp = 0.0 if (th <= 3e+33) tmp = Float64(Float64(1.0 + Float64(-0.5 * Float64(th * th))) * Float64(Float64(Float64(a1_m * a1_m) + Float64(a2_m * a2_m)) * sqrt(0.5))); elseif (th <= 2e+141) tmp = Float64(a2_m * Float64(a2_m * sqrt(0.5))); else tmp = Float64(Float64(0.0 - -1.0) / Float64(sqrt(2.0) / Float64(a2_m * a2_m))); end return tmp end
a1_m = abs(a1);
a2_m = abs(a2);
a1_m, a2_m, th = num2cell(sort([a1_m, a2_m, th])){:}
function tmp_2 = code(a1_m, a2_m, th)
tmp = 0.0;
if (th <= 3e+33)
tmp = (1.0 + (-0.5 * (th * th))) * (((a1_m * a1_m) + (a2_m * a2_m)) * sqrt(0.5));
elseif (th <= 2e+141)
tmp = a2_m * (a2_m * sqrt(0.5));
else
tmp = (0.0 - -1.0) / (sqrt(2.0) / (a2_m * a2_m));
end
tmp_2 = tmp;
end
a1_m = N[Abs[a1], $MachinePrecision] a2_m = N[Abs[a2], $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_] := If[LessEqual[th, 3e+33], N[(N[(1.0 + N[(-0.5 * N[(th * th), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(N[(a1$95$m * a1$95$m), $MachinePrecision] + N[(a2$95$m * a2$95$m), $MachinePrecision]), $MachinePrecision] * N[Sqrt[0.5], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[th, 2e+141], N[(a2$95$m * N[(a2$95$m * N[Sqrt[0.5], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(0.0 - -1.0), $MachinePrecision] / N[(N[Sqrt[2.0], $MachinePrecision] / N[(a2$95$m * a2$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
a1_m = \left|a1\right|
\\
a2_m = \left|a2\right|
\\
[a1_m, a2_m, th] = \mathsf{sort}([a1_m, a2_m, th])\\
\\
\begin{array}{l}
\mathbf{if}\;th \leq 3 \cdot 10^{+33}:\\
\;\;\;\;\left(1 + -0.5 \cdot \left(th \cdot th\right)\right) \cdot \left(\left(a1\_m \cdot a1\_m + a2\_m \cdot a2\_m\right) \cdot \sqrt{0.5}\right)\\
\mathbf{elif}\;th \leq 2 \cdot 10^{+141}:\\
\;\;\;\;a2\_m \cdot \left(a2\_m \cdot \sqrt{0.5}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{0 - -1}{\frac{\sqrt{2}}{a2\_m \cdot a2\_m}}\\
\end{array}
\end{array}
if th < 2.99999999999999984e33Initial program 99.5%
distribute-lft-outN/A
clear-numN/A
associate-/r/N/A
associate-*l*N/A
*-lowering-*.f64N/A
pow1/2N/A
pow-flipN/A
pow-lowering-pow.f64N/A
metadata-evalN/A
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6499.5%
Applied egg-rr99.5%
Taylor expanded in th around 0
associate-*r*N/A
distribute-lft1-inN/A
+-commutativeN/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f6469.3%
Simplified69.3%
if 2.99999999999999984e33 < th < 2.00000000000000003e141Initial program 99.5%
Taylor expanded in a1 around 0
/-lowering-/.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
sqrt-lowering-sqrt.f6444.3%
Simplified44.3%
clear-numN/A
associate-/r/N/A
associate-*l*N/A
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
pow1/2N/A
pow-flipN/A
metadata-evalN/A
pow-lowering-pow.f64N/A
*-lowering-*.f64N/A
cos-lowering-cos.f6444.3%
Applied egg-rr44.3%
Taylor expanded in th around 0
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f6412.8%
Simplified12.8%
if 2.00000000000000003e141 < th Initial program 99.7%
Taylor expanded in a1 around 0
/-lowering-/.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
sqrt-lowering-sqrt.f6439.4%
Simplified39.4%
Taylor expanded in th around 0
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f6413.0%
Simplified13.0%
clear-numN/A
frac-2negN/A
metadata-evalN/A
/-lowering-/.f64N/A
neg-sub0N/A
--lowering--.f64N/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f6417.2%
Applied egg-rr17.2%
Final simplification58.3%
a1_m = (fabs.f64 a1)
a2_m = (fabs.f64 a2)
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
(if (<= th 3e+33)
(* a2_m (/ a2_m (/ (sqrt 2.0) (+ 1.0 (* -0.5 (* th th))))))
(if (<= th 2e+141)
(* a2_m (* a2_m (sqrt 0.5)))
(/ (- 0.0 -1.0) (/ (sqrt 2.0) (* a2_m a2_m))))))a1_m = fabs(a1);
a2_m = fabs(a2);
assert(a1_m < a2_m && a2_m < th);
double code(double a1_m, double a2_m, double th) {
double tmp;
if (th <= 3e+33) {
tmp = a2_m * (a2_m / (sqrt(2.0) / (1.0 + (-0.5 * (th * th)))));
} else if (th <= 2e+141) {
tmp = a2_m * (a2_m * sqrt(0.5));
} else {
tmp = (0.0 - -1.0) / (sqrt(2.0) / (a2_m * a2_m));
}
return tmp;
}
a1_m = abs(a1)
a2_m = abs(a2)
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
real(8) :: tmp
if (th <= 3d+33) then
tmp = a2_m * (a2_m / (sqrt(2.0d0) / (1.0d0 + ((-0.5d0) * (th * th)))))
else if (th <= 2d+141) then
tmp = a2_m * (a2_m * sqrt(0.5d0))
else
tmp = (0.0d0 - (-1.0d0)) / (sqrt(2.0d0) / (a2_m * a2_m))
end if
code = tmp
end function
a1_m = Math.abs(a1);
a2_m = Math.abs(a2);
assert a1_m < a2_m && a2_m < th;
public static double code(double a1_m, double a2_m, double th) {
double tmp;
if (th <= 3e+33) {
tmp = a2_m * (a2_m / (Math.sqrt(2.0) / (1.0 + (-0.5 * (th * th)))));
} else if (th <= 2e+141) {
tmp = a2_m * (a2_m * Math.sqrt(0.5));
} else {
tmp = (0.0 - -1.0) / (Math.sqrt(2.0) / (a2_m * a2_m));
}
return tmp;
}
a1_m = math.fabs(a1) a2_m = math.fabs(a2) [a1_m, a2_m, th] = sort([a1_m, a2_m, th]) def code(a1_m, a2_m, th): tmp = 0 if th <= 3e+33: tmp = a2_m * (a2_m / (math.sqrt(2.0) / (1.0 + (-0.5 * (th * th))))) elif th <= 2e+141: tmp = a2_m * (a2_m * math.sqrt(0.5)) else: tmp = (0.0 - -1.0) / (math.sqrt(2.0) / (a2_m * a2_m)) return tmp
a1_m = abs(a1) a2_m = abs(a2) a1_m, a2_m, th = sort([a1_m, a2_m, th]) function code(a1_m, a2_m, th) tmp = 0.0 if (th <= 3e+33) tmp = Float64(a2_m * Float64(a2_m / Float64(sqrt(2.0) / Float64(1.0 + Float64(-0.5 * Float64(th * th)))))); elseif (th <= 2e+141) tmp = Float64(a2_m * Float64(a2_m * sqrt(0.5))); else tmp = Float64(Float64(0.0 - -1.0) / Float64(sqrt(2.0) / Float64(a2_m * a2_m))); end return tmp end
a1_m = abs(a1);
a2_m = abs(a2);
a1_m, a2_m, th = num2cell(sort([a1_m, a2_m, th])){:}
function tmp_2 = code(a1_m, a2_m, th)
tmp = 0.0;
if (th <= 3e+33)
tmp = a2_m * (a2_m / (sqrt(2.0) / (1.0 + (-0.5 * (th * th)))));
elseif (th <= 2e+141)
tmp = a2_m * (a2_m * sqrt(0.5));
else
tmp = (0.0 - -1.0) / (sqrt(2.0) / (a2_m * a2_m));
end
tmp_2 = tmp;
end
a1_m = N[Abs[a1], $MachinePrecision] a2_m = N[Abs[a2], $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_] := If[LessEqual[th, 3e+33], N[(a2$95$m * N[(a2$95$m / N[(N[Sqrt[2.0], $MachinePrecision] / N[(1.0 + N[(-0.5 * N[(th * th), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[th, 2e+141], N[(a2$95$m * N[(a2$95$m * N[Sqrt[0.5], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(0.0 - -1.0), $MachinePrecision] / N[(N[Sqrt[2.0], $MachinePrecision] / N[(a2$95$m * a2$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
a1_m = \left|a1\right|
\\
a2_m = \left|a2\right|
\\
[a1_m, a2_m, th] = \mathsf{sort}([a1_m, a2_m, th])\\
\\
\begin{array}{l}
\mathbf{if}\;th \leq 3 \cdot 10^{+33}:\\
\;\;\;\;a2\_m \cdot \frac{a2\_m}{\frac{\sqrt{2}}{1 + -0.5 \cdot \left(th \cdot th\right)}}\\
\mathbf{elif}\;th \leq 2 \cdot 10^{+141}:\\
\;\;\;\;a2\_m \cdot \left(a2\_m \cdot \sqrt{0.5}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{0 - -1}{\frac{\sqrt{2}}{a2\_m \cdot a2\_m}}\\
\end{array}
\end{array}
if th < 2.99999999999999984e33Initial program 99.5%
Taylor expanded in a1 around 0
/-lowering-/.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
sqrt-lowering-sqrt.f6459.7%
Simplified59.7%
Taylor expanded in th around 0
+-lowering-+.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6443.5%
Simplified43.5%
associate-/l*N/A
associate-*l*N/A
*-lowering-*.f64N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6442.7%
Applied egg-rr42.7%
if 2.99999999999999984e33 < th < 2.00000000000000003e141Initial program 99.5%
Taylor expanded in a1 around 0
/-lowering-/.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
sqrt-lowering-sqrt.f6444.3%
Simplified44.3%
clear-numN/A
associate-/r/N/A
associate-*l*N/A
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
pow1/2N/A
pow-flipN/A
metadata-evalN/A
pow-lowering-pow.f64N/A
*-lowering-*.f64N/A
cos-lowering-cos.f6444.3%
Applied egg-rr44.3%
Taylor expanded in th around 0
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f6412.8%
Simplified12.8%
if 2.00000000000000003e141 < th Initial program 99.7%
Taylor expanded in a1 around 0
/-lowering-/.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
sqrt-lowering-sqrt.f6439.4%
Simplified39.4%
Taylor expanded in th around 0
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f6413.0%
Simplified13.0%
clear-numN/A
frac-2negN/A
metadata-evalN/A
/-lowering-/.f64N/A
neg-sub0N/A
--lowering--.f64N/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f6417.2%
Applied egg-rr17.2%
Final simplification36.9%
a1_m = (fabs.f64 a1) a2_m = (fabs.f64 a2) 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 (if (<= th 2e+141) (* (+ (* a1_m a1_m) (* a2_m a2_m)) (sqrt 0.5)) (/ (- 0.0 -1.0) (/ (sqrt 2.0) (* a2_m a2_m)))))
a1_m = fabs(a1);
a2_m = fabs(a2);
assert(a1_m < a2_m && a2_m < th);
double code(double a1_m, double a2_m, double th) {
double tmp;
if (th <= 2e+141) {
tmp = ((a1_m * a1_m) + (a2_m * a2_m)) * sqrt(0.5);
} else {
tmp = (0.0 - -1.0) / (sqrt(2.0) / (a2_m * a2_m));
}
return tmp;
}
a1_m = abs(a1)
a2_m = abs(a2)
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
real(8) :: tmp
if (th <= 2d+141) then
tmp = ((a1_m * a1_m) + (a2_m * a2_m)) * sqrt(0.5d0)
else
tmp = (0.0d0 - (-1.0d0)) / (sqrt(2.0d0) / (a2_m * a2_m))
end if
code = tmp
end function
a1_m = Math.abs(a1);
a2_m = Math.abs(a2);
assert a1_m < a2_m && a2_m < th;
public static double code(double a1_m, double a2_m, double th) {
double tmp;
if (th <= 2e+141) {
tmp = ((a1_m * a1_m) + (a2_m * a2_m)) * Math.sqrt(0.5);
} else {
tmp = (0.0 - -1.0) / (Math.sqrt(2.0) / (a2_m * a2_m));
}
return tmp;
}
a1_m = math.fabs(a1) a2_m = math.fabs(a2) [a1_m, a2_m, th] = sort([a1_m, a2_m, th]) def code(a1_m, a2_m, th): tmp = 0 if th <= 2e+141: tmp = ((a1_m * a1_m) + (a2_m * a2_m)) * math.sqrt(0.5) else: tmp = (0.0 - -1.0) / (math.sqrt(2.0) / (a2_m * a2_m)) return tmp
a1_m = abs(a1) a2_m = abs(a2) a1_m, a2_m, th = sort([a1_m, a2_m, th]) function code(a1_m, a2_m, th) tmp = 0.0 if (th <= 2e+141) tmp = Float64(Float64(Float64(a1_m * a1_m) + Float64(a2_m * a2_m)) * sqrt(0.5)); else tmp = Float64(Float64(0.0 - -1.0) / Float64(sqrt(2.0) / Float64(a2_m * a2_m))); end return tmp end
a1_m = abs(a1);
a2_m = abs(a2);
a1_m, a2_m, th = num2cell(sort([a1_m, a2_m, th])){:}
function tmp_2 = code(a1_m, a2_m, th)
tmp = 0.0;
if (th <= 2e+141)
tmp = ((a1_m * a1_m) + (a2_m * a2_m)) * sqrt(0.5);
else
tmp = (0.0 - -1.0) / (sqrt(2.0) / (a2_m * a2_m));
end
tmp_2 = tmp;
end
a1_m = N[Abs[a1], $MachinePrecision] a2_m = N[Abs[a2], $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_] := If[LessEqual[th, 2e+141], N[(N[(N[(a1$95$m * a1$95$m), $MachinePrecision] + N[(a2$95$m * a2$95$m), $MachinePrecision]), $MachinePrecision] * N[Sqrt[0.5], $MachinePrecision]), $MachinePrecision], N[(N[(0.0 - -1.0), $MachinePrecision] / N[(N[Sqrt[2.0], $MachinePrecision] / N[(a2$95$m * a2$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
a1_m = \left|a1\right|
\\
a2_m = \left|a2\right|
\\
[a1_m, a2_m, th] = \mathsf{sort}([a1_m, a2_m, th])\\
\\
\begin{array}{l}
\mathbf{if}\;th \leq 2 \cdot 10^{+141}:\\
\;\;\;\;\left(a1\_m \cdot a1\_m + a2\_m \cdot a2\_m\right) \cdot \sqrt{0.5}\\
\mathbf{else}:\\
\;\;\;\;\frac{0 - -1}{\frac{\sqrt{2}}{a2\_m \cdot a2\_m}}\\
\end{array}
\end{array}
if th < 2.00000000000000003e141Initial program 99.5%
distribute-lft-outN/A
clear-numN/A
associate-/r/N/A
associate-*l*N/A
*-lowering-*.f64N/A
pow1/2N/A
pow-flipN/A
pow-lowering-pow.f64N/A
metadata-evalN/A
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6499.6%
Applied egg-rr99.6%
Taylor expanded in th around 0
*-commutativeN/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f6468.1%
Simplified68.1%
if 2.00000000000000003e141 < th Initial program 99.7%
Taylor expanded in a1 around 0
/-lowering-/.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
sqrt-lowering-sqrt.f6439.4%
Simplified39.4%
Taylor expanded in th around 0
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f6413.0%
Simplified13.0%
clear-numN/A
frac-2negN/A
metadata-evalN/A
/-lowering-/.f64N/A
neg-sub0N/A
--lowering--.f64N/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f6417.2%
Applied egg-rr17.2%
Final simplification62.9%
a1_m = (fabs.f64 a1) a2_m = (fabs.f64 a2) NOTE: a1_m, a2_m, and th should be sorted in increasing order before calling this function. (FPCore (a1_m a2_m th) :precision binary64 (* (+ (* a1_m a1_m) (* a2_m a2_m)) (sqrt 0.5)))
a1_m = fabs(a1);
a2_m = fabs(a2);
assert(a1_m < a2_m && a2_m < th);
double code(double a1_m, double a2_m, double th) {
return ((a1_m * a1_m) + (a2_m * a2_m)) * sqrt(0.5);
}
a1_m = abs(a1)
a2_m = abs(a2)
NOTE: a1_m, a2_m, and th should be sorted in increasing order before calling this function.
real(8) function code(a1_m, a2_m, th)
real(8), intent (in) :: a1_m
real(8), intent (in) :: a2_m
real(8), intent (in) :: th
code = ((a1_m * a1_m) + (a2_m * a2_m)) * sqrt(0.5d0)
end function
a1_m = Math.abs(a1);
a2_m = Math.abs(a2);
assert a1_m < a2_m && a2_m < th;
public static double code(double a1_m, double a2_m, double th) {
return ((a1_m * a1_m) + (a2_m * a2_m)) * Math.sqrt(0.5);
}
a1_m = math.fabs(a1) a2_m = math.fabs(a2) [a1_m, a2_m, th] = sort([a1_m, a2_m, th]) def code(a1_m, a2_m, th): return ((a1_m * a1_m) + (a2_m * a2_m)) * math.sqrt(0.5)
a1_m = abs(a1) a2_m = abs(a2) a1_m, a2_m, th = sort([a1_m, a2_m, th]) function code(a1_m, a2_m, th) return Float64(Float64(Float64(a1_m * a1_m) + Float64(a2_m * a2_m)) * sqrt(0.5)) end
a1_m = abs(a1);
a2_m = abs(a2);
a1_m, a2_m, th = num2cell(sort([a1_m, a2_m, th])){:}
function tmp = code(a1_m, a2_m, th)
tmp = ((a1_m * a1_m) + (a2_m * a2_m)) * sqrt(0.5);
end
a1_m = N[Abs[a1], $MachinePrecision] a2_m = N[Abs[a2], $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[(a1$95$m * a1$95$m), $MachinePrecision] + N[(a2$95$m * a2$95$m), $MachinePrecision]), $MachinePrecision] * N[Sqrt[0.5], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
a1_m = \left|a1\right|
\\
a2_m = \left|a2\right|
\\
[a1_m, a2_m, th] = \mathsf{sort}([a1_m, a2_m, th])\\
\\
\left(a1\_m \cdot a1\_m + a2\_m \cdot a2\_m\right) \cdot \sqrt{0.5}
\end{array}
Initial program 99.5%
distribute-lft-outN/A
clear-numN/A
associate-/r/N/A
associate-*l*N/A
*-lowering-*.f64N/A
pow1/2N/A
pow-flipN/A
pow-lowering-pow.f64N/A
metadata-evalN/A
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6499.6%
Applied egg-rr99.6%
Taylor expanded in th around 0
*-commutativeN/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f6463.3%
Simplified63.3%
a1_m = (fabs.f64 a1) a2_m = (fabs.f64 a2) 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))))
a1_m = fabs(a1);
a2_m = fabs(a2);
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));
}
a1_m = abs(a1)
a2_m = abs(a2)
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
a1_m = Math.abs(a1);
a2_m = Math.abs(a2);
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));
}
a1_m = math.fabs(a1) a2_m = math.fabs(a2) [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))
a1_m = abs(a1) a2_m = abs(a2) 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
a1_m = abs(a1);
a2_m = abs(a2);
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
a1_m = N[Abs[a1], $MachinePrecision] a2_m = N[Abs[a2], $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}
a1_m = \left|a1\right|
\\
a2_m = \left|a2\right|
\\
[a1_m, a2_m, th] = \mathsf{sort}([a1_m, a2_m, th])\\
\\
a2\_m \cdot \frac{a2\_m}{\sqrt{2}}
\end{array}
Initial program 99.5%
Taylor expanded in a1 around 0
/-lowering-/.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
sqrt-lowering-sqrt.f6456.3%
Simplified56.3%
Taylor expanded in th around 0
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f6439.2%
Simplified39.2%
associate-/l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f6439.2%
Applied egg-rr39.2%
Final simplification39.2%
a1_m = (fabs.f64 a1) a2_m = (fabs.f64 a2) 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 0.5)))
a1_m = fabs(a1);
a2_m = fabs(a2);
assert(a1_m < a2_m && a2_m < th);
double code(double a1_m, double a2_m, double th) {
return (a2_m * a2_m) * sqrt(0.5);
}
a1_m = abs(a1)
a2_m = abs(a2)
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(0.5d0)
end function
a1_m = Math.abs(a1);
a2_m = Math.abs(a2);
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(0.5);
}
a1_m = math.fabs(a1) a2_m = math.fabs(a2) [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(0.5)
a1_m = abs(a1) a2_m = abs(a2) 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(0.5)) end
a1_m = abs(a1);
a2_m = abs(a2);
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(0.5);
end
a1_m = N[Abs[a1], $MachinePrecision] a2_m = N[Abs[a2], $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[0.5], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
a1_m = \left|a1\right|
\\
a2_m = \left|a2\right|
\\
[a1_m, a2_m, th] = \mathsf{sort}([a1_m, a2_m, th])\\
\\
\left(a2\_m \cdot a2\_m\right) \cdot \sqrt{0.5}
\end{array}
Initial program 99.5%
Taylor expanded in a1 around 0
/-lowering-/.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
sqrt-lowering-sqrt.f6456.3%
Simplified56.3%
clear-numN/A
associate-/r/N/A
associate-*l*N/A
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
pow1/2N/A
pow-flipN/A
metadata-evalN/A
pow-lowering-pow.f64N/A
*-lowering-*.f64N/A
cos-lowering-cos.f6456.2%
Applied egg-rr56.2%
Taylor expanded in th around 0
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f6439.2%
Simplified39.2%
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f6439.2%
Applied egg-rr39.2%
a1_m = (fabs.f64 a1) a2_m = (fabs.f64 a2) 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 0.5))))
a1_m = fabs(a1);
a2_m = fabs(a2);
assert(a1_m < a2_m && a2_m < th);
double code(double a1_m, double a2_m, double th) {
return a2_m * (a2_m * sqrt(0.5));
}
a1_m = abs(a1)
a2_m = abs(a2)
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(0.5d0))
end function
a1_m = Math.abs(a1);
a2_m = Math.abs(a2);
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(0.5));
}
a1_m = math.fabs(a1) a2_m = math.fabs(a2) [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(0.5))
a1_m = abs(a1) a2_m = abs(a2) 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(0.5))) end
a1_m = abs(a1);
a2_m = abs(a2);
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(0.5));
end
a1_m = N[Abs[a1], $MachinePrecision] a2_m = N[Abs[a2], $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[0.5], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
a1_m = \left|a1\right|
\\
a2_m = \left|a2\right|
\\
[a1_m, a2_m, th] = \mathsf{sort}([a1_m, a2_m, th])\\
\\
a2\_m \cdot \left(a2\_m \cdot \sqrt{0.5}\right)
\end{array}
Initial program 99.5%
Taylor expanded in a1 around 0
/-lowering-/.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
sqrt-lowering-sqrt.f6456.3%
Simplified56.3%
clear-numN/A
associate-/r/N/A
associate-*l*N/A
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
pow1/2N/A
pow-flipN/A
metadata-evalN/A
pow-lowering-pow.f64N/A
*-lowering-*.f64N/A
cos-lowering-cos.f6456.2%
Applied egg-rr56.2%
Taylor expanded in th around 0
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f6439.2%
Simplified39.2%
herbie shell --seed 2024185
(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))))