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_solver::{bisection::BisectionSolver, Dim1Solver},
    polynomial::PolynomialInnerVec,
};

#[test]
fn test_bisection_0() {
    let _ = env_logger::try_init();
    let f = |x: f64| 2. * x + 1.;
    let solver = BisectionSolver::new([-10., 10.], 1e-5);
    let result = solver.solve(&f).unwrap();
    assert!((result + 0.5).abs() < 1e-3, "root = {}", result);
}

#[test]
fn test_bisection_1() {
    let _ = env_logger::try_init();
    let f = PolynomialInnerVec::from_coefficients(vec![2., -3., 1.].into());
    let solver_a = BisectionSolver::new([-10., 1.5], 1e-5);
    let solver_b = BisectionSolver::new([1.5, 10.], 1e-5);
    let result_a = solver_a.solve(&f).unwrap();
    let result_b = solver_b.solve(&f).unwrap();
    assert!((result_a - 1.).abs() < 1e-3, "root a = {}", result_a);
    assert!((result_b - 2.).abs() < 1e-3, "root b = {}", result_b);
}

#[test]
fn test_bisection_2() {
    let _ = env_logger::try_init();
    let f = PolynomialInnerVec::from_coefficients(vec![-8. / 27., 4. / 3., -2., 1.].into());
    let solver = BisectionSolver::new([0., 2.], 1e-14);
    let result = solver.solve(&f).unwrap();
    // large forward error
    assert!((result - 2. / 3.).abs() > 1e-6, "root = {}", result);
}