2020
DOI: 10.1002/num.22492
|View full text |Cite
|
Sign up to set email alerts
|

A robust scheme based on novel‐operational matrices for some classes of time‐fractional nonlinear problems arising in mechanics and mathematical physics

Abstract: In this paper, we present a novel approach based on shifted Gegenbauer wavelets to attain approximate solutions of some classed of time-fractional nonlinear problems. First, we present the approximation of a function of two variables u(x,t) with help of shifted Gegenbauer wavelets and then some novel operational matrices are proposed with the help of piecewise functions to investigate the positive integer derivative (D x and D t), fractional-order derivative (P x and P t), fractional-order integration (J x and… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
7
0

Year Published

2020
2020
2021
2021

Publication Types

Select...
6

Relationship

5
1

Authors

Journals

citations
Cited by 24 publications
(7 citation statements)
references
References 64 publications
(165 reference statements)
0
7
0
Order By: Relevance
“…In order to covert nonlinear time‐fractional telegraph model into a linear form, we apply the well‐known Picard iterative Scheme [38, 39] as, ()0CDt2α+μ1()boldx,t0CDtα+μ2()boldx,tur+1()boldx,t=[]μ3()boldx,t2x2+μ4()boldx,t2y2+μ5()boldx,t2z2ur+1()boldx,t+F()ur+ϕ()boldx,t, for r ≥ 0. When r = 0, we usually select u 0 = u ( x , 0) + tu t ( x , 0).…”
Section: Solution Procedures Via Lfsm Sdm and Fnmmentioning
confidence: 99%
“…In order to covert nonlinear time‐fractional telegraph model into a linear form, we apply the well‐known Picard iterative Scheme [38, 39] as, ()0CDt2α+μ1()boldx,t0CDtα+μ2()boldx,tur+1()boldx,t=[]μ3()boldx,t2x2+μ4()boldx,t2y2+μ5()boldx,t2z2ur+1()boldx,t+F()ur+ϕ()boldx,t, for r ≥ 0. When r = 0, we usually select u 0 = u ( x , 0) + tu t ( x , 0).…”
Section: Solution Procedures Via Lfsm Sdm and Fnmmentioning
confidence: 99%
“…Associated with boundary and initial conditions: ux,tt=0=ufalse˜1()x,utx,tt=0=ufalse˜2()x, ux,tx=0=ufalse˜3()t,ux,tx=L=ufalse˜4()t. The problem with conditions given in Equations – via Picard technique 55 can be modified as follows: D0Ctνus+1()x,t+D0Ctν1uxs+1()x,t+D0Cxν2us+1()x,t+Huskfalse˜=trueA˜()x,t. where truep˜,truek˜>1+,0<v1+1 and 1 < v ∈ ℚ + ≤ 2 are the order of the derivative of the problem understudy and trueA˜()x,...…”
Section: Solution Procedures Via Pcmmentioning
confidence: 99%
“…Firstly, we will apply the Picard‐iterative technique [34] and the problem understudy reduces to following iterative scheme (see Equation (14)), where s ∈ Z + is representing the iterations while the initial guess for the said iterative scheme can be chosen via expression (15): v1tv1usfalse(x,tfalse)=2v2x2v2usfalse(x,tfalse)+2v3y2v3usfalse(x,tfalse)+ϵusfalse(x,tfalse)+Ffalse(us1false(x,tfalse)false)+Gfalse(x,tfalse), u0false(x,tfalse)=ufalse(x,0false). …”
Section: Pcpm For Higher‐dimensional Problemsmentioning
confidence: 99%