The simulation of random processes on digital computers: Unavoidable order
From MaRDI portal
Publication:1050078
DOI10.1016/0021-9991(83)90137-7zbMath0512.65004OpenAlexW1982332968MaRDI QIDQ1050078
M. J. Frank, T. M. Rynne, Thomas Erber, William F. Darsow
Publication date: 1983
Published in: Journal of Computational Physics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0021-9991(83)90137-7
pseudorandom number generatorshysteresis of Ewing arraysordered distribution of the set of initial numberssimulation of chaotic behaviorterminal loops
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (10)
ACORN - A new method for generating sequences of uniformly distributed pseudo-random numbers ⋮ A model for roundoff and collapse in computation of chaotic dynamical systems ⋮ Cramér distance and discretizations of circle expanding maps II: simulations ⋮ Limit cycles in a quadratic discrete iteration ⋮ Shadowing and iterative interpolation for Čebyšev mixing transformations ⋮ The genesis of the notion of distributional chaos ⋮ Effects of phase space discretization on the long-time behavior of dynamical systems ⋮ DYNAMICAL CHARACTERISTICS OF DISCRETIZED CHAOTIC PERMUTATIONS ⋮ Basin of attraction of cycles of discretizations of dynamical systems with SRB invariant measures. ⋮ Informal Remarks on the Orbit Structure of Discrete Approximations to Chaotic Maps
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The simulation of random processes on digital computers with Chebyshev mixing transformations
- Hammersley's law for the van der Corput sequence: an instance of probability theory for pseudorandom numbers
- On mixing transformations
- On the concepts of convergence, consistency, and stability in connection with some numerical methods
- Zufälligkeit und Wahrscheinlichkeit. Eine algorithmische Begründung der Wahrscheinlichkeitstheorie. (Randomness and probability. An algorithmic foundation of probability theory)
- Mixing transformations on metric spaces
- Asymptotische Eigenschaften der unvollständigen Gammafunktionen
- Titchmarsh divisor problem for abelian varieties of types I, II, III, and IV
- On Causality, Statistics and Probability
- Information-Theoretic Limitations of Formal Systems
- Topological Entropy
- Probability Distributions Related to Random Mappings
- The Expected Number of Components Under a Random Mapping Function
This page was built for publication: The simulation of random processes on digital computers: Unavoidable order
