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
pub trait GershgorinCircles {
fn gershgorin_circles(&self) -> Vec<(f64, f64)>;
}
impl GershgorinCircles for ndarray::Array2<f64> {
fn gershgorin_circles(&self) -> Vec<(f64, f64)> {
debug_assert!(self.is_square());
let n = self.raw_dim()[0];
let mut out: Vec<(f64, f64)> = Vec::with_capacity(n);
for i in 0..n {
let aii = self[(i, i)];
let mut ri = 0.0;
let mut ci = 0.0;
for j in 0..n {
if i == j {
continue;
}
ri += self[(i, j)].abs();
ci += self[(j, i)].abs();
}
out.push((aii, ri.min(ci)));
}
out
}
}
#[cfg(test)]
mod tests {
#[test]
fn test_gershgorin_circles() {
use super::GershgorinCircles;
let a: ndarray::Array2<f64> = ndarray::arr2(&[
[10.0, -1.0, 0.0, 1.0],
[0.2, 8.0, 0.2, 0.2],
[1.0, 1.0, 2.0, 1.0],
[-1.0, -1.0, -1.0, -11.0],
]);
let b: Vec<(f64, f64)> = vec![(10.0, 2.0), (8.0, 0.6), (2.0, 1.2), (-11.0, 2.2)];
let res = a.gershgorin_circles();
b.iter()
.zip(res.iter())
.map(|((x1, y1), (x2, y2))| {
assert!((x1 - x2).abs() < 2.0 * std::f64::EPSILON);
assert!((y1 - y2).abs() < 2.0 * std::f64::EPSILON);
})
.count();
}
}