Skip to content
BY 4.0 license Open Access Published by De Gruyter Open Access December 23, 2020

Numerical solution of two-term time-fractional PDE models arising in mathematical physics using local meshless method

  • Jun-Feng Li , Imtiaz Ahmad , Hijaz Ahmad , Dawood Shah , Yu-Ming Chu EMAIL logo , Phatiphat Thounthong and Muhammad Ayaz
From the journal Open Physics

Abstract

Multi-term time-fractional partial differential equations (PDEs) have become a hot topic in the field of mathematical physics and are used to improve the modeling accuracy in the description of anomalous diffusion processes compared to the single-term PDE results. This research includes the numerical solutions of two-term time-fractional PDE models using an efficient and accurate local meshless method. Due to the advantages of the meshless nature and ease of applicability in higher dimensions, the demand for meshless techniques is increasing. This approach approximates the solution on a uniform or scattered set of nodes, resulting in well-conditioned and sparse coefficient matrices. Numerical tests are performed to demonstrate the efficacy and accuracy of the proposed local meshless technique.

1 Introduction

In the past decade, fractional partial differential equations (PDEs) have received a lot of attention. Today, it is an active research area among scientists and engineers. PDEs have the ability to formulate many complex phenomena in various fields such as biology, fluid mechanics, plasma physics, fluid mechanics, optics and so on, and many exact and numerical schemes have been being derived such as those in refs. [1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18]. However, many researchers have not managed to derive and formulate many complex phenomena in the nonlinear PDEs with an integer order [19]. Thus, fractional is considered as a suitable solution for this issue where it contains a nonlocal property that is not found in nonlinear PDEs with an integer order [20]. In the present work, we consider two-term two-dimensional time-fractional Sobolev equation which is defined as follows:

(1) α 1 U t α 1 + α 2 U t α 2 t 2 U x 2 + 2 U y 2 = β 2 U x 2 + 2 U y 2 γ U 2 U x 2 + 2 U y 2 γ U x + U y 2 δ U + F ( z ¯ , t ) , z ¯ Ω n , 0 < α 2 α 1 1 , t > 0 ,

with the following initial and boundary conditions:

(2) U ( z ¯ , 0 ) = U 0 ( z ¯ ) ,

(3) U ( z ¯ , t ) = g 1 ( z ¯ , t ) , z ¯ Ω ,

where β , γ and δ are known constants. Moreover, α 1 t α 1 and α 2 t α 2 are the Caputo fractional derivative operator of order 0 < α 2 α 1 1 for the function U ( z ¯ , t ) .

Recently, a great effort has been expended to develop the exact and approximate behavior of fractional PDEs [21,22,23,24,25,26,27,28,29,30,31,32,33,34,35], and a variety of meshless algorithms, in almost all engineering disciplines, have gained increasing interest for the solution of various models of PDEs. In particular, the radial basis function (RBF)-based meshless methods [36,37,38,39,40,41,42,43] are the most common of these methods. Contrast to mesh-based algorithms, meshless algorithms do not need mesh in the computational domains and take into account a number of uniform or scattered collocation points. Additionally, the RBF only depends on the Euclidean distance between two points in the spatial domain, so it increases the preferences and advantages of the meshless technique. As indicated by these realities, the meshless method is a truly adaptable and helpful numerical technique and can be applied to enormous practical problems [44,45]. Hardy [46] developed the RBF algorithm in 1971, which introduced a multiquadric (MQ) RBF as a meshless interpolation method. In 1982, Franke [47] further worked on this algorithm and popularized it. Franke conducted a series of extensive tests and concluded that the MQ technique had a better performance than other RBFs. In addition, Kansa [48] recommended the MQ method for approximating elliptical and parabolic PDEs. The convergence, existence and uniqueness of RBF approximations have been described in detail in several studies [49,50].

In the RBF-based meshless methods, the RBFs usually have a free parameter c called the shape parameter. Choosing the right value (in a sense) or the optimal value for the shape parameter has been a major problem for a long time. In fact with the RBF technique, it is realized that the determination of the shape parameters has a great influence on the results in terms of accuracy and stability (see ref. [51]). In short, shape parameters are typically user-defined and depend on the problem as well as the geometry of the problem. The determination of the optimum/ideal shape parameter in the RBF method has been studied extensively and a lot of research studies have been carried out over the past 20 years. In the beginning phases of improvement, the researchers utilized their expertise for the best choice of this parameter, whereas others came to some methodologies. For instance, Hardy chose c = 0.815 d , where d denotes the average distance between the close-by nodes [46]. Franke utilized c = 1.25 D / N , where N and D denote the total number of nodes and diameter of smallest circle containing given nodes, respectively [47]. Fasshaeur [52] has suggested c = 2 / N , whereas interested readers are advised to read the text [51] for more information on these choices.

