Struct Qr

pub struct Qr { /* private fields */ }

Householder QR with column pivoting: A P = Q R.

Implementations

impl Qr

pub fn new(a: &Matrix) -> NumericResult<Self>

Factor an m x n matrix and determine its numerical rank: a pivot counts when it exceeds max(m, n) eps |r_00|.

Errors

Refuses a non-finite matrix.

pub fn rank(&self) -> usize

Numerical rank.

pub fn condition_estimate(&self) -> f64

Estimate of the 1-norm condition number of the leading rank x rank block of R, which equals A’s 2-norm condition number up to a factor of n.

pub fn solve_least_squares( &self, b: &[f64], ) -> NumericResult<LeastSquaresSolution>

Minimise ||A x - b||_2.

Errors

Refuses b of the wrong length or with non-finite entries, and a matrix whose rank is below its column count (NumericError::RankDeficient): the minimiser is then not unique.

Trait Implementations

impl Clone for Qr

fn clone(&self) -> Qr

Returns a copy 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.

impl PartialEq for Qr

fn eq(&self, other: &Qr) -> 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 Qr