Symbolic computation of recursion operators for nonlinear differential-difference equations

From MaRDI portal
Publication:719212

DOI10.3390/MCA16010001zbMATH Open1232.34018arXiv1104.4026OpenAlexW2963289193MaRDI QIDQ719212FDOQ719212


Authors: Ünal Göktaş, W. Hereman Edit this on Wikidata


Publication date: 10 October 2011

Published in: Mathematical \& Computational Applications (Search for Journal in Brave)

Abstract: An algorithm for the symbolic computation of recursion operators for systems of nonlinear differential-difference equations (DDEs) is presented. Recursion operators allow one to generate an infinite sequence of generalized symmetries. The existence of a recursion operator therefore guarantees the complete integrability of the DDE. The algo-rithm is based in part on the concept of dilation invariance and uses our earlier algorithms for the symbolic computation of conservation laws and generalized symmetries. The algorithm has been applied to a number of well-known DDEs, including the Kac-van Moerbeke (Volterra), Toda, and Ablowitz-Ladik lattices, for which recursion opera-tors are shown. The algorithm has been implemented in Mathematica, a leading com-puter algebra system. The package DDERecursionOperator.m is briefly discussed.


Full work available at URL: https://arxiv.org/abs/1104.4026




Recommendations





Cited In (7)

Uses Software





This page was built for publication: Symbolic computation of recursion operators for nonlinear differential-difference equations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q719212)