pub struct ShiftLadderNodeProfile {
pub ladder_position: usize,
pub shift: f64,
pub weight: f64,
pub iterations: usize,
pub max_solve_iterations: usize,
pub krylov_condition: Option<f64>,
}Expand description
What one quadrature node of the shifted-solve ladder cost, and what the operator looked like there.
Fields§
§ladder_position: usizePosition of this node in the ladder’s DESCENDING walk (0 = largest shift, solved first and cold; the rest are warm-started from their predecessor).
shift: f64The shift t_ℓ.
weight: f64The quadrature weight w_ℓ.
iterations: usizeIterations summed over every right-hand side solved at this node.
max_solve_iterations: usizeLargest single-solve iteration count at this node.
krylov_condition: Option<f64>Ritz condition estimate θ_max/θ_min of the PRECONDITIONED shifted
operator, read off the CG coefficients of this node’s longest solve. None
when that solve converged before resolving two Ritz values.
Trait Implementations§
Source§impl Clone for ShiftLadderNodeProfile
impl Clone for ShiftLadderNodeProfile
Source§fn clone(&self) -> ShiftLadderNodeProfile
fn clone(&self) -> ShiftLadderNodeProfile
Returns a duplicate of the value. Read more
1.0.0 (const: unstable) · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moreAuto Trait Implementations§
impl Freeze for ShiftLadderNodeProfile
impl RefUnwindSafe for ShiftLadderNodeProfile
impl Send for ShiftLadderNodeProfile
impl Sync for ShiftLadderNodeProfile
impl Unpin for ShiftLadderNodeProfile
impl UnsafeUnpin for ShiftLadderNodeProfile
impl UnwindSafe for ShiftLadderNodeProfile
Blanket Implementations§
impl<T> Allocation for T
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
impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
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> Read<Exclusive, BecauseExclusive> for Twhere
T: ?Sized,
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.