Abstract
We give an error analysis of an algorithm for computing the sample variance due to Chan, Golub, and LeVeque [The American Statistician 7 (1983), pp. 242-247]. It is shown that this algorithm is numerically stable. The algorithm computes the sample variance (and the sample mean) using just one pass through the sample data. It is amenable to pairwise summation and thus requires only O(log n) parallel steps.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 583-590 |
| Number of pages | 8 |
| Journal | Numerische Mathematik |
| Volume | 58 |
| Issue number | 1 |
| DOIs | |
| State | Published - Dec 1990 |
All Science Journal Classification (ASJC) codes
- Computational Mathematics
- Applied Mathematics