[−][src]Struct la::QRDecomposition
QR Decomposition.
Based on Apache Commons Math and JAMA.
For an m-by-n matrix A, the QR decomposition is an m-by-m orthogonal matrix Q and an m-by-n upper triangular (or trapezoidal) matrix R, so that A = Q*R.
The QR decompostion always exists, even if the matrix does not have full rank. The primary use of the QR decomposition is in the least squares solution of nonsquare systems of simultaneous linear equations. This will fail if is_full_rank() returns false.
Methods
impl<T: Float + ApproxEq<T>> QRDecomposition<T>[src]
pub fn new(m: &Matrix<T>) -> QRDecomposition<T>[src]
pub fn is_full_rank(&self) -> bool[src]
pub fn get_h(&self) -> Matrix<T>[src]
pub fn get_r(&self) -> Matrix<T>[src]
pub fn get_q(&self) -> Matrix<T>[src]
pub fn solve(&self, b: &Matrix<T>) -> Option<Matrix<T>>[src]
Auto Trait Implementations
impl<T> Send for QRDecomposition<T> where
T: Send,
T: Send,
impl<T> Sync for QRDecomposition<T> where
T: Sync,
T: Sync,
impl<T> Unpin for QRDecomposition<T> where
T: Unpin,
T: Unpin,
impl<T> UnwindSafe for QRDecomposition<T> where
T: UnwindSafe,
T: UnwindSafe,
impl<T> RefUnwindSafe for QRDecomposition<T> where
T: RefUnwindSafe,
T: RefUnwindSafe,
Blanket Implementations
impl<T, U> Into<U> for T where
U: From<T>, [src]
U: From<T>,
impl<T> From<T> for T[src]
impl<T, U> TryFrom<U> for T where
U: Into<T>, [src]
U: Into<T>,
type Error = Infallible
The type returned in the event of a conversion error.
fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>[src]
impl<T, U> TryInto<U> for T where
U: TryFrom<T>, [src]
U: TryFrom<T>,
type Error = <U as TryFrom<T>>::Error
The type returned in the event of a conversion error.
fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>[src]
impl<T> Borrow<T> for T where
T: ?Sized, [src]
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized, [src]
T: ?Sized,
fn borrow_mut(&mut self) -> &mut T[src]
impl<T> Any for T where
T: 'static + ?Sized, [src]
T: 'static + ?Sized,