root1d 0.4.1

One dimensional root finding algorithms
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

use std::{cell::Cell, error::Error};
use roots;

fn main() -> Result<(), Box<dyn Error + Send + Sync + 'static>> {
    let mut sum = 0.;

    let mut n = 0;
    // Necessary to use interior mutability as `find_root_brent` only
    // accepts Fn and not FnMut closures.
    let neval = Cell::new(0);
    for _ in 0..10_000 {
        for i in 2..100 {
            n += 1;
            let c = i as f64;
            let f = |x| {
                neval.set(neval.get() + 1);
                x * x - c
            };
            let mut tol = Tol { rtol: 1e-10, atol: 0., maxiter: 100 };
            let r = roots::find_root_brent(0., 100., &f, &mut tol)?;
            sum += r;
        }
    }

    println!("roots sum: {:.12} (#eval {:.2})", sum,
             neval.take() as f64 / n as f64);
    Ok(())
}


struct Tol {
    rtol: f64,
    atol: f64,
    maxiter: usize,
}

impl roots::Convergency<f64> for Tol {
    fn is_root_found(&mut self, y: f64) -> bool {
        y == 0.
    }

    fn is_converged(&mut self, a: f64, b: f64) -> bool {
        (a - b).abs() <= self.rtol * a.abs().max(b.abs()) + self.atol
    }

    fn is_iteration_limit_reached(&mut self, iter: usize) -> bool {
        iter > self.maxiter
    }
}