pub struct DynQr<T> { /* private fields */ }Expand description
QR decomposition of a dynamically-sized matrix (M >= N).
Stores the packed Householder vectors, R, and tau scalars.
§Example
use numeris::{DynMatrix, DynVector};
let a = DynMatrix::from_rows(3, 2, &[
1.0_f64, 0.0,
1.0, 1.0,
1.0, 2.0,
]);
let b = DynVector::from_slice(&[1.0, 2.0, 4.0]);
let x = a.qr().unwrap().solve(&b);
assert!((x[0] - 5.0 / 6.0).abs() < 1e-10);
assert!((x[1] - 3.0 / 2.0).abs() < 1e-10);Implementations§
Trait Implementations§
Auto Trait Implementations§
impl<T> Freeze for DynQr<T>
impl<T> RefUnwindSafe for DynQr<T>where
T: RefUnwindSafe,
impl<T> Send for DynQr<T>where
T: Send,
impl<T> Sync for DynQr<T>where
T: Sync,
impl<T> Unpin for DynQr<T>where
T: Unpin,
impl<T> UnsafeUnpin for DynQr<T>
impl<T> UnwindSafe for DynQr<T>where
T: UnwindSafe,
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self is actually part of its subset T (and can be converted to it).Source§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset but without any property checks. Always succeeds.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.