algebra_linear 1.1.1

Pure-Rust BLAS, LAPACK, and sparse LU
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

//! Statistics of a sparse LU factorization.

use core::time::Duration;

/// Structure, cost and timing of a sparse LU factorization.
///
/// The counts describe the factors in their permuted coordinate system. The
/// flop figure is an **estimate**: it counts one multiply-add per `(L, U)` entry
/// pair, which is the dominant term of the simplicial factorization.
#[derive(Clone, Copy, Debug, PartialEq)]
pub struct SparseLuStats {
    /// The order of the matrix.
    pub n: usize,
    /// The number of stored entries in the input matrix.
    pub nnz_a: usize,
    /// The number of stored entries in `L`, including its unit diagonal.
    pub nnz_l: usize,
    /// The number of stored entries in `U`.
    pub nnz_u: usize,
    /// `(nnz_l + nnz_u) / nnz_a`, or zero for an empty matrix.
    pub fill_ratio: f64,
    /// An estimate of the multiply-adds in the factorization.
    pub flops_estimate: usize,
    /// The time spent computing the column ordering.
    pub ordering_time: Duration,
    /// The time spent computing the numeric factorization.
    pub factorization_time: Duration,
}

impl SparseLuStats {
    /// Returns the total number of stored entries in both factors.
    #[inline]
    pub fn nnz_factors(&self) -> usize {
        self.nnz_l + self.nnz_u
    }
}