pub struct LeastSquaresResult<E, I>{
pub singular_values: ArrayBase<OwnedRepr<<E as Scalar>::Real>, Dim<[usize; 1]>>,
pub solution: ArrayBase<OwnedRepr<E>, I>,
pub rank: i32,
pub residual_sum_of_squares: Option<ArrayBase<OwnedRepr<<E as Scalar>::Real>, <I as Dimension>::Smaller>>,
}Expand description
Result of a LeastSquares computation
Takes two type parameters, E, the element type of the matrix
(one of f32, f64, c32 or c64) and I, the dimension of
b in the equation Ax = b (one of Ix1 or Ix2). If I is Ix1,
the right-hand-side (RHS) is a n x 1 column vector and the solution
is a m x 1 column vector. If I is Ix2, the RHS is a n x k matrix
(which can be seen as solving Ax = b k times for different b) and
the solution is a m x k matrix.
Fields§
§singular_values: ArrayBase<OwnedRepr<<E as Scalar>::Real>, Dim<[usize; 1]>>The singular values of the matrix A in Ax = b
solution: ArrayBase<OwnedRepr<E>, I>The solution vector or matrix x which is the best
solution to Ax = b, i.e. minimizing the 2-norm ||b - Ax||
rank: i32The rank of the matrix A in Ax = b
residual_sum_of_squares: Option<ArrayBase<OwnedRepr<<E as Scalar>::Real>, <I as Dimension>::Smaller>>If n < m and rank(A) == n, the sum of squares If b is a (m x 1) vector, this is a 0-dimensional array (single value) If b is a (m x k) matrix, this is a (k x 1) column vector
Trait Implementations§
Source§impl<E, I> Clone for LeastSquaresResult<E, I>
impl<E, I> Clone for LeastSquaresResult<E, I>
Source§fn clone(&self) -> LeastSquaresResult<E, I>
fn clone(&self) -> LeastSquaresResult<E, I>
1.0.0 · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source. Read moreAuto Trait Implementations§
impl<E, I> Freeze for LeastSquaresResult<E, I>
impl<E, I> RefUnwindSafe for LeastSquaresResult<E, I>where
I: RefUnwindSafe,
<I as Dimension>::Smaller: RefUnwindSafe,
<E as Scalar>::Real: RefUnwindSafe,
E: RefUnwindSafe,
impl<E, I> Send for LeastSquaresResult<E, I>
impl<E, I> Sync for LeastSquaresResult<E, I>
impl<E, I> Unpin for LeastSquaresResult<E, I>
impl<E, I> UnwindSafe for LeastSquaresResult<E, I>where
I: UnwindSafe,
<E as Scalar>::Real: RefUnwindSafe,
E: RefUnwindSafe,
<I as Dimension>::Smaller: 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
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§impl<T> Pointable for T
impl<T> Pointable for T
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>
self from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
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
self.to_subset but without any property checks. Always succeeds.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
self to the equivalent element of its superset.