Expand description
The result of unpacking a QR decomposition.
Let A
denote the m x n
matrix given by A = QR
.
Then Q
is an m x m
orthogonal matrix, and R
is an m x n
upper trapezoidal matrix .
More precisely, if m > n
, then we have the decomposition
A = QR = Q [ R1 ]
[ 0 ]
where R1
is an n x n
upper triangular matrix.
On the other hand, if m < n
, we have
A = QR = Q [ R1 R2 ]
where R1
is an m x m
upper triangular matrix and
R2
is an m x (n - m)
general matrix.
To actually compute the QR decomposition, see Householder QR.
Fields
q: Matrix<T>
The orthogonal matrix Q
in the decomposition A = QR
.
r: Matrix<T>
The upper-trapezoidal matrix R
in the decomposition A = QR
.
Trait Implementations
Auto Trait Implementations
impl<T> RefUnwindSafe for QR<T>where
T: RefUnwindSafe,
impl<T> Send for QR<T>where
T: Send,
impl<T> Sync for QR<T>where
T: Sync,
impl<T> Unpin for QR<T>where
T: Unpin,
impl<T> UnwindSafe for QR<T>where
T: UnwindSafe,
Blanket Implementations
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
const: unstablefn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
impl<T> ToOwned for Twhere
T: Clone,
impl<T> ToOwned for Twhere
T: Clone,
type Owned = T
type Owned = T
The resulting type after obtaining ownership.
fn clone_into(&self, target: &mut T)
fn clone_into(&self, target: &mut T)
Uses borrowed data to replace owned data, usually by cloning. Read more