Symbolic Computation of Recursion Operators for Nonlinear Differential-Difference equations

Details Symbolic Computation of Recursion Operators for Nonlinear Differential-Difference equations Symbolic Computation of Recursion Operators for Nonlinear Differential-Difference equations

2011-04-20

arxiv.org/abs/1104.4026v1

Mathematical and Computational Applications, 16, 1-12, 2011

Computer Science

Symbolic Computation

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Symbolic Computation of Recursion Operators for Nonlinear Differential-Difference equations does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Symbolic Computation of Recursion Operators for Nonlinear Differential-Difference equations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Symbolic Computation of Recursion Operators for Nonlinear Differential-Difference equations will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-432904