compensated-summation
| Crates.io | compensated-summation |
| lib.rs | compensated-summation |
| version | 0.3.0 |
| source | src |
| created_at | 2024-05-14 12:19:49.715937 |
| updated_at | 2024-05-20 13:44:13.920814 |
| description | Compensated summation algorithms for better precision. |
| homepage | |
| repository | https://github.com/FedericoStra/compensated-summation |
| max_upload_size | |
| id | 1239520 |
| size | 30,803 |
Federico Stra (FedericoStra)
documentation
README
compensated-summation
Compensated summation algorithms for better precision.
This crate implements summation algorithms that significantly reduce the numerical error in the total obtained by adding a sequence of finite-precision floating-point numbers, compared to the obvious approach.
Currently it implements the 2Sum and Fast2Sum from https://en.wikipedia.org/wiki/2Sum for exact addition and the Kahan-Babuška and Kahan-Babuška-Neumaier algorithms for compensated summation.
Please see the documentation for a description of the API and some usage examples.