Integrable discretization of recursion operators and unified bilinear forms to soliton hierarchies
arXiv:1703.01723 · doi:10.46298/ocnmp.11754
Abstract
In this paper, we give a procedure for discretizing recursion operators by utilizing unified bilinear forms within integrable hierarchies. To illustrate this approach, we present unified bilinear forms for both the AKNS hierarchy and the KdV hierarchy, derived from their respective recursion operators. Leveraging the inherent connection between soliton equations and their auto-Bäcklund transformations, we discretize the bilinear integrable hierarchies and derive discrete recursion operators. These discrete recursion operators exhibit convergence towards the original continuous forms when subjected to a standard limiting process.
arXiv comment16Pages
References in corpus (6)
- A Novel Hierarchy of Integrable Lattices
- Recursion operators, conservation laws and integrability conditions for difference equations
- Integrable semi-discretizations of the reduced Ostrovsky equation
- Rational recursion operators for integrable differential-difference equations
- Loop Groups and Discrete KdV Equations
- On a (2+1)-dimensional generalization of the Ablowitz-Ladik lattice and a discrete Davey-Stewartson system