Abstract
An improved algorithm for symbolic computations of polynomial-type conservation laws (PCLaws) of a general polynomial nonlinear system is presented. The algorithm is implemented in Maple and can be successfully used for high-dimensional models. Furthermore, the algorithm discards the restriction to evolution equations. The program can also be used to determine the preferences for a given parameterized nonlinear systems. The code is tested on several known nonlinear equations from the soliton theory.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
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
