# A New Numerical Technique for Solving Volterra Integral Equations Using Chebyshev Spectral Method

Authors: Ahmed A. Khidir
Journal: Mathematical Problems in Engineering
 (2021)

---

## Abstract

In this work, we propose a new method for solving Volterra integral equations. The technique is based on the Chebyshev spectral collocation method. The application of the proposed method leads Volterra integral equation to a system of algebraic equations that are easy to solve. Some examples are presented and compared with some methods in the literature to illustrate the ability of this technique. The results demonstrate that the new method is more efficient, convergent, and accurate to the exact solution.


---

## Body

## 1. Introduction

Many mathematical formulations of physical phenomena contain integral equations; these equations arise in many fields including biology, economics engineering, and medicine; for more details, see [1–4]. Finding solutions of linear or nonlinear Volterra integral equations is highly interesting for researchers and scientists in this field and there are available studies to find analytical or numerical solutions for Volterra integral equations (see [5–8]). In fact, Volterra integral equations are usually difficult to solve analytically, so we resort to finding approximate solutions to the problems using numerical or analytical approximation methods. The main purpose of this work is to introduce a new method for solving Volterra integral equations that uses Chebyshev spectral collocation method. Chebyshev spectral collocation methods have been applied successfully in different areas of sciences and engineering because of their ability to give highly accurate solutions of single or system of boundary value problems [9–13]. Chebyshev spectral methods are defined everywhere in the computational domain. Therefore, it is easy to compute high accurate values of a considered function at any point of the domain.In the proposed method, we introduce a new integral transformation that is the replacement of an integral term in the Volterra integral equation by Chebyshev spectral differential matrix of known elements. The advantages of this approach over the standard same approaches are as follows: (i) the current technique suggests a standard way of choosing the auxiliary linear operator of the integral equation which is the main motivation behind the selection of the current algorithm whereas the other methods are choosing a linear operator to be simple in order to ensure that the integral or integrodifferential equations can be easily integrated and (ii) this algorithm transforms the integral equation(s) into a system of linear algebraic equations which is easier and faster to solve when compared to a system of integral equations. One of the disadvantages of this method is that it cannot be applied directly to the nonlinear integral equations; therefore, we need first to linearized the nonlinear integral equation using any available method such as the successive linearization method [14–17]. The applicability, accuracy, and reliability of the proposed method are confirmed by solving the various Volterra integral equations.This paper is organized as follows: in Section2, we introduce a description of the proposed method. In Section 3, the proposed method is implemented in some cases. The numerical results are discussed and investigated in Section 4. Finally, the paper is concluded in Section 5.


## 2. Description of the Method

Let us consider the Volterra integral equation of the second kind defined as(1)ux+∫0xKx,tutdt=fx,with(2)u0=f0,where ux is an unknown function and the kernel Kx,t and the source term function fx are given functions.In the proposed method, we are seeking for for solving the linear Volterra integral equation of the form (1) using the Chebyshev collocation method. This method is based on approximating the unknown function ux by the Chebyshev interpolating polynomials at the Gauss–Lobatto collocation points defined on the domain 0,xN by [18–20](3)xj=12xN1−cosjπN,j=0,1,2,…,N.The unknown functionux is approximated as a truncated series of Chebyshev polynomials of the form(4)ux=uxj≃∑k=0NukTkxj,where Tk is the kth Chebyshev polynomial and uk are the Chebyshev coefficients. The derivatives of ux at the collocation points are represented as(5)drudxr≃∑k=0NDjkruxk=Dru,where r is the order of differentiation, D is the Chebyshev differentiation matrix, and N+1 is the number of collocation points. We express the entries of the differentiation matrix D as [18–20](6)D00=2N2+16,Djk=cjck−1j+kξj−ξk,j≠k;j,k=0,1,…,N,Dkk=−ξk21−ξk2,k=1,2,…,N−1,DNN=−2N2+16..We introduce the following simple integral equation:(7)ϕx=∫0xvtutdt,where vt is a known function. Clearly, the existence of the function ϕx depends on the existence of the integral. One approach is to note that the integral equation (7) is a special case of an initial value problem expressed as(8)ddxϕx−vxux=0,withϕ0=0.This differential equation can be solved using the Chebyshev spectral collocation method by replacing the differential operatord/dx with the transformed Chebyshev differentiation matrix D defined on the domain x∈0,xN (see [21]) and also the functions vx and ux are written in vectors forms of sizes N+1×1; this yields(9)Dϕ0ϕ1…ϕNT=v0u0v1u1…vNuNT,withϕx0=0,where ϕi=ϕxi, ui=uxi, and vi=vxi and the superscript T denotes the transpose.From the solution of the initial value problem (9), the integral equation (7) can be written in matrices form of unknown function ux as follows:(10)∫xxvtutdt=10⋯00D1,0⋯D1,N⋮⋮DN,0⋯DN,N−1v0v1⋮vN⋅u0u1⋮uN−v0u0v0u0⋮v0u0,where u0 and v0 are known values; here, the first row of transformed Chebyshev differential matrix D in equation (10) is interchanging by the row 10⋯0. This is caused by the condition ϕ0=0.Now, according to equations (7) and (10), we introduce the following transformation.


