Struct sprs_suitesparse_ldl::LdlLongNumeric

pub struct LdlLongNumeric { /* fields omitted */ }

Structure holding the numeric ldlt decomposition computed by suitesparse’s ldl

Implementations

impl LdlLongNumeric

pub fn new<N, I>(mat: CsMatViewI<'_, N, I>) -> Result<Self, LinalgError> where
    N: Clone + Into<f64>,
    I: SpIndex, 

Compute the numeric LDLT decomposition of the given matrix.

Panics

• if mat is not symmetric

pub fn new_perm<N, I>(
    mat: CsMatViewI<'_, N, I>,
    perm: PermOwnedI<I>,
    check_perm: PermutationCheck
) -> Result<Self, LinalgError> where
    N: Clone + Into<f64>,
    I: SpIndex, 

Compute the numeric decomposition L D L^T = P^T A P where P is a permutation matrix.

Using a good permutation matrix can reduce the non-zero count in L, thus making the decomposition and the solves faster.

Panics

• if mat is not symmetric

pub fn update<N, I>(
    &mut self,
    mat: CsMatViewI<'_, N, I>
) -> Result<(), LinalgError> where
    N: Clone + Into<f64>,
    I: SpIndex, 

Factor a new matrix, assuming it shares the same nonzero pattern as the matrix this factorization was built from.

Panics

If the matrix is not symmetric.

pub fn solve<'a, N, V>(&self, rhs: &V) -> Vec<N> where
    N: 'a + Copy + Num + Into<f64> + From<f64>,
    V: Deref<Target = [N]>, 

Solve the system A x = rhs

pub fn problem_size(&self) -> usize

The size of the linear system associated with this decomposition

pub fn nnz(&self) -> usize

The number of non-zero entries in L

Trait Implementations

impl Clone for LdlLongNumeric

fn clone(&self) -> LdlLongNumeric

Returns a copy of the value.

pub fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for LdlLongNumeric

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.