Abstract:
The paper considers algorithms for solving inverse scattering problems based on the discretization of the Gelfand–Levitan–Marchenko integral equations, associated with the system of nonlinear Schrödinger equations of the Manakov model. The numerical algorithm of the first order approximation for solving the scattering problem is reduced to the inversion of a series of nested block Toeplitz matrices using the Levinson-type bordering method. Increasing the approximation accuracy violates the Toeplitz structure of block matrices. Two algorithms are described that solve this problem for second order accuracy. One algorithm uses a block version of the Levinson bordering algorithm, which recovers the Toeplitz structure of the matrix by moving some terms of the systems of equations to the right-hand side. Another algorithm is based on the Toeplitz decomposition of an almost block-Toeplitz matrix and the Tyrtyshnikov bordering algorithm. The speed and accuracy of calculations using the presented algorithms are compared on an exact solution (the Manakov vector soliton).
Cited by