### 2.1. Definition

Letux and vx be continuous functions on 0,xN; then, the integral ∫0xvtutdt is transformed into matrices form as follows:(11)∫0xvtutdt=Lvu−u0v0,where L is a square matrix of size N+1×N+1 defined as(12)L=D˜−1=10⋯00D1,0⋯D1,N⋮⋮DN,0⋯DN,N−1,and Lv is a multiplication of matrix L by the vector v defined by(13)Lv=10⋯00D1,0⋯D1,N⋮⋮DN,0⋯DN,N−1v0v1⋮vN,where D˜ is the modified matrix D after implementing initial condition. It is clear that this transformation is linear and it is easy to show this property.The existence and uniqueness of the linear transformationL defined in (12) depend on the existence and uniqueness of the inverse of matrix D˜. In linear algebra, if A is a square matrix of size N×N, then (i) A is invertible if and only if rank (A) = N and (ii) if A is invertible, then its inverse is unique [22]. We applied this theorem to all square matrices D˜ to show that these matrices are invertible. In Figure 1, we display all the sizes of the matrices D˜ of sizes N+1×N+1 against the corresponding ranks for 1≤N≤200. We notice that, from Figure 1, the rank of the matrix D˜ is equal to its size for all those values of N; that is, the matrix D˜ is invertible and consequently the inverse is unique.Figure 1
Ranks of matricesD˜N.For the kernelKx,t of the Volterra integral equation (1), we assume that the function Kx,t can be separated into two multiplied functions wx and vt as follows:(14)∫0xKx,tutdt=∫0xwxvtutdt=wx∫0xvxuxdx.Substituting (5), (11), and (14) in equation (1) gives the following system of linear equations:(15)Au=F,in which A is an N+1×N+1 square matrix and F is N+1×1 column vector obtained by(16)A=I+diagwdiagLv,F=f−u0v0wT,where diag […] is the diagonal matrix of size N+1×N+1 that puts the vector […] of size N+1×1 on the main diagonal and I is an identity matrix of size N+1×N+1. Finally, the solution of the Volterra integral equation (1) is obtained by solving the linear system (15) as(17)u=A−1F.The general idea underpinning the use of the proposed method is the replacement of a linear Volterra integral equation by a system of linear algebraic equations that replace the integral part in the integral equation by the introduced integral transformation. The obtained linear algebraic equations can easily be solved with the help of symbolic computation software such as Maple, Mathematica, MATLAB, and other symbolic computer packages.


## 2.1. Definition

