Struct Lu 

pub struct Lu { /* private fields */ }

Reusable square LU with partial ROW pivoting. Convention: P * A = L * U. pivots[k] is the row interchanged with row k during elimination. The factors own a copy; the caller’s input is never modified. Not a blocked BLAS kernel.

Implementations

impl Lu

pub fn factor( a: MatrixView<'_>, tolerance: Tolerance, ) -> Result<Self, SolverError>

pub fn order(&self) -> usize

pub fn pivots(&self) -> &[usize]

pub fn packed(&self) -> &Matrix

pub fn lower(&self) -> Result<Matrix, SolverError>

pub fn upper(&self) -> Result<Matrix, SolverError>

pub fn solve(&self, b: MatrixView<'_>) -> Result<Matrix, SolverError>

Solve all RHS columns, reusing the factorization. RHS is not modified.

pub fn solve_transpose(&self, b: MatrixView<'_>) -> Result<Matrix, SolverError>

Solve A^T X = B without refactorizing A.

pub fn inverse(&self) -> Result<Matrix, SolverError>

Prefer solve(B) to explicitly forming an inverse for linear systems.

pub fn slogdet(&self) -> Result<(i32, f64), SolverError>

Determinant sign and log(abs(det)), avoiding a potentially overflowing product.

Trait Implementations

impl Clone for Lu

fn clone(&self) -> Lu

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Lu

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

Formats the value using the given formatter.