pub struct Convergence {
pub rtol: R,
pub atol: R,
pub dtol: R,
pub max_iters: usize,
}Expand description
Convergence criteria for iterative solvers.
This struct defines four types of stopping criteria:
- Relative tolerance:
‖r‖/‖b‖ ≤ rtol - Absolute tolerance:
‖r‖ ≤ atol - Divergence threshold:
‖r‖ ≥ dtol * ‖b‖ - Maximum iterations:
iterations ≥ max_iters
Fields§
§rtol: RRelative tolerance: ‖r‖/‖b‖ ≤ rtol ⇒ converge
atol: RAbsolute tolerance: ‖r‖ ≤ atol ⇒ converge
dtol: RDivergence threshold: ‖r‖ ≥ dtol * ‖b‖ ⇒ diverge
max_iters: usizeMaximum iterations
Implementations§
Source§impl Convergence
impl Convergence
Sourcepub fn new(rtol: R, atol: R, dtol: R, max_iters: usize) -> Self
pub fn new(rtol: R, atol: R, dtol: R, max_iters: usize) -> Self
Create new convergence criteria.
Sourcepub fn check(
&self,
rnorm: R,
bnorm: R,
iters: usize,
) -> (ConvergedReason, SolveStats<R>)
pub fn check( &self, rnorm: R, bnorm: R, iters: usize, ) -> (ConvergedReason, SolveStats<R>)
Check convergence/divergence criteria.
Returns (reason, SolveStats) based on current residual norm and iteration count.
§Arguments
rnorm- Current residual norm ‖r‖bnorm- Right-hand side norm ‖b‖iters- Current iteration count
§Returns
Tuple of (ConvergedReason, SolveStats) indicating the stopping reason.
Source§impl Convergence
impl Convergence
Sourcepub fn check_legacy(
&self,
res_norm: R,
res0_norm: R,
i: usize,
) -> (bool, SolveStats<R>)
👎Deprecated since 0.1.0: use check() method instead
pub fn check_legacy( &self, res_norm: R, res0_norm: R, i: usize, ) -> (bool, SolveStats<R>)
use check() method instead
Legacy method for backward compatibility.
Returns (should_stop, stats) given current res_norm and iteration i.
Deprecated: Use check() instead for more detailed convergence information.
Auto Trait Implementations§
impl Freeze for Convergence
impl RefUnwindSafe for Convergence
impl Send for Convergence
impl Sync for Convergence
impl Unpin for Convergence
impl UnsafeUnpin for Convergence
impl UnwindSafe for Convergence
Blanket Implementations§
Source§impl<Src, Scheme> ApproxFrom<Src, Scheme> for Srcwhere
Scheme: ApproxScheme,
impl<Src, Scheme> ApproxFrom<Src, Scheme> for Srcwhere
Scheme: ApproxScheme,
Source§fn approx_from(src: Src) -> Result<Src, <Src as ApproxFrom<Src, Scheme>>::Err>
fn approx_from(src: Src) -> Result<Src, <Src as ApproxFrom<Src, Scheme>>::Err>
Convert the given value into an approximately equivalent representation.
Source§impl<Dst, Src, Scheme> ApproxInto<Dst, Scheme> for Srcwhere
Dst: ApproxFrom<Src, Scheme>,
Scheme: ApproxScheme,
impl<Dst, Src, Scheme> ApproxInto<Dst, Scheme> for Srcwhere
Dst: ApproxFrom<Src, Scheme>,
Scheme: ApproxScheme,
Source§type Err = <Dst as ApproxFrom<Src, Scheme>>::Err
type Err = <Dst as ApproxFrom<Src, Scheme>>::Err
The error type produced by a failed conversion.
Source§fn approx_into(self) -> Result<Dst, <Src as ApproxInto<Dst, Scheme>>::Err>
fn approx_into(self) -> Result<Dst, <Src as ApproxInto<Dst, Scheme>>::Err>
Convert the subject into an approximately equivalent representation.
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, Dst> ConvAsUtil<Dst> for T
impl<T, Dst> ConvAsUtil<Dst> for T
Source§impl<T> ConvUtil for T
impl<T> ConvUtil for T
Source§fn approx_as<Dst>(self) -> Result<Dst, Self::Err>where
Self: Sized + ApproxInto<Dst>,
fn approx_as<Dst>(self) -> Result<Dst, Self::Err>where
Self: Sized + ApproxInto<Dst>,
Approximate the subject to a given type with the default scheme.
Source§fn approx_as_by<Dst, Scheme>(self) -> Result<Dst, Self::Err>
fn approx_as_by<Dst, Scheme>(self) -> Result<Dst, Self::Err>
Approximate the subject to a given type with a specific scheme.
Source§impl<T> DistributionExt for Twhere
T: ?Sized,
impl<T> DistributionExt for Twhere
T: ?Sized,
impl<T, U> Imply<T> for U
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
impl<T> ShellContext 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§unsafe fn to_subset_unchecked(&self) -> SS
unsafe 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.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.