pub struct MGS<A>where
A: Scalar,{ /* private fields */ }Expand description
Iterative orthogonalizer using modified Gram-Schmit procedure
Implementations§
Trait Implementations§
Source§impl<A> Orthogonalizer for MGS<A>
impl<A> Orthogonalizer for MGS<A>
type Elem = A
fn tolerance(&self) -> <A as Scalar>::Real
Source§fn decompose<S>(
&self,
a: &mut ArrayBase<S, Dim<[usize; 1]>>,
) -> ArrayBase<OwnedRepr<A>, Dim<[usize; 1]>>where
S: DataMut<Elem = A>,
fn decompose<S>(
&self,
a: &mut ArrayBase<S, Dim<[usize; 1]>>,
) -> ArrayBase<OwnedRepr<A>, Dim<[usize; 1]>>where
S: DataMut<Elem = A>,
Decompose given vector into the span of current basis and
its tangent space Read more
Source§fn coeff<S>(
&self,
a: ArrayBase<S, Dim<[usize; 1]>>,
) -> ArrayBase<OwnedRepr<A>, Dim<[usize; 1]>>
fn coeff<S>( &self, a: ArrayBase<S, Dim<[usize; 1]>>, ) -> ArrayBase<OwnedRepr<A>, Dim<[usize; 1]>>
Calculate the coefficient to the current basis basis Read more
Source§fn append<S>(&mut self, a: ArrayBase<S, Dim<[usize; 1]>>) -> AppendResult<A>
fn append<S>(&mut self, a: ArrayBase<S, Dim<[usize; 1]>>) -> AppendResult<A>
Add new vector if the residual is larger than relative tolerance
Source§fn div_append<S>(
&mut self,
a: &mut ArrayBase<S, Dim<[usize; 1]>>,
) -> AppendResult<A>
fn div_append<S>( &mut self, a: &mut ArrayBase<S, Dim<[usize; 1]>>, ) -> AppendResult<A>
Add new vector if the residual is larger than relative tolerance,
and return the residual vector
fn is_empty(&self) -> bool
Auto Trait Implementations§
impl<A> Freeze for MGS<A>
impl<A> RefUnwindSafe for MGS<A>
impl<A> Send for MGS<A>
impl<A> Sync for MGS<A>
impl<A> Unpin for MGS<A>
impl<A> UnwindSafe for MGS<A>
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> 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>
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.