Abstract
In this paper, an approach to solving direct and inverse scattering problems on the half-line for a one-dimensional Schrödinger equation with a complex-valued potential that is exponentially decreasing at infinity is developed. It is based on a power series representation of the Jost solution in a unit disk of a complex variable related to the spectral parameter by a Möbius transformation. This representation leads to an efficient method of solving the corresponding direct scattering problem for a given potential, while the solution to the inverse problem is reduced to the computation of the first coefficient of the power series from a system of linear algebraic equations. The approach to solving these direct and inverse scattering problems is illustrated by several explicit examples and numerical testing.
Keywords:
non-selfadjoint Schrödinger operator; Jost solution; direct scattering problem; inverse scattering problem MSC:
34A55; 34L05; 34L16; 34L25; 34L40; 65L09; 65L15
1. Introduction
Consider the one-dimensional Schrödinger equation
with and a complex-valued potential satisfying the condition
for some . By ρ, we denote the square root of such that . In the present work, an approach to solving direct and inverse scattering problems for (1) under Condition (2) is developed.
Complex-valued potentials arise when studying parity time (PT)-symmetric potentials [1] (Chapter 1), [2], quasi-exactly solvable (QES) potentials [3,4], hydrodynamics, and magnetohydrodynamics [5]; see also [6,7,8].
Studying a Zakharov–Shabat system, even with a real-valued potential, naturally leads to a couple of equations of the form (1) with complex-valued potentials; see [9]. Indeed, consider the Zakharov–Shabat system
where ρ is a complex spectral parameter and is a real-valued potential.
The further transformation of is as follows:
This leads to a pair of Schrödinger equations with complex-valued potentials
Thus, the results of the present work are applicable to direct and inverse scattering problems for a Zakharov–Shabat system.
A direct scattering problem for (1) with a complex-valued potential was studied in a number of publications ([10,11,12,13]). Equation (1) under Condition (2) was considered in [12] (p. 292), [14,15,16,17,18,19,20] (p. 353), and [21,22].
It is well-known (see, e.g., [12] (p. 443), [18]) that (1) admits a unique solution, which we denote by , satisfying the asymptotic equality
This solution is called the Jost solution of (1). It admits the Levin integral representation [12] (see also [18,23,24])
where for every fixed x, the kernel belongs to . In [25] (see also [26]) a Fourier–Laguerre series representation for was proposed in the form
where stands for the Laguerre polynomial of order n. A recurrent integration procedure was developed in [27] to calculate the coefficients . The substitution of (7) into (6) was found to lead to a series representation for the Jost solution [25,26]
where
In the present work, we consider the direct and inverse scattering problems for (1) subject to the homogeneous Dirichlet condition
however, the approach developed here is also applicable in the case of other boundary conditions, such as
with .
The problem (1) and (10) under Condition (2) possesses a continuous spectrum coinciding with the positive semi-axis , and may have a point spectrum that coincides with the squares of the non-real roots of the Jost function
if such roots exist. Let us denote them as Their multiplicity may be greater than one. In this case, instead of norming constants associated to the eigenvalues, the corresponding normalization polynomials naturally arise (see Section 3.3 below).
As a component of the scattering data for (1), the scattering function
is considered in the strip where is sufficiently small (see Section 3.2 below).
The overall approach developed in the present work to solve this problem is based on the representation (8). Indeed, the calculation of is easily realizable with the aid of the argument principle theorem applied to find zeros of (8) in the unit disc. To the best of our knowledge, there has been no practical way of calculating the normalization polynomials. We propose a simple procedure for computing their coefficients by solving a finite system of linear algebraic equations. For this, an auxiliary result for the derivatives is obtained.
The calculation of the scattering function requires an analytic extension of the Jost function obtained from (8), onto the strip . We explore different possibilities for such an extension, including the Padé approximants (see [28,29]) and the power series analytic continuation [30] (p. 150), [31]. This results in an efficient numerical method for solving the direct scattering problem.
The inverse scattering problem consists of recovering the potential from the set of the scattering data. A general theory of this inverse problem can be found in [12,13,20] (p. 353), [24,32,33,34,35]. Here, we use the representation (7) for the numerical solution of the problem, thus extending the approach developed in [25,26,36,37,38] to the non-selfadjoint situation. The inverse Sturm–Liouville problem is reduced to an infinite system of linear algebraic equations. The potential is recovered from the first component of the solution vector, which coincides with in (7).
The reduction to the infinite system of linear algebraic equations is based on the substitution of the series representation (7) for the kernel into the Gelfand–Levitan equation (see [39]),
where the function f can be computed from the set of scattering data (11):
To approximate the complex-valued function , we consider the truncated system of linear algebraic equations, for which the existence, uniqueness and stability of the solution is proved.
Finally, we illustrate the proposed approach by numerical calculations performed in Matlab2021a.
We discuss the details of the numerical implementation of the method: its convergence, stability and accuracy. In a couple of examples, we show the “in-out” performance of the approach, i.e., we solve the direct problem numerically and use the results of our computation as the input data to solve the inverse problem.
The approach based on the representations (7) and (8) leads to efficient numerical methods for solving both direct and inverse scattering problems.
In Section 2, we recall the series representations for the kernel and for the Jost solution, then prove additional results related to these representations. In Section 3, we recall the set of scattering data and put forward an algorithm for solving the direct scattering problem. Additionally, we present analytical examples. In Section 4, the approach for solving the inverse scattering problem is developed. Analytical examples from Section 2 are considered in order to illustrate the approach. In Section 5, we discuss the numerical implementation of the algorithms proposed for solving the direct and inverse scattering problems. Section 6 contains some concluding remarks.
2. Series Representations for the Transmutation Operator Kernel and Jost Solution
Consider the one-dimensional Schrödinger equation on the half-line (1) where is the spectral parameter. The potential is a complex-valued function satisfying Condition (2) for some .
Equation (1) is considered on the class of functions .
Series Representation for Solutions of the One-Dimensional Schrödinger Equation
Equation (1) possesses the unique so-called Jost solution (see, e.g., [12] (p. 443), [18]), which for all is a holomorphic function of in the half-plane and satisfies the asymptotic relation
The function is called the Jost function.
Remark 1.
Under the assumption instead of (2), for every the solution is continuous with respect to for and holomorphic with respect to for . If in addition , the functions , are continuous for (see [24] (p. 105)).
Remark 2.
Under Condition (2), the Jost solution satisfies the asymptotic relations
provided the existence of these derivatives; see [21].
The solution admits the Levin integral representation [12]
where is a complex-valued continuous function for . Denote . The kernel admits the bound [24] (p. 108)
Under Condition (2), the Jost solution is extensible onto the half-plane through the Levin representation (14). The extension satisfies (13) for .
Proposition 1.
Proof.
Under Condition (2), the potential satisfies the inequality
Moreover, for any fixed we have [12] (p. 317)
Additionally, the kernel has first continuous derivatives that satisfy the inequalities [12] (p. 305)
and the equality [12] (p. 328)
As was pointed out in [25], since , the function
belongs to and hence admits the series representation
where stands for the Laguerre polynomial of order n and are complex-valued functions such that for any . For all , the series (22) converges in the norm of . Thus,
and
This series representation was obtained in [25] for real-valued . However, (23) remains true in the non-selfadjoint case as well.
Proposition 2.
For any fixed , the series
converges pointwise.
Proof.
We use [40] (Theorem 6.5), and thus need to verify that the following assertions are true.
1. is of class .
2. is -Hölder continuous, i.e., there exists , such that
for some constant and arbitrary t, .
3. The integrals
exist.
To prove the first assertion, it is enough to consider estimate (15). Indeed,
Note that and therefore
Thus,
The second assertion follows from the inclusion .
The existence of the first integral in (26) follows from the continuity of . Finally, for the second integral we have
and thus, from the proof of the first assertion, we obtain
Now, the application of Theorem 6.5 from [40] completes the proof. □
Following [25] (see also [26] (p. 63)), the substitution of (23) into (14) and termwise integration lead to the series representation (8) for the Jost solution.
The series (8) is convergent in the open unit disk of the complex z-plane, , and for every x, the function belongs to the Hardy space as a function of z [26].
Proposition 3.
Let . Then, the kernel admits the representation (23), where for any x fixed the series converges in the norm of , and the complex-valued coefficients satisfy the system of equations
as well as the inequality
Proof.
The proof of (28) and (29) from [26] (Theorem 10.1, p. 66) given for the case of a real-valued q remains valid in this more general situation as well.
Note that
Corollary 1.
Under Condition (2), the coefficients satisfy the inequality
Remark 3.
Under the assumption that functions are absolutely continuous with respect to t in for , the convergence of the power series in (8) for can be proved with the aid of a result from [42], which states that
provided that
and
Moreover,
Remark 4.
Denote
In [27], the following statements were proved in the case of a real-valued potential.
1. If , then
where
2. If , then
These results remain valid in the case of a complex-valued potential. Moreover, under the assumptions of Remark 3, we obtain the inequality
Remark 5.
The substitution of into (8) leads to the equality
Moreover, note that we have
By , we denote the solution of (1), satisfying the initial conditions
We also need the solution
3. Direct Problem
3.1. Spectrum of (1) and (10)
Consider the problem (1) and (10) under Condition (2). Let us recall some definitions and facts from [12] (p. 452) (see also [18]). The continuous spectrum fills the entire semi-axis .
Definition 1.
If they exist, their number is finite. Let us denote the non-real singular numbers by . The numbers constitute the point spectrum of the problem, and the multiplicities of the zeros are called the multiplicities of the singular numbers and denoted by , respectively.
Thus, we are interested in the zeros of the Jost function
to obtain the eigenvalues from
For an estimate of the number of the eigenvalues, we refer to [43].
3.2. Scattering Function
Let us introduce as the distance from the real axis to the non-real roots of the function . Let when ( means that there are no non-real roots), or otherwise.
The scattering function is defined by
Let us recall some properties of the Jost function and scattering function (see, e.g., [39]).
- is holomorphic for and for every it satisfies the asymptotic relationuniformly in the strip .
- is meromorphic in the strip and for everyuniformly in the strip
- has no non-real poles in the strip
A function satisfying properties 2–5 is said to be of S-type in the strip The following examples illustrate some of the above definitions.
Example 1
([44,45]). Consider the potential
with in (2). With the aid of Wolfram Mathematica v.12 the Jost solution can be obtained in a closed form,
where stands for the Bessel function of the first kind of order ν.
Hence,
and the eigenvalues are the squares of the values such that
From here, we obtain the only singular number
The scattering function has the form
It is well-defined in the domain
and is an S-type function in the strip .
Example 2.
Consider the potential
which satisfies Condition (2) for . The Schödinger equation with this potential comes from a Zakharov–Shabat system (3) with the potential and its reduction to Equation (5).
The corresponding Jost solution is obtained from the Jost solution of a Zakharov–Shabat system (see [46]) with the potential ,
Thus, the Jost function is
It has one root, , which corresponds to the spectral singularity .
The scattering function is given by
which is an S-type function in the strip .
Example 3
([21]). Consider the potentials of the form
satisfying Condition (2) for The Jost solution has the form
from which the Jost function is obtained
with the single root
The square of this represents the discrete spectrum of the problem. The potential (49) is complex-valued when b is not purely imaginary. The scattering function has the form
which is an S-type function in in the case of a complex-valued potential. In the case of a real-valued potential, is an S-type function in .
To present an explicit example, we fix and in (49). Then,
with in Condition (2) and the Jost solution is
Thus, the Jost function has the form
and one eigenvalue exists:
The scattering function
is an S-type function in the strip .
3.3. Normalization Polynomials
The normalization polynomial of degree , associated with the eigenvalue ( is the algebraic multiplicity of as zero of ), defined by the equation [18]
where is defined by (40). Using the series representation (23) of the kernel , we can obtain a method to compute the coefficients of .
Remark 6.
Let us write Equation (51) in terms of the Jost solution and Jacobi polynomials, as follows.
Proposition 4.
Proof.
Here, we change the order of summation and integration due to Parseval’s identity [47] (p. 16) and additionally use the equality
Thus,
The last integral can be explicitly evaluated [48] (Formula 7.414 (7))
where stands for the hypergeometric function [49] (p. 56). Thus, we have the equation
and due to Remark 6, we obtain (53). □
Hereinafter denotes the binomial coefficient.
Lemma 1.
The m-th derivative of the Jost solution with respect to the variable z admits the representation
where
Proof.
We use the identity [50] (p. 3)
where means the derivative with respect to z, and j, n are integers.
Let us prove the lemma by induction. For , from (52), we have
The application of (55) gives
Consider Formula (54) as the induction hypothesis for . The idea is to prove the equation
and the equality
Then, noting that the second terms on the left-hand side of (57) and (58) coincide up to the sign, the desired result is obtained by summing up both equations.
The proof of Equations (57) and (58) is presented in Appendix A, which completes the proof of the Lemma. □
As long as there is no possible misunderstanding, we consider a fixed with a multiplicity and the corresponding normalization polynomial . Thus, the index k is omitted along the following two statements.
Lemma 2.
The coefficients of a normalization polynomial of degree
satisfy the equation
Proof.
Note that
Then, upon comparison of (61) with (62), it can be observed that proving (61) is equivalent to proving the equality
for some natural number . Thus, we are going to prove (64). The substitution of the term with the derivative in (63) by Formula (54) for is enough to obtain (64) as follows
This completes the proof of the Lemma. □
Equation (60) provides us with a simple method for computing the coefficients in (59), and consequently for calculating the normalization polynomials.
Theorem 1.
The coefficients of a normalization polynomial corresponding to a complex singular number satisfy the system of linear algebraic equations
where A is an matrix with entries defined by
Here, are distinct points, (). B is an vector with its entries being the normalization polynomial coefficients and D is an m vector defined by
Proof.
Thus, the coefficients of the normalization polynomial are obtained from the system (65).
Definition 2.
Here, are the non-real singular numbers, their multiplicities, the corresponding normalization polynomials, and is the scattering function (S-type function in the strip ).
In order to recall a result on the characterization of the scattering data, we need the following definition [39].
Definition 3.
Let be an S-type function in the strip and let be a curve lying in the strip and running from to , such that all roots (poles) of are situated above (below) . The increment divided by of a continuous branch of , when runs along from to , is called the index of and denoted by .
Let us assume that a set J as in Definition 2 is given. A necessary and sufficient condition (obtained in [18]) to ensure that this set represents the scattering data for a problem (1) and (10) with Condition (2) is the following relation
where
In the case when , the notion of the Birkhoff solution is useful for computing the corresponding norming constants.
Remark 7.
Let denote the Birkhoff solution of Equation (1) (see [24] (p. 113)), i.e., a solution satisfying the asymptotic relation
uniformly for for each . For , this solution is not unique. Indeed, if is a Birkhoff solution, then is also a Birkhoff solution of (1) for any constant . Note that for (a singular number of the problem), the values of all Birkhoff solutions at the origin coincide. We have , because . Moreover,
which can be observed by considering the Wronskian .
Remark 8.
The solution satisfying Conditions (39) has the form
Note that is a pole of in the upper half-plane of the complex variable if and only if it is a root of the Jost function (see (40)). Thus, in case of a simple pole in Equation (67), the residue can be computed as follows
where , and the corresponding normalization polynomial (in fact normalization constant) is given by
Moreover, due to (70), we have
Similarly to the case of a real-valued potential [51] (p. 95), one can see that
If (for some constants , ), then is an entire function of (see [51] (p. 95)). In this case, as a Birkhoff solution , one can consider the Jost solution , and hence from (72) we obtain
Example 4.
According to Remark 8, the normalization constant associated with the unique eigenvalue of the operator from Example 3 is
and, in particular, for , we have
Example 5.
With the aid of Remark 8, an approximate value of the normalization constant for the eigenvalue from Example 1 is obtained
3.4. Numerical Algorithm
The approximate solution of the direct problem can be performed with the following steps.
- Compute the Jost function using (41) and the recurrent integration procedure from [27], for .
- Extend the Jost function to using any convenient technique, such as the classic analytic continuation, Padé approximants [28] or some other approach [52,53].
- Obtain the scattering function for by Formula (42).
- To locate the eigenvalues, find the non-real poles of the function , which is equivalent to finding zeroes of the function in the unit disk in terms of z. This can be achieved with the aid of the argument principle theorem. In particular, in the present work, we compute the change in the argument along rectangular contours . If the change in the argument along is zero, consider another contour. Otherwise, subdivide the region within the contour until the desired accuracy is attained. Note that for a sufficiently large N, zeros of , approximate the square roots of the eigenvalues of the problem arbitrarily closely. The proof is analogous to that in [54] and is based on the Rouché theorem from complex analysis.
- Obtain the normalization polynomials.
- 5.1
- For simple poles, use Remark 8 to obtain the normalization constants.
- 5.2
4. Inverse Problem
In order to reconstruct the potential in (1) from the scattering data, it is convenient to introduce the function [39]
where is a number satisfying the inequalities (s, defined in Section 3.2), and the function
Remark 9.
Hereinafter, we use the notation
for where represents a line parallel to the real axis crossing .
The kernel and the function satisfy the following Gel’fand–Levitan (G-L) equation [39] (Theorem 10.1)
4.1. Infinite Linear Algebraic System for Coefficients
Following [38], from the G-L Equation (78), we deduce the following system of linear algebraic equations for the coefficients from the series representation (23).
Theorem 2.
The complex-valued functions satisfy the equations
where
Proof.
Substitution of the series representation (23) into (78) leads to the equalities
where the change in the order of summation and integration is justified by the general Parseval identity [47] (p. 16).
We have
Denote . Equation (81) is equivalent to
Multiplying the last equation by and integrating this, we obtain
Note that
and
4.2. Expressions for and
It is convenient to regard the functions and as a sum of the components corresponding to the continuous and discrete spectra , and simplify these expressions with the aid of the formula ([48], Formula 7.414 (6))
The continuous and discrete components for the function have the form
and
Remark 10.
Example 6.
Consider the scattering function obtained in Example 2:
in the strip , with no discrete spectrum and thus no normalization polynomials. Let us compute the function defined by (75), where the line lies in the strip . Since the function is analytic in the strip the value of the integral is independent of the choice of . Using Jordan’s lemma to calculate the integral in (75), we obtain
Now, computing the functions and from Formula (85) and (87) and using the residue theorem, we obtain
Thus, in the case of the potential , the system of Equation (79) can be written explicitly.
Example 7.
Consider the scattering function from Example 3. It has two poles in the upper half-plane: at i and . Hence, using the residue theorem, we find that
Again, the corresponding system of Equation (79) can be written explicitly.
Example 8.
Consider from Example 1. To compute , we consider the singularities of in the upper half-plane. From the set (see Example 1), we have that has an infinite number of isolated singularities at the points with and a singular number ; see (46). Using properties of the gamma function, we obtain
and
where is the normalization constant obtained in Example 5. Therefore, for , we have
Hence, the function has the form
and we obtain the functions and in terms of (see (9)) as follows
and
Likewise, applying the residue theorem, we have
Thus, as in the previous two examples, the system of Equation (79) can be written explicitly.
The cancellation of terms when summing up (92) with (93) is not incidental and is generalized below in Remark 12.
To calculate the integrals in functions and in the case when the scattering function is given explicitly, we implement Jordan’s lemma and the residue theorem considering the asymptotics (44). However, often the function is not given in a closed form but as a table of data—then, the following techniques can be useful to compute the integrals. First, we recall a widely used technique for the quadrature of highly oscillatory integrals through approximations of the Fourier sine and cosine transform. This is illustrated below in Example 16. A second option is a transformation of integrals in and into integrals over a finite interval providing a certain advantage for its numerical implementation. This is illustrated below in Example 21.
Remark 11.
We mainly discuss the calculation of the functions . The calculation of is analogous.
- 1.
- Suppose is given in a closed form. By Pol we denote the set of its poles in the open upper half-plane. Since satisfies the asymptotics (44), the integral in (85) can be computed with the aid of Jordan’s lemma and the residue theorem as followsprovided the series on the right-hand side is convergent; see [55] (p. 459).If Pol contains only simple poles, we obtain
- 2.
- Consider the integral in (85)for some Following the approach from [56] (p. 236), denoteand set , . ThenThe integrals on the right hand side (the Fourier cosine and sine transforms) are approximated by the corresponding sumswhere h and N are chosen to be sufficiently small and large, respectively.
- 3.
- Transform the line into a circle centered at of radius with the aid of the formulasThis enables us to consider the integral in (85) in the formreducing the integration to a finite interval.
4.3. Stability of the System and Its Solution
Consider the truncated system (79):
Denote its solution as . In the following two theorems, we prove the unique solvability of (100), the convergence of its solution to the exact one as well as its stability.
Theorem 3.
Let be fixed. Consider the system (100) truncated to equations. Then, for a sufficiently large M, the truncated system is uniquely solvable, and
Proof.
Since and and we look for , the assertion of the theorem for the truncated system follows directly from the general theory presented in [57] (Chapter 14, §3). □
Theorem 4.
The approximate solution of the system is stable.
Proof.
Note that the truncated system (100) coincides with that obtained by applying the Bubnov–Galerkin procedure to the G-L Equation (78) with the orthonormal system of Laguerre polynomials in ; see [58] (§14). Let denote the identity matrix, be the coefficient matrix of the truncated system and the right hand side of (100). Following [58] (§9), consider a system called inexact
where is an matrix representing errors in the coefficients , and is the column vector representing errors in the coefficients . Let be a solution of the non-exact system. The solution of the Bubnov–Galerkin procedure is said to be stable if there exist constants , such that for and arbitrary the non-exact system is solvable, and the following inequality holds
Now, since in the case under consideration, the inequality (102) is true (see [58] (Theorems 14.1 and 14.2)), the approximate solution is stable. □
4.4. Algorithm to Recover the Potential
Given a scattering data set J as in Definition 2, the algorithm to recover consists of the following steps.
5. Numerical Examples
We implemented the algorithms proposed in Section 3.4 and Section 4.4 to solve the direct and inverse problems, respectively, with machine precision and with the aid of Matlab2021. Several examples are discussed, some of which have been introduced in previous sections.
5.1. Direct Problem
In this subsection, we discuss the computation of the scattering data, based on the series representation of the Jost solution (8). We deal with the approximate solution obtained by truncating the series (36).
The computation of the coefficients is performed with the aid of the recurrent integration procedure from [27].
First of all, we discuss the choice of the number N in (36). Below, we show that a satisfactory accuracy is attained for a relatively small N (from several units to several dozens), and a reliable indicator
can be used to choose an appropriate N.
In the case of simple singular numbers , the norming constants can be computed with the aid of (73):
Another possibility consists of using (74) in the form
where stands for the Padé approximant of at . This can be achieved when the accuracy of this rational approximation in the upper half-plane is satisfactory, i.e., when one has a suitable small value of in a sufficiently large region in the upper half-plane of the complex variable .
To obtain the scattering function (42) in the strip we consider two options depending on how the computation of the Jost function is performed for in the lower half-plane. The first one uses
provided extends analytically onto a certain strip in the lower half -plane. A second option for the computation of is
where the expression (36) is calculated at points of a parallel line sufficiently close to the real axis and contained in the lower half -plane.
Remark 13.
The notation for the approximate Jost solution (Jost function) may contain two indices, k and N: (), where k denotes the solution associated with the Schrödinger equation with the potential and N is the parameter from (36).
Example 9.
Consider the potential from Example 2. We present the indicator in Table 1 for different values of N in (103).
Table 1.
Example 9: indicator for different values of N.
Figure 1 shows the real and imaginary parts of the approximate and exact Jost solution computed from (36) at a sample point with , i.e., . The maximum absolute error of the computed Jost solution for x in the interval is
Figure 1.
Real (left) and imaginary (right) parts of and approximate Jost solution .
Table 2 presents the maximum absolute and relative errors of the approximate Jost function for for different values of N.
Table 2.
Maximum absolute and relative errors of the approximate Jost function in .
Figure 2 shows the function for . Here, we illustrate the existence of a unique singular number. Indeed, this singular number corresponds to and the value is .
Figure 2.
Function for .
The distribution of the absolute and relative errors of the approximate Jost function is presented in Figure 3 and Figure 4 (respectively), where the maximum absolute error is and the maximum relative error is .
Figure 3.
Absolute error of approximate Jost function for .
Figure 4.
Relative error of approximate Jost function for .
Furthermore, a good approximation of the derivative of the Jost function becomes essential for the argument principle algorithm performance. This is necessary to obtain the eigenvalues as the squares of non-real zeros of the approximate Jost function. In Figure 5, we illustrate , and Figure 6 and Figure 7 depict the distribution of the absolute and relative errors, respectively. The maximum absolute error is and the maximum relative error is .
Figure 5.
Function for .
Figure 6.
Absolute error of , .
Figure 7.
Relative error of , .
To find the singular numbers, we consider the circle (real axis in ρ) and a cubic spline interpolation of the approximate Jost function (). For the spline interpolation, we use the Matlab routine csapi. To locate the zeros of the spline, we use slmsolve from the Shape Language Modeling (SLM) toolbox, version 1.14 by John D’Errico [59], available for Matlab2021a. The value was obtained with an absolute error of Additionally, the argument principle algorithm applied to in discarded any eigenvalue of the problem (non-real zero ρ).
The second step of the algorithm from Section 3.4 requires computing the Jost function in the strip (). In this example, we extend analytically via Padé’s approximation. The Padé approximant was computed in Matlab2021a using the routine pade.
In Table 3, we computed the maximum absolute and relative errors of the Padé approximant of with for . These values indicate the possibility of dealing with this Padé approximant when computing the set of scattering data. Additionally, from Table 4, we confirm that this approximant satisfactorily extends the Jost function to a desirable strip in the lower half-plane (the strip is related to the one needed for the calculation of the scattering function ).
Table 3.
Maximum absolute and relative errors of the Padé approximant with respect to in a strip in the upper half -plane.
Table 4.
Maximum absolute and relative errors of the Padé approximant with respect to the exact Jost function in a strip in the lower half -plane.
To obtain numerically on the strip , we use the truncated series and the Padé approximant :
The maximum absolute error inside the region is .
Remark 14.
The order of the Padé approximant used for the Jost function is not arbitrary. Although the maximum absolute errors inside the region of other approximations of using , , and are better in comparison with , we choose as the most suitable option to avoid the appearance of Froissart doublets. Indeed, the use of the Padé approximants when there is no available information about the smoothness of the function to be approximated is challenging. Some publications propose modified algorithms [60], even using the Toeplitz matrix theory with many numerical implementations in Maple, Wolfram Mathematica (see [61]) or Matlab (see [62]). For the purposes of this paper, it is sufficient to use only the information obtained from the truncated series and the argument principle algorithm to construct the approximant. Consider the number K of zeros counting multiplicities of the approximate Jost function (singular numbers being calculated using the argument principle algorithm) located inside as the degree of the polynomial in the numerator in the Padé approximant. Recalling that, in most cases, an accurate Padé’s approximation is obtained on the diagonal approximant types for analytical functions, it is reasonable to choose the Padé approximant as .
Example 10.
Consider the potential from Example 3. The approximate Jost function is computed in the strip for several values of N. In Table 5, the maximum absolute error of the approximate Jost function is presented.
Table 5.
Maximum absolute error of the Jost function for and 180.
Similarly to the previous example, a search for real singular numbers was performed; however, none were detected. Subsequently, the argument principle algorithm located a non-real singular number in , with the value (). Its absolute error is . The contour refinement is not a concern, since the performed algorithm from [54] is based on the argument principle algorithm followed by several Newton iterations.
Additionally, the Jost function was extended to the strip through the Padé approximant
The corresponding maximum absolute error of inside the rectangle in the complex ρ-plane is . Inside , the maximum absolute error is .
Next, an approximate value of the normalization constant corresponding to was computed
with an absolute error of
Finally, we calculate the scattering function by
The maximum absolute error of the approximation of in is (see Figure 8).
Figure 8.
Absolute error of the approximate scattering function .
Example 11.
Consider the potential from Example 1. Table 6 shows the parameter for some values of
Table 6.
Example 11: parameter for different values of N.
Note that the approximation of the Jost function in this example requires more terms in the series representation than in previous examples. To control the accuracy of the approximation, in addition to the parameter , one can use the asymptotic relation for the Jost function from [24] (p. 105),
where . This relation is valid for with first and second summable derivatives.
Figure 9 depicts the Jost function computed with and the singular number . Figure 10 shows the fulfillment of the asymptotic relation (108), namely the graph of , which tends to 1 when .
Figure 9.
Absolute value of in the upper half -plane. The marked point is the singular number .
Figure 10.
Graph of tending to 1 when .
The eigenvalue is computed numerically as a zero of the exact Jost function with the aid of Wolfram Mathematica v.12 (Wolfram Research, Inc., Champaign, IL, USA) . This “exact” eigenvalue is compared with the approximation obtained as the square of the approximate . The absolute error is .
For the numerical calculation of the analytic extension of onto the strip , it is not possible to consider the Padé approximant . This does not approximate accurately even in the upper half-plane of the complex variable ρ. Using the Padé approximant the absolute error was .
Instead of using Formula (105) to compute the normalization constant , Formula (104) is applied to obtain the approximation with absolute error
To compute the scattering function on a line parallel to the real axis contained in the strip , Formula (106) was used. The function is represented by (36) for ρ on a line in the lower half ρ-plane parallel and sufficiently close to the real axis. Having calculated these series representations for the functions involved in we compute
with a maximum absolute error along the line (see (77)).
Example 12
([44]). Consider the potential
with R being a constant (Reynolds number). When is sufficiently large, the eigenvalues may exist. For example, for , there is one eigenvalue in the box [44] (see also [45]).
The Jost solution is not available in a closed form. In order to check the validity of the numerical calculation of the coefficients for , we consider the indicator (Table 7).
Table 7.
Example 12: indicator for different values of N (potential with ).
Figure 11 depicts the Jost function computed with and the approximation of the singular number , with its square belonging to the box . Additionally, Figure 12 shows the fulfillment of the asymptotic relation (108).
Figure 11.
Absolute value of () in the upper half -plane and the marked point is the approximate singular number .
Figure 12.
Graph of tending to 1 when ().
The normalization constant is calculated using (104),
Finally, the scattering function is approximated by .
Now, take in the potential . In this case, two boxes localizing the only two eigenvalues and were obtained in [44],
Table 8 provides the values of the indicator for several values of N.
Table 8.
Example 12: indicator for different values of N ().
Approximate eigenvalues computed from for different values of N, are presented in Table 9 and Table 10.
Table 9.
Approximate eigenvalue computed using different values of N in ().
Table 10.
Approximate eigenvalue computed using different values of N in ().
Note that and for . Finally, the normalization constants are calculated using in (104),
Although, in this example, more powers for the series representation of the Jost function were used, the method proved to be applicable to obtaining the scattering data set without any additional informatio. The good accuracy achieved is confirmed by the ability t use the scattering data obtained as input data to solve the inverse scattering problem to recover the potential with below in Example 22.
5.2. Inverse Problem
In the present section, we discuss the accuracy, convergence and stability of the proposed method for solving the inverse scattering problem.
Remark 15.
By , we denote the approximation of the potential () obtained by solving the truncated system (100) with the sum up to M, i.e., with equations.
5.2.1. Convergence and Accuracy
Example 13.
Consider the scattering data calculated in Example 3:
where is an S-type function in the strip .
We shall recover the potential The system (100) of linear algebraic equations for this example is obtained in a closed form (see Example 7). For a different number of equations in the truncated system, we obtain a solution symbolically by using the Matlab routine solve. The potential is recovered from (38). Figure 13 presents the recovered potential in each case.
Figure 13.
Real (left) and imaginary (right) part of the recovered potential for and 11.
The corresponding absolute and relative errors are presented in Figure 14 and Figure 15, respectively. Note that a high accuracy is attained even in the case of a very reduced number of equations in the truncated system. Moreover, a very fast convergence of the method can be appreciated.
Figure 14.
Absolute error of the recovered potential with and 11.
Figure 15.
Relative error of the recovered potential with and 11.
Example 14.
Consider the scattering data from Example 2. As was shown above (Example 6), the system (100) for this example can be written explicitly. Again, when solving the corresponding truncated system for different values of M we observe a fast convergence and remarkable accuracy even for small values of M (see Table 11 and Figure 16).
Table 11.
Maximum absolute error of the approximate potential for some values of M.
Figure 16.
Exact and computed potential .
Example 15.
Consider the closed form of the scattering function from Example 1. We compute functions and using the first option from Remark 11. Some poles and residues are given in Table 12 (computed with the aid of the package Numerical Calculus of Mathematica v.12).
Table 12.
Poles and residues in the upper half-plane of the function .
Note that the absolute value of the residues decreases considerably as the poles move away from the origin on the imaginary axis. This allows us to use a small number of poles for the calculation of the functions and .
The convergence of the method in this case results to be slower; see Figure 17, although a satisfactory accuracy is attained for .
Figure 17.
Absolute error for different values of M in the truncated system (100) (left) and the absolute value of the recovered potential computed with 20 equations (right) for .
5.2.2. Stability of the System
Since the stability of the method was proved in Theorem 4, we are able to work efficiently with noisy scattering data. First, we consider the natural noise arising from the numerical implementations of the last two procedures in Remark 11, i.e., calculation of the approximate matrix in (100) from the scattering function given in a closed form. Another situation considered in this subsection is the recovery of the potential from a uniformly noisy scattering function.
Remark 16.
Henceforth, denote by , , and the numerical approximation of , , and .
Remark 17.
In the last step of the algorithm from Section 4.4, for recovering q with the aid of (38), the coefficient needs to be differentiated twice. This was performed by interpolating with a quintic spline through the Matlab routine spapi and a posterior differentiation with the Matlab command fnder.
Example 16.
Let us consider the scattering data from Example 2. The recovery of the potential from the exact scattering function , obtained by using approximate functions and in the truncated system (100), is presented. The computation of functions and requires numerical integration along the line (see (77)). For this purpose, the last two procedures in Remark 11 were applied.
Method 1. The second option in Remark 11 is implemented. With the scattering function (91) at points and for , where and , the calculation of the Fourier transforms in (98) is carried out. In Table 13, the maximum absolute error of is presented for 4 values of the parameter m.
Table 13.
Example 16: maximum absolute error of calculated with the second procedure in Remark 11.
Now, we compute using the same numerical integration method with parameters and .
Table 14 shows the maximum absolute error of for parameters .
Table 14.
Example 16: maximum absolute error of calculated with the second procedure in Remark 11.
The system (100) constructed with and is solved numerically in Matlab for several values of M. Maximum absolute and relative errors of the approximation of the potential are shown in Table 15.
Table 15.
Example 16: maximum absolute and relative errors of the approximation of the potential by the recovered potential for some values of M in (100).
Figure 18.
Recovered potential by Method 1 in Example 16.
Method 2. Now, we compute the approximate functions (see Table 16) and (see Table 17) following the third procedure in Remark 11.
Table 16.
Example 16: maximum absolute error of after applying the third procedure in Remark 11.
Table 17.
Example 16: maximum absolute error of after applying the third procedure in Remark 11.
In Table 18, the absolute error of the recovered potential for some values of M in (100) is presented.
Table 18.
Example 16: maximum absolute error of recovered potential using the third option in Remark 11.
Both methods (procedures 2 and 3 from Remark 11) illustrated in the above example have proven to be suitable for calculating the functions and from a table of values for the . Nevertheless, it is worth mentioning that although the first method (procedure 2) produced slightly more accurate results, this approach might be sensitive to the choice of the and h parameters, whereas the second method (procedure 3) only requires the implementation of trapz, the Matlab integration routine on a dense set of points defined in the interval . Hence, for the purposes of this paper, it is sufficient to consider procedure 3 from Remark 11 in the following examples, so as to obtain satisfactory approximations of and .
As expected from the results of Example 14 for this potential, the numerical method for recovering the potential converges very fast. Indeed, an acceptable approximation of is achieved with only four equations in this case, where an inexact matrix in the linear system (100) is considered. In fact, the difference between the approximate and the exact potential presented in Figure 18 is indistinguishable.
In the following examples, a noisy scattering function with a uniformly distributed noise added to the rand routine of Matlab is considered.
Example 17.
Consider the scattering function and denote the noisy scattering function by . Here, is uniformly distributed complex-valued noise (the percentage of the noise is applied pointwise to the modulus and argument of the value of ). The maximum absolute error of on the line is . The potential was recovered using five equations with a maximum absolute error of . The real and imaginary parts of the potential and the absolute error of its recovery are shown in Figure 19.
Figure 19.
Example 17: figures on the top part show the recovered potential , and the bottom figure shows the absolute error of the recovered potential.
Despite the noise that produces in the matrix of the system (100), the method recovers the shape of the potential with reasonable accuracy.
Example 18.
Consider the scattering function and define where is a uniformly distributed complex-valued noise (considered as in the previous example). The maximum absolute error of on the line is . The potential was recovered using eight equations with a maximum absolute error of . The real and imaginary parts of the potential as well as the absolute error of its recovery are shown in Figure 20.
Figure 20.
Example 18: figures on the top part show the potential recovered with eight equations, and the bottom figure presents the absolute error of the recovered potential.
Although, in this case, the absolute error of is larger, the shape of the recovered potential is still quite close to that of the exact one.
5.2.3. In-Out
In this subsection, we consider the results obtained in Section 5.1 as input data for the inverse problem.
Example 19.
We use the approximate scattering function from Example 10 calculated by (107). Particularly, the form in which it is given allows for us to approximate functions and with the aid of the numerical calculus of residues, i.e., the first procedure in Remark 11 (see Table 19 and Table 20).
Table 19.
Example 19: maximum absolute error of the approximation of the function using calculus of residues.
Table 20.
Example 19: maximum absolute error of the approximation of the function using calculus of residues.
The potential was recovered with an absolute error of in the interval using 8 equations.
Example 20.
Consider the approximate scattering function from Example 11. The coefficient was recovered using 14 equations with a maximum absolute error of , from which the potential was recovered with a maximum absolute error of , Figure 21.
Figure 21.
The (left) figure shows the recovered potential , and the (right) figure presents the absolute error of the recovered potential.
Example 21.
Consider the approximate scattering data obtained in Example 9. The approximate functions (see Table 21) and (see Table 22) were obtained accurately enough to recover the potential (see Table 23).
Table 21.
Example 21: maximum absolute error of the approximation of the function .
Table 22.
Example 21: maximum absolute error of the approximation of the function .
Table 23.
Maximum absolute error of the approximation of the potential by the recovered potential .
Figure 22 illustrates the stability and convergence of the method with the absolute error stabilized at .
Figure 22.
Absolute error of the approximation of the potential by the recovered potential using and 8 equations.
Example 22.
Consider the potential introduced in Example 12. Using the results of the solution of the direct scattering problem from Example 12, we recover using 20 equations with a maximum absolute error of (Figure 23).
Figure 23.
Real (left) and imaginary (right) parts of the exact potential and the recovered ().
It is worth mentioning that the coefficient is recovered with an absolute error of (Figure 24). The error is calculated and compared with the solution of the Cauchy problem
for a sufficiently large value of , obtained using ode45 routine of Matlab2021a.
Figure 24.
Example 22: absolute error of the recovered coefficient with 20 equations.
This is a case where closed formulas for the scattering data set are unavailable. Therefore, the In–Out procedure confirms a satisfactory accuracy in the solution of both the direct and inverse scattering problems.
Example 23.
Consider the singular potential
Table 24.
Example 23: indicator for different values of N.
Using data from Table 24, we computed the scattering data with . No eigenvalue was detected, so the scattering data set consists of the scattering function approximated by the expression
Using this scattering data set to solve the inverse problem, we obtained the coefficient as shown in Figure 25. The maximum absolute error resulted in .
Figure 25.
Example 23: coefficient with four equations.
The potential is recovered as shown in Figure 26. The corresponding absolute error is presented in Figure 27. Indeed, the maximum absolute error is .
Figure 26.
Recovered potential .
Figure 27.
Absolute error of .
This example shows the applicability of the proposed algorithms to both the solution of the direct and inverse scattering problems in the case of non-smooth potentials.
6. Conclusions
An approach to solving the direct and inverse scattering problems on the half-line for the one-dimensional Schrödinger equation with an exponentially decreasing complex-valued potential is developed. It is based on a series representation of the Jost solution from [25], which is shown in the present work to remain valid in a non-selfadjoining case.
When solving the direct problem, this representation is used to calculate the scattering data set through a simple and efficient procedure, which includes a proposed algorithm for computing normalization polynomials (which are part of the scattering data set) by solving a finite system of linear algebraic equations for its coefficients.
When solving the inverse problem, the use of the series representation combined with the Gel’fand–Levitan equation reduces the problem to a system of linear algebraic equations for the series coefficients, and the knowledge of the first coefficient is sufficient to recover the potential.
The numerical results illustrate the remarkable accuracy of the proposed algorithms in solving both the direct and inverse scattering problems.
Author Contributions
Conceptualization, formal analysis, methodology, funding acquisition, investigation, project administration, software, supervision, writing—review and editing, V.V.K.; formal analysis, investigation, software, writing—original draft, writing—review and editing, L.E.M.-L. All authors have read and agreed to the published version of the manuscript.
Funding
Research was supported by CONAHCYT, Mexico via the project 284470.
Data Availability Statement
The data that support the findings of this study are available upon reasonable request.
Conflicts of Interest
This work does not have any conflict of interest.
Appendix A. Proofs of Auxiliary Equalities for Lemma 1
Let us prove Equation (57). Consider
Note that the last expression can be written as where
Associating terms in the expression for we obtain
Simplification of the last expression results in
where we applied Formula (55). Thus,
which is the desired result.
References
- Bagarello, F.; Gazeau, J.P.; Szafraniec, F.H.; Znojil, M. Non-Selfadjoint Operators in Quantum Physics; John Wiley & Sons: Hoboken, NJ, USA, 2015. [Google Scholar]
- Bender, C.M.; Boettcher, S. Real spectra in non-Hermitian Hamiltonians having P T symmetry. Phys. Rev. Lett. 1998, 80, 5243. [Google Scholar] [CrossRef]
- Bender, C.M.; Boettcher, S. Quasi-exactly solvable quartic potential. J. Phys. A Math. Gen. 1998, 31, L273. [Google Scholar] [CrossRef]
- Ushveridze, A.G. Quasi-Exactly Solvable Models in Quantum Mechanics; CRC Press: New York, NY, USA, 2017. [Google Scholar]
- Chandrasekhar, S. On characteristic value problems in high order differential equations which arise in studies on hydrodynamic and hydromagnetic stability. Am. Math. 1954, 61, 32–45. [Google Scholar] [CrossRef]
- Dolph, C.L. Recent developments in some non-self-adjoint problems of mathematical physics. Bull. Am. Math. 1961, 67, 1–69. [Google Scholar] [CrossRef]
- Moiseyev, N. Non-Hermitian Quantum Mechanics; Cambridge University Press: Cambridge, UK, 2011. [Google Scholar]
- Lombard, R.J.; Mezhoud, R.; Yekken, R.; Ezzouar, U.B. Complex potentials with real eigenvalues and the inverse problem. Rom. J. Phys. 2018, 63, 101. [Google Scholar]
- Hryniv, O.R.; Manko, S.S. Inverse scattering on the half-line for ZS-AKNS systems with integrable potentials. Integr. Oper. Theory 2016, 84, 323–355. [Google Scholar] [CrossRef]
- Bairamov, E.; Seyyidoglu, M.S. Non-Self-Adjoint singular Sturm-Liouville problems with boundary conditions dependent on the eigenparameter. In Abstract and Applied Analysis; Hindawi: London, UK, 2010; Volume 2010. [Google Scholar]
- Gasymov, M.G. On the decomposition in a series of eigenfunctions for a nonselfconjugate boundary value problem of the solution of a differential equation with a singularity at a zero point. Dokl. Akad. Nauk Russ. Acad. Sci. 1965, 165, 261–264. [Google Scholar]
- Naimark, M.A. Linear Differential Operators. Part II: Linear Differential Operators in Hilbert Space; Dawson, E.R.; Everitt, W.N., Translators; Ungar Publishing: New York, NY, USA, 1968. [Google Scholar]
- Yurko, V.A. Introduction to the Theory of Inverse Spectral Problems; Fizmatlit: Moscow, Russia, 2007. (In Russian) [Google Scholar]
- Barrera-Figueroa, V. Analysis of the spectral singularities of Schrödinger operator with complex potential by means of the SPPS method. J. Phys. Conf. Ser. 2016, 698, 012029. [Google Scholar] [CrossRef]
- Kir, E. Spectrum and principal functions of the non-self-adjoint Sturm–Liouville operators with a singular potential. Appl. Math. 2005, 18, 1247–1255. [Google Scholar] [CrossRef]
- Naimark, M.A. Investigation of the spectrum and the expansion in eigenfunctions of a nonselfadjoint operator of the second order on a semi-axis. Tr. Mosk. Mat. Obs. 1954, 3, 181–270. (In Russian) [Google Scholar]
- Pavlov, B.S. On the non-selfadjoint operator −y″ + q(x)y on a semiaxis. Dokl. Akad. Nauk SSSR 1961, 141, 807–810. (In Russian) [Google Scholar]
- Pavlov, B.S. On a Non-Selfadjoint Schrödinger operator, Probl. Math. Phys., No. I, Spectral Theory and Wave Processes; Izdat. Leningrad. Univ.: Leningrad, Russia, 1966; pp. 102–132. (In Russian) [Google Scholar]
- Pavlov, B.S. On a Non-Selfadjoint Schrödinger Operator II, Problems of Mathematical Physics, No. 2, Spectral Theory, Diffraction Problems; Izdat. Leningrad. Univ: Leningrad, Russia, 1967; pp. 133–157. (In Russian) [Google Scholar]
- Sabatier, P.C. Applied Inverse Problems; Lecture Notes in Physics; Springer: Heidelberg, Germany, 1978; Volume 85. [Google Scholar]
- Samsonov, B.F. Spectral singularities of non-Hermitian Hamiltonians and SUSY transformations. J. Phys. A Math. Gen. 2005, 38, L571. [Google Scholar] [CrossRef]
- Sitenko, A.G. Lectures in Scattering Theory; Pergamon Press: Oxford, UK, 1971. [Google Scholar]
- Agranovich, Z.S.; Marchenko, V.A. The Inverse Problem of Scattering Theory; Courier Dover Publications: New York, NY, USA, 2020. [Google Scholar]
- Freiling, G.; Yurko, V. Inverse Sturm–Liouville Problems and Their Applications; NOVA Science Publishers: New York, NY, USA, 2001. [Google Scholar]
- Kravchenko, V.V. On a method for solving the inverse scattering problem on the line. Math. Methods Appl. Sci. 2019, 42, 1321–1327. [Google Scholar] [CrossRef]
- Kravchenko, V.V. Direct and Inverse Sturm-Liouville Problems: A Method of Solution, Frontiers in Mathematics; Birkhäuser: Cham, Switzerland, 2020. [Google Scholar]
- Delgado, B.B.; Khmelnytskaya, K.V.; Kravchenko, V.V. A representation for Jost solutions and an efficient method for solving the spectral problem on the half line. Math. Methods Appl. Sci. 2020, 43, 9304–9319. [Google Scholar] [CrossRef]
- Baker, G.A., Jr.; Graves-Morris, P.R. Padé Approximants, Part I: Basic Theory; Cambridge University Press: Cambridge, UK, 1981. [Google Scholar]
- Baker, G.A., Jr.; Graves-Morris, P.R. Padé Approximants, Part 2: Extensions and Applications; Cambridge University Press: Cambridge, UK, 1981. [Google Scholar]
- Henrici, P. Applied and Computational Complex Analysis; Power Series, Integration, Conformal Mapping, Location of Zeros; John Wiley & Sons: New York, NY, USA, 1974; Volume 1. [Google Scholar]
- Suetin, S.P. Padé approximants and efficient analytic continuation of a power series. Russ. Math. Surv. 2002, 57, 43. [Google Scholar] [CrossRef]
- Bondarenko, E.I.; Rofe-Beketov, F.S. Inverse scattering problem on the semiaxis for the system with the triangle matrix potential. Zhurnal Mat. Fiz. Anal. Geom. [J. Math. Phys. Anal. Geom.] 2003, 10, 412–424. [Google Scholar]
- Levitan, B.M. Inverse Sturm-Liouville Problems; VSP: Zeist, The Netherlands, 1987. [Google Scholar]
- Lyantse, V.É. The inverse problem for a nonselfadjoint operator. Dokl. Akad. Nauk. Russ. Acad. Sci. 1966, 166, 30–33. [Google Scholar]
- Xu, X.C.; Bondarenko, N.P. Stability of the inverse scattering problem for the self-adjoint matrix Schrödinger operator on the half line. Stud. Appl. Math. 2022, 149, 815–838. [Google Scholar] [CrossRef]
- Delgado, B.B.; Khmelnytskaya, K.V.; Kravchenko, V.V. The transmutation operator method for efficient solution of the inverse Sturm-Liouville problem on a half-line. Math. Methods Appl. Sci. 2019, 42, 7359–7366. [Google Scholar] [CrossRef]
- Grudsky, S.M.; Kravchenko, V.V.; Torba, S.M. Realization of the inverse scattering transform method for the Korteweg-de Vries equation. Math. Methods Appl. Sci. 2023, 46, 9217–9251. [Google Scholar] [CrossRef]
- Kravchenko, V.V.; Shishkina, E.L.; Torba, S.M. A transmutation operator method for solving the inverse quantum scattering problem. Inverse Probl. 2020, 36, 125007. [Google Scholar] [CrossRef]
- Lyantse, V.É. An analog of the inverse problem of scattering theory for a nonselfadjoint operator. Mat. Sb. 1967, 1, 485. (In Russian) [Google Scholar]
- Suetin, P.K. Classical Orthogonal Polynomials, 3rd ed.; Fizmatlit: Moscow, Russia, 2005. (In Russian) [Google Scholar]
- Szego, G. Orthogonal Polynomials, American Mathematical Society Colloquium Publications, 23; American Mathematical Society: New York, NY, USA, 1939. [Google Scholar]
- Xiang, S. Asymptotics on Laguerre or Hermite polynomial expansions and their applications in Gauss quadrature. J. Math. Anal. Appl. 2012, 393, 434–444. [Google Scholar] [CrossRef][Green Version]
- Frank, R.L.; Laptev, A.; Safronov, O. On the number of eigenvalues of Schrödinger operators with complex potentials. J. Lond. Math. Soc. 2016, 94, 377–390. [Google Scholar] [CrossRef][Green Version]
- Brown, B.M.; Langer, M.; Marletta, M.; Tretter, C.; Wagenhofer, M. Eigenvalue bounds for the singular Sturm–Liouville problem with a complex potential. J. Phys. A Math. Gen. 2003, 36, 3773. [Google Scholar] [CrossRef]
- Chanane, B. Computing the spectrum of non-self-adjoint Sturm–Liouville problems with parameter-dependent boundary conditions. J. Comput. Appl. Math. 2007, 206, 229–237. [Google Scholar] [CrossRef]
- Satsuma, J.; Yajima, N.B. Initial value problems of one-dimensional self-modulation of nonlinear waves in dispersive media. Prog. Theor. Phys. Suppl. 1974, 55, 284–306. [Google Scholar] [CrossRef]
- Akhiezer, N.I.; Glazman, I.M. Theory of Linear Operators in Hilbert Space; Dover: New York, NY, USA, 1993. [Google Scholar]
- Gradshteyn, I.S.; Ryzhik, I.M. Table of Integrals, Series, and Products; Academic Press: New York, NY, USA, 2007. [Google Scholar]
- Erdélyi, A.; Magnus, W.; Oberhettinger, F.; Tricomi, F.G. Higher Transcendental Functions; McGraw-Hill Book Co.: New York, NY, USA, 1953; Volume 1. [Google Scholar]
- Ancarani, L.U.; Gasaneo, G. Derivatives of any order of the Gaussian hypergeometric function 2F1(a,b,c;z) with respect to the parameters a, b and c. J. Phys. A Math. Theor. 2009, 42, 395208. [Google Scholar] [CrossRef]
- Ramm, A.G. Inverse Problems: Mathematical and Analytical Techniques with Applications to Engineering; Springer: New York, NY, USA, 2005. [Google Scholar]
- Trefethen, L.N. Approximation Theory and Approximation Practice; SIAM: Philadelphia, PA, USA, 2013. [Google Scholar]
- Trefethen, L.N. Quantifying the ill-conditioning of analytic continuation. BIT Numer. Math. 2020, 60, 901–915. [Google Scholar] [CrossRef]
- Kravchenko, V.V.; Torba, S.M.; Velasco-García, U. Spectral parameter power series for polynomial pencils of Sturm-Liouville operators and Zakharov-Shabat systems. J. Math. Phys. 2015, 56, 073508. [Google Scholar] [CrossRef]
- Roussos, I.M. Improper Riemann Integrals; Taylor & Francis Group: Boca Raton, FL, USA, 2013. [Google Scholar]
- Davis, P.J.; Rabinowitz, P. Methods of Numerical Integration, 2nd ed.; Dover Publishers: New York, NY, USA, 2007. [Google Scholar]
- Kantorovich, L.V.; Akilov, G.P. Functional Analysis, 2nd ed.; Silcock, H.L., Translator; Pergamon Press: Oxford-Elmsford, NY, USA, 1982. [Google Scholar]
- Mikhlin, S.G. The Numerical Performance of Variational Methods; Wolters-Noordhoff Publishing: Groningen, The Netherlands, 1971. [Google Scholar]
- D’Errico, J. SLM-Shape Language Modeling. 2009. Available online: http://www.mathworks.commatlabcentral/fileexchange/24443-slm-shape-language-modeling:Mathworks (accessed on 10 March 2022).
- Sarnari, A.J.; Živanović, R. Robust Padé approximation for the holomorphic embedding load flow. In Proceedings of the 2016 Australasian Universities Power Engineering Conference (AUPEC), Brisbane, Australia, 25–28 September 2016; pp. 1–6. [Google Scholar]
- Ibryaeva, O.L.; Aduko, V.M. An algorithm for computing a Padé approximant with minimal degree denominator. J. Comput. Appl. Math. 2013, 237, 529–541. [Google Scholar] [CrossRef]
- Ibryaeva, O.L. A new algorithm for computing Padé approximants and its implementation in Matlab. Bull. South Ural. State Univ. Ser. Math. Model. Program. 2011, 10, 99–107. (In Russian) [Google Scholar]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content. |
© 2023 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).