pub struct NumericLdl<T: Real = f64> {
pub blocks: Vec<DenseBlock<T>>,
pub diag: Vec<T>,
pub pivot_2x2: Vec<bool>,
pub inertia: Inertia,
pub bumped: usize,
/* private fields */
}Expand description
The numeric factor of SupernodalLdl: P K_reg Pᵀ = L̂ Δ̂ L̂ᵀ with
L̂ by blocks (column-major, Δ̂ on the diagonal, the unit diagonal of
L̂ implicit), in the caller’s units (step N4). For the LDLᵀ of
Algorithm N (both regularized systems) Δ̂ is diagonal, the blocks are
the symbolic supernodes and P is SymbolicLdl::perm. For the
LBLᵀ of Algorithm M (the unregularized augmented system) Δ̂ has
2×2 blocks — pivot_2x2 true on both their columns, e₂₁ stored in
the block at the slot (k + 1, k) where L̂ has an implicit zero —,
P is the pivot order NumericLdl::perm, and the blocks’ pivot
ranges and rows are NumericLdl::supernodes and NumericLdl::rows
(delayed pivots move columns between blocks).
Fields§
§blocks: Vec<DenseBlock<T>>One block per supernode: nrows(s) × ncols(s), column-major.
diag: Vec<T>Δ̂ in pivot order (diag[k] = the pivot of permuted column k,
in the caller’s units: step N4).
pivot_2x2: Vec<bool>2×2 pivot marks, in pivot order: true on both columns of a
2×2 block (LBLᵀ); all false for LDLᵀ.
inertia: InertiaThe inertia of the factor (S6).
bumped: usizePivots that dynamic regularization bumped (step K3), of both signs, counted as they are bumped.
Implementations§
Source§impl<T: Real> NumericLdl<T>
impl<T: Real> NumericLdl<T>
Sourcepub fn n_supernodes(&self) -> usize
pub fn n_supernodes(&self) -> usize
Number of supernodes.
Sourcepub fn perm(&self) -> &Perm
pub fn perm(&self) -> &Perm
The permutation of the factor (fwd[k] = the original row of pivot
k): the symbolic one (step A2′) for LDLᵀ, the pivot order fwd′
of Algorithm M for LBLᵀ.
Sourcepub fn is_pivoted(&self) -> bool
pub fn is_pivoted(&self) -> bool
true for an LBLᵀ factor (Algorithm M: 2×2 pivots and delayed
pivots possible — the unregularized augmented system), false for
the LDLᵀ of Algorithm N.
Sourcepub fn delayed(&self) -> usize
pub fn delayed(&self) -> usize
Pivots delayed to a parent supernode in Algorithm M (step M5),
counted once per delay; 0 for LDLᵀ.
Sourcepub fn supernodes(&self) -> &[u32]
pub fn supernodes(&self) -> &[u32]
The blocks’ boundaries in pivot order (n_supernodes + 1 entries):
blocks[s] holds the pivots supernodes()[s]..supernodes()[s + 1].
The symbolic supernodes for LDLᵀ; with delayed pivots a block may
hold more or fewer columns than its supernode.