Struct LuDecomposition 

pub struct LuDecomposition { /* private fields */ }

LU decomposition with partial pivoting for a finite square f32 matrix.

Implementations

impl LuDecomposition

pub fn shape(&self) -> MatrixShape

Returns the square decomposition shape.

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

Returns the row permutation after partial pivoting.

pub fn swap_count(&self) -> usize

Returns the number of pivot row swaps performed.

pub fn determinant(&self) -> Result<f32>

Computes the determinant from the upper-triangular diagonal and swap parity.

pub fn solve_vector(&self, b: &[f32]) -> Result<Vec<f32>>

Solves A x = b for a finite vector b.

pub fn solve_matrix(&self, b: &F32MatrixView<'_>) -> Result<F32Matrix>

Solves A X = B for a finite matrix B.

pub fn lower_matrix(&self) -> Result<F32Matrix>

Extracts the unit diagonal lower triangular factor.

pub fn upper_matrix(&self) -> Result<F32Matrix>

Extracts the upper triangular factor.

Trait Implementations

impl Clone for LuDecomposition

fn clone(&self) -> LuDecomposition

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for LuDecomposition

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

Formats the value using the given formatter.

impl PartialEq for LuDecomposition

fn eq(&self, other: &LuDecomposition) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl StructuralPartialEq for LuDecomposition