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
use crate::{number::Number, Matrix, MatrixError};
use rayon::prelude::*;
#[derive(Clone, Debug, Default, PartialEq, Hash)]
pub struct BidiagonalMatrix<T = f64>
where
T: Number,
{
d: Vec<T>,
e: Vec<T>,
}
impl<T> BidiagonalMatrix<T>
where
T: Number,
{
pub fn new(dim: usize) -> Self {
Self {
d: vec![T::default(); dim],
e: vec![T::default(); dim.max(1) - 1],
}
}
pub fn from(d: Vec<T>, e: Vec<T>) -> Result<Self, MatrixError> {
if d.len().max(1) - 1 != e.len() {
return Err(MatrixError::DimensionMismatch);
}
Ok(Self { d, e })
}
pub fn dim(&self) -> usize {
self.d.len()
}
pub fn d(&self) -> &[T] {
&self.d
}
pub fn e(&self) -> &[T] {
&self.e
}
pub fn eject(self) -> (Vec<T>, Vec<T>) {
(self.d, self.e)
}
pub fn mat(&self, upper: bool) -> Matrix<T> {
let n = self.d.len();
let mut mat = Matrix::new(n, n);
mat.elems_mut()
.par_iter_mut()
.enumerate()
.map(|(k, elem)| ((k / n, k % n), elem))
.for_each(|((i, j), elem)| {
if i == j {
*elem = self.d[i];
} else if i + 1 == j && upper {
*elem = self.e[i];
} else if i == j + 1 && !upper {
*elem = self.e[j];
}
});
mat
}
}