Letux and vx be continuous functions on 0,xN; then, the integral ∫0xvtutdt is transformed into matrices form as follows:(11)∫0xvtutdt=Lvu−u0v0,where L is a square matrix of size N+1×N+1 defined as(12)L=D˜−1=10⋯00D1,0⋯D1,N⋮⋮DN,0⋯DN,N−1,and Lv is a multiplication of matrix L by the vector v defined by(13)Lv=10⋯00D1,0⋯D1,N⋮⋮DN,0⋯DN,N−1v0v1⋮vN,where D˜ is the modified matrix D after implementing initial condition. It is clear that this transformation is linear and it is easy to show this property.The existence and uniqueness of the linear transformationL defined in (12) depend on the existence and uniqueness of the inverse of matrix D˜. In linear algebra, if A is a square matrix of size N×N, then (i) A is invertible if and only if rank (A) = N and (ii) if A is invertible, then its inverse is unique [22]. We applied this theorem to all square matrices D˜ to show that these matrices are invertible. In Figure 1, we display all the sizes of the matrices D˜ of sizes N+1×N+1 against the corresponding ranks for 1≤N≤200. We notice that, from Figure 1, the rank of the matrix D˜ is equal to its size for all those values of N; that is, the matrix D˜ is invertible and consequently the inverse is unique.Figure 1
Ranks of matricesD˜N.For the kernelKx,t of the Volterra integral equation (1), we assume that the function Kx,t can be separated into two multiplied functions wx and vt as follows:(14)∫0xKx,tutdt=∫0xwxvtutdt=wx∫0xvxuxdx.Substituting (5), (11), and (14) in equation (1) gives the following system of linear equations:(15)Au=F,in which A is an N+1×N+1 square matrix and F is N+1×1 column vector obtained by(16)A=I+diagwdiagLv,F=f−u0v0wT,where diag […] is the diagonal matrix of size N+1×N+1 that puts the vector […] of size N+1×1 on the main diagonal and I is an identity matrix of size N+1×N+1. Finally, the solution of the Volterra integral equation (1) is obtained by solving the linear system (15) as(17)u=A−1F.The general idea underpinning the use of the proposed method is the replacement of a linear Volterra integral equation by a system of linear algebraic equations that replace the integral part in the integral equation by the introduced integral transformation. The obtained linear algebraic equations can easily be solved with the help of symbolic computation software such as Maple, Mathematica, MATLAB, and other symbolic computer packages.


## 3. Numerical Examples