In the above discussed cases, the referenced strategies were impractical for this longstanding problem. Luckily, this issue has generated a lot of interest, and several techniques have been proposed in recent literature. Rippa [53] recommended a technique known as leave-one-out cross-validation (LOOCV)-based algorithm to determine an appropriate shape parameter, which is modified by Fasshaeur and Zhang [54]. Fasshaeur’s modification was examined further by Uddin in ref. [55]. Significant improvements in the use of adaptive LOOCV-based algorithms were reported in ref. [56]. Several other algorithms have also been proposed for the selection of the optimal value of shape parameter [57].

In light of the above discussed shortcomings such as sensitivity to the shape parameters value and ill-conditioned and dense system of algebraic equations, the researchers recommend the local meshless method (LMM) [58,59]. The local RBF-based methods utilize neighboring collocation points to approximate the differential operator and make the system sparse and well-conditioned.

In this article, the explicit, implicit and Crank–Nicolson time discretization schemes are coupled with the LMM for the numerical solution of two-term time-fractional model (1). MQ, inverse quadric (IQ) and inverse multiquadric (IMQ) RBFs are considered. Furthermore, one irregular puncture domain is also considered in numerical examinations.

2 Proposed methodology

Utilizing the suggested local meshless methodology, the derivatives of U ( z ¯ , t ) are approximated at the centers z ¯ h by the neighborhood of z ¯ h , { z ¯ h 1 , z ¯ h 2 , z ¯ h 3 ,..., z ¯ h n h } { z ¯ 1 , z ¯ 2 , , z ¯ N n } , n h N n , where h = 1 , 2 , , N n . In one-, two- and three-dimensional case, z ¯ = x and z ¯ = ( x , y ) , respectively.

Now in one-dimensional case, we have

(4) U ( m ) ( x h ) k = 1 n h λ k ( m ) U ( x h k ) , h = 1 , 2 , , N .

Substituting RBF ψ ( x x p ) in (4)

(5) ψ ( m ) ( x h x p ) = k = 1 n h λ h k ( m ) ψ ( x h k x p ) , p = h 1 , h 2 , , h n h .

Matrix form of (5) is

(6) ψ h 1 ( m ) ( x h ) ψ h 2 ( m ) ( x h ) ψ h n h ( m ) ( x h ) y n h ( m ) = ψ h 1 ( x h 1 ) ψ h 2 ( x h 1 ) ψ h n h ( x h 1 ) ψ h 1 ( x h 2 ) ψ h 2 ( x h 2 ) ψ h n h ( x h 2 ) ψ h 1 ( x h n h ) ψ h 2 ( x h n h ) ψ h n h ( x h n h ) A n h λ h 1 ( m ) λ h 2 ( m ) λ h n h ( m ) l n h ( m ) ,

where

ψ p ( x k ) = ψ ( x k x p ) ,   p = h 1 , h 2 , , h n h ,

for each k = i 1 , h 2 , , h n h . (6) can be written as

(7) ψ n h ( m ) = A n h λ n h ( m ) .

From (7), we obtain

(8) λ n h ( m ) = A n h 1 ψ n h ( m ) .

(4) and (8) imply

U ( m ) ( x h ) = ( λ n h ( m ) ) T U n h ,

where

U n h = U ( x h 1 ) , U ( x h 2 ) , , U ( x h n h ) T .

Find the derivatives of U ( x , y , t ) w.r.t. x and y as follows:

U x ( m ) ( x h , y h ) k = 1 n h γ k ( m ) U ( x h k , y h k ) , h = 1 , 2 , , N 2 , U y ( m ) ( x h , y h ) k =1 n h η k ( m ) U ( x h k , y h k ) , h = 1,2, , N 2 .

For γ k ( m ) and η k ( m ) ( k = 1 , 2 , , n h ), we continue as

γ n h ( m ) = A n h 1 Φ n h ( m ) ,

η n h ( m ) = A n h 1 Φ n h ( m ) .

The time derivative α 1 U ( z ¯ , t ) t α 1 is discretized by using the Caputo derivative [60] for α 1 ( 0 , 1 ) as

α 1 U ( z ¯ , t ) t α 1 = 1 Γ 1 α 1 0 t U ( z ¯ , ϑ ) ϑ t ϑ α 1 d ϑ , 0 < α 1 < 1 U ( z ¯ , t ) t , α 1 = 1 .

Consider t q = q τ , q = 0 , 1 , 2 , , Q , for [0, t ] interval and the time step size is τ . To compute time-fractional derivative term, we proceed as follows:

α 1 U ( z ¯ , t q + 1 ) t α 1 = 1 Γ ( 1 α 1 ) 0 t q + 1 U ( z ¯ , ϑ ) ϑ t q + 1 ϑ α 1 d ϑ , = 1 Γ ( 1 α 1 ) s = 0 q s τ ( s + 1 ) τ U ( z ¯ , ϑ ) ϑ t s + 1 ϑ α 1 d ϑ , 1 Γ ( 1 α 1 ) s = 0 q s τ ( s + 1 ) τ U ( z ¯ , ϑ s ) ϑ t s + 1 ϑ α 1 d ϑ .

The term U ( z ¯ , ϑ s ) ϑ is approximated as follows:

