mathru 0.16.2

Fundamental algorithms for scientific computing in Rust
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

use crate::algebra::{
    abstr::{Field, Scalar},
    linear::matrix::General,
};
use rand::random;
#[cfg(feature = "serde")]
use serde::{Deserialize, Serialize};

/// Lower triangular matrix with unit diagonal
#[cfg_attr(feature = "serde", derive(Serialize, Deserialize))]
#[derive(Debug, Clone)]
pub struct UnitLowerTriangular<T> {
    pub(crate) matrix: General<T>,
}

impl<T> UnitLowerTriangular<T>
where
    T: Field + Scalar,
{
    pub fn new(matrix: General<T>) -> UnitLowerTriangular<T> {
        UnitLowerTriangular { matrix }
    }

    pub fn dim(&self) -> (usize, usize) {
        self.matrix.dim()
    }

    pub fn new_random(m: usize) -> UnitLowerTriangular<T> {
        let mut g = General::zero(m, m);

        for i in 0..m {
            for j in i..m {
                g[[i, j]] = if i == j {
                    T::one()
                } else {
                    T::from_f64(random())
                };
            }
        }

        UnitLowerTriangular { matrix: g }
    }
}