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
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
use structure::dual::*;
use structure::matrix::*;
use util::non_macro::{cat, zeros};
use Number;
use NumberVector;
#[allow(non_snake_case)]
pub fn jacobian<F>(g: F, x: Vec<f64>) -> Matrix
where
F: Fn(Vec<Number>) -> Vec<Number>,
{
let l = x.len();
let f = |x: Vec<Dual>| g(NumberVector::from_dual_vec(x)).to_dual_vec();
let x_var: Vec<Dual> = merge_dual(x.clone(), vec![1f64; l]);
let x_const = x.clone().conv_dual();
let l2 = f(x_const.clone()).len();
let mut J = zeros(l2, l);
let mut x_temp = x_const.clone();
for i in 0..l {
x_temp[i] = x_var[i];
let dual_temp = f(x_temp.clone());
let slope_temp = dual_temp.slopes();
for j in 0..l2 {
J[(j, i)] = slope_temp[j];
}
x_temp = x_const.clone();
}
J
}
pub fn tdma(a_input: Vec<f64>, b_input: Vec<f64>, c_input: Vec<f64>, y_input: Vec<f64>) -> Matrix {
let n = b_input.len();
assert_eq!(a_input.len(), n - 1);
assert_eq!(c_input.len(), n - 1);
assert_eq!(y_input.len(), n);
let a = cat(0f64, a_input.clone());
let mut b = b_input.clone();
let c = {
let mut c_temp = c_input.clone();
c_temp.push(0f64);
c_temp.clone()
};
let mut y = y_input.clone();
let mut w = vec![0f64; n];
for i in 1..n {
w[i] = a[i] / b[i - 1];
b[i] = b[i] - w[i] * c[i - 1];
y[i] = y[i] - w[i] * y[i - 1];
}
let mut x = vec![0f64; n];
x[n - 1] = y[n - 1] / b[n - 1];
for i in (0..n - 1).rev() {
x[i] = (y[i] - c[i] * x[i + 1]) / b[i];
}
x.to_matrix()
}