The relativistic inverse scattering problem for quantum graphs

the algorithm for solving the inverse numerical range problem

برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.

Inverse scattering problem for quantum graph vertices

On the quantum inverse scattering problem

A general method for solving the so-called quantum inverse scattering problem (namely the reconstruction of local quantum (field) operators in term of the quantum monodromy matrix satisfying a Yang-Baxter quadratic algebra governed by an R-matrix) for a large class of lattice quantum integrable models is given. The principal requirement being the initial condition (R(0) = P , the permutation op...

Inverse scattering problem for the Impulsive Schrodinger equation with a polynomial spectral dependence in the potential

In the present work, under some di¤erentiability conditions on the potential functions , we …rst reduce the inverse scattering problem (ISP) for the polynomial pencil of the Scroedinger equation to the corresponding ISP for the generalized matrix Scrödinger equation . Then ISP will be solved in analogy of the Marchenko method. We aim to establish an e¤ective algorithm for uniquely reconstructin...

On the Inverse Problem for Quantum Graphs with One Cycle

Quantum graphs having one cycle are considered. It is shown that if the cycle contains at least three vertices, then the potential on the graph can be uniquely reconstructed from the corresponding Titchmarsh-Weyl function (Dirichlet-to-Neumann map) associated with graph’s boundary, provided certain non-resonant conditions are satisfied. PACS numbers: 03.65.Nk, 73.63.-b, 85.35.-p.