Algorithms for Computing the Sample Variance: Analysis and Recommendations
- 1 August 1983
- journal article
- research article
- Published by Taylor & Francis in The American Statistician
- Vol. 37 (3) , 242-247
- https://doi.org/10.1080/00031305.1983.10483115
Abstract
The problem of computing the variance of a sample of N data points {xi } may be difficult for certain data sets, particularly when N is large and the variance is small. We present a survey of possible algorithms and their round-off error bounds, including some new analysis for computations with shifted data. Experimental results confirm these bounds and illustrate the dangers of some algorithms. Specific recommendations are made as to which algorithm should be used in various contexts.Keywords
This publication has 7 references indexed in Scilit:
- Updating Formulae and a Pairwise Algorithm for Computing Sample VariancesPublished by Springer Nature ,1982
- Updating mean and variance estimatesCommunications of the ACM, 1979
- Computing standard deviationsCommunications of the ACM, 1979
- Remark on stably updating mean and standard deviation of dataCommunications of the ACM, 1975
- Stably updating mean and standard deviation of dataCommunications of the ACM, 1975
- Some Results Relevant to Choice of Sum and Sum-of-Product AlgorithmsTechnometrics, 1971
- Note on a Method for Calculating Corrected Sums of Squares and ProductsTechnometrics, 1962