Efficient method for calculating the eigenvalue of the Zakharov-Shabat system

by   Shikun Cui, et al.
NetEase, Inc

In this paper, a direct method is proposed to calculate the eigenvalue of the Zakharov-Shabat system. The main tools of our method are Chebyshev polynomials and the QR algorithm. After introducing the hyperbolic tangent mapping, the eigenfunctions and potential function defined in the real field can be represented by Chebyshev polynomials. Using Chebyshev nodes, the Zakharov-Shabat eigenvalue problem is transformed into a matrix eigenvalue problem. The matrix eigenvalue problem is solved by the QR algorithm. Our method is used to calculate eigenvalues of the Zakharov-Shabat equation with three potentials, the rationality of our method is verified by comparison with analytical results.


page 5

page 7


Linearizations of matrix polynomials viewed as Rosenbrock's system matrices

A well known method to solve the Polynomial Eigenvalue Problem (PEP) is ...

Introducing phase jump tracking - a fast method for eigenvalue evaluation of the direct Zakharov-Shabat problem

We propose a new method for finding discrete eigenvalues for the direct ...

An Eigenvalue-Free Implementation of the Log-Conformation Formulation

The log-conformation formulation, although highly successful, was from t...

Eigenvectors from eigenvalues in quaternion matrix with computer realization

In this paper, we extend eigenvector-eigenvalue identity (formally named...

Computing Klein-Gordon Spectra

We study the computational complexity of the eigenvalue problem for the ...

Calculating a function of a matrix with a real spectrum

Let T be a square matrix with a real spectrum, and let f be an analytic ...

Please sign up or login with your details

Forgot password? Click here to reset