Author
Abstract
This paper refines existing techniques into an algorithmic method for deriving the generalization of a Lax Pair directly from a general integrable nonlinear evolution equation via the use of truncated Painlevé expansions. The resulting algorithm is also applicable to multicomponent integrable systems, and is thus expected to be of great value for complicated variants of such systems in various applications areas. Although a related method has existed for simple scalar integrable evolution equations for many years now, nevertheless no systematic procedure has been given that would work in general for scalar as well as for multicomponent systems. The method presented here largely systematizes the necessary operations in applying the Painlevé method to a general integrable evolution equation or system of equations. We demonstrate that by following the concept of enforcing integrability at each step (referred to here as the Principle of Integrability), one is led to an appropriate generalization of a Lax Pair, although perhaps in nonlinear form, called a “Lax Complex”. One new feature of this procedure is that it utilizes, as needed, a technique from the well-known Estabrook–Wahlquist method for determining necessary integrating factors. The end result of this procedure is to obtain a Lax Complex, whose integrability condition will contain the original evolution equation as a necessary condition. This in itself is sufficient to ensure that the Lax Complex may be used to construct Bäcklund solutions of the evolution equation, to obtain Darboux Transformations, and also to obtain Hirota’s tau functions, in a manner analogous to the procedure for single component systems. The additional problem of finding a general procedure for the linearization of any Lax Complex is not treated in this paper. However, we do demonstrate that a particular technique, which can be derived self-consistently from the Painlevé–Bäcklund equations, has proven to be sufficient so far. The Nonlinear Schrödinger equation is used to illustrate the method, and then the method is applied to obtain, for the first time via the Painlevé method, a Lax Complex for the vector Manakov system. Limitations in the algorithm remain, especially for cases with more than one principal branch, and these are briefly mentioned as directions for future work.
Suggested Citation
Choudhury, S. Roy, 2006.
"Painlevé analysis of nonlinear evolution equations—an algorithmic method,"
Chaos, Solitons & Fractals, Elsevier, vol. 27(1), pages 139-152.
Handle:
RePEc:eee:chsofr:v:27:y:2006:i:1:p:139-152
DOI: 10.1016/j.chaos.2005.02.043
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:chsofr:v:27:y:2006:i:1:p:139-152. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Thayer, Thomas R. (email available below). General contact details of provider: https://www.journals.elsevier.com/chaos-solitons-and-fractals .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.