mgh 0.1.16

A Collection of Moré-Garbow-Hilstrom https://dl.acm.org/doi/pdf/10.1145/355934.355936
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

pub fn discrete_boundary_value(x: &[f64]) -> f64 {
    let mut res = 0.;
    for i in 1..(x.len() + 1) {
        let index = i - 1;
        let h = 1. / (x.len() as f64 + 1.);
        let t = i as f64 * h;

        let plus1 = if index + 1 < x.len() {
            x[index + 1]
        } else {
            0.
        };
        // x_{i-1} (with x_0 = 0)
        let minus1 = if index > 0 { x[index - 1] } else { 0. };

        // f_i(x) = 2x_i - x_{i-1} - x_{i+1} + h^2(x_i + t_i + 1)^3 / 2
        let f = 2. * x[index] - minus1 - plus1 + h.powi(2) * (x[index] + t + 1.).powi(3) / 2.;

        res += f.powi(2);
    }
    res
}

pub fn init(n: usize) -> Vec<f64> {
    let h = 1. / (n as f64 + 1.);
    let mut vec = vec![0.; n];
    for (i, item) in vec.iter_mut().enumerate().take(n) {
        let t = (i as f64 + 1.) * h;
        *item = t * (t - 1.);
    }
    vec
}

#[cfg(test)]
mod tests {
    use super::*;

    #[test]
    fn test_discrete_boundary_value() {
        let n = 3;
        let x = init(n);
        let val = discrete_boundary_value(&x);
        assert!(val.is_finite());
    }
}