Struct linfa_linalg::qr::QRDecomp

pub struct QRDecomp<A, S: DataMut<Elem = A>> { /* private fields */ }

Compact representation of a QR decomposition. Can be used to yield the Q and R matrices or to calculate the inverse or solve a system.

Implementations

impl<A: NdFloat, S: DataMut<Elem = A>> QRDecomp<A, S>

pub fn generate_q(&self) -> Array2<A>

Generate semi-orthogonal Q matrix

pub fn into_r(self) -> ArrayBase<S, Ix2>

Consumes self to generate the upper-triangular R matrix

pub fn into_decomp(self) -> (Array2<A>, ArrayBase<S, Ix2>)

Generate both Q and R

pub fn solve_into<Si: DataMut<Elem = A>>( &self, b: ArrayBase<Si, Ix2>, ) -> Result<ArrayBase<Si, Ix2>>

Solves A * x = b, where A is the original matrix. Used to calculate least squares for “thin” matrices (rows >= cols).

pub fn solve_tr_into<Si: DataMut<Elem = A>>( &self, b: ArrayBase<Si, Ix2>, ) -> Result<Array2<A>>

Solves A.t * x = b, where A is the original matrix. Used to calculate least squares for “wide” matrices (rows < cols).

pub fn solve<Si: Data<Elem = A>>( &self, b: &ArrayBase<Si, Ix2>, ) -> Result<Array2<A>>

Solves A * x = b, where A is the original matrix.

pub fn solve_tr<Si: Data<Elem = A>>( &self, b: &ArrayBase<Si, Ix2>, ) -> Result<Array2<A>>

Solves A.t * x = b, where A is the original matrix.

pub fn is_invertible(&self) -> bool

Checks if original matrix is invertible.

pub fn inverse(&self) -> Result<Array2<A>>

Produce the inverse of the original matrix, if it’s invertible.

Trait Implementations

impl<A: Clone, S: DataMut<Elem = A> + RawDataClone> Clone for QRDecomp<A, S>

fn clone(&self) -> Self

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<A: Debug, S: Debug + DataMut<Elem = A>> Debug for QRDecomp<A, S>

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

Formats the value using the given formatter.