U ( z ¯ , ϑ s ) ϑ = U ( z ¯ , ϑ s + 1 ) U ( z ¯ , ϑ s ) ϑ + O ( τ ) .

Then

α 1 U ( z ¯ , t q + 1 ) t α 1 1 Γ ( 1 α 1 ) s = 0 q U ( z ¯ , t s + 1 ) U ( z ¯ , t s ) τ s τ ( s + 1 ) τ t s + 1 ϑ α 1 d ϑ , = 1 Γ ( 1 α 1 ) s = 0 q U ( z ¯ , t q + 1 s ) U ( z ¯ , t q s ) τ s τ ( s + 1 ) τ t s + 1 ϑ α 1 d ϑ , = τ α 1 Γ ( 2 α 1 ) ( U q + 1 U q ) + τ α 1 Γ ( 2 α 1 ) s = 1 q ( U q + 1 s U q s ) [ ( s + 1 ) 1 α 1 s 1 α 1 ] , q 1 τ α 1 Γ ( 2 α 1 ) ( U 1 U 0 ) , q = 0 .

Letting a 0 = τ α 1 Γ ( 2 α 1 ) and b s = ( s + 1 ) 1 α 1 s 1 α 1 , s = 0 , 1 , , q , we have

(9) α 1 U ( z ¯ , t q + 1 ) t α 1 a 0 ( U q + 1 U q ) + a 0 s = 1 q b s ( U q + 1 s U q s ) , q 1 a 0 ( U 1 U 0 ) , q = 0 .

A similar methodology is employed for fractional derivative of order α 2 .

3 Numerical discussion

In this section, we validate the applicability and accuracy of the proposed computational technique on two-term time-fractional model (1). In this computational process, the uniform and scatted nodes with regular and one irregular domain are considered. Throughout the paper, we have used three RBFs such as IQ, MQ and IMQ with shape parameter value c = 10 . The local stencil five with spatial domain [0, 2] unless mentioned explicitly. The accuracy is measured through Max-error , L 2 and RMS error norms which are defined as follows:

(10) L absolute = | U ˆ U | , L 2 = Δ h h = 1 N n U ˆ h U h 2 , Max-error = max ( L absolute ) , RMS = h = 1 N n U ˆ h U h 2 N ,

where U ˆ is the exact solution, U is the approximate solution and Δ h is the space step size.

Example 1

Consider the model equation (1) with β = 1 , γ = δ = 0 having the exact solution:

(11) U ( z ¯ , t ) = e t sin ( π x ) sin ( π y ) , z ¯ = ( x , y ) Ω .

In Example 1, numerical results are obtained by the LMM utilizing MQ, IQ and IMQ RBFs. These results are displayed in Table 1, and the error stands for Max-error . These results are computed using different values of time step size τ , fractional order α 1 = α 2 = 0.3 , nodal points N 2 = 20 and final time t = 1 and t = 5 . Furthermore, explicit, implicit and Crank–Nicolson schemes are used. It is observed from the table that the results of the LMM are in very good agreement with the exact solution and also the accuracy increases when τ decreases. The results of the Crank–Nicolson scheme utilizing IQ RBF are more accurate among other RBFs and time integration schemes. Figure 1 shows numerical results for different values of N 2 and fractional order. It can be seen that the proposed technique produced better results on courser grid and various values of α 1 = α 2 . The accuracy and stability of the meshless based on RBFs fully depend on the value of shape parameter c as well as the number of nodes N. It is observed from the literature that the accuracy and conditional number of the global meshless method are extremely sensitive to the values of c. In contrast, the recommended LMM is checked for a wide range of c (up to 200) and observed from Figure 2 that the method shows stable behavior. Also, Figure 2 (right) shows the condition number of the IQ, MQ and IMQ RBFs and noted that MQ and IMQ RBFs have less condition numbers as compared to IQ RBF. Figure 3 (left) shows the good agreement between the exact and numerical solution of the LMM using MQ RBF for N 2 = 30 , τ = 6.2500 × 10 3 , α 1 = α 2 = 0.5 , t = 1 , t = 2 and t = 3 , whereas Figure 3 (right) shows the absolute error obtained by the recommended LMM.

Table 1

Example 1, simulation results of the LMM

