Mathematics / Lorenz Attractor & Chaos
FREE TO EXPLORE
LABORATORY 40 · MATHEMATICS

Lorenz Attractor & Chaos lab report

A worked lorenz attractor & chaos lab report with iteration data tables, logarithmic graphs, calculations, uncertainty and conclusions.

WORKED EXAMPLE · BENCHMARK OBSERVATIONS

A complete example laboratory report.

Simulated demonstration data.

This report illustrates formal numerical analysis, iteration tracking, and convergence rate extraction. Replace its observations with your own computational telemetry when preparing a practical submission.

Student: __________________Student ID: __________________Course: __________________Date: __________________Partner: __________________Instructor: __________________

1. Title and aim

Lorenz Attractor: Deterministic Chaos, Strange Attractors & Lyapunov Exponents. Integrate the three-dimensional non-linear Lorenz atmospheric convection system dx/dt = σ (y - x), dy/dt = x (ρ - z) - y, dz/dt = x y - β z, visualize the butterfly strange attractor in 3D phase space, demonstrate sensitive dependence on initial conditions (the butterfly effect), and quantitatively extract the maximal Lyapunov exponent λ = 0.906.

2. Abstract

Six computational trials were executed across standardized inputs Step = 1.0 to Step = 6.0 for Lorenz Attractor: Deterministic Chaos, Strange Attractors & Lyapunov Exponents. An ordinary least-squares regression yielded an empirical Maximal Lyapunov Exponent (λ) of 0.906 nats/time (difference from theoretical reference = 0.0000%). The empirical telemetry conclusively validates the theoretical model and complexity scaling with R² = 1.000000.

3. Apparatus and fixed settings

4. Theory and graph choice

In 1963, Massachusetts Institute of Technology meteorologist Edward Norton Lorenz published a twelve-page paper in the Journal of the Atmospheric Sciences titled 'Deterministic Nonperiodic Flow.' Intending to model simplified thermal convection rolls in the atmosphere using three truncated Fourier modes, Lorenz uncovered a phenomenon that shattered the classical Laplacian clockwork universe: deterministic chaos. Governed by the non-linear differential equations dx/dt = σ (y - x), dy/dt = x (ρ - z) - y, dz/dt = x y - β z, the system's trajectories never settle into an equilibrium point, never repeat as a periodic limit cycle, and never escape to infinity. Instead, they trace an infinite, non-self-intersecting fractal manifold popularly known as the 'butterfly attractor.' In this laboratory, we integrate the 3D Lorenz system, simulate twin trajectories with infinitesimal separation, demonstrate the butterfly effect, and quantitatively extract the maximal Lyapunov exponent λ = 0.906.

ln(||δ(t)||) = λ · t + ln(δ₀)

The mathematical regression linearizes the relationship into the form y = mx + b. Here, the independent variable x represents Observation Time Coordinate t = k, and the dependent variable y represents Logarithmic Separation y = λ · t. The slope m directly extracts Maximal Lyapunov Exponent (λ), while the intercept b accounts for residual baseline offsets.

5. Method

  1. Set σ = 10.0, ρ = 28.0, and β = 8/3, noting that the three equilibrium points (origin and two convective roll states C±) are all unstable.
  2. Launch reference trajectory x₁ at (0.0, 1.0, 1.05) and shadow trajectory x₂ at (0.0, 1.0 + 10⁻⁸, 1.05).
  3. March both trajectories simultaneously using time step h = 0.01 across time units t = 1 to 6.
  4. Observe that for initial times t < 10, both trajectories remain virtually indistinguishable, tracing identical butterfly lobes.
  5. Track the explosion of separation ||δ(t)|| ~ 10⁻⁸ exp(0.906 t), showing complete decorrelation as trajectories diverge onto opposite lobes.
  6. Log the standardized logarithmic separation response across time steps t = 1 to 6 and fit linear regression to confirm λ = 0.906.

6. Observations and calculation table

All iterative observations use strictly controlled 64-bit IEEE 754 precision buffers. Residuals are computed relative to the ordinary least-squares regression line.

Table 1. Six simulated observations; x and y represent transformed mathematical metrics.
No.Observation Time Step (k) (time unit)Logarithmic Separation Vector Norm (ln(norm))Observation Time Coordinate t = kLogarithmic Separation y = λ · tFitted yResidual
11.00.9061.00000.90600.90600.0000
22.01.8122.00001.81201.81200.0000
33.02.7183.00002.71802.71800.0000
44.03.6244.00003.62403.62400.0000
55.04.535.00004.53004.53000.0000
66.05.4366.00005.43605.43600.0000

Download the sample observations (CSV) ↓

7. Worked calculation for one observation

For step k = 1.0: Current coordinate x = 1.0000. Mathematical model response y = 0.9060. Output reading: 0.9060.

8. Graph, gradient and final calculation

0.230.401.701.953.173.504.645.056.126.60Observation Time Coordinate t = kLogarithmic Separation y = λ · t

Circular markers represent empirical computational observations. The solid line represents the ordinary least-squares linear fit.

x̄ = 3.50000; ȳ = 3.17100
Σ(x − x̄)² = 17.50000
Σ(x − x̄)(y − ȳ) = 15.85500
m = Σ(x − x̄)(y − ȳ) / Σ(x − x̄)² = 0.90600000
b = ȳ − mx̄ = -4.4409e-16
y = 0.9060 · k + -4.4409e-16 ⟹ Target = 0.906 (theoretical = 0.906)

9. Uncertainty and comparison

Percentage difference = |estimate − theoretical value| / |theoretical value| × 100 = 0.0000%.

For n = 6 observations, Σresidual² = 1.5777e-30; s² = Σresidual²/(n − 2). Gradient standard error = √[s²/Σ(x − x̄)²] = 1.5013e-16. Intercept standard error = √[s²(1/n + x̄²/Σ(x − x̄)²)] = 5.8467e-16.

Propagating the fit parameters yields a fit standard error of 1.5013e-16 nats/time, with an ideal coefficient of determination R² = 1.000000.

In computational mathematics and numerical analysis, errors arise from algorithmic discretization, finite precision IEEE 754 floating-point arithmetic (machine epsilon ε_mach ≈ 2.22 × 10⁻¹⁶ for 64-bit double precision), and condition number propagation. The ordinary least-squares fit across n = 6 standardized observations provides standard errors for the gradient and intercept. Because the mathematical recurrence is evaluated with high numerical precision, the residual sum of squares is vanishingly small, yielding a coefficient of determination R² ≥ 0.999999 and confirming the theoretical mathematical model.

10. Result and discussion

Maximal Lyapunov Exponent (λ) = 0.906 nats/time
Theoretical reference value: 0.906 nats/time

The empirical benchmark observations provide rigorous quantitative verification of Lorenz Attractor: Deterministic Chaos, Strange Attractors & Lyapunov Exponents. In numerical analysis, scientific computing, and computational mathematics, algorithms are characterized by their asymptotic operational scaling, stability, and convergence rates. Across all six observations, the empirical slope m = 0.9060 confirms the theoretical model with near-zero residual variance. Furthermore, comparison with alternative algorithmic paradigms underscores critical trade-offs between memory footprint, condition number sensitivity, and operational throughput. The algorithm's behavior confirms the mathematical predictions established by numerical analysis literature.

11. Precautions and limitations

The Lyapunov exponent measures only local exponential divergence; once separation reaches the macroscopic size of the attractor, divergence saturates. The simulation integrates the canonical Lorenz system (σ=10, ρ=28, β=8/3) and tracks exponential divergence between twin trajectories with initial perturbation ||δ₀|| = 10⁻⁸ across observation time steps t = 1 to 6. The logarithmic separation scales linearly with time. The linear regression ln(||δ||) = λ·t + ln(δ₀) extracts the maximal Lyapunov exponent λ = 0.906 with R² = 1.000000.

12. Conclusion

This computational laboratory investigation quantitatively verified the mathematical formulation and asymptotic scaling of Lorenz Attractor: Deterministic Chaos, Strange Attractors & Lyapunov Exponents. Through rigorous tracking across six observation points, we confirmed an empirical Maximal Lyapunov Exponent (λ) of 0.906 nats/time matching the theoretical reference 0.906 nats/time within 0.0000% error. The investigation demonstrates why this method serves as an indispensable tool in modern computational science.