To illustrate the effectiveness and accuracy of the proposed technique in the present work, several examples are carried out in this section.Example 1.
Consider the following Volterra integral equation:(18)ux+xe−x1+x+∫0xxex−2tet−e−xutdt=0.
The exact solution isux=−xex. According to (14), we have(19)ux+xe−x1+x+xex∫0xe−2tet−e−xutdt=0.
To apply the proposed method to this test problem, we rewrite equation (19) in the following system of linear equations:(20)Au=F,where A=I−diagxLe−2x, F=−xe−x1+x−xexLe−xT, and u=ux0,ux1,…,uxNT.
Thus, the final solution is obtained as(21)u=A−1F.Example 2.
Consider the following Volterra–Fredholm integral equation [23]:(22)ux−∫0xxtutdt+∫01t−xutdt=fx,where fx=−2/5x7/2−2/3x+x+2/5. The exact solution is ux=x. According to (14), we have(23)ux−x∫0xtutdt+∫01tutdt−x∫01utdt=fx.
Applying the proposed method to this problem, equation (23), we obtain the system of linear equations:(24)Au=F,where A=I−diagxLx+Rdiagx−diagxR, F=−xe−x1+x−xexLe−xT, and u=ux0,ux1,…,uxNT; the rows of the matrix R are obtained by subtracting the first row from the last row of the matrix:(25)Lv=10⋯00D1,0⋯D1,N⋮⋮DN,0⋯DN,N−1.
Thus, the final solution of the Volterra–Fredholm integral equation (22) is obtained as(26)u=A−1F.Example 3.
Consider the following system of linear Volterra integral equations [24]:(27)3x−8ux+5−2xgx−∫0xx+tutdt−∫0xxtgtdt=f1x,4xux+x−5gx−∫0x2x−tutdt−∫0xxt+tgtdt=f2x,with(28)f1x=5ex−2x−9sinx−x2ex+2xcosx−xex+3xsinx,f2x=−3x−4ex+sinx−x2ex+xcosx+xex+4xsinx−1,where the exact solution is ux=sinx and gx=ex. To illustrate the use of the proposed method to approximate the solution of this integral equations system, we rewrite the system as(29)3x−8ux+5−2xgx−x∫0xuxdx−∫0xxuxdx−x∫0xxgxdx=f1x,4xux+x−5gx−2x∫0xuxdx+∫0xxuxdx−x∫0xxgxdx−∫0xxgxdx=f2x.
Now, converting the system above into a system of linear algebraic equations using the proposed method gives(30)3x−8−xLI−Lxu+5−2x−xLxg=F1,4x−2xLI+Lxu+x−5−xLx−Lxg=F2,where F2=f1−xu0T and F2=f2−2xu0T. Finally, the solution of the system of integral equations (30) is obtained as(31)u=A−1F,where u,F, and A are defined as(32)u=ux0,ux1,…,uxN,gx0,gx1,…,gxNT,F=F1;F2,A=3x−8−xLI−Lx5−2x−xLx4x−2xLI+Lxx−5−xLx−Lx.Example 4.
Consider the following quadratic nonlinear Volterra integral equation [25]:(33)ux−x10ux∫0x11+utdt=fx,0≤x≤1,with fx=ex+x/10exlog1+e−x−log2. The exact solution is ux=ex.
For solving the nonlinear Volterra integral equation (33), we first use the successive linearization method (SLM) [14–17] to linearize the nonlinear integral equation (33). The SLM was recently introduced as an efficient linearization algorithm and robust method for solving boundary value problems. The procedure of the SLM is based on transforming the governing nonlinear equation into an iterative scheme made up of linear equations which is subsequently solved using the proposed method. In applying the SLM, we assume that the solution of (33) is obtained by(34)ux=umx+um−1x,withum0=0,m=1,2,3,…,where m is the iteration of SLM and umx are unknown functions that are obtained by solving the linearized integral equation assuming that um−1x are known functions from previous iterations. The procedure starts with an initial guess u0x which is chosen to satisfy the condition u00=f0. A suitable initial guess that satisfies this condition of equation (33) is(35)u0x=fx.
The linearized integral equation to be solved is obtained by substituting equation (34) in integral equation (33) and deleting the nonlinear terms. Thus, the linearized equation is expressed as(36)umx+x10um−1x∫0x11+um−1t2umtdt−umx2um−1∫0x11+umtdt=f1x,where f1x=fx−um−1x+x/10um−1x∫0x1/1+um−1tdt. Applying the proposed method on (36) gives the following matrices system:(37)Aum=F,where(38)A=I+diagx10um−1Lv1−diagx20um−1umLv2+diagx20um−1v2,F=f−um−1+x10um−1Lv2T,where v1=1/1+um2 and v2=1/1+um. Finally, the solution of the integral equation (33) is given by(39)u=um=A−1F.Example 5.
Consider the following system of nonlinear Volterra integral equations [26, 27]:(40)ux−∫0xu2t+g2tdt=sinx−xgx−∫0xutgtdt=cosx−sin2x2,with the exact solution ux,gx=sinx,cosx. To apply the proposed method to this test problem, we first linearize the equations using the SLM; we start by assuming that the solution of system (40) may be obtained by(41)ux=umx+um−1x,gx=gmx+gm−1x,m=1,2,3,….
Substituting (41) into (40) gives the linearized form(42)umx−2∫0xum−1tumtdt−2∫0xgm−1tgmtdt=sinx−x−um−1x+∫0xum−12tdt+∫0xgm−12tdt,gx−∫0xgm−1tumtdt−∫0xum−1tgmtdt−∫0xum−1tgmtdt=cosx−sin2x2−gm−1+∫0xgm−1tumtdt.
The suitable initial guesses foru0x and g0x are u0x=sinx−x and g0x=cosx−sin2x/2. Applying the proposed method on (42) gives the following m th approximations of the linear system of equations:(43)I−2Lum−1um−2Lgm−1gm=F1,m−1,−Lgm−1um+I−Lum−1gm=F2,m−1,with(44)F1,m−1=sinx−x−um−1+Lum−12+Lgm−12−um−120−gm−120,F2,m−1=cosx−sin2x2−gm−1+Lum−1gm−1−um−10gm−10,where um,gm,F1,m−1, and F1,m−1 are N+1×1 column vectors. System (43) leads to the matrix equation given as(45)Am−1Um=Fm−1,where Um,Fm−1, and Am−1 are defined as(46)U=um;gmT,F=F1,m−1;F2,m−1T,Am−1=I−2Lum−1−2Lgm−1−Lgm−1I−Lum−1.
Thus, the final solution of the integral equations (40) for ux and gx is obtained as(47)ugT=Um=Am−1−1Fm−1.


## 4. Results and Discussion

In this section, we present the numerical results obtained using the proposed method for solving the Volterra integral equations. Implementation of the numerical schemes was performed using the personal computer of 2.5 GHz CPU speed including MATLAB 2017 package to perform the simulation results. The accuracy of the method is demonstrated by presenting infinity error normsuEx between exact and approximate solutions computed as(48)uEx=maxux−u˜x,where ux and u˜x are the exact and the numerical solutions, respectively. The accuracy of the current results was checked by comparing them with other methods reported in the literature. We also generate the computational times of the results to show the computational efficiency of the proposed method. The results of our solutions for all introduced cases in this work are displayed in the tables and graphs and discussed below.Table1 gives a comparison between the absolute errors of the present results and the Adomian Decomposition Method (ADM) at different iterations at selected nodes for Example 1. A striking feature of the proposed method is that a high level of accuracy is achieved at the first order of approximation than the ADM, for example, whereas the proposed method gives the exact value at only one iteration for the 14th digits. This is because the proposed method selects all the terms as linear operator.Table 1
Comparison between absolute errors of present and AMD results at different iterations ofux for Example 1.
xADM iterationsCurrent results1st iteration2nd iteration3rd iteration4th iteration1st iteration0000000.257.214e−0055.318e−0072.960e−0091.323e−0111.665e−0150.501.385e−0032.931e−0054.719e−0076.123e−0093.220e−0150.756.417e−0032.226e−0045.924e−0061.276e−0077.105e−0151.001.679e−0027.669e−0042.710e−0057.781e−0071.421e−0141.253.241e−0021.743e−0037.312e−0052.503e−0062.665e−0151.505.201e−0023.087e−0031.443e−0045.520e−0067.994e−0151.757.398e−0024.664e−0032.334e−0049.594e−0063.730e−0142.009.688e−0026.334e−0033.312e−0041.427e−0057.461e−014Table2 shows a comparison between the results obtained by the current method and Shifted Chebyshev Collocation (SCC) method reported by Youssri and Hafez [23]; both methods have been applied to the Volterra–Fredholm integral equation (Example 2). It is noticed that accurate results with errors of order up to eight digits are observed using the proposed method while the SCC method is accurate up to six digits when applied to this example. Also, we notice that increasing the values of N leads to improvement in the accuracy of the solution using the SCC method whereas increasing the values of N does not affect the improvement in the accuracy of the solution using the proposed method.Table 2
Comparison of the absolute errors with various choices ofN and x for Example 2.
Youssri and Hafez [23]Current methodxN=8N=12N=160.12.96e−0035.97e−0043.02e−0057.30e−0090.28.79e−0045.75e−0043.00e−0042.30e−0090.37.10e−0043.63e−0041.33e−0042.70e−0090.49.59e−0041.64e−0044.62e−0057.81e−0090.51.75e−0056.72e−0063.24e−0061.31e−0080.67.12e−0041.31e−0042.19e−0051.87e−0080.72.48e−0041.43e−0046.51e−0052.49e−0080.81.87e−0041.75e−0046.74e−0053.19e−0080.94.93e−0044.87e−0059.79e−0064.02e−0081.05.12e−0041.71e−0047.71e−0055.03e−008In Table3, we present the numerical results of the absolute errors uEx and gEx for ux and gx, respectively, at selected nodes obtained by the proposed method, the Bernstein Polynomials Expansion (BPE) method [24], the Artificial Neural Network (ANN) method [24], and the Trapezoidal Quadrature Rule (TQR) method [28] for Example 3. It is remarkable to note that accurate results with errors of order up to sixteen digits are obtained using the proposed method while the BPE, ANN, and TQR methods are accurate up to only two, five, and two digits, respectively. This indicates that the proposed method converges much faster than the BPE, ANN, and TQR methods. Table 4 shows the maximum absolute errors uEx and gEx for ux and gx, respectively, obtained by the proposed method using different values of N. The maximum absolute errors are very small for small values of N. Also, increasing the number of nodes (increasing N) does not result in a significant improvement in the accuracy of the current approximation. We also note that the present method is computationally fast as accurate results are generated in a fraction of a second. In Figure 2, a convergence analysis graph for Example 3 is presented. Figure 2 presents a variation of the error norm at various values of nodes N. It can be seen that the values of nodes start from N=10 to converge fully. The accuracy of the method does not improve when increasing grid points N.Table 3
Errors of the BPE, ANN, TQR methods and the present results for Example3.
x=1/2rBPE methodANN methodTQR methodPresented resultsuExr=12.66e−0051.160e−0028.320e−0035.551e−017r=25.85e−0054.300e−0032.140e−0025.551e−017r=38.55e−0052.040e−0033.010e−0026.106e−016r=46.14e−0051.730e−0033.910e−0025.551e−017r=53.89e−0058.010e−0041.120e−0017.355e−016r=62.12e−0056.230e−0043.620e−0014.823e−016r=71.11e−0055.370e−0048.540e−0021.422e−016r=85.70e−0064.950e−0046.370e−0023.209e−017r=92.90e−0064.750e−0048.640e−0024.597e−017gExr=14.92e−0059.280e−0048.070e−0032.220e−016r=21.37e−0051.480e−034.810e−0032.220e−016r=32.04e−0054.430e−0033.710e−0022.220e−016r=44.11e−0055.910e−0033.160e−0026.661e−016r=59.44e−0057.940e−0034.240e−0014.441e−016r=65.17e−0051.940e−0022.800e−0010r=72.71e−0054.130e−0021.780e−0014.441e−016r=81.38e−0056.890e−0027.070e−0020r=97.01e−0069.400e−0029.040e−0030Table 4
Errors of the approximate solutionsux and gx for increasing values of N for Example 3.
NuExgExCPU time (sec)105.961e−0136.817e−0130.044153.109e−0153.997e−0150.004203.886e−0153.997e−0150.001302.776e−0153.997e−0150.002609.104e−0151.288e−0140.0081009.215e−0151.110e−0140.021Figure 2
Errors ofuEx and gEx for different values of N for Example 3.In Table5, we have compared between the errors of present results for Example 4 corresponding to different values of collocation points N and those obtained by Maleknejad’s method (MAL) reported in [29] and Mean Value Theorem (MVT) reported in [25]. It can be seen that the present method converges rapidly compared to the MAL and MVT for this example. Full convergence to the 7 decimal places’ accurate results reported by MAL and MVT is achieved for the values N=50 and N=100 while high convergence is achieved to the 16 decimal places’ accurate results for the present method for all values of N≥12. Table 6 shows the maximum absolute errors of ux for Example 4 at different orders of approximation at selected nodes. The maximum absolute errors are generally very small. A high level of accuracy is achieved at very low orders of approximation. We remark that increasing the number of nodes (i.e., increasing N) does not result in a significant improvement in the accuracy of the approximation. Figure 3 displays the errors against the iterations of the solution for Example 4 when N is fixed at 20. From Figure 3, it can be seen that the current solution rapidly converges, but the accuracy does not improve after 7 iterations.Table 5
Comparison between the errors of the MAT, MVT, and present solutions at various values ofN for Example 4.
NMATMVTPresent method5——7.287e−00812——8.882e−01615——4.441e−016502.435e−0071.669e−0078.882e−0161001.166e−0073.057e−0084.441e−016Table 6
The errors of the present solutions for Example4 at various values of N and iterations.
N1st iteration2nd iteration3rd iteration4th iteration104.849e−0061.483e−0131.741e−0131.741e−013124.849e−0062.842e−0148.882e−0168.882e−016144.849e−0062.753e−0144.441e−0164.441e−016164.849e−0062.709e−0144.441e−0164.441e−016204.849e−0062.753e−0144.441e−0164.441e−016CPU time (sec)0.0371660.0374430.0377110.037975Figure 3
Errors ofux for different values of iterations for Example 4.In Table7, we have compared between the errors of present results for Example 5 corresponding to different values of x and those obtained by Single-Term Walsh Series (STWS) reported in [26] and Homotopy Perturbation Method (HPM) reported in [27]. Table 7 indicates that 15 decimal places’ accurate results are obtained using the present technique for large values of x while only 2 and 6 decimal places’ accurate results are obtained using HPM and STWS, respectively. It is interesting to note from Table 7 that when x increases, this would lead to a decrease in the absolute error for HPM and STWS, while increasing x does not result in a decrease in the accuracy of the current approximation. This shows that the present method is more efficient than the method of STWS and HPM. Table 8 shows the maximum absolute errors uEx and gEx of the present method at different orders of approximation for different values of N for Example 5. It can be seen that the maximum absolute errors are very small and further decrease with an increase in the order of the solution. Also, a large increase in the number of nodes (increasing N) does not result in a significant improvement in the accuracy of the present solution. In Figure 4, we display the absolute errors of ux and gx against collocation points N between the present results of Example 5 at the fifth iteration. From Figure 4, it is clear that the present method rapidly converges, and also, we notice that the accuracy does not improve for N>13.Table 7
Comparison between absolute errors of HPM, STWS, and present results ofux and gx at different values of x for Example 5.
xErrors in HPM [26]Errors in STWS [27]Errors in present methoduxgxuxgxuxgx0.11.10e−0072.40e−0071.67e−0068.31e−0081.04e−0156.66e−0160.23.97e−0061.09e−0053.32e−0063.30e−0075.55e−0165.55e−0160.35.55e−0051.19e−0044.97e−0067.33e−0073.61e−0153.33e−0160.43.81e−0046.27e−0046.59e−0061.28e−0062.61e−0152.22e−0160.51.64e−0032.20e−0038.20e−0061.95e−0067.22e−0162.22e−0160.65.20e−0035.96e−0039.79e−0062.73e−0067.77e−0164.44e−0160.71.32e−0021.33e−0021.14e−0053.58e−0065.11e−0151.11e−0150.82.86e−0022.59e−0021.30e−0054.47e−0064.33e−0151.55e−0150.95.41e−0024.49e−0021.47e−0055.36e−0064.66e−0151.67e−0151.09.21e−0027.07e−0021.65e−0056.22e−0063.33e−0151.78e−015Table 8
Errors ofux and gx at different orders of approximation for different values of N for Example 5.
N3rd iteration4th iteration5th iteration6th iterationuEx106.024e−0051.028e−0101.145e−0101.145e−010126.027e−0051.278e−0101.841e−0131.834e−013146.026e−0051.311e−0104.663e−0154.774e−015186.026e−0051.317e−0104.885e−0155.218e−015226.026e−0051.317e−0105.967e−0156.189e−015CPU time (sec)0.0023040.0029930.0036790.004365gEx101.938e−0056.811e−0117.369e−0117.369e−011121.939e−0053.733e−0111.179e−0131.177e−013141.939e−0053.901e−0111.665e−0151.776e−015181.939e−0053.929e−0111.332e−0151.332e−015221.939e−0053.929e−0111.110e−0151.110e−015CPU time (sec)0.0023290.0036010.0048780.006196Figure 4
Errors ofuEx and gEx varied N for Example 5.


## 5. Conclusion

In this paper, we have proposed a new method for solving linear and nonlinear Volterra integral equations. The technique has been constructed by introducing a new integral transformation together with Chebyshev pseudospectral method. The main difference between this collocation method and the other collocation methods is the replacement of the integral terms by a linear transformation using the Chebyshev differential matrix. The numerical results have been shown and compared with the exact solutions and other methods in the literature. These results are shown in the tables and figures for all cases considered in this work. To give a sense of the computational efficiency of the technique, the CPU computational time to generate the results is presented in the tables. It can be seen that high accuracy and less computational time (less than 0.02 seconds) substantiate our proposed method is a powerful numerical method for solving linear or nonlinear Volterra integral equations even for large values of grid points or iterations. The main conclusions emerging from this study may be summarized as follows:(1)
The method is more flexible than other numerical methods such as BPE, ANN, TQR, STWS, HPM, MAT, and MVT since it allows us to choose the integral operators in the integral equations in terms of the Chebyshev spectral collocation differentiation matrix.(2)
The proposed method is highly accurate and efficient, converges rapidly, and is sufficient to give good agreement with the exact solution.(3)
The suggested technique does not depend on the number of collocation pointsN and it requires a few numbers of collocation points to achieve high accuracy of results.Finally, we note that the proposed method described above is a powerful method that is appropriate in solving Volterra integral equations and can be generalized for Volterra and Fredholm integral equations. In future, we intend to show that the proposed method can be extended to coupled Volterra integrodifferential equations.



---

*Source: 9230714-2021-09-03.xml*