Computing standard deviations
- 1 September 1979
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 22 (9) , 526-531
- https://doi.org/10.1145/359146.359152
Abstract
Four algorithms for the numerical computation of the standard deviation of (unweighted) sampled data are analyzed. Two of the algorithms are well-known in the statistical and computational literature; the other two are new algorithms specifically intended for automatic computation. Our discussion is expository, with emphasis on reaching a suitable definition of “accuracy.” Each of the four algorithms is analyzed for the conditions under which it will be accurate. We conclude that all four algorithms will provide accurate answers for many problems, but two of the algorithms, one new, one old, are substantially more accurate on difficult problems than are the other two.Keywords
This publication has 9 references indexed in Scilit:
- Updating mean and variance estimatesCommunications of the ACM, 1979
- Further remark on stably updating mean and standard deviation estimatesCommunications of the ACM, 1979
- Incremental least squares and the approximate seperation of exponentialsNuclear Instruments and Methods, 1976
- 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
- Comparison of Several Algorithms for Computing Sample Means and VariancesJournal of the American Statistical Association, 1974
- Some Results Relevant to Choice of Sum and Sum-of-Product AlgorithmsTechnometrics, 1971
- Comparison of several algorithms for computation of means, standard deviations and correlation coefficientsCommunications of the ACM, 1966
- Note on a Method for Calculating Corrected Sums of Squares and ProductsTechnometrics, 1962