Abstract
We study a method for estimating the topological entropy of a smooth dynamical system. Our method is based on estimating the logarithmic growth rates of suitably chosen curves in the system. We present two algorithms for this purpose and we analyze each according to its strengths and pitfalls. We also contrast these with a method based on the definition of topological entropy, using(n, ɛ)-spanning sets.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
