科研之友
微信
新浪微博
Facebook
分享链接
摘要
In this paper, based on the Hirota bilinear method, a reliable algorithm for generating the bilinear Backlund transformation (BT) of integrable hierarchies is described. With the help of Maple symbolic computation the algorithm would be very helpful and powerful for looking for the bilinear BT of integrable systems especially for those high-order integrable hierarchies. The BTs of bilinear Ramani hierarchy are deduced for the first time by using the algorithm.
