1. Introduction
Volterra integral equations (VIEs) have significant applications in various fields of applied science and engineering, such as superfluidity, elasticity, electromagnetism, electrostatics, potential theory, geophysics, etc. Singular and weakly singular integral equations are of particular interest, since they are used to solve inverse boundary value problems whose domains are fractal curves, where classical calculus cannot be used. Abel equations and other fractional-order integral equations have been studied extensively and are used in modeling various phenomena in biophysics, viscoelasticity and electrical circuits [1,2]. In this paper, we consider using the biquadrature formula to solve the following two-dimensional nonlinear VIEs with a fractional-order weakly singular kernel:
(1)
where and are given continuous functions defined on , , and is an unknown function defined on D. In addition, we assume that the VIEs (1) have a smooth solution and that satisfies the following condition(2)
The classical block-by-block method is an efficient numerical algorithm for VIEs. A general block-by-block method for one-dimensional linear VIEs with a nonsingular kernel function was given in [3]. In [4], systems of one-dimensional nonlinear VIEs with a nonsingular kernel function were solved by the block-by-block method. A new high-order numerical scheme for fractional ordinary differential equations was given in [5], called the modified block-by-block method. In [6], radial basis functions were used to solve for the second kind of nonlinear VIEs in which the kernel function satisfies the Lipschitz condition. The authors of [7] used the Runge–Kutta method and the block-by-block method to solve the second kind of nonlinear VIEs with a continuous kernel. In [8], a new transformation was used to solve the VIEs by using a Laplace transform. The Bernstein approximation method was used for VIEs of the third kind in [9]. In [10], the spectral collocation method with graded meshes was used to solve the second kind of VIEs with a weakly singular kernel. Two-dimensional VIEs were studied by an Euler-type numerical scheme in [11]. A method based on two-dimensional Euler polynomials combined with the Gauss–Jacobi quadrature formula was used to solve two-dimensional VIEs with fractional-order weakly singular kernels in [12]. General linear methods were implemented with a variable step size for VIEs with a sufficiently smooth kernel function, and the corresponding MATLAB code was developed in [13]. VIEs with a nonlinear weakly singular kernel function were solved by an hp-version collocation method in conjunction with Jacobi polynomials in [14]. The optimal homotopy asymptotic method was used for linear and nonlinear two-dimensional VIEs in [15]. In [16], an iterated multi-Galerkin method was used to solve VIEs with a weakly singular kernel, and the proof of convergence rates was given by the projected methods. Multivariate Bernstein polynomials were used to solve multidimensional linear and nonlinear VIEs with fractional weakly singular kernel functions in [17]. In [18], a Jacobi spectral collocation method was proposed for a class of nonlinear VIEs with kernels of the form , where and is a nonlinear function. Numerical solutions for weakly singular VIEs were presented based on Chebyshev and Legendre pseudo-spectral Galerkin methods in [19]. Some more recent developments are shown in [20,21,22]. The study of numerical solutions for high-dimensional VIEs with singular nonlinear kernel functions remains an important research issue. To date, there have been few reports on high-order numerical algorithms for two-dimensional VIEs with singular nonlinear kernel functions.
In this paper, we construct a new high-order numerical solution for two-dimensional nonlinear fractional VIEs by using the techniques of [5] with uniform accuracy. To avoid degeneracy near the two boundary layers, the proposed scheme couples the solutions at the two boundary layers. Thus, no smaller meshes are needed to achieve the sharp numerical order. Such coupling is not required in the other subdomains. The convergence analysis is based on a novel technology that couples the ideas of [5] and the Gronwall inequality. Hence, the optimal convergence order for can be achieved for a sufficiently smooth solution and a general nonlinear kernel function.
This paper is arranged as follows. In Section 2, the higher-order numerical scheme is proposed. The estimation of the truncation errors of the constructed higher-order numerical scheme is given in Section 3. A convergence analysis of the higher-order numerical scheme is given in Section 4. In Section 5, four numerical experiments are presented to illustrate the efficiency of the the high-order numerical approach and to support our theoretical findings. Finally, some conclusions arising from this work are drawn in Section 6.
2. Higher-Order Numerical Scheme of Two-Dimensional Nonlinear Fractional VIEs
In this section, we consider the approximate evaluation of two-dimensional nonlinear fractional VIEs. In order to construct the numerical scheme of Equation (1), the region D is divided into equal subdomains with size , where M and N are positive integers. We denote ,, and the numerical solution of formula (1) at point is denoted by , where . For convenience of narration, we let .
Firstly, we propose a high-order scheme for the nonlinear fractional VIEs. Let and be the basis functions of quadratic interpolation polynomials at points and , respectively, where and , are defined as follows
We estimate that at point has the form
(3)
with(4)
To compute and , we use the following approximation:
(5)
(6)
(7)
where(8)
Note that computing through (3) requires the values of (or indirectly, the values of u) at and . Particularly, the dependence of on and means that (3), (5)–(7) must be solved simultaneously with the scheme.
We further estimate and , assuming and are already known. For , we have
(9)
where is in (4) and(10)
(11)
We estimate and using the following approximations
(12)
(13)
(14)
where is in (4), is in (8), and are in (10) and (11), respectively, and(15)
Next we use the same method to estimate and directly obtain
(16)
(17)
(18)
(19)
where and are in (4) and (8), respectively, and(20)
(21)
(22)
Next we approximate for . We first assume that are known, and then we construct the approximation of .
Firstly, for , we have
(23)
where is the integral of the first block and can be calculated by using biquadratic interpolation as follows(24)
where is shown in (10) and is defined in (20).For , we can obtain
(25)
where is shown in (10) and is defined in (20).For , we have
(26)
where and are shown in (11) and (20), respectively.For , along the same lines, we have
(27)
where is shown in (11) and is defined in (21).Bringing (24)–(27) into (23), we obtain
(28)
Next, we construct the numerical scheme for . We first split the integration domain, and then use the piecewise biquadratic interpolation to approximate the calculation in the corresponding subdomains. Therefore, the numerical scheme of can be given by the following
(29)
where , and are in (15), (20) and (21), respectively.As a consequence, and can be approximated as follows
(30)
(31)
where , , and are shown in (10), (11), (15) and (22), respectively.To summarize, by combining (3), (5)–(7), (9), (12)–(14), (16)–(19) and (28)–(31) we compose the high-order numerical scheme of Equation (1) as follows
(32)
3. Estimation of the Truncation Errors
Now, we analyze the estimation of the truncation error of (32). We define the truncation error at the point by
(33)
where is an approximate value of , which is substituted into the exact solution of (32). For example, we define at the point as follows(34)
For ease of notation, let . Then, the estimation of is as follows.
Let be the truncation error defined in (33). If , then it holds that
where C depends only on , and are defined as follows:
(35)
(36)
Firstly, we estimate the truncation error . According to (33), we define the truncation error at the point . Combining (28), (33) and (34), we have
(37)
Using Taylor’s theorem, one can obtain that for all ,
where . For all , there exists , such thatSimilarly, for all , there exists , such that
and for all , there exists , such thatWe can directly obtain as follows
(38)
Next, we estimate each item on the right side of (38), and we have
(39)
(40)
where is defined by (35).Combining (39) and (40) yields
(41)
We use the same technique for , and it is easy to see that
(42)
For the first item on the right side of (42), we can obtain
(43)
Next, we make a detailed estimate of with the following form
(44)
where . Based on the definition of , we know that , and therefore , and we have(45)
We make the following detailed estimates of and , which can be directly obtained.
(46)
(47)
where . Then, we insert (46) and (47) into (45) and obtain as follows(48)
For , we discover
(49)
where is defined by ().According to (48) and (49), (44) becomes
(50)
Therefore, combining (43) and (50) with (42), we can obtain the following result:
(51)
Now, we estimate , and we can obtain
For , we have
where . Taking the first term and the second term on the right side of the above formula as and , we haveFor and , we use the same method as (46) and (47), obtaining
Hence, for , we can directly obtain
For , we can directly obtain the result
Next, we estimate as follows
Therefore, we obtain that
(52)
Finally, we make a detailed estimation of , which has the form
Next, we estimate and one by one. For , we have
where .For , the same processing method can be used as for , to obtain
For , we can obtain
Finally, we estimate as follows
where . The two terms of the above formula are denoted and , respectively. Using the same method as for to deal with , we can obtainTherefore, we obtain
(53)
Bringing (41) and (51)–(53) into (37) gives
where C depends only on and .We can prove the truncation error at the other steps in a similar way to the truncation error at the point . We can draw the conclusion that the truncation errors satisfy
(54)
The proof is then completed. □
4. Convergence Analysis
To simplify the notation, we rewrite the numerical scheme by introducing the following coefficients
(55)
Carefully observing (11), (15), (21) and (22), it is obvious that . Hence, the numerical scheme (32) can be reformulated with an equivalent form as follows
(56)
where ; .Based on the idea of [5], we can prove the following lemma.
The coefficients and , are defined in (55), and they satisfy
In the following, we will use Lemmas 1 and 2 to analyze the convergence of the scheme (56), as in the following theorem.
Let u be the exact solution of Equation (1), , , be the numerical solution of (56). If satisfies the condition (2), and the step size , satisfies
(57)
then the following error estimates hold
(58)
where C depends only on and β.Let . It is easily seen that . Firstly, , satisfy
where and are defined in (55). By direct calculation, it is easy to show that , and are bounded and satisfies (2). Hence, it follows thatBy combing these four inequalities, and taking into account (57), we discover that
Secondly, satisfies
where and are in (55) and satisfy Lemma 2. Since the above four equations are coupled, they must be solved simultaneously. For simplicity, we choose to set , , and then we can convert them into two groups of similar formulas, one of which isFor , we have
After applying the Gronwall’s inequality [23] to the above equation, we obtain
Using the same method for , we directly obtain
The process of calculating is similar to that for , and therefore it is omitted.
Taking the above result, together with Lemma 1, we have
(59)
(60)
Next, satisfy
where and are defined in (55) and satisfy Lemma 2. We estimate as shown below.(61)
which can be rearranged into the preferred formIf we let , , then we obtain
As the above formula is applicable to all , we can obtain
Therefore,
(62)
Using the discrete Gronwall inequality [23], we obtain
Combining the above estimations with Lemma 1 yields
(63)
In the same way, we can obtain the results
(64)
We combine (59), (60), (63) and (64), then the proof is completed. □
5. Numerical Examples
In this section, the numerical scheme is used to solve the two-dimensional fractional Volterra integral equations, and we propose four calculation examples to prove its effectiveness. All the numerical examples were implemented using MATLAB on a ThinkCentre computer with a 3.40 GHz Intel(R) Core(TM) i5-7500 CPU and 8.00 GB of RAM. The time complexity of the proposed numerical scheme on discrete grids was .
Consider the following two-dimensional linear fractional Volterra integral equations
where
The corresponding exact solution is
In our test, we chose and , respectively. The step size in the x-direction was and the step size in the y-direction was . The definition of error was as follows
In this example, we wished to check how well the constructed numerical format converged for different choices of α and β. The test results are given in Table 1 and Table 2, and the convergence order was calculated as . From the results of the theoretical analysis in Theorem 1, we know that the theoretical convergence order of the constructed numerical scheme is . When is sufficiently small with respect to , we have . In Table 1 and Table 2, we take or and . In this case, our scheme’s theoretical order is . In Table 1 and Table 2, we show the corresponding convergence order and CPU time when N takes a series of values and are given specific values. In Table 1, when , the tested order is close to the theoretical order of 3.4. In Table 2, when , the order of the test is close to the theoretical order of 3.3. This is consistent with the theoretical prediction. However, from Table 1 and Table 2, we find that the CPU time quickly increases from 0.14 s to about 2 h as N increases.
Similarly, we test the convergence order using the proposed numerical scheme in another way. When we take , where indicates rounding up, the numerical scheme’s theoretical order . The test results are given in Table 3. When , the numerical result of the test is close to 3.7, and when , the numerical result of the test is close to 3.9. It may be noted from Table 1, Table 2 and Table 3 that the high-order numerical scheme is convergent and has good approximation.
Consider the following two-dimensional nonlinear fractional Volterra integral equations:
where
and the exact solution is
In this example, the meanings described in Table 4 and Table 5 are similar to those in Table 1, Table 2 and Table 3 in Example 1. In Table 4, we can easily see that when and , the numerical results of the test are very close to the theoretical values of 3.4 and 3.3, respectively. In Table 5, when , the numerical result of the test is close to 3.7, and when , the numerical result of the test is close to 3.9. This shows very good consistency with the theoretical prediction.
Next, we plot the error distribution. The error distribution of is shown in Figure 1, where the error distribution of is on the left and the error distribution of is on the right. From Figure 1, we find that the errors can be as small as and .
Assume the below two-dimensional fractional Volterra integral equation [24]:
where the exact solution is .
In this example, we take and compare our scheme with the numerical method in [24]. The numerical solutions of different points are given in Table 6, where “Haar solution” denotes the numerical solutions in Table 2 of [24], and “Numerical solution” denotes the numerical solutions obtained by our method. Since we are using a quadratic polynomial, while a zero polynomial is used in [24], combined with the data in Table 6, we can clearly see that the error produced by using our proposed method is much smaller.
We consider the following two-dimensional nonlinear fractional Volterra integral equation [25]:
with the exact solution .
In this example, we take and give the exact and approximate solutions at the point in Table 7, where "Method solution" represents the approximate solution in Table 1 of [25] and "Numerical solution" represents the numerical solution using our proposed method. The maximum error is also given in Table 7. According to the calculation results shown in Table 7, we can see that the approximate solution obtained using our proposed method is closer to the exact solution at the corresponding point, and the maximum error is smaller.
6. Concluding Remarks
Following the modified block-by-block method [5], we proposed an efficient and high-order numerical scheme (32) to approximate the solution of two-dimensional nonlinear fractional Volterra integral equations with singular kernels. The main idea of the high-order numerical scheme was to discretize its domain into a number of subdomains and then use biquadratic interpolation on each subdomain. In this high-order numerical scheme, only the two boundary layers were coupled, and the rest of the blocks were explicit in the scheme, which made our calculations more convenient. The scheme has uniform accuracy, and the optimal convergence order was . For the high-order numerical scheme, we conducted a detailed error analysis and verified the correctness of the theoretical analysis through numerical examples. The advantages of the numerical scheme (32) are high accuracy, easy calculation and the fact that there is no need for coupling solutions. The disadvantage of the numerical scheme is that the computation time is long, increasing as the number of partitions increases. In the future, according to reference [26,27], we intend to use a fast algorithm to realize the results. Based on the idea of [28], we will use the high-order numerical scheme to solve Fredholm–Hammerstein integral equations of the second kind. Based on the ideas of [29,30,31,32], we expect that the constructed efficient higher-order scheme can be applied to engineering and practical problems.
Funding acquisition, Z.-Q.W. and J.-Y.C.; investigation, Z.-Q.W. and Q.L.; methodology, Z.-Q.W. and J.-Y.C.; project administration, Z.-Q.W. and J.-Y.C.; software, Q.L.; supervision, Z.-Q.W. and J.-Y.C.; visualization, Q.L.; writing—original draft, Z.-Q.W. and Q.L.; writing—review and editing, Z.-Q.W., Q.L. and J.-Y.C.; All authors have read and agreed to the published version of the manuscript.
Not applicable.
Not applicable.
All the data were computed using our high-order numerical scheme.
The authors thank the anonymous referees for their valuable suggestions, which improved the quality of this work significantly.
The authors declare no conflict of interest. The funders had no role in the design of the study, in the collection, analyses or interpretation of data, in the writing of the manuscript or in the decision to publish the results.
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Figure 1. Error distribution of [Forumla omitted. See PDF.] (left) and [Forumla omitted. See PDF.] (right) for [Forumla omitted. See PDF.].
Maximum errors, decay rate and CPU time with
N |
|
Order | CPU Time |
---|---|---|---|
8 | 1.9973659945 |
- | 0.1438033000 s |
16 | 2.0439893391 |
3.2886391376 | 1.7739478000 s |
32 | 2.0217387802 |
3.3377191614 | 27.3948994000 s |
64 | 1.9623458838 |
3.3649453461 | 7.1728836283 min |
128 | 1.8839724669 |
3.3807295678 | 1.8958612181 h |
Maximum errors, decay rate and CPU time with
N |
|
Order | CPU Time |
---|---|---|---|
8 | 1.0362949128 |
- | 0.2546744000 s |
16 | 1.1195268795 |
3.2104735569 | 1.8277023000 s |
32 | 1.1762915084 |
3.2505716291 | 27.406621300 s |
64 | 1.2176430484 |
3.2720824624 | 7.1583191750 min |
128 | 1.2502313451 |
3.2838242818 | 1.8919108256 h |
Maximum errors and decay rate with
M |
|
Order |
|
Order |
---|---|---|---|---|
|
2.7093547741 |
− | 8.5837427821 |
− |
|
2.4017036964 |
3.4958192397 | 6.7887046124 |
3.6603986275 |
|
2.0350262447 |
3.5609388681 | 5.0238828559 |
3.7562615829 |
|
1.6641178999 |
3.6122178456 | 3.6303832318 |
3.7906090690 |
128 | 1.3366509233 |
3.6380630008 | 2.5643266843 |
3.8234698786 |
Maximum errors and decay rate with
N |
|
Order |
|
Order |
---|---|---|---|---|
|
1.4497410528 |
− | 6.7268209314 |
− |
|
1.4126072922 |
3.3593628803 | 6.9945531354 |
3.2656105874 |
|
1.3572217464 |
3.3796320927 | 7.1896243538 |
3.2822435908 |
|
1.2887160530 |
3.3966501211 | 7.3370971254 |
3.2926351059 |
128 | 1.2153830342 |
3.4064514616 | 7.4615217116 |
3.2976675925 |
Maximum errors and decay rate with
M |
|
Order |
|
Order |
---|---|---|---|---|
|
4.1299227631 |
− | 1.2444932111 |
− |
|
3.5190750852 |
3.5528465991 | 9.1544255179 |
3.7649451968 |
|
2.9677317197 |
3.5677637121 | 6.6471665752 |
3.7836579403 |
|
2.4390547260 |
3.6049666456 | 4.7740052334 |
3.7994674546 |
128 | 1.9706716024 |
3.6295628422 | 3.3836403013 |
3.8185520322 |
The numerical results in Example 3.
|
Exact Solution | Haar Solution in [ |
Numerical Solution |
---|---|---|---|
|
0 | 0 | 0 |
|
−0.000900 | −0.000931 | −0.000899999999999 |
|
−0.006400 | −0.006458 | −0.006400000000000 |
|
−0.018900 | −0.018932 | −0.018900000000000 |
|
−0.038400 | −0.038412 | −0.038400000000000 |
|
−0.062500 | −0.062504 | −0.062499999999999 |
|
−0.086400 | −0.086475 | −0.086399999999997 |
|
−0.102900 | −0.102941 | −0.102899999999998 |
|
−0.102400 | −0.102482 | −0.102399999999991 |
|
−0.072900 | −0.072970 | −0.072899999999974 |
|
0 | 0 | 0.000000000000137 |
The numerical results for Example 4.
|
Exact Solution | Method Solution in [ |
Numerical Solution | ||
---|---|---|---|---|---|
|
|
|
|
||
0 | 0 | 0.018452 | 0.002162 | 0 | 0 |
0.1 | 0.057735 | 0.031135 | 0.049679 | 0.062761 | 0.057660 |
0.2 | 0.11547 | 0.13261 | 0.117302 | 0.114850 | 0.115427 |
0.3 | 0.173205 | 0.147605 | 0.168105 | 0.171241 | 0.173187 |
0.4 | 0.23094 | 0.246768 | 0.232442 | 0.230698 | 0.230858 |
0.5 | 0.288675 | 0.262075 | 0.285535 | 0.288662 | 0.288662 |
0.6 | 0.34641 | 0.360925 | 0.347581 | 0.346202 | 0.346324 |
0.7 | 0.404145 | 0.378535 | 0.398155 | 0.404047 | 0.404057 |
0.8 | 0.46188 | 0.475083 | 0.462721 | 0.461606 | 0.461757 |
0.9 | 0.519615 | 0.501015 | 0.513525 | 0.519441 | 0.519463 |
0.99 | 0.571577 | 0.583533 | 0.572104 | 0.570976 | 0.571549 |
Max error | 0 | 2.96 |
8.09 |
5.02 |
1.51 |
References
1. Kimeu, J. Fractional Calculus: Definitions and Applications. Master’s Thesis; Western Kentucky University: Bowling Green, Kentucky, USA, 2009.
2. Micula, S. A numerical method for weakly singular nonlinear Volterra integral equations of the second kind. Symmetry; 2020; 12, 1862.
3. Saberi-Nadjafi, J.; Heidari, M. A generalized block-by-block method for solving linear Volterra integral equations. Appl. Math. Comput.; 2007; 188, pp. 1969-1974. [DOI: https://dx.doi.org/10.1016/j.amc.2006.11.101]
4. Katani, R.; Shahmorad, S. Block by block method for the systems of nonlinear Volterra integral equations. Appl. Math. Model.; 2010; 34, pp. 400-406. [DOI: https://dx.doi.org/10.1016/j.apm.2009.04.013]
5. Cao, J.; Xu, C. A high order schema for the numerical solution of the fractional ordinary differential equations. J. Comput. Phys.; 2013; 238, pp. 154-168. [DOI: https://dx.doi.org/10.1016/j.jcp.2012.12.013]
6. Assari, P.; Dehghan, M. The approximate solution of nonlinear Volterra integral equations of the second kind using radial basis functions. Appl. Numer. Math.; 2018; 131, pp. 140-157. [DOI: https://dx.doi.org/10.1016/j.apnum.2018.05.001]
7. Al-Bugami, A.M.; Al-Juaid, J.G. Runge-Kutta method and block by block method to solve nonlinear Fredholm-Volterra integral equation with continuous Kernel. J. Appl. Math. Phys.; 2020; 8, pp. 2043-2054. [DOI: https://dx.doi.org/10.4236/jamp.2020.89152]
8. Jaabar, S.M.; Hussain, A.H. Solving Volterra integral equation by using a new transformation. J. Interdiscip. Math.; 2021; 24, pp. 735-741. [DOI: https://dx.doi.org/10.1080/09720502.2020.1861787]
9. Usta, F. Bernstein approximation technique for numerical solution of Volterra integral equations of the third kind. Comput. Appl. Math.; 2021; 40, pp. 161-172.
10. Ma, Z.; Alikhanov, A.A.; Huang, C.; Zhang, G. A multi-domain spectral collocation method for Volterra integral equations with a weakly singular kernel. Appl. Numer. Math.; 2021; 167, pp. 218-236. [DOI: https://dx.doi.org/10.1016/j.apnum.2021.05.006]
11. Mckee, S.; Tang, T.; Diogo, T. An Euler-type method for two-dimensional Volterra integral equations of the first kind. IMA J. Numer. Anal.; 2000; 20, pp. 423-440. [DOI: https://dx.doi.org/10.1093/imanum/20.3.423]
12. Wang, Y.; Huang, J.; Wen, X. Two-dimensional Euler polynomials solutions of two-dimensional Volterra integral equations of fractional order. Appl. Numer. Math.; 2021; 163, pp. 77-95. [DOI: https://dx.doi.org/10.1016/j.apnum.2021.01.007]
13. Abdi, A.; Conte, D. Implementation of general linear methods for Volterra integral equations. J. Comput. Appl. Math.; 2021; 386, pp. 1-19. [DOI: https://dx.doi.org/10.1016/j.cam.2020.113261]
14. Dehbozorgi, R.; Nedaiasl, K. Numerical solution of nonlinear weakly singular Volterra integral equations of the first kind: An hp-version collocation approach. Appl. Numer. Math.; 2021; 161, pp. 111-136. [DOI: https://dx.doi.org/10.1016/j.apnum.2020.10.030]
15. Ahsan, S.; Nawaz, R.; Akbar, M. Nisar. K.S.; Baleanu, D. Approximate solutions of nonlinear two-dimensional Volterra integral equations. Math. Methods Appl. Sci.; 2021; 44, pp. 5548-5559. [DOI: https://dx.doi.org/10.1002/mma.7128]
16. Kant, K.; Nelakanti, G. Approximation methods for second kind weakly singular Volterra integral equations. J. Comput. Appl. Math.; 2020; 368, 112531.
17. Pan, Y.; Huang, J.; Ma, Y. Bernstein series solutions of multidimensional linear and nonlinear Volterra integral equations with fractional order weakly singular kernels. Appl. Math. Comput.; 2019; 347, pp. 149-161. [DOI: https://dx.doi.org/10.1016/j.amc.2018.10.022]
18. Allaei, S.S.; Diogo, T.; Rebelo, M. The Jacobi collocation method for a class of nonlinear Volterra integral equations with weakly singular kernel. J. Sci. Comput.; 2016; 69, pp. 673-695.
19. Li, X.; Tang, T.; Xu, C. Numerical solutions for weakly singular Volterra integral equations using Chebyshev and Legendre Pseudo-Spectral Galerkin methods. J. Sci. Comput.; 2016; 67, pp. 43-64. [DOI: https://dx.doi.org/10.1007/s10915-015-0069-5]
20. Abdelrahman, M.; Hassan, S.; Alomair, R.; Alsaleh, D. Fundamental solutions for the conformable time fractional Phi-4 and space-time fractional simplified MCH equations. AIMS Math.; 2021; 6, pp. 6555-6568. [DOI: https://dx.doi.org/10.3934/math.2021386]
21. Abdelrahman, M.; Sohaly, M.; Alharbi, Y. Fundamental stochastic solutions for the conformable fractional NLSE with spatiotemporal dispersion via exponential distribution. Phys. Scr.; 2021; 96, 125223. [DOI: https://dx.doi.org/10.1088/1402-4896/ac119c]
22. Wang, K.; Wang, G.; Zhu, H. A new perspective on the study of the fractal coupled Boussinesq-Burger equation in shallow water. Fractals; 2021; 29, 2150122. [DOI: https://dx.doi.org/10.1142/S0218348X2150122X]
23. Dixon, J.; Mckee, S. Weakly singular discrete Gronwall inequalities. Z. Angew. Math. Mech.; 1978; 66, pp. 535-544. [DOI: https://dx.doi.org/10.1002/zamm.19860661107]
24. Abdollahi, Z.; Moghadam, M.M.; Saeedi, H.; Ebadi, M. A computational approach for solving fractional Volterra integral equations based on two-dimensional Haar wavelet method. Int. J. Comput. Math.; 2022; 99, pp. 1488-1504.
25. Najafalizadeh, S.; Ezzati, R. Numerical methods for solving two-dimensional nonlinear integral equations of fractional order by using two-dimensional block pulse operational matrix. Appl. Math. Comput.; 2016; 280, pp. 46-56. [DOI: https://dx.doi.org/10.1016/j.amc.2015.12.042]
26. Micula, S. A fast converging iterative method for Volterra integral equations of the second kind with delayed arguments. Fixed Point Theory.; 2015; 16, pp. 371-380.
27. Gu, X.; Wu, S. A parallel-in-time iterative algorithm for Volterra partial integro-differential problems with weakly singular kernel. J. Comput. Phys.; 2020; 417, 109576. [DOI: https://dx.doi.org/10.1016/j.jcp.2020.109576]
28. Micula, S.; Cattani, C. On a numerical method based on wavelets for Fredholm-Hammerstein integral equations of the second kind. Math. Methods Appl. Sci.; 2018; 41, pp. 9103-9115.
29. Cao, J.; Cai, Z. Numerical analysis of a high-order scheme for nonlinear fractional differential equations with uniform accuracy. Numer. Math. Theor. Meth. Appl.; 2021; 14, pp. 71-112. [DOI: https://dx.doi.org/10.4208/nmtma.OA-2020-0039]
30. Wang, Z.; Cui, J. Second-order two-scale method for bending behavior analysis of composite plate with 3-D periodic configuration and its approximation. Sci. China Math.; 2014; 57, pp. 1713-1732. [DOI: https://dx.doi.org/10.1007/s11425-014-4831-1]
31. Huang, Y.; Gu, X.; Gong, Y.; Li, H.; Zhao, Y.; Carpentieri, B. A fast preconditioned semi-implicit difference scheme for strongly nonlinear space-fractional diffusion equations. Fractal Fract.; 2021; 5, 230. [DOI: https://dx.doi.org/10.3390/fractalfract5040230]
32. Gu, X.; Sun, H.; Zhao, Y.; Zheng, X. An implicit difference scheme for time-fractional diffusion equations with a time-invariant type variable order. Appl. Math. Lett.; 2021; 120, 107270. [DOI: https://dx.doi.org/10.1016/j.aml.2021.107270]
You have requested "on-the-fly" machine translation of selected content from our databases. This functionality is provided solely for your convenience and is in no way intended to replace human translation. Show full disclaimer
Neither ProQuest nor its licensors make any representations or warranties with respect to the translations. The translations are automatically generated "AS IS" and "AS AVAILABLE" and are not retained in our systems. PROQUEST AND ITS LICENSORS SPECIFICALLY DISCLAIM ANY AND ALL EXPRESS OR IMPLIED WARRANTIES, INCLUDING WITHOUT LIMITATION, ANY WARRANTIES FOR AVAILABILITY, ACCURACY, TIMELINESS, COMPLETENESS, NON-INFRINGMENT, MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE. Your use of the translations is subject to all use restrictions contained in your Electronic Products License Agreement and by using the translation functionality you agree to forgo any and all claims against ProQuest or its licensors for your use of the translation functionality and any output derived there from. Hide full disclaimer
© 2022 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/). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
Abstract
In this paper, based on the modified block-by-block method, we propose a higher-order numerical scheme for two-dimensional nonlinear fractional Volterra integral equations with uniform accuracy. This approach involves discretizing the domain into a large number of subdomains and using biquadratic Lagrangian interpolation on each subdomain. The convergence of the high-order numerical scheme is rigorously established. We prove that the numerical solution converges to the exact solution with the optimal convergence order
You have requested "on-the-fly" machine translation of selected content from our databases. This functionality is provided solely for your convenience and is in no way intended to replace human translation. Show full disclaimer
Neither ProQuest nor its licensors make any representations or warranties with respect to the translations. The translations are automatically generated "AS IS" and "AS AVAILABLE" and are not retained in our systems. PROQUEST AND ITS LICENSORS SPECIFICALLY DISCLAIM ANY AND ALL EXPRESS OR IMPLIED WARRANTIES, INCLUDING WITHOUT LIMITATION, ANY WARRANTIES FOR AVAILABILITY, ACCURACY, TIMELINESS, COMPLETENESS, NON-INFRINGMENT, MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE. Your use of the translations is subject to all use restrictions contained in your Electronic Products License Agreement and by using the translation functionality you agree to forgo any and all claims against ProQuest or its licensors for your use of the translation functionality and any output derived there from. Hide full disclaimer