pub struct HenonMap {
pub a: f64,
pub b: f64,
}Expand description
The Hénon map:
x_{n+1} = 1 − a xₙ² + yₙ
y_{n+1} = b xₙClassical parameter values are a = 1.4, b = 0.3.
Fields§
§a: f64Parameter a.
b: f64Parameter b.
Implementations§
Source§impl HenonMap
impl HenonMap
Sourcepub fn apply(&self, x: f64, y: f64) -> (f64, f64)
pub fn apply(&self, x: f64, y: f64) -> (f64, f64)
Apply one step starting at (x, y). Returns (x_new, y_new).
Sourcepub fn orbit_2d(&self, x0: f64, y0: f64, n: usize) -> Vec<(f64, f64)>
pub fn orbit_2d(&self, x0: f64, y0: f64, n: usize) -> Vec<(f64, f64)>
Compute an orbit for n steps starting at (x0, y0).
Sourcepub fn jacobian_det(&self) -> f64
pub fn jacobian_det(&self) -> f64
Jacobian determinant (constant for the Hénon map): −b.
Trait Implementations§
Source§impl DiscreteMapIterate for HenonMap
impl DiscreteMapIterate for HenonMap
Auto Trait Implementations§
impl Freeze for HenonMap
impl RefUnwindSafe for HenonMap
impl Send for HenonMap
impl Sync for HenonMap
impl Unpin for HenonMap
impl UnsafeUnpin for HenonMap
impl UnwindSafe for HenonMap
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.