pub struct LinearSolverSummary {
pub solver_name: String,
pub n_factors: u64,
pub n_pattern_reuse: u64,
pub n_pattern_changes: u64,
pub max_fill_ratio: Option<f64>,
pub min_abs_pivot: Option<f64>,
pub max_abs_pivot: Option<f64>,
pub last_inertia: Option<(usize, usize, usize)>,
pub last_nnz_a: Option<usize>,
pub last_nnz_l: Option<usize>,
}Expand description
Aggregate stats accumulated over the lifetime of one linear-solver
instance. All fields default to zero / None so a backend that
declines to populate them still produces a valid summary.
Fields§
§solver_name: StringShort identifier of the backend that produced this summary:
"feral", "ma57", etc. Empty for the Default value.
n_factors: u64Number of factor() calls completed (including those that
reused the cached symbolic factorisation).
n_pattern_reuse: u64Of n_factors, how many reused the previous symbolic
factorisation (sparsity pattern unchanged). Healthy IPM workloads
expect this to dominate after the first iter.
n_pattern_changes: u64Of n_factors, how many required a fresh symbolic factorisation
(sparsity pattern changed). Inverse of n_pattern_reuse modulo
the very first factor.
max_fill_ratio: Option<f64>Maximum nnz(L) / nnz(A) observed across factors. Values much
greater than ~10 on KKT-style systems indicate ordering trouble.
min_abs_pivot: Option<f64>Minimum |pivot| observed across factors. Approaches the
working-precision floor when the matrix is near-singular.
max_abs_pivot: Option<f64>Maximum |pivot| observed across factors.
last_inertia: Option<(usize, usize, usize)>Inertia of the final factorisation as (positive, negative, zero).
last_nnz_a: Option<usize>nnz(A) of the final factorisation’s matrix.
last_nnz_l: Option<usize>nnz(L) of the final factorisation.
Implementations§
Trait Implementations§
Source§impl Clone for LinearSolverSummary
impl Clone for LinearSolverSummary
Source§fn clone(&self) -> LinearSolverSummary
fn clone(&self) -> LinearSolverSummary
1.0.0 (const: unstable) · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source. Read more