A new numerical method to solve pantograph delay differential equations with convergence analysis

The main aim presented in this article is to provide an efficient transferred Legendre pseudospectral method for solving pantograph delay differential equations. At the first step, we transform the problem into a continuous-time optimization problem and then utilize a transferred Legendre pseudospectral method to discretize the problem. By solving this discrete problem, we can attain the pointwise and continuous estimated solutions for the major pantograph delay differential equation. The convergence of method has been considered. Also, numerical experiments are described to show the performance and precision of the presented technique. Moreover, the obtained results are compared with those from other techniques.

at previous times and a kind of time-delay in the system can be seen. This class of differential equations has been considered by many researchers, and they have been looking for numerical and approximate solutions. Moreover, in the category of delay differential equations, functional differential equations or pantograph delay differential equations (PDDEs) have received much attention. At first, PDDEs have originated from the work of Ockendon and Tayler [23]. Some applications of PDDEs can be found in [1,6,9,23].
After the emergence of pantograph delay differential equations and their many applications, their numerical solution has been considered by many researchers. We want to mention some of the proposed methods. In [2], Boubaker polynomials were used to solve PDDEs. Sedaghat et al. [30] presented a numerical method based on the transferred Chebyshev polynomials for a pantograph equation. Also, [36] focused on the Chebyshev polynomial method for PDDEs. In [29], a sequence of functions based on the variational iteration method was given for the generalized PDDEs. A compound technique, incorporating the perturbation method with an iteration algorithm, was suggested for solving PDDEs by Cevik [4]. Exponential polynomials were applied to approximate the solution of highorder PDDEs in [5,45]. In [28], the Bessel polynomials were utilized to gain the estimated solution of a generalized pantograph equation with variable coefficients. The authors of [24] gave the multistage homotopy perturbation method for DDEs. In [27], the reproducing kernel was applied for a neutral functional differential equation. Tohidi et al. [34] and Akyuz-Dascioglu and Sezer [3] used the Bernoulli collocation method to solve generalized pantograph equations. Moreover, Jacobi rational Gauss collocation method was given to solve generalized pantograph equations in [8]. In [41,47], the Runge-Kutta methods were presented for a class of neutral infinite delay-differential equations with different proportional delays. In [18,20], Bernstein polynomials have been applied to approximately solve the generalized pantograph equations. Also, the Hermite polynomials were proposed in [43] to achieve approximate solutions of a generalized pantograph equation with variable coefficients. The authors of [12,46] discussed the stability of θ -methods for the solution of a generalized pantograph equation. The Chebyshev polynomials and the tau method were suggested to solve pantograph equations in [36]. Xu and Huang [13,42] found the discontinuous and continuous Galerkin solutions for the PDDEs. In [6], the trapezoidal rule discretization was investigated for numerical solution of the PDEs. In [8,19], rational functions were applied to approximate a generalized pantograph equation on a semiinfinite interval. Furthermore, Taylor polynomials were used to estimate the solution of the pantograph equations in [21,31,32].
Despite the techniques mentioned above, there is a need for an efficient and convergent numerical method with high accuracy and less complexity to solve PDDEs. In recent decades, spectral and pseudospectral methods have been considered as some of the high-precision methods for numerical solution of continuous-time problems involving dynamical systems. The main reason for using spectral and pseudospectral methods is the exponential convergence rate of these methods in approximating analytical and smooth functions [7,33,35]. These methods usually deal with two steps: selecting a polynomial space to approximate the solution of problem and transferring the problem (or differential equation) into the polynomial space. The orthogonal polynomials such as those of Legendre and Chebyshev are utilized to approximate the solution that have derivatives of any order. Also, a set of points, as collocation or interpolating points, are considered to discretize the equations.
In this paper, we propose a transferred Legendre pseudospectral method to solve a class of PDDEs. The proposed method has the ability to be extended to all DDEs. We focus on the following PDDE: where α(·), β(·), and χ(·) are given differentiable functions, 0 < q < 1 is a constant, γ is a given vector, and w : R n → R is an unknown continuously differentiable function. We assume that equation (1) has a unique solution w(·). Here we suggest a new transferred Legendre PS method for numerical solution of equation (1). The collocation is communicated to the transferred Legendre-Gauss-Lobatto (LGL) nodes. After discretization of the problem in these nodes, we have a nonlinear programming (NLP) problem. So, we estimate the solution of the major PDDEs. The convergence of estimate solutions is given, and the performance of technique by solving four test problems and a comparison of the method with other numerical techniques are presented.

Description of the technique
At the first step, we transform DDE (1) into the following CTO problem: The accurate solution of equation (1) is an optimal solution to the problem (2). Since equation (1) has a unique solution, problem (2) is feasible and has a unique optimal solution. We estimate the solution of problem (2) as follows: wherew j , j = 0, 1, . . . , M are unknown coefficients and L j (·), j = 0, 1, . . . , M are the interpolating Lagrange polynomials, defined by The transferred LGL points, where Q M (·) is the transferred Legendre polynomial of order M defined on [0, R] by the following recurrence relation: We note that Now, by using relations (3) and (6), we discretize CTO (2) into the NLP problem where H kj =L j (r k ), and we can display that We note that Having solved NLP problem (7), we attain the pointwise estimated solutionw * = (w * 0 ,w * 1 , . . . ,w * M ). Also, is a continuous estimate solution for the CTO problem (2) (or the major equation (1)).

