pub struct Lstsq<R: RealField, N: Dim>where
DefaultAllocator: Allocator<N>,{
pub solution: OVector<R, N>,
pub residuals: R,
pub rank: usize,
}Expand description
Results of lstsq
Fields§
§solution: OVector<R, N>Least-squares solution.
This is the variable x that approximatively solves the equation a * x = b.
residuals: RSums of squared residuals: Squared Euclidean 2-norm.
rank: usizeRank of matrix a.
Auto Trait Implementations§
impl<R, N> !Freeze for Lstsq<R, N>
impl<R, N> !RefUnwindSafe for Lstsq<R, N>
impl<R, N> !Send for Lstsq<R, N>
impl<R, N> !Sync for Lstsq<R, N>
impl<R, N> !Unpin for Lstsq<R, N>
impl<R, N> !UnsafeUnpin for Lstsq<R, N>
impl<R, N> !UnwindSafe for Lstsq<R, N>
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.