A Maple package for finding exact solitary wave solutions of coupled nonlinear evolution equations. (English) Zbl 1196.37004

Summary: The tanh function expansion method for finding traveling solitary wave solutions to coupled nonlinear evolution equations is described. A complete implementation RATHS written in Maple is presented, in which the operator mains can output exact solitary wave solutions entirely automatically. Furthermore, RATHS can handle any number of dependent variables \(ui\) as well as any number of independent variables \(x_j\) contained in the input system. This package can also be applied to ODEs. The effectiveness of RATHS is illustrated by applying it to a variety of equations.


37-04 Software, source code, etc. for problems pertaining to dynamical systems and ergodic theory
37K40 Soliton theory, asymptotic behavior of solutions of infinite-dimensional Hamiltonian systems


RATHS; Maple


Maple; RATH
Full Text: DOI


[1] Lan, H.; Wang, K., J. Phys. A: Math. Gen., 23, 3923 (1990)
[2] Malfliet, W., Amer. J. Phys., 60, 650 (1992)
[3] Parkes, E. J.; Duffy, B. R., Comput. Phys. Comm., 98, 288 (1996)
[4] Li, Z. B.; Shi, H., Appl. Math. JCU, 11B, 1 (1996)
[5] Fan, E. G.; Zhang, H. Q., Phys. Lett. A, 245, 389 (1998)
[6] Zhang, G. X.; Li, Z. B.; Duan, Y. S., Sci. in China (Series A), 44, 396 (2001)
[7] Li, Z. B.; Liu, Y. P., Comput. Phys. Comm., 104, 256 (2002)
[8] Hirota, R.; Satsuma, J., Phys. Lett. A, 85, 407 (1981)
[9] Sachs, R. L., Physica D, 30, 1 (1998)
[10] Satsuma, J.; Hirota, R., J. Phys. Soc. Jpn., 51, 332 (1982)
[11] Hirota, R.; Satsuma, J., Phys. Lett. A, 85, 407 (1981)
[12] Fan, E. G., Phys. Lett. A, 282, 18 (2001)
[13] Tam, H. W.; Hu, X. B.; Wang, D. L., J. Phys. Soc. Jpn., 68, 369 (1999)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.