Abstract
Under investigation in this work is the Davey–Stewartson (DS) II equation. Based on the Kadomtsev–Petviashvili (KP) reduction method and Schur polynomial theory, we construct the general high-order lump solutions. The prediction solutions consisting of fundamental lumps and their positions are derived by extracting leading-order asymptotics of the Schur polynomials of true solutions. When indexes of the solutions are chosen as different positive integer combinations, the prediction solutions at large time reflect two classes of lump patterns of the true solutions. The first class of lump pattern with triangle shape is analytically described by root structure of the Yablonskii–Vorob’ev polynomial. When time t evolves from large negative to large positive, the triangle lump reverses itself along the y -direction. The second class of lump pattern consists of non-triangle in outer region, which is analytically described by non-zero root structure of the Wronskian–Hermit polynomial, together with possible triangle in the inner region, which is analytically described by root structure of the Yablonskii–Vorob’ev polynomial. In addition, the non-triangle lump pattern in outer regions rotates at an angle while the possible triangle lump pattern in the inner region reverses itself along the y -direction when time t evolves from large negative to large positive. The obtained results improve our understanding of time evolution mechanisms of high-order lumps.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences
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.