Struct SimplicialLu 

pub struct SimplicialLu<I, T> { /* private fields */ }

$LU$ factor structure containing the symbolic and numerical representations

Implementations

impl<I: Index, T> SimplicialLu<I, T>

pub fn new() -> Self

creates a new simplicial $LU$ of a $0 \times 0$ matrix

pub fn nrows(&self) -> usize

returns the number of rows of $A$

pub fn ncols(&self) -> usize

returns the number of columns of $A$

pub fn l_factor_unsorted(&self) -> SparseColMatRef<'_, I, T>

returns the $L$ factor of the $LU$ factorization. the row indices may be unsorted

pub fn u_factor_unsorted(&self) -> SparseColMatRef<'_, I, T>

returns the $U$ factor of the $LU$ factorization. the row indices may be unsorted

pub fn solve_in_place_with_conj( &self, row_perm: PermRef<'_, I>, col_perm: PermRef<'_, I>, conj_lhs: Conj, rhs: MatMut<'_, T>, par: Par, work: MatMut<'_, T>, )

where T: ComplexField,

solves the equation $A x = \text{rhs}$ and stores the result in rhs, implicitly conjugating $A$ if needed

panics

• panics if self.nrows() != self.ncols()
• panics if rhs.nrows() != self.nrows()

pub fn solve_transpose_in_place_with_conj( &self, row_perm: PermRef<'_, I>, col_perm: PermRef<'_, I>, conj_lhs: Conj, rhs: MatMut<'_, T>, par: Par, work: MatMut<'_, T>, )

where T: ComplexField,

solves the equation $A^\top x = \text{rhs}$ and stores the result in rhs, implicitly conjugating $A$ if needed

panics

• panics if self.nrows() != self.ncols()
• panics if rhs.nrows() != self.nrows()

Trait Implementations

impl<I: Clone, T: Clone> Clone for SimplicialLu<I, T>

fn clone(&self) -> SimplicialLu<I, T>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<I: Debug, T: Debug> Debug for SimplicialLu<I, T>

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

Formats the value using the given formatter.

impl<I: Index, T> Default for SimplicialLu<I, T>

fn default() -> Self

Returns the “default value” for a type.