Abstract
In this paper, we prove the existence of response solution (i.e., quasi-periodic solution with the same frequency as the forcing) for the quasi-periodically forced generalized ill-posed Boussinesq equation: $$\begin{aligned} \begin{aligned} y_{tt}(t,x)=\mu y_{xxxx}+y_{xx}+\left( y^{3}+\varepsilon f(\omega t,x)\right) _{xx},\,\, x\in [0, \pi ],\,\, \mu >0, \end{aligned} \end{aligned}$$subject to the hinged boundary conditions $$\begin{aligned} \begin{aligned} y(t,0)=y(t,\pi )=y_{xx}(t,0)=y_{xx}(t,\pi )=0, \end{aligned} \end{aligned}$$where $$\omega =(1,\alpha )$$ with $$\alpha $$ being any irrational numbers. The proof is based on a modified Kolmogorov–Arnold–Moser (KAM) iterative scheme. We will, at every step of KAM iteration, construct a symplectic transformation in a such way that the composition of these transformations reduce the original system to a new system which possesses zero as equilibrium. Note that we allow $$\alpha $$ to be any irrational numbers, and thus the frequency $$\omega =(1,\alpha )$$ is beyond Diophantine or Brjuno frequency, which we call as Liouvillean frequency. Moreover, the model under consideration is ill-posed and has complicated Hamiltonian structure. This makes homological equations appearing in KAM iteration are different from the ones in the classical infinite-dimensional KAM theory. The result obtained in this paper strengthens the existing results in the literature where the system is well-posed or the forcing frequency is assumed to be Diophantine.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.