Max-error
Method τ t = 1 t = 5
MQ IQ IMQ MQ IQ IMQ
Explicit 1.0000 × 10−1 1.8985 × 10−2 1.8025 × 10−2 1.9894 × 10−2 1.5971 × 10−3 1.6438 × 10−3 1.2824 × 10−2
5.0000 × 10−2 9.2780 × 10−3 8.8557 × 10−3 9.6846 × 10−3 8.2371 × 10−4 8.4253 × 10−4 1.8936 × 10−3
2.5000 × 10−2 4.5880 × 10−3 4.3939 × 10−3 4.7808 × 10−3 4.1804 × 10−4 4.2641 × 10−4 6.2922 × 10−4
1.2500 × 10−2 2.2815 × 10−3 2.1902 × 10−3 2.3752 × 10−3 2.1057 × 10−4 2.1450 × 10−4 2.7806 × 10−4
6.2500 × 10−3 1.1377 × 10−3 1.0941 × 10−3 1.1838 × 10−3 1.0567 × 10−4 1.1075 × 10−4 1.3158 × 10−4
Implicit 1.0000 × 10−1 1.7500 × 10−2 1.6812 × 10−2 1.8127 × 10−2 1.7904 × 10−3 1.8238 × 10−3 4.2065 × 10−3
5.0000 × 10−2 8.9133 × 10−3 8.5647 × 10−3 9.2442 × 10−3 8.7217 × 10−4 8.8880 × 10−4 1.3934 × 10−3
2.5000 × 10−2 4.4982 × 10−3 4.3247 × 10−3 4.6693 × 10−3 4.3024 × 10−4 4.3836 × 10−4 5.8666 × 10−4
1.2500 × 10−2 2.2594 × 10−3 2.1739 × 10−3 2.3468 × 10−3 2.1364 × 10−4 2.1760 × 10−4 2.7162 × 10−4
6.2500 × 10−3 1.1323 × 10−3 1.0903 × 10−3 1.1765 × 10−3 1.0645 × 10−4 1.1169 × 10−4 1.3021 × 10−4
Crank–Nicolson 1.0000 × 10−1 3.0659 × 10−4 2.0459 × 10−4 3.9556 × 10−4 3.0957 × 10−5 1.5536 × 10−5 6.6946 × 10−4
5.0000 × 10−2 8.4249 × 10−5 4.5236 × 10−5 1.0332 × 10−4 8.4718 × 10−6 3.2714 × 10−6 8.3605 × 10−5
2.5000 × 10−2 2.4213 × 10−5 9.5438 × 10−6 2.7555 × 10−5 2.3901 × 10−6 6.4059 × 10−7 1.6480 × 10−5
1.2500 × 10−2 7.1414 × 10−6 1.8555 × 10−6 7.4599 × 10−6 6.8938 × 10−7 1.1316 × 10−7 3.9518 × 10−6
6.2500 × 10−3 2.1392 × 10−6 3.4572 × 10−7 2.1154 × 10−6 2.0203 × 10−7 9.5540 × 10−8 1.0463 × 10−6
Figure 1 
               Example 1, (left) nodes versus error norms and (right) fractional order 
                     
                        
                        
                           α
                        
                        \alpha 
                     
                  s versus error norms.
Figure 1

Example 1, (left) nodes versus error norms and (right) fractional order α s versus error norms.

Figure 2 
               Example 1, (left) c versus RMS and (right) c versus condition number.
Figure 2

Example 1, (left) c versus RMS and (right) c versus condition number.

Figure 3 
               Example 1, (left) exact versus approximate solution and (right) exact versus absolute error.
Figure 3

Example 1, (left) exact versus approximate solution and (right) exact versus absolute error.

Example 2

Consider the model equation (1) with β = 1 , γ = δ = 0 having the exact solution

(12) U ( z ¯ , t ) = e x y t sin ( π x ) sin ( π y ) , z ¯ = ( x , y ) Ω .

In Example 2, numerical results are obtained by the LMM utilizing MQ RBF. These results are displayed in Table 2, and the error stands for L 2 . These results are computed using different values of τ , fractional order α 1 = α 2 = 0.3 and α 1 = α 2 = 0.6 , N 2 = 6 , t = 1 and t = 2 . Moreover, explicit, implicit and Crank–Nicolson schemes are utilized and observed that the accuracy increases when τ decreases in this case as well. Also, the results of the Crank–Nicolson scheme are more accurate among other time integration schemes. The numerical results of Example 2 utilizing explicit, implicit and Crank–Nicolson schemes for various values of fractional orders α ’s are shown in Figure 4. It can be noted that Crank–Nicolson scheme is more effective as compared to explicit and implicit schemes. Like previous example, the accuracy and stability of the suggested method are tested in terms of shape parameter value for a wide range (up to 200) as shown in Figure 5. The MQ and IMQ RBFs are more stable in this case in comparison to IQ RBF, also the conation number of IQ RBF is also high than MQ and IMQ RBFs. One of the advantages of the meshless methods over mesh-based methods is the ease of implementation in irregular domain. We have considered a challenging irregular punctured domain which is shown in Figure 6. The numerical results of the LMM corresponding to the irregular domain are tabulated in Table 3. It can be revealed from this table that the suggested LMM gives good results in irregular domain as well. The accuracy of the MQ and IMQ is better than that of IQ RBF in this case.

Table 2

Example 2, simulation results of the LMM

