Abstract

Recent advances in the numerical solution of Riemann–Hilbert problems allow for the implementation of a Cauchy initial-value problem solver for the Korteweg–de Vries equation (KdV) and the defocusing modified Korteweg–de Vries equation (mKdV), without any boundary approximation. Borrowing ideas from the method of nonlinear steepest descent, this method is demonstrated to be asymptotically accurate. The method is straightforward for the case of defocusing mKdV due to the lack of poles in the Riemann–Hilbert problem and the boundedness properties of the reflection coefficient. Solving KdV requires the introduction of poles in the Riemann–Hilbert problem and more complicated deformations. The introduction of a new deformation for KdV allows for the stable asymptotic computation of the solution in the entire spacial and temporal plane. KdV and mKdV are dispersive equations, and this method can fully capture the dispersion with spectral accuracy. Thus, this method can be used as a benchmarking tool for determining the effectiveness of future numerical methods designed to capture dispersion. This method can easily be adapted to other integrable equations with Riemann–Hilbert formulations, such as the nonlinear Schrödinger equation.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call