pub struct ConjugateGradient<'a, T, A, P, Criterion>where
T: Scalar,{ /* private fields */ }Implementations§
Source§impl<'a, T: Scalar + Zero> ConjugateGradient<'a, T, (), IdentityOperator, ()>
impl<'a, T: Scalar + Zero> ConjugateGradient<'a, T, (), IdentityOperator, ()>
Source§impl<'a, T: Scalar> ConjugateGradient<'a, T, (), IdentityOperator, ()>
impl<'a, T: Scalar> ConjugateGradient<'a, T, (), IdentityOperator, ()>
pub fn with_workspace(workspace: &'a mut CgWorkspace<T>) -> Self
Source§impl<'a, T: Scalar, P, Criterion> ConjugateGradient<'a, T, (), P, Criterion>
impl<'a, T: Scalar, P, Criterion> ConjugateGradient<'a, T, (), P, Criterion>
pub fn with_operator<A>( self, operator: A, ) -> ConjugateGradient<'a, T, A, P, Criterion>
Source§impl<'a, T: Scalar, A, P, Criterion> ConjugateGradient<'a, T, A, P, Criterion>
impl<'a, T: Scalar, A, P, Criterion> ConjugateGradient<'a, T, A, P, Criterion>
pub fn with_preconditioner<P2>( self, preconditioner: P2, ) -> ConjugateGradient<'a, T, A, P2, Criterion>
pub fn with_max_iter(self, max_iter: usize) -> Self
Source§impl<'a, T: Scalar, A, P> ConjugateGradient<'a, T, A, P, ()>
impl<'a, T: Scalar, A, P> ConjugateGradient<'a, T, A, P, ()>
pub fn with_stopping_criterion<Criterion>( self, stopping_criterion: Criterion, ) -> ConjugateGradient<'a, T, A, P, Criterion>
Source§impl<'a, T, A, P, Criterion> ConjugateGradient<'a, T, A, P, Criterion>
impl<'a, T, A, P, Criterion> ConjugateGradient<'a, T, A, P, Criterion>
pub fn solve_with_guess<'b>( &mut self, b: impl Into<DVectorView<'b, T>>, x: impl Into<DVectorViewMut<'b, T>>, ) -> Result<CgOutput<T>, SolveError<T>>
Trait Implementations§
Auto Trait Implementations§
impl<'a, T, A, P, Criterion> Freeze for ConjugateGradient<'a, T, A, P, Criterion>
impl<'a, T, A, P, Criterion> RefUnwindSafe for ConjugateGradient<'a, T, A, P, Criterion>
impl<'a, T, A, P, Criterion> Send for ConjugateGradient<'a, T, A, P, Criterion>
impl<'a, T, A, P, Criterion> Sync for ConjugateGradient<'a, T, A, P, Criterion>
impl<'a, T, A, P, Criterion> Unpin for ConjugateGradient<'a, T, A, P, Criterion>
impl<'a, T, A, P, Criterion> !UnwindSafe for ConjugateGradient<'a, T, A, P, Criterion>
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.