pub struct TruncatedSvd<A>where
A: Scalar,{ /* private fields */ }Expand description
Truncated singular value decomposition
Wraps the LOBPCG algorithm and provides convenient builder-pattern access to parameter like maximal iteration, precision and constraint matrix.
Implementations§
Source§impl<A> TruncatedSvd<A>
impl<A> TruncatedSvd<A>
pub fn new( problem: ArrayBase<OwnedRepr<A>, Dim<[usize; 2]>>, order: Order, ) -> TruncatedSvd<A>
pub fn precision(self, precision: f32) -> TruncatedSvd<A>
pub fn maxiter(self, maxiter: usize) -> TruncatedSvd<A>
pub fn decompose(self, num: usize) -> Result<TruncatedSvdResult<A>, LinalgError>
Auto Trait Implementations§
impl<A> Freeze for TruncatedSvd<A>
impl<A> RefUnwindSafe for TruncatedSvd<A>where
A: RefUnwindSafe,
impl<A> Send for TruncatedSvd<A>where
A: Send,
impl<A> Sync for TruncatedSvd<A>where
A: Sync,
impl<A> Unpin for TruncatedSvd<A>
impl<A> UnwindSafe for TruncatedSvd<A>where
A: RefUnwindSafe,
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<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>
Converts
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>
Converts
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>
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.