Struct LuRef 

pub struct LuRef<'a, I: Index, T> { /* private fields */ }

sparse $LU$ factorization wrapper

Implementations

impl<'a, I: Index, T> LuRef<'a, I, T>

pub unsafe fn new_unchecked( symbolic: &'a SymbolicLu<I>, numeric: &'a NumericLu<I, T>, ) -> Self

creates $LU$ factors from their components

safety

the numeric part must be the output of SymbolicLu::factorize_numeric_lu, called with a matrix having the same symbolic structure as the one used to create symbolic

pub fn symbolic(self) -> &'a SymbolicLu<I>

returns the symbolic structure of the $LU$ factorization

pub fn row_perm(self) -> PermRef<'a, I>

returns the row pivoting permutation

pub fn col_perm(self) -> PermRef<'a, I>

returns the fill reducing column permutation

pub fn solve_in_place_with_conj( self, conj: Conj, rhs: MatMut<'_, T>, par: Par, stack: &mut MemStack, )

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, conj: Conj, rhs: MatMut<'_, T>, par: Par, stack: &mut MemStack, )

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: Index, T> Clone for LuRef<'_, I, T>

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<'a, I: Debug + Index, T: Debug> Debug for LuRef<'a, I, T>

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

Formats the value using the given formatter.

impl<I: Index, T> Copy for LuRef<'_, I, T>