Chebyshev collocation treatment of Volterra–Fredholm integral equation with error analysis


 This work reports a collocation algorithm for the numerical solution of a Volterra–Fredholm integral equation (V-FIE), using shifted Chebyshev collocation (SCC) method. Some properties of the shifted Chebyshev polynomials are presented. These properties together with the shifted Gauss–Chebyshev nodes were then used to reduce the Volterra–Fredholm integral equation to the solution of a matrix equation. Nextly, the error analysis of the proposed method is presented. We compared the results of this algorithm with others and showed the accuracy and potential applicability of the given method.


Introduction
The Volterra-Fredholm integral equations are derived from parabolic boundary value problems and can also be obtained from spatiotemporal epidemic modeling [15,27].
Consider the following Volterra-Fredholm integral equation [17]: where the functions θ 1 (x, t) and Numerical methods such as Jacobi collocation method [12,13], fifth kind Chebyshev method [2], Laguerre spectral method [8], and general orthogonal spectral method [9] are powerful techniques that can be used in applied mathematics and scientific computation to solve different types of differential problems. This work presents an approximation method for a class of Volterra-Fredholm integral equations on the interval [0, L] via the shifted Chebyshev polynomials, and finite difference methods [18][19][20][21][22].
Recently, various works have focused on the development of highly advanced and efficient methods for integral equations such as rationalized Haar functions method [23], He's variational iteration method [28], an adaptive method [5], hybrid function method [14], collocation Method [24], Legendre collocation method for solving Volterra-Fredholm integral equations [17], and second kind Chebyshev quadrature collocation algorithm [1].
The structure of this paper is as follows. In Sect. 2, we give an overview of shifted Chebyshev polynomials and their relevant properties needed hereafter. In Sect. 3, the way of constructing the collocation technique for Volterra-Fredholm integral equations is described using the shifted Chebyshev polynomials. In Sect. 4, we discuss in depth the convergence and error analysis of the suggested expansion. In Sect. 5, we present some numerical results exhibiting the accuracy and efficiency of our numerical algorithms. Also, a brief conclusion is given in Sect. 6.

Preliminaries
The conventional Chebyshev polynomials are defined on [−1, 1] and can be generated with the aid of the following recursive formulae:

Shifted Chebyshev polynomials
To use these polynomials over the interval [0, L], we define the so-called shifted Chebyshev polynomials of degree i as follows: We consider the space L 2 ω L [0, L] equipped with the following inner product and norm: The set of shifted Chebyshev polynomials forms a complete L 2 ω L [0, L]-orthogonal system with the orthogonality condition The analytic form of the shifted Chebyshev polynomials χ i (x) of degree i is given by where The polynomials χ i (x) may be generated with the aid of the following recurrence relation: where χ 0 (x) = 1 and χ 1 (x) = 2 L x − 1.

Function approximation
A function u(x) in L 2 ω L [0, L] may be expanded in terms of the shifted Chebyshev polynomials as: where the coefficients c i are given by Considering only the first (N + 1)-terms of shifted Chebyshev polynomials, we have the following approximation: where the shifted Chebyshev coefficient vector C and the shifted Chebyshev vector φ(x) are given by respectively.

Shifted Chebyshev collocation treatment of V-FIE
In this section, we approximate the solution of Eq. (1) using shifted Chebyshev polynomials. We assume that the known functions in Eq. (1) are such that this equation has a unique solution [4,6,7,10,11] and also we assume that 0 ≤ Q(x) ≤ L. We approximate the function u(x) using the way mentioned in the previous section as follows: where the coefficients c i , i = 0, 1, . . . , N are the unknowns to be determined and C and φ(x) are defined as in (5) and (6), respectively. Using (7), we can consider that Substituting Eqs. (7) and (8) into Eq. (1) yields: Suppose that: then, Eq. (9) can be rewritten as: Now, we collocate Eq. (10) at the distinct N + 1 roots of the shifted Chebyshev polynomial T L ,N +1 (x) and, consequently, the following system of algebraic equations was obtained, which can be written in the following matrix form: The elements of the matrix F are determined as follows: Finally, the unknown vector C can be computed by Therefore, the approximate solution of Eq. (1) is given by

