The simulation of random processes on digital computers with Chebyshev mixing transformations

DOI10.1016/0021-9991(79)90128-1zbMATH Open0443.65002OpenAlexW1983085075MaRDI QIDQ1144352FDOQ1144352

Authors: P. Everett, P. W. Johnson, Thomas Erber 

Publication date: 1979

Published in: Journal of Computational Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0021-9991(79)90128-1

zbMATH Keywords

simulationrandom processesKolmogorov entropyasymptotic statistical featuresChebyshev mixing transformationgrowth of round-off errorsmemory-dependent feedbackprobabilistic metric for Baker's transformationpseudo- random numbers

Mathematics Subject Classification ID

Monte Carlo methods (65C05) Random number generation in numerical analysis (65C10)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Deterministic Nonperiodic Flow
• Stable and Random Motions in Dynamical Systems
• Title not available (Why is that?)
• Period Three Implies Chaos
• Topological Entropy
• The Entropy of Chebyshev Polynomials
• Title not available (Why is that?)
• Title not available (Why is that?)
• Communication Theory of Secrecy Systems*
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On normal numbers
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Generic Hamiltonian dynamical systems are neither integrable nor ergodic
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Invariant sets under iteration of rational functions
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On Causality, Statistics and Probability
• Measure-preserving homeomorphisms and metrical transitivity
• Some new results in the Kolmogorov-Sinai theory of entropy and ergodic theory
• Deterministic Simulation of Random Processes
• Ergodic and Mixing Properties of Chebyshev Polynomials
• An extension of the Shannon theory approach to cryptography
• Roots of n  : 1 Measure-Preserving Transformations
• On the Distribution of Pseudo-Random Numbers Generated by the Linear Congruential Method
• On mixing transformations
• Mixing transformations on metric spaces
• A New Pseudo-Random Number Generator
• Recurrence and dispersion under iteration of Cebysev polynomials
• Broken linear transformations
• Probabilistic metric spaces determined by measure preserving transformations

Cited In (8)

• Ergodic properties of computer orbits for simple piecewise monotonic transformations
• Informal Remarks on the Orbit Structure of Discrete Approximations to Chaotic Maps
• Symbolic dynamics of one-dimensional maps: Entropies, finite precision, and noise
• ACORN - A new method for generating sequences of uniformly distributed pseudo-random numbers
• The simulation of random processes on digital computers: Unavoidable order
• Computer orbits
• Shadowing and iterative interpolation for Čebyšev mixing transformations
• The use of Chebyshev mixing to generate pseudo-random numbers

This page was built for publication: The simulation of random processes on digital computers with Chebyshev mixing transformations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1144352)