University of Cambridge > Talks.cam > Applied and Computational Analysis > An Explicit Filtered Lie Splitting Scheme for the Original Zakharov System with Low Regularity Error Estimates in All Dimensions

An Explicit Filtered Lie Splitting Scheme for the Original Zakharov System with Low Regularity Error Estimates in All Dimensions

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Georg Maierhofer.

In this talk, we present low-regularity numerical schemes for nonlinear dispersive equations, with a particular focus on the Zakharov system (ZS) and the “good” Boussinesq (GB) equation. These models exhibit strong nonlinear interactions and are known to pose significant analytical and numerical challenges when the solution has limited regularity.

We concentrate on our recent results for the Zakharov system, where we construct and analyze an explicit filtered Lie splitting scheme applied directly to its original coupled form. This method successfully overcomes the essential difficulty of derivative loss in the nonlinear terms, which not only obstructs low-regularity analysis, but has long prevented rigorous error estimates for explicit Lie splitting schemes based directly on the original Zakharov system. By developing multilinear estimates in discrete Bourgain spaces, we rigorously prove the first explicit low-regularity error estimate for the original Zakharov system, and also the first such result for a coupled system within the Bourgain framework. The analytical strategy developed here can also be extended to other dispersive equations with derivative loss, offering a way to overcome both low-regularity difficulties and the fundamental obstacle posed by derivative-loss nonlinearities. Numerical experiments confirm the theoretical predictions.

This talk is part of the Applied and Computational Analysis series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity