首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Chaos in the Kuramoto-Sivashinsky equations—a computer-assisted proof
Authors:Daniel Wilczak
Institution:Department of Computational Mathematics, Faculty of Computer Science, Nowy Sacz WSB-NLU, Zielona 27, 33 - 300, Nowy Sacz, Poland
Abstract:In this paper, we present a new technique of proving the existence of an infinite number of symmetric periodic solutions. This technique combines the covering relations method introduced by Zgliczyński (J. Differential Equations 171 (2001) 173; Methods in Nonlinear Anal. 8 (1996) 169; Nonlinearity 10 (1997) 243) with fixed set iteration method described in Lamb (Reversing symmetries in dynamical systems, Ph.D. Thesis, Universiteit van Amsterdam, 1994). As an example we present a computer-assisted proof of symbolic dynamics in the Kuramoto-Sivashinsky equations. Moreover, we prove the existence of an infinite number of symmetric and an infinite number of nonsymmetric periodic solutions.
Keywords:Dynamical systems  Differential equations  Symmetric periodic solutions  Covering relations  Rigorous numerical analysis
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号