کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
1888813 1533642 2016 17 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Computing the topological entropy of continuous maps with at most three different kneading sequences with applications to Parrondo's paradox
موضوعات مرتبط
مهندسی و علوم پایه فیزیک و نجوم فیزیک آماری و غیرخطی
پیش نمایش صفحه اول مقاله
Computing the topological entropy of continuous maps with at most three different kneading sequences with applications to Parrondo's paradox
چکیده انگلیسی
We introduce an algorithm to compute the topological entropy of piecewise monotone maps with at most three different kneading sequences, with prescribed accuracy. As an application, we compute the topological entropy of 3-periodic sequences of logistic maps, disproving a commutativity formula for topological entropy with three maps, and analyzing the dynamics Parrondo's paradox in this setting.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Chaos, Solitons & Fractals - Volume 83, February 2016, Pages 1-17
نویسندگان
, ,