Struct LogisticMap 

pub struct LogisticMap {
    pub r: f64,
}

The logistic map x_{n+1} = r · xₙ (1 − xₙ).

Classic example of period-doubling route to chaos with r ∈ [0, 4].

Fields

r: f64

Growth parameter r.

Implementations

impl LogisticMap

pub fn new(r: f64) -> Self

Create a logistic map with growth parameter r.

pub fn apply(&self, x: f64) -> f64

One application of the map.

pub fn orbit_1d(&self, x0: f64, n: usize) -> Vec<f64>

Compute an orbit starting at x0 for n steps.

pub fn bifurcation_diagram( r_min: f64, r_max: f64, n_r: usize, transient: usize, keep: usize, ) -> Vec<(f64, f64)>

Generate a bifurcation diagram by sweeping r in [r_min, r_max] with n_r steps. For each r value the system is iterated transient steps (discarded) then keep steps are recorded.

Returns a list of (r, x) pairs.

pub fn lyapunov_exponent(&self, x0: f64, n: usize) -> Option<f64>

Largest Lyapunov exponent estimated over n iterations.

Returns None if the trajectory passes through 0 or 1 (derivative undefined).

Trait Implementations

impl Clone for LogisticMap

fn clone(&self) -> LogisticMap

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for LogisticMap

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl DiscreteMapIterate for LogisticMap

fn dim(&self) -> usize

State dimension.

fn step(&self, state: &[f64]) -> Vec<f64>

Advance the state by one step. state must have length dim().

fn orbit(&self, init: &[f64], n: usize) -> Vec<Vec<f64>>

Compute an orbit of length n starting from init.