Convergence of method
In this part of the article, we present the convergence theorem of the presented method for PDDEs. Suppose V n,q , n ≥ 2 is a Sobolev space containing all functions ρ : ) For any given function ρ(·) ∈ V n,∞ , there is a polynomial p(·) ∈ P M such that where C is a fixed constant independent of M and C 0 = ρ V n,∞ .
To guarantee the feasibility of problem (7), we convert it into the following one: Proof There is a polynomial p(·) ∈ P M-1 and fixed C 1 independent of M, such that Hence, By (12), w(r k ) andw k for k = 0, 1, . . . , M are in a dense set as ⊆ R n . On the other hand, w M (·) ∈ P M is a polynomial. For any polynomial w(·) ∈ P M , its derivative at the transferred LGL nodes r 0 , r 1 , . . . , r M can be computed accurately with differential matrix H. Therefore we get So by (12) and (13), for k = 1, 2, . . . , M, we have where N 1 and N 2 are upper bounds for continuous functions a(·) and b(·) on the interval [0, R]. Thus by selecting for all integers M ≥ M 1 .

Proof Under Assumption 1, there exists a subsequence {ẇ *
In the first step, we demonstrate that w * (·) is a feasible solution for problem (2). In the second step, we show that w * (·) is an optimal solution for the problem (2).
Since nodes {r k } ∞ k=0 are dense in [0, R] (see [10]), there exists a subsequence k M i such that 0 < k M i < M i , lim i→∞ r k M i =r. Thus, On the other hand, lim i→∞ (M i -1) 3 2 -n = 0, so that for problem (11), we obtain which is a contradiction to (17). So, w * (·) is a possible solution to problem (2).

Test problems
In this part of the article, in order to illustrate the performance and precision of presented method, we solve four PDDEs.
Example 1 Consider the following PDDE: The accurate solution of this pantograph equation is w(r) = e r . We assume that R = 1. The estimated and accurate solutions with M = 9 are illustrated in Fig. 1. The absolute errors of estimated solutions with M = 6, 9, 12 in Fig. 2 are given in Table 1. It appears that when M increases, the absolute errors vanish and the obtained estimated solutions converge to the accurate solution. Also, in Table 1 we compare the absolute error of the obtained estimated solution with that found using Taylor methods in [31]. It can be seen that our method is more accurate. The accurate solution of this pantograph equation is w(r) = sin(r) for any a, b ∈ R, 0 < q < 1. We assume that a = -1, b = 0.5, q = 0.5, and R = 1. The estimated and accurate solutions   are shown with M = 9 in Fig. 3. Also, the absolute errors of estimated solutions for M = 5, 7, 9 are illustrated in Fig. 4. It can see that when M increases, the absolute error tends to zero. In Table 2 we compare the maximum of absolute errors of the presented method with discontinuous Galerkin (DG) method [14]. The results of the presented method are better than those of DG method for this example.   Example 3 Consider the following PDDE: The accurate solution of this pantograph equation is w(r) = e -r , 0 < q < 1. We illustrate the accurate and estimated solutions for M = 8 and q = 0.5 in Fig. 5. The absolute errors of the estimated solutions with M = 8, 10, 12 and q = 0.5 are given in Fig. 6. By increasing M, the absolute errors decrease. In Table 3 we compare the maximum errors of the presented method and see that the error of the presented method is less than that of the method of [17].    [26], Laguerre series (LS) approach [16], Taylor series (TS) scheme [32], Hermit series collocation (HSC) approach [43], Bernstein polynomial (BP) method [20], Bernoulli collocation (BC) method [3], and modified Chebyshev collocation (MCC) technique [44]. Tables 4 and 5 indicate that our results are close and consistent with the solutions of others. Furthermore, Table 5 shows that, by increasing M, our estimated solutions come close to some constants and are more trustworthy.

Conclusions and suggestions
In this manuscript, we presented a transferred Legendre pseudospectral method for PDDEs. The feasibility and convergence of obtained estimated solutions have been discussed. The technique has been successfully utilized for solving some pantograph DDEs. A comparison of the obtained results with those of other techniques showed that our method is more precise than some existing approaches. One of the advantages of this method is that by selecting a small number of points, an acceptable accuracy can be   8 0.1716941986 0.1714664548 0.1714843782 0.1714841232 0.1714841100 0.1714841105  1  0.1025092417 0.1026729554 0.1026700543 0.1026701279 0.1026701257 0.1026701257 achieved for the solution of the equation. For future work, we will suggest the implementation of the method to the numerical solution of other types of DDE, such as fractional DDEs, fractional delay integro-differential equations and fractional delay partial differential equations.