Initial-boundary value problems for discrete evolution equations: discrete linear Schrodinger and integrable discrete nonlinear Schrodinger equations
Gino Biondini, Guenbo Hwang

TL;DR
This paper extends Fokas' unified transform method to discrete evolution equations, enabling the solution of initial-boundary value problems for discrete linear and nonlinear Schrödinger equations using spectral analysis and Lax pairs.
Contribution
It develops a discrete analogue of Fokas' method for solving initial-boundary value problems, including handling boundary conditions and soliton solutions for integrable discrete equations.
Findings
Successfully solves initial-boundary value problems for discrete Schrödinger equations.
Identifies linearizable boundary conditions and explicit solutions.
Connects discrete solutions to continuum limits and soliton structures.
Abstract
We present a method to solve initial-boundary value problems for linear and integrable nonlinear differential-difference evolution equations. The method is the discrete version of the one developed by A. S. Fokas to solve initial-boundary value problems for linear and integrable nonlinear partial differential equations via an extension of the inverse scattering transform. The method takes advantage of the Lax pair formulation for both linear and nonlinear equations, and is based on the simultaneous spectral analysis of both parts of the Lax pair. A key role is also played by the global algebraic relation that couples all known and unknown boundary values. Even though additional technical complications arise in discrete problems compared to continuum ones, we show that a similar approach can also solve initial-boundary value problems for linear and integrable nonlinear…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
