Nonlinear echoes and Landau damping with insufficient regularity

Auteurs : Jacob Bedrossian

Minor technical improvement that more clearly rules out the extension of Mouhot and Villani's results to Sobolev spaces for fixed backgrounds in the gravitational case (that is, for each high Sobolev space, there exists fixed backgrounds for which arbitrarily small perturbations display arbitrarily many nonlinear echoes)

Résumé : We prove that the theorem of Mouhot and Villani on Landau damping near equilibrium for the Vlasov-Poisson equations on $\mathbb{T}_x \times \mathbb{R}_v$ cannot, in general, be extended to high Sobolev spaces in the case of gravitational interactions. This is done by showing in every Sobolev space, there exists background distributions such that one can construct arbitrarily small perturbations that exhibit arbitrarily many isolated nonlinear oscillations in the density. These oscillations are known as plasma echoes in the physics community. For the case of electrostatic interactions, we demonstrate a sequence of small background distributions and asymptotically smaller perturbations in $H^s$ which display similar nonlinear echoes. This shows that in the electrostatic case, any extension of Mouhot and Villani's theorem to Sobolev spaces would have to depend crucially on some additional non-resonance effect coming from the background -- unlike the case of Gevrey-$\nu$ with $\nu < 3$ regularity, for which results are uniform in the size of small backgrounds. In particular, the uniform dependence on small background distributions obtained in Mouhot and Villani's theorem in Gevrey class is false in Sobolev spaces.

Soumis à arXiv le 22 Mai. 2016

Explorez l'arbre d'article

Cliquez sur les nœuds de l'arborescence pour être redirigé vers un article donné et accéder à leurs résumés et assistant virtuel

Accédez également à nos Résumés, ou posez des questions sur cet article à notre Assistant IA.

Beta

Recherchez des articles similaires (en version bêta)

En cliquant sur le bouton ci-dessus, notre algorithme compare le titre et le résumé de cet article à tous les articles de la même catégorie arXiv que nous avons résumés, et trouve les plus proches. Vous pouvez le relancer de temps en temps : les résultats s'améliorent à mesure que notre base grandit.