Rapid Calculation Methods
It has been suggested that this article be merged into Algorithms for calculating variance. (Discuss) |
The following two formulas can represent a running (continuous) standard deviation. A set of two power sums s1 and s2 are computed over a set of N values of x, denoted as x1, ..., xN:
Given the results of these three running summations, the values N, s1, s2 can be used at any time to compute the current value of the running standard deviation:
Where :
Similarly for sample standard deviation,
In a computer implementation, as the three sj sums become large, we need to consider round-off error, arithmetic overflow, and arithmetic underflow. The method below calculates the running sums method with reduced rounding errors. This is a "one pass" algorithm for calculating variance of n samples without the need to store prior data during the calculation. Applying this method to a time series will result in successive values of standard deviation corresponding to n data points as n grows larger with each new sample, rather than a constant-width sliding window calculation.
For k = 1, ..., n:
where A is the mean value.
Sample variance:
Population variance:
Read more about this topic: Sample Standard Deviation
Famous quotes containing the words rapid, calculation and/or methods:
“The idealism of Berkeley is only a crude statement of the idealism of Jesus, and that again is a crude statement of the fact that all nature is the rapid efflux of goodness executing and organizing itself.”
—Ralph Waldo Emerson (18031882)
“Common sense is the measure of the possible; it is composed of experience and prevision; it is calculation appled to life.”
—Henri-Frédéric Amiel (18211881)
“In inner-party politics, these methods lead, as we shall yet see, to this: the party organization substitutes itself for the party, the central committee substitutes itself for the organization, and, finally, a dictator substitutes himself for the central committee.”
—Leon Trotsky (18791940)