Struct PartialPivLu

pub struct PartialPivLu<E>
where
    E: Entity,
{
    pub(crate) factors: Mat<E>,
    row_perm: Vec<usize>,
    row_perm_inv: Vec<usize>,
    n_transpositions: usize,
}

LU decomposition with partial pivoting.

Fields

factors: Mat<E>

row_perm: Vec<usize>

row_perm_inv: Vec<usize>

n_transpositions: usize

Implementations

impl<E> PartialPivLu<E>

where E: ComplexField,

pub fn new<ViewE>(matrix: MatRef<'_, ViewE>) -> PartialPivLu<E>

where ViewE: Conjugate<Canonical = E>,

Returns the LU decomposition of the input matrix with partial (row) pivoting.

The factorization is such that $PA = LU$, where $L$ is lower triangular, $U$ is unit upper triangular, and $P$ is the permutation arising from the pivoting.

pub fn row_permutation(&self) -> PermRef<'_, usize>

Returns the row permutation due to pivoting.

pub fn transposition_count(&self) -> usize

Returns the number of transpositions that constitute the permutation.

pub fn compute_l(&self) -> Mat<E>

Returns the factor $L$ of the LU decomposition.

pub fn compute_u(&self) -> Mat<E>

Returns the factor $U$ of the LU decomposition.

Trait Implementations

impl<E> Debug for PartialPivLu<E>

where E: Debug + Entity,

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

Formats the value using the given formatter.

impl<E> SolverCore<E> for PartialPivLu<E>

where E: ComplexField,

fn inverse(&self) -> Mat<E>

Computes the inverse of the original matrix using the decomposition.

fn reconstruct(&self) -> Mat<E>

Reconstructs the original matrix using the decomposition.

impl<E> SpSolverCore<E> for PartialPivLu<E>

where E: ComplexField,

fn nrows(&self) -> usize

Returns the number of rows of the matrix used to construct this decomposition.

fn ncols(&self) -> usize

Returns the number of columns of the matrix used to construct this decomposition.