pub struct KrawczykStep<S: Scalar> {
pub contracted: Vector<S, 2>,
pub verified: bool,
pub empty: bool,
}Expand description
Outcome of one gauss_newton_krawczyk_step contraction.
Fields§
§contracted: Vector<S, 2>K(X) ∩ X — still an honest enclosure of every root of F in the
incoming X, tightened whenever K(X) and X actually overlap.
Meaningless (equal to the incoming X, unchanged) when empty is
true — the whole point of that flag is to tell the two cases apart.
verified: boolK(X) ⊆ X held: the rigorous existence-and-uniqueness certificate
(Krawczyk’s classical guarantee) — X contains exactly one root of
F, and it lies in contracted.
empty: boolK(X) and X did not even overlap on some component: a rigorous
non-existence proof — X contains no root of F at all. Distinct
from !verified, which merely means “inconclusive” (neither proved
nor disproved) — the caller must check this before trusting
contracted.
Auto Trait Implementations§
impl<S> Freeze for KrawczykStep<S>where
S: Freeze,
impl<S> RefUnwindSafe for KrawczykStep<S>where
S: RefUnwindSafe,
impl<S> Send for KrawczykStep<S>
impl<S> Sync for KrawczykStep<S>
impl<S> Unpin for KrawczykStep<S>where
S: Unpin,
impl<S> UnsafeUnpin for KrawczykStep<S>where
S: UnsafeUnpin,
impl<S> UnwindSafe for KrawczykStep<S>where
S: UnwindSafe,
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