Improve README
This commit is contained in:
parent
34a8aadb35
commit
79f449e190
@ -1,9 +1,15 @@
|
|||||||
# average
|
# average
|
||||||
|
|
||||||
Calculate the average of a sequence and its error iteratively, using constant
|
Calculate the average of a sequence and its error iteratively, using constant
|
||||||
memory.
|
memory and avoiding numerical problems. The calculation can be easily parallelized
|
||||||
|
by using `Average::merge`.
|
||||||
|
|
||||||
[Documentation](https://docs.rs/average) |
|
[Documentation](https://docs.rs/average) |
|
||||||
[crates.io](https://crates.io/crates/average)
|
[crates.io](https://crates.io/crates/average)
|
||||||
|
|
||||||
[![Build Status](https://travis-ci.org/vks/average.svg?branch=master)](https://travis-ci.org/vks/average)
|
[![Build Status](https://travis-ci.org/vks/average.svg?branch=master)](https://travis-ci.org/vks/average)
|
||||||
|
|
||||||
|
## 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.
|
||||||
|
Loading…
x
Reference in New Issue
Block a user