in descriptive statistics, there are two computational algorithms for determining the variance s2, of a set of observations : algorithm 1: s2= - , algorithm 2: s2= , where . it is interesting to discuss, which of the above formulas is numerically more trustworthy in machine numbers sets. i this paper, based on total effect of rounding error, we prove that the second algorithm is better than ...

At a high level, the AKS algorithm for finding the shortest vector in a lattice works by taking a large sphere or box and choosing many (e.g. ∼ 2) random lattice points in the box by taking random combinations of the basis. The points are then refined through an iterative routine called sieving. The sieving procedure Sieve(Y ) will have the following properties. Sieve(Y ) = C ⊆ Y such that: • F...

In descriptive statistics, there are two computational algorithms for determining the variance S2, of a set of observations : Algorithm 1: S2= - , Algorithm 2: S2= , where . It is interesting to discuss, which of the above formulas is numerically more trustworthy in machine numbers sets. I this paper, based on total effect of rounding error, we prove that the second Algorithm is better...