Struct Qr 

pub struct Qr { /* private fields */ }

Economy QR with recomputed column norms and column pivoting. Convention: A[:, permutation] = Q * R, where Q has m rows and n columns. Householder reflectors are stored, not a full m*m Q. Only m >= n is supported.

Implementations

impl Qr

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

pub fn rank(&self) -> usize

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

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

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

Materialize thin Q only on explicit request.

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

Full-column-rank least squares without forming A^T A or an inverse. Rank-deficient and underdetermined minimum-norm problems are NOT approximated.

Trait Implementations

impl Clone for Qr

fn clone(&self) -> Qr

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Qr

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

Formats the value using the given formatter.