pub struct ImplicitEuler;Expand description
Implicit (backward) Euler integrator — unconditionally stable.
For linear systems F = k * x the implicit update solves:
v_{n+1} = v_n + a_{n+1} * dt (where a_{n+1} uses new position)
q_{n+1} = q_n + v_{n+1} * dtIn the absence of position-dependent forces this reduces to the semi-implicit Euler integrator.
Trait Implementations§
Auto Trait Implementations§
impl Freeze for ImplicitEuler
impl RefUnwindSafe for ImplicitEuler
impl Send for ImplicitEuler
impl Sync for ImplicitEuler
impl Unpin for ImplicitEuler
impl UnsafeUnpin for ImplicitEuler
impl UnwindSafe for ImplicitEuler
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<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.