Error analysis
Here, we discuss in depth the convergence and error analysis of the suggested truncated series expansion. For this target, we define the following errors: The following lemmas are needed: where (a) p = (a + p)/ (a), a = s − p + 1 is the pochhammer symbol.
Proof The L.H.S. of (12) is a telescopic series. By splitting 1 (s − p + 1) p into partial fractions and taking the limit of the partial sums, we get the R.H.S.
is bounded for some p > 1, then the expansion coefficients in (3) satisfy the following estimate: where C is a generic constant independent of i and C < i − p + 1.
Proof Starting from Eq. (4), using the substitution x = L 2 (1 + cos θ), following the procedures in [3] and by the assumptions of the theorem, we get the desired result.
Proof It suffices to prove that E

Now, since |χ i (Q(x))| ≤ 1 an application of Theorem 4.1 gives
Finally, a direct application of Lemma 4.1 yields the result.

Theorem 4.3 Let
where, M 1 , W 1 , 1 , 2 and q are positive constants, then we have the following residual estimate: Proof From Eq. 1, we have Noticing that, |

Test problems
To justify the validity and accuracy of the presented algorithm, we apply it to solve some examples of the Volterra-Fredholm integral equations. Also, we compare our numerical results with those obtained using other methods and with the exact solutions of such problems. The following tables and figures contain the values of the exact solution u(x), the approximate solution u N (x), and the absolute error functions e N (x) at the selected points.
Example 5.1 Consider the following V-FIE [17] (sin where The exact solution of this equation is u(x) = x 2 . In Table 1, we compare the absolute errors of the present method with the Taylor collocation (TC) method of [26], the Taylor polynomial (TP) method of [16] and the Lagrange collocation (LC) [25]. The numerical results for this example are displayed in Fig. 1. The graphs of the analytical solution and the approximate solution at N = 10 and L = 100 are displayed in Fig 2 to make the comparison easier.

Example 5.2 Consider the following V-FIE
where f (x) = − e x 4 − 1 4 e −2+x cos 2 + 1 2 e 3x cos 2x − 1 4 e −2+x sin 2 + x 2 sin x +e x sin 2x − 1 2 e 3x sin 2x. Its exact solution is u(x) = sin x. Table 2 shows that the absolute error obtained by the SCC method is significantly better than that obtained by the Taylor collocation (TC) method of [26], the Taylor polynomial (TP) method of [16] and the Lagrange collocation (LC) [25]. The absolute error obtained by the SCC method at N = 14 is plotted in Fig 3. The graphs of the analytical solution and the approximate solution at N = 10 and L = 8 are displayed in Fig 4 to make the comparison easier.

Example 5.3 Consider the V-FIE
The exact solution of this problem is u(x) = x 1 2 . Table 3 shows the numerical results of the proposed method of this example, with N = 8, 12, 16.    compared with the Taylor collocation (TC) method of [26], the Taylor polynomial (TP) method of [16] and the Lagrange collocation (LC) [25]. The absolute error obtained by the SCC method at N = 11 is plotted in Fig 5 and in Fig. 6, we compare the analytic solution with the approximate solution at N = 10 and L = 6 ( Table 4).

Concluding remarks
A Chebyshev collocation method was applied to solve a special class of Volterra-Fredholm integral equation. This method uses the shifted Gauss-Chebyshev nodes to reduce the considered Volterra-Fredholm integral equations to the solution of a matrix equation. In the given examples, through the selection of a relatively few shifted Gauss-Chebyshev nodes, we were able to obtain very accurate approximations, demonstrating the utility of our approach over other analytical or numerical methods. The proposed method is a powerful tool for obtaining novel numerical solutions of such equations.