L 2
Method τ t = 1 t = 1 t = 2 t = 2
α 1 = α 2 = 0.3 α 1 = α 2 = 0.6 α 1 = α 2 = 0.3 α 1 = α 2 = 0.6
Explicit 1.0000 × 10−1 5.2290 × 10−2 5.1872 × 10−2 3.7158 × 10−2 3.7523 × 10−2
5.0000 × 10−2 2.5622 × 10−2 2.5444 × 10−2 1.8438 × 10−2 1.8637 × 10−2
2.5000 × 10−2 1.2687 × 10−2 1.2612 × 10−2 9.1845 × 10−3 9.2941 × 10−3
1.2500 × 10−2 6.3133 × 10−3 6.2822 × 10−3 4.5840 × 10−3 4.6433 × 10−3
6.2500 × 10−3 3.1494 × 10−3 3.1364 × 10−3 2.2900 × 10−3 2.3216 × 10−3
Implicit 1.0000 × 10−1 4.8471 × 10−2 4.8894 × 10−2 3.6200 × 10−2 3.7120 × 10−2
5.0000 × 10−2 2.4691 × 10−2 2.4862 × 10−2 1.8215 × 10−2 1.8657 × 10−2
2.5000 × 10−2 1.2461 × 10−2 1.2528 × 10−2 9.1339 × 10−3 9.3447 × 10−3
1.2500 × 10−2 6.2589 × 10−3 6.2845 × 10−3 4.5728 × 10−3 4.6732 × 10−3
6.2500 × 10−3 3.1364 × 10−3 3.1458 × 10−3 2.2877 × 10−3 2.3357 × 10−3
Crank–Nicolson 1.0000 × 10−1 7.0289 × 10−4 3.5095 × 10−4 5.0136 × 10−4 2.5348 × 10−4
5.0000 × 10−2 1.6547 × 10−4 9.2813 × 10−5 1.1769 × 10−4 7.1868 × 10−5
2.5000 × 10−2 3.8330 × 10−5 4.9749 × 10−5 2.7198 × 10−5 3.8280 × 10−5
1.2500 × 10−2 8.6918 × 10−6 2.4637 × 10−5 6.1554 × 10−6 1.8688 × 10−5
6.2500 × 10−3 1.9200 × 10−6 1.0941 × 10−5 1.3581 × 10−6 8.2362 × 10−6
Figure 4 
               Example 2, fractional order 
                     
                        
                        
                           α
                        
                        \alpha 
                     
                  ’s versus 
                     
                        
                        
                           L
                           2
                        
                        L2
                     
                   error norms.
Figure 4

Example 2, fractional order α ’s versus L 2 error norms.

Figure 5 
               Example 2, (left) c versus RMS and (right) c versus condition number.
Figure 5

Example 2, (left) c versus RMS and (right) c versus condition number.

Figure 6 
               Computational domain.
Figure 6

Computational domain.

Table 3

Example 2, simulation results of the LMM utilizing computational domain given in Figure 6

RBFs Error norm t = 1 t = 2 t = 3
IQ Max-error 2.8503 × 10−3 6.9177 × 10−3 1.9053 × 10−2
RMS 5.3969 × 10−4 1.1019 × 10−3 2.6854 × 10−3
L2 5.8179 × 10−3 1.1879 × 10−2 2.8949 × 10−2
MQ Max-error 1.0762 × 10−4 7.4827 × 10−5 3.9556 × 10−5
RMS 1.2498 × 10−5 8.9038 × 10−6 4.8116 × 10−6
L2 1.3473 × 10−4 9.5983 × 10−5 5.1869 × 10−5
IMQ Max-error 1.6486 × 10−4 1.2021 × 10−4 6.5942 × 10−5
RMS 1.6465 × 10−5 1.2001 × 10−5 6.5818 × 10−6
L2 1.7749 × 10−4 1.2937 × 10−4 7.0953 × 10−5

Example 3

Consider the model equation (1) with β = 1 , γ = 1 , δ = π 2 having the exact solution

(13) U ( z ¯ , t ) = e t sin ( π x ) sin ( π y ) , z ¯ = ( x , y ) Ω .

The comparison of approximate solution obtained by the LMM with the exact solution for Example 3 is shown in Figure 7 using N 2 = 20 , α 1 = α 2 = 0.25 and t = 0.1 . One can see that the numerical solution is in good agreement with the exact solution, whereas the absolute errors are shown in Figure 8.

Figure 7 
               Example 3, (left) exact solution and (right) numerical solution.
Figure 7

Example 3, (left) exact solution and (right) numerical solution.

Figure 8 
               Example 3, absolute error at (left) 
                     
                        
                        
                           t
                           =
                           0.01
                        
                        t=0.01
                     
                   and (right) 
                     
                        
                        
                           t
                           =
                           0.05
                        
                        t=0.05
                     
                  .
Figure 8

Example 3, absolute error at (left) t = 0.01 and (right) t = 0.05 .

4 Conclusion

The LMM based on RBFs is utilized for two-term time-fractional Sobolev equations. Three types of RBFs are used. The proposed algorithm framework leads to a sparse linear system of equations and approximated the solution with good accuracy. To check the accuracy of the proposed scheme, several examples have been considered using rectangular and one irregular computational domain. The numerical results demonstrate that the algorithm is reliable, effective and gives accurate solution. Considering the current work, we can say that the proposed strategy is amazing, powerful and successful instrument for the numerical solution of multi-term time-fractional PDEs, so it can be applied to a wide scope of complex problems that emerge in natural sciences and engineering.



  1. Funding: This research was supported by the National Natural Science Foundation of China (Grant Nos. 11971142, 11871202, 61673169, 11701176, 11626101 and 11601485).

  2. Data Availability: Data will be provided on request to the second author.

References

[1] Prakash A, Goyal M, Baskonus HM, Gupta S. A reliable hybrid numerical method for a time dependent vibration model of arbitrary order. AIMS Math. 2020;5(2):979–1000.10.3934/math.2020068Search in Google Scholar

[2] Al-Ghafri K, Rezazadeh H. Solitons and other solutions of (3 + 1)-dimensional space–time fractional modified KdV–Zakharov–Kuznetsov equation. Appl Math Nonlinear Sci. 2019;4(2):289–304.10.2478/AMNS.2019.2.00026Search in Google Scholar

[3] Siraj-ul-Islam IA. A comparative analysis of local meshless formulation for multi-asset option models. Eng Anal Bound Elem. 2016;65:159–76.10.1016/j.enganabound.2015.12.020Search in Google Scholar

[4] Santra SS, Bazighifan O, Ahmad H, Chu Y-M. Second-order differential equation: Oscillation theorems and applications. Math Probl Eng. 2020;2020:1–6.10.1155/2020/8820066Search in Google Scholar

[5] İlhan E, Kymaz İO. A generalization of truncated M-fractional derivative and applications to fractional differential equations. Appl Math Nonlinear Sci. 2020;5(1):171–88.10.2478/amns.2020.1.00016Search in Google Scholar

[6] Zhang Y, Cattani C, Yang X-J. Local fractional homotopy perturbation method for solving non-homogeneous heat conduction equations in fractal domains. Entropy. 2015;17(10):6753–64.10.3390/e17106753Search in Google Scholar

[7] Wang P, Li S, Su H. Stabilization of complex-valued stochastic functional differential systems on networks via impulsive control. Chaos, Solitons Fractals. 2020;133:109561.10.1016/j.chaos.2019.109561Search in Google Scholar

[8] Gao W, Veeresha P, Baskonus HM, Prakasha D, Kumar P. A new study of unreported cases of 2019-nCOV epidemic outbreaks. Chaos, Solitons Fractals. 2020;138:109929.10.1016/j.chaos.2020.109929Search in Google Scholar PubMed PubMed Central

[9] Odibat Z, Baleanu D. Numerical simulation of initial value problems with generalized Caputo-type fractional derivatives. Appl Numer Math. 2020;156:94–105.10.1016/j.apnum.2020.04.015Search in Google Scholar

[10] Abdullaev OK. Some problems for the degenerate mixed type equation involving Caputo and Atangana-Baleanu operators fractional order. Prog Fract Differ Appl. 2020;6(2):104–14.Search in Google Scholar

[11] Al-Refai M. Maximum principles for nonlinear fractional differential equations in reliable space. Prog Fract Differ Appl. 2020;6(2):95–99.10.18576/pfda/060202Search in Google Scholar

[12] Jajarmi A, Baleanu D. On the fractional optimal control problems with a general derivative operator. Asian J Control. 2019;21:asjc.2282. 10.1002/asjc.2282 Search in Google Scholar

[13] Baleanu D, Jajarmi A, Sajjadi SS, Asad JH. The fractional features of a harmonic oscillator with position-dependent mass. Commun Theor Phys. 2020;72(5):055002.10.1088/1572-9494/ab7700Search in Google Scholar

[14] Abouelregal AE, Ahmad H. Thermodynamic modeling of viscoelastic thin rotating microbeam based on non-Fourier heat conduction. Appl Math Model. 2021;91:973–88.10.1016/j.apm.2020.10.006Search in Google Scholar

[15] Sajjadi SS, Baleanu D, Jajarmi A, Pirouz HM. A new adaptive synchronization and hyperchaos control of a biological snap oscillator. Chaos, Solitons & Fractals. 2020;138:109919.10.1016/j.chaos.2020.109919Search in Google Scholar

[16] Jajarmi A, Baleanu D. A new iterative method for the numerical solution of high-order non-linear fractional boundary value problems. Front Phys. 2020;8:220.10.3389/fphy.2020.00220Search in Google Scholar

[17] Baleanu D, Ghanbari B, Asad JH, Jajarmi A, Pirouz HM. Planar system-masses in an equilateral triangle: Numerical study within fractional calculus. CMES-Comput Modeling Eng & Sci. 2020;124(3):953–68.10.32604/cmes.2020.010236Search in Google Scholar

[18] Rezapour S, Mohammadi H, Jajarmi A. A new mathematical model for Zika virus transmission. Adv Differ Equ. 2020;2020:589.10.1186/s13662-020-03044-7Search in Google Scholar

[19] Rizvi STR, Afzal I, Ali K. Chirped optical solitons for Triki–Biswas equation. Mod Phys Lett B. 2019;33(22):1950264.10.1142/S0217984919502646Search in Google Scholar

[20] Attia RA, Lu D, Khater MMA. Chaos and relativistic energy-momentum of the nonlinear time fractional Duffing equation. Math Comput Appl. 2019;24(1):10.10.3390/mca24010010Search in Google Scholar

