Mersenne Twister Random Vector Generator
Generates uniform pseudo-random vectors x_i ∈ [0, 1]^d with long period 2^{19937}-1 and uniform multi-dimensional equidistribution.
Implement pseudorandom Monte Carlo integration over a multi-dimensional unit hypercube, compute sample means and sample variances, demonstrate immunity to the curse of dimensionality, and verify the O(N^{-1/2}) statistical convergence rate governed by the Central Limit Theorem. Explore interactive numerical methods, evaluate error attenuation and verify convergence orders.
Ready to execute Step = 1.
Adjust Step, then execute computation.
Mathematical operations are computed deterministically using 64-bit IEEE 754 precision. Residuals reflect ordinary least-squares regression across successive observations.
Monte Carlo convergence O(N^{-1/2}) is slow: reducing error by a factor of 10 requires a 100-fold increase in sample count N. The simulation evaluates 5-dimensional Monte Carlo integration across sample counts N = 1000 · 4^{k-1}. The standardized error metric scales linearly with step index k, confirming the theoretical Central Limit exponent α = 0.500 with R² = 1.000000.
Generates uniform pseudo-random vectors x_i ∈ [0, 1]^d with long period 2^{19937}-1 and uniform multi-dimensional equidistribution.
Evaluates smooth and non-smooth test functions across dimensions d = 1 to 10.
Computes the unweighted sample average I_N = (V/N) ∑_{i=1}^N f(x_i) in 64-bit precision.
Calculates running sample variance s² numerically stably in a single pass without catastrophic cancellation.
Compares Monte Carlo O(N^{-1/2}) convergence against grid-based trapezoidal rule O(N^{-2/d}) across increasing dimensions d.
Confirms that the statistical standard error decays strictly as 1/√N with exponent α = 0.500.
Implement pseudorandom Monte Carlo integration over a multi-dimensional unit hypercube, compute sample means and sample variances, demonstrate immunity to the curse of dimensionality, and verify the O(N^{-1/2}) statistical convergence rate governed by the Central Limit Theorem. Standardized input settings: 1.0, 2.0, 3.0, 4.0, 5.0, 6.0 step.
Set up the 5D test function f(x₁, ..., x₅) = 32 x₁ x₂ x₃ x₄ x₅ on [0, 1]⁵ with exact integral I = 1.0.
Set sample sizes N = 1000 · 4^{k-1} across levels k = 1 to 6 (N = 1000, 4000, 16000, 64000, 256000, 1024000).
Sample N independent identically distributed uniform random vectors x_i ~ U([0, 1]⁵).
Evaluate the empirical mean I_N = (1/N) ∑_{i=1}^N f(x_i) and measure discrepancy |I_N - 1.0|.
Evaluate sample variance s² and compute standard error σ_N = s / √N corresponding to the 68.3% confidence bound.
Log the standardized error metric across levels k = 1 to 6 and fit the linear regression slope to verify α = 0.500.
Points are your recorded observations. The solid regression line validates Monte Carlo Multidimensional Integration mathematical scaling.
| # | Sample Size Level (k) (step) | Statistical Standard Error σ_N (standard error) | Observation Step Index k | Standardized Error Metric y = α · k | Remove |
|---|
No readings yet. Execute a computation and record it.