compensated-summation 0.3.1

Compensated summation algorithms for better precision.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85

use crate::*;

/// Alternative implementation of `Iterator::sum::<KahanBabuska<_>>().total()`.
pub fn kahan_babuska_sum<T, I>(iter: I) -> T
where
    T: Float,
    I: IntoIterator<Item = T>,
{
    let mut s = T::zero();
    let mut c = T::zero();
    for x in iter {
        let y = x + c;
        let t = s + y;
        c = y - (t - s);
        s = t;
    }
    s + c
}

/// Alternative implementation of `Iterator::sum::<KahanBabuskaNeumaier<_>>().total()`.
pub fn kahan_babuska_neumaier_sum<T, I>(iter: I) -> T
where
    T: Float + AddAssign,
    I: IntoIterator<Item = T>,
{
    let mut s = T::zero();
    let mut c = T::zero();
    for x in iter {
        let (t, d) = two_sum(s, x);
        s = t;
        c += d;
    }
    s + c
}

/// Alternative implementation of `Iterator::sum::<KahanBabuskaNeumaier<_>>().total()`
/// using an absolute value comparison.
pub fn kahan_babuska_neumaier_abs_sum<T, I>(iter: I) -> T
where
    T: Float + AddAssign,
    I: IntoIterator<Item = T>,
{
    let mut s = T::zero();
    let mut c = T::zero();
    for x in iter {
        let t = s + x;
        if s.abs() >= x.abs() {
            // c += (s - t) + x;
            c += x - (t - s);
        } else {
            // c += (x - t) + s;
            c += s - (t - x);
        }
        s = t;
    }
    s + c
}

/// Alternative implementation of [`two_sum`] using an absolute value comparison.
pub fn abs_two_sum<T: Float>(a: T, b: T) -> (T, T) {
    let s = a + b;
    let t = if a.abs() >= b.abs() {
        b - (s - a)
    } else {
        a - (s - b)
    };
    (s, t)
}

/// Alternative implementation of `Iterator::sum::<KahanBabuskaNeumaier<_>>().total()`
/// using `abs_two_sum`.
pub fn kahan_babuska_neumaier_abs_two_sum<T, I>(iter: I) -> T
where
    T: Float + AddAssign,
    I: IntoIterator<Item = T>,
{
    let mut s = T::zero();
    let mut c = T::zero();
    for x in iter {
        let (t, d) = abs_two_sum(s, x);
        s = t;
        c += d;
    }
    s + c
}