Struct SymbolicLu

pub struct SymbolicLu<I> {
    raw: SymbolicLuRaw<I>,
    col_perm_fwd: Vec<I>,
    col_perm_inv: Vec<I>,
    A_nnz: usize,
}

The symbolic structure of a sparse LU decomposition.

Fields

raw: SymbolicLuRaw<I>

col_perm_fwd: Vec<I>

col_perm_inv: Vec<I>

A_nnz: usize

Implementations

impl<I> SymbolicLu<I>

where I: Index,

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 col_perm(&self) -> PermRef<'_, I>

Returns the fill-reducing column permutation that was computed during symbolic analysis.

pub fn factorize_numeric_lu_req<E>( &self, parallelism: Parallelism<'_>, ) -> Result<StackReq, SizeOverflow>

where E: Entity,

Computes the size and alignment of the workspace required to compute the numerical LU factorization.

pub fn solve_in_place_req<E>( &self, rhs_ncols: usize, parallelism: Parallelism<'_>, ) -> Result<StackReq, SizeOverflow>

where E: Entity,

Computes the size and alignment of the workspace required to solve the equation $A x = b$.

pub fn solve_transpose_in_place_req<E>( &self, rhs_ncols: usize, parallelism: Parallelism<'_>, ) -> Result<StackReq, SizeOverflow>

where E: Entity,

Computes the size and alignment of the workspace required to solve the equation $A^\top x = b$.

pub fn factorize_numeric_lu<'out, E>( &'out self, numeric: &'out mut NumericLu<I, E>, A: SparseColMatRef<'_, I, E>, parallelism: Parallelism<'_>, stack: PodStack<'_>, ) -> Result<LuRef<'out, I, E>, LuError>

where E: ComplexField,

Computes a numerical LU factorization of A.

Trait Implementations

impl<I> Clone for SymbolicLu<I>

where I: Clone,

fn clone(&self) -> SymbolicLu<I>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<I> Debug for SymbolicLu<I>

where I: Debug,

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

Formats the value using the given formatter.