2017-05-05 16:52:54 +02:00
|
|
|
# average
|
|
|
|
|
|
|
|
Calculate the average of a sequence and its error iteratively, using constant
|
2017-05-16 18:21:27 +02:00
|
|
|
memory and avoiding numerical problems. The calculation can be easily parallelized
|
|
|
|
by using `Average::merge`.
|
2017-05-05 16:52:54 +02:00
|
|
|
|
2017-05-05 16:54:01 +02:00
|
|
|
[Documentation](https://docs.rs/average) |
|
2017-05-05 17:01:59 +02:00
|
|
|
[crates.io](https://crates.io/crates/average)
|
|
|
|
|
2017-05-05 17:01:10 +02:00
|
|
|
[![Build Status](https://travis-ci.org/vks/average.svg?branch=master)](https://travis-ci.org/vks/average)
|
2017-05-16 18:21:27 +02:00
|
|
|
|
|
|
|
## Advantages over naive calculation of average and variance
|
|
|
|
|
|
|
|
* Avoids loss of precision due to cancellation.
|
|
|
|
* Only needs a single pass over the samples, at the cost of a division inside the loop.
|