pub struct SymbolicLdl {
pub perm: Perm,
pub etree: Vec<u32>,
pub supernodes: Vec<u32>,
pub row_ptr: Vec<usize>,
pub row_idx: Vec<u32>,
pub nnz_l: usize,
pub form: KktForm,
/* private fields */
}Expand description
The symbolic factor of SupernodalLdl (Algorithm A): permutation,
elimination tree, supernode partition and the row pattern of every
supernode, plus (private) the scatter map of K and the descendant
lists of the left-looking numeric phase.
Fields§
§perm: PermThe fill-reducing permutation used (fwd[k] = the original row
eliminated k-th): the ordering’s, postordered (step A2′).
etree: Vec<u32>Parent of each column (permuted numbering) in the elimination tree;
u32::MAX for a root.
supernodes: Vec<u32>Supernode boundaries over the permuted columns: supernode s is
the columns supernodes[s]..supernodes[s + 1] (n_supernodes + 1
entries).
row_ptr: Vec<usize>Row pattern R_s of each supernode (the rows below its diagonal
block, permuted numbering, increasing): row_idx[row_ptr[s]..row_ptr[s + 1]].
row_idx: Vec<u32>See SymbolicLdl::row_ptr.
nnz_l: usizeStored length of the factor: Σ_s nrows(s) · ncols(s) (step A9).
form: KktFormThe form the pattern was analyzed for.
Implementations§
Source§impl SymbolicLdl
impl SymbolicLdl
Sourcepub fn n_supernodes(&self) -> usize
pub fn n_supernodes(&self) -> usize
Number of supernodes.
Sourcepub fn is_simplicial(&self) -> bool
pub fn is_simplicial(&self) -> bool
true if the switch of step A3′ chose the simplicial structure
(fundamental supernodes, plain loops), false for the supernodal
one (relaxed supernodes, dense kernels).
Sourcepub fn relaxation_zeros(&self) -> usize
pub fn relaxation_zeros(&self) -> usize
The explicit zeros the relaxed amalgamation added to the lower
parts of the blocks (step A5): 0 with relax_zeros = 0.
Sourcepub fn check_invariants(&self) -> Result<(), SparseError>
pub fn check_invariants(&self) -> Result<(), SparseError>
Checks invariants (L1)–(L4).