[21] Ahmad H, Khan TA, Stanimirovic PS, Ahmad I. Modified variational iteration technique for the numerical solution of fifth order kdv-type equations. J Appl Comput Mech. 2020;6:1220–7.Search in Google Scholar

[22] Ahmad H, Khan TA, Stanimirović PS, Chu Y-M, Ahmad I. Modified variational iteration algorithm-II: convergence and applications to diffusion models. Complexity. 2020;2020:1–14.10.1155/2020/8841718Search in Google Scholar

[23] Yokus A, Durur H, Ahmad H, Yao S-W. Construction of different types analytic solutions for the Zhiber-Shabat equation. Mathematics. 2020;8(6):908.10.3390/math8060908Search in Google Scholar

[24] Noor M., Rafiq M, Khan S-U-D, Qureshi M., Kamran M, Khan S-U-D, et al. Analytical solutions to contact problem with fractional derivatives in the sense of Caputo. Therm Sci. 2020;24(Suppl. 1):313–23.10.2298/TSCI20S1313NSearch in Google Scholar

[25] Yokus A, Durur H, Ahmad H. Hyperbolic type solutions for the couple Boiti–Leon–Pempinelli system. Facta Universitatis, Series: Math Inform. 2020;35(2):523–31.10.22190/FUMI2002523YSearch in Google Scholar

[26] Shah NA, Ahmad I, Omar B, Abouelregal AE, Ahmad H. Multistage optimal homotopy asymptotic method for the nonlinear Riccati ordinary differential equation in nonlinear physics. Appl Math & Inf Sci. 2020;14(6):1–7.Search in Google Scholar

[27] Wang F, Khan A, Ayaz M, Ahmad I, Nawaz R, Gul N. Formation of intermetallic phases in ion implantation. J Math. 2020;2020:1–5.10.1155/2020/8875976Search in Google Scholar

[28] Ahmad I, Siraj-ul-Islam, Mehnaz, Zaman S. Local meshless differential quadrature collocation method for time-fractional PDEs. Discret Cont Dyn Sys-S. 2018;13:2641–54.10.3934/dcdss.2020223Search in Google Scholar

[29] Ahmad H, Akgül A, Khan TA, Stanimirović PS, Chu Y-M. New perspective on the conventional solutions of the nonlinear time-fractional partial differential equations. Complexity. 2020;2020:1–10.10.1155/2020/8829017Search in Google Scholar

[30] Ahmad H, Khan TA, Yao S-W. An efficient approach for the numerical solution of fifth-order KdV equations. Open Math. 2020;18(1):738–48.10.1515/math-2020-0036Search in Google Scholar

[31] Abouelregal A, Ahmad H. A modified thermoelastic fractional heat conduction model with a single-lag and two different fractional-orders. J Appl Comput Mech. 10.22055/JACM.2020.33790.2287.Search in Google Scholar

[32] Abo-Dahab S, Abouelregal AE, Ahmad H. Fractional heat conduction model with phase lags for a half-space with thermal conductivity and temperature dependent. Math Methods Appl Sci. 2020:mma.6614.10.1002/mma.6614Search in Google Scholar

[33] Ahmad H, Seadawy AR, Khan TA. Study on numerical solution of dispersive water wave phenomena by using a reliable modification of variational iteration algorithm. Math Comput Simul. 2020;177:13–23.10.1016/j.matcom.2020.04.005Search in Google Scholar

[34] Akgül A, Ahmad H. Reproducing kernel method for Fangzhu’s oscillator for water collection from air. Math Methods Appl Sci. 2020. 10.1002/mma.6853.Search in Google Scholar

[35] Ahmad H, Seadawy AR, Khan TA, Thounthong P. Analytic approximate solutions for some nonlinear parabolic dynamical wave equations. J Taibah Univ Sci. 2020;14(1):346–58.10.1080/16583655.2020.1741943Search in Google Scholar

[36] Shakeel M, Hussain I, Ahmad H, Ahmad I, Thounthong P, Zhang Y-F. Meshless technique for the solution of time-fractional partial differential equations having real-world applications. J Funct Spaces. 2020;2020:1–17.10.1155/2020/8898309Search in Google Scholar

[37] Ahmad I, Ahmad H, Thounthong P, Chu Y-M, Cesarano C. Solution of multi-term time-fractional PDE models arising in mathematical biology and physics by local meshless method. Symmetry. 2020;12(7):1195.10.3390/sym12071195Search in Google Scholar

[38] Srivastava MH, Ahmad H, Ahmad I, Thounthong P, Khan NM. Numerical simulation of three-dimensional fractional-order convection-diffusion PDEs by a local meshless method. Therm Sci. 2020:210.Search in Google Scholar

[39] Siraj-ul-Islam IA. Local meshless method for PDEs arising from models of wound healing. Appl Math Model. 2017;48:688–710.10.1016/j.apm.2017.04.015Search in Google Scholar

[40] Khan MN, Siraj-ul-Islam, Hussain I, Ahmad I, Ahmad H. A local meshless method for the numerical solution of space-dependent inverse heat problems. Math Methods Appl Sci. 2020. 10.1002/mma.6439.Search in Google Scholar

[41] Nawaz M, Ahmad I, Ahmad H. A radial basis function collocation method for space-dependent inverse heat problems. J Appl Comput Mech. 2020;6(Special Issue):1187–1199. 10.22055/jacm.2020.32999.2123.Search in Google Scholar

[42] Thounthong P, Khan MN, Hussain I, Ahmad I, Kumam P. Symmetric radial basis function method for simulation of elliptic partial differential equations. Mathematics. 2018;6(12):327.10.3390/math6120327Search in Google Scholar

[43] Ahmad I, Riaz M, Ayaz M, Arif M, Islam S, Kumam P. Numerical simulation of partial differential equations via local meshless method. Symmetry. 2019;11:257.10.3390/sym11020257Search in Google Scholar

[44] Ahmad I, Ahmad H, Inc M, Yao S-W, Almohsen B. Application of local meshless method for the solution of two term time fractional-order multi-dimensional PDE arising in heat and mass transfer. Therm Sci. 2020;24(Suppl. 1):95–105.10.2298/TSCI20S1095ASearch in Google Scholar

[45] Inc M, Khan MN, Ahmad I, Yao S-W, Ahmad H, Thounthong P. Analysing time-fractional exotic options via efficient local meshless method. Results Phys. 2020;19:103385.10.1016/j.rinp.2020.103385Search in Google Scholar

[46] Hardy RL. Multiquadric equations of topography and other irregular surfaces. J Geophys Res. 1971;76(8):1905–15.10.1029/JB076i008p01905Search in Google Scholar

[47] Franke R. Scattered data interpolation: tests of some methods. Math Computation. 1982;38(157):181–200.Search in Google Scholar

[48] Kansa EJ. Multiquadrics A scattered data approximation scheme with applications to computational fluid-dynamics-II solutions to parabolic, hyperbolic and elliptic partial differential equations. Comput Math Appl. 1990;19(8–9):147–61.10.1016/0898-1221(90)90271-KSearch in Google Scholar

[49] Franke C, Schaback R. Convergence order estimates of meshless collocation methods using radial basis functions. Adv Comput Math. 1998;8(4):381–99.10.1023/A:1018916902176Search in Google Scholar

[50] Madych W, Nelson S. Multivariate interpolation and conditionally positive definite functions. II. Math Comput. 1990;54(189):211–30.10.1090/S0025-5718-1990-0993931-7Search in Google Scholar

[51] Fasshauer GE. Meshfree approximation methods with MATLAB. Vol. 6. Singapore: World Scientific; 2007.10.1142/6437Search in Google Scholar

[52] Fasshauer GE. Newton iteration with multiquadrics for the solution of nonlinear PDEs. Comput Math Appl. 2002;43(3–5):423–38.10.1016/S0898-1221(01)00296-6Search in Google Scholar

[53] Rippa S. An algorithm for selecting a good value for the parameter c in radial basis function interpolation. Adv Comput Math. 1999;11(2–3):193–210.10.1023/A:1018975909870Search in Google Scholar

[54] Fasshauer GE, Zhang JG. On choosing optimal shape parameters for RBF approximation. Numer Algorithms. 2007;45(1–4):345–68.10.1007/s11075-007-9072-8Search in Google Scholar

[55] Uddin M. On the selection of a good value of shape parameter in solving time-dependent partial differential equations using RBF approximation method. Appl Math Model. 2014;38(1):135–44.10.1016/j.apm.2013.05.060Search in Google Scholar

[56] Cavoretto R, De Rossi A. A two-stage adaptive scheme based on RBF collocation for solving elliptic PDEs. Comput Math Appl. 2020;79:3206–22.10.1016/j.camwa.2020.01.018Search in Google Scholar

[57] Biazar J, Hosami M. An interval for the shape parameter in radial basis function approximation. Appl Math Comput. 2017;315:131–49.10.1016/j.amc.2017.07.047Search in Google Scholar

[58] Ahmad I, Siraj-ul-Islam, Khaliq AQM. Local RBF method for multi-dimensional partial differential equations. Comput Math Appl. 2017;74:292–324.10.1016/j.camwa.2017.04.026Search in Google Scholar

[59] Shu C. Differential quadrature and its application in engineering. London: Springer-Verlag; 2000.10.1007/978-1-4471-0407-0Search in Google Scholar

[60] Caputo M. Linear models of dissipation whose Q is almost frequency independent. Geophys J Int. 1967;13(5):529–39.10.4401/ag-5051Search in Google Scholar

Received: 2020-11-01
Revised: 2020-11-28
Accepted: 2020-11-30
Published Online: 2020-12-23

© 2020 Jun-Feng Li et al., published by De Gruyter

This work is licensed under the Creative Commons Attribution 4.0 International License.

Downloaded on 23.4.2024 from https://www.degruyter.com/document/doi/10.1515/phys-2020-0222/html
Scroll to top button