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
use crate::matrix::ci::CirculantMatrix;
use crate::{matrix::MatrixError, number::Number};
use rayon::prelude::*;
#[derive(Clone, Debug, Default, PartialEq, Hash)]
pub struct ToeplitzMatrix<T = f64>
where
T: Number,
{
col_elems: Vec<T>,
row_elems: Vec<T>,
}
impl<T> ToeplitzMatrix<T>
where
T: Number,
{
pub fn new(dim: usize) -> Self {
Self {
col_elems: vec![T::default(); dim],
row_elems: vec![T::default(); dim.max(1) - 1],
}
}
pub fn from(col_elems: Vec<T>, row_elems: Vec<T>) -> Result<Self, MatrixError> {
let dim = col_elems.len();
if row_elems.len() != dim.max(1) - 1 {
return Err(MatrixError::DimensionMismatch);
}
Ok(Self {
col_elems,
row_elems,
})
}
pub fn dim(&self) -> usize {
self.col_elems.len()
}
pub fn col_elems(&self) -> &[T] {
&self.col_elems
}
pub fn row_elems(&self) -> &[T] {
&self.row_elems
}
pub fn eject(self) -> (Vec<T>, Vec<T>) {
(self.row_elems, self.col_elems)
}
pub fn embedded_circulant(&self) -> CirculantMatrix<T> {
let col_elems = (0..self.dim())
.into_par_iter()
.chain((1..self.dim() - 1).into_par_iter().rev())
.map(|i| self.col_elems[i])
.collect();
CirculantMatrix::<T>::new(col_elems)
}
}