Abstract
A method for determining the measure of random nature of a dynamic system was presented. The system is related with an oriented graph (symbolic image) that can be regarded as its discrete approximation. A special sequence of symbolic images enabling one to judge the degree of randomness (entropy) of the dynamic system was constructed.
Similar content being viewed by others
REFERENCES
Alekseev, V.M., Symbolic Dynamics, Eleventh Math.Workshop, Kiev, 1976.
Methods of Symbolic Dynamics, Matematika, 1979, no. 13.
Douglas, L. and Marcus, B., An Introduction to Symbolic Dynamics and Coding, New York: Cambridge Univ. Press, 1995.
Froyland, G., Junge, O., and Ochs, G., Rigorous Computation of Topological Entropy with Respect to Finite Partition, Web-article.
Gene, H., Charles, F., and Loan, V., Matrix Computations, Baltimore: J. Hopkins Univ. Press, 1996.
Collet, P., Crutchfield, J., and Eckmann, J., Computing the Topological Entropy of Maps, Commun.Math.Phys., 1983, vol. 88, pp. 257-262.
Block, L. and Keesling, J., Computing the Topological Entropy of Maps of the Interval with Three Monotone Pieces, J.Statist.Phys., 1992, vol. 66, pp. 755-774.
Osipenko, G., Construction of Attractors and Filtrations, in Conley Index Theory, 1999, vol. 47, pp. 173-197.
Shub, M., Dynamical Systems, Filtrations and Entropy, Bull.Am.Math.Soc., 1974, vol. 80, no. 1, pp. 27-41.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Mizin, D.A. Estimation of the Entropy of Dynamic System. Automation and Remote Control 63, 1860–1865 (2002). https://doi.org/10.1023/A:1020971802526
Issue Date:
DOI: https://doi.org/10.1023/A:1020971802526