Struct LogisticMap 

pub struct LogisticMap {
    pub r: f64,
}

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

Fields

r: f64

Growth parameter r ∈ [0, 4].

Implementations

impl LogisticMap

pub fn new(r: f64) -> Self

Creates a new logistic map with the given growth rate.

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

Iterates the map for n steps starting from x0.

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

Returns the attractor (after discarding transient steps) of length n.

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

Computes the Lyapunov exponent of the map.

pub fn bifurcation_diagram( r_values: &[f64], x0: f64, transient: usize, n_attractor: usize, ) -> Vec<(f64, Vec<f64>)>

Generates a bifurcation diagram: for each r in r_values returns (r, attractor_points).

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.