numerical 0.1.5

Algorithm for numerical analysis
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

use numerical::{
    base_float::BaseFloat,
    dim1_func::Dim1Func,
    dim1_solver::{brent::BrentSolver, Dim1Solver},
    polynomial::PolynomialInnerVec,
};

#[test]
fn test_brent_0() {
    let _ = env_logger::try_init();
    let f = PolynomialInnerVec::from_coefficients(vec![-1., 1., 0., 1.].into());
    let solver = BrentSolver::new([0., 1.], 1e-14);
    let result = solver.solve(&f).unwrap();
    // large forward error
    assert!((result - 0.682328).abs() < 1e-6, "root = {}", result);
}

#[test]
fn test_brent_1() {
    let _ = env_logger::try_init();
    let f =
        PolynomialInnerVec::from_coefficients(vec![-4., 16., 35., -69., -102., 45., 54.].into());
    let ranges = [[-1.5, -1.], [0., 0.3], [0.3, 0.8], [0.8, 1.5]];
    let solvers = ranges.map(|r| BrentSolver::new(r, 1e-14));
    let roots = solvers.map(|s| s.solve(&f).unwrap());
    let backward_errors = roots.map(|x| f.eval(x));
    println!("roots = {:?}", roots);
    for i in 0..roots.len() {
        assert!(
            backward_errors[i].abs() < 1e-8,
            "root = {}, error = {}",
            roots[i],
            backward_errors[i]
        );
    }
}