pub struct VanDerPol {
pub mu: f64,
}Expand description
Van der Pol oscillator:
ẋ = y
ẏ = μ(1 − x²)y − xExhibits a stable limit cycle for any μ > 0.
Fields§
§mu: f64Nonlinearity parameter μ.
Implementations§
Trait Implementations§
Auto Trait Implementations§
impl Freeze for VanDerPol
impl RefUnwindSafe for VanDerPol
impl Send for VanDerPol
impl Sync for VanDerPol
impl Unpin for VanDerPol
impl UnsafeUnpin for VanDerPol
impl UnwindSafe for VanDerPol
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> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
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.