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
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

use numerical::{
    dim1_func::Dim1Func,
    polynomial::{Polynomial, PolynomialInnerVec},
    tensor::vector::Vector,
};

#[test]
fn test_nest_mul_inner_array() {
    let poly = Polynomial::new(
        Vector::<f64, [f64; 5]>::new([-1., 5., -3., 3., 2.]),
        Some(Vector::<f64, [f64; 4]>::new([0.; 4])),
    );
    let y = poly.nest_mul(0.5);
    assert!(y == 1.25);
}

#[test]
fn test_nest_mul_inner_array_and_vec() {
    let poly = Polynomial::new(
        Vector::<f64, [f64; 5]>::new([-1., 5., -3., 3., 2.]),
        Some(Vector::<f64, Vec<f64>>::new(vec![0., 0., 0., 0.])),
    );
    let y = poly.nest_mul(0.5);
    assert!(y == 1.25);
}

#[test]
fn test_nest_mul_inner_vec_0() {
    let poly = PolynomialInnerVec::new(
        vec![-1., 5., -3., 3., 2.].into(),
        Some(vec![0., 0., 0., 0.].into()),
    );
    let y = poly.nest_mul(0.5);
    assert!(y == 1.25);
}

#[test]
fn test_new_0() {
    let poly = PolynomialInnerVec::from_coefficients(vec![-1., 5., -3., 3., 2.].into());
    let y = poly.nest_mul(0.5);
    assert!(y == 1.25, "y = {y:?}");
}

#[test]
fn test_nest_mul_inner_vec_1() {
    let poly = PolynomialInnerVec::new(
        vec![1., 0.5, 0.5, -0.5].into(),
        Some(vec![0., 2., 3.].into()),
    );
    let y = poly.nest_mul(1.);
    assert!(y == 0.);
}

#[test]
fn test_new_1() {
    let poly = PolynomialInnerVec::from_coefficients_base_points(
        vec![1., 0.5, 0.5, -0.5].into(),
        vec![0., 2., 3.].into(),
    );
    let y = poly.nest_mul(1.);
    assert!(y == 0.);
}

#[test]
fn test_eval_0() {
    let poly = PolynomialInnerVec::from_coefficients_base_points(
        vec![1., 0.5, 0.5, -0.5].into(),
        vec![0., 2., 3.].into(),
    );
    let y = poly.eval(1.);
    assert!(y == 0.);
}