2019
DOI: 10.1080/00207160.2019.1612053
|View full text |Cite
|
Sign up to set email alerts
|

An efficient computational technique based on cubic trigonometric B-splines for time fractional Burgers' equation

Abstract: This paper presents a linear computational technique based on cubic trigonometric cubic B-splines for time fractional burgers' equation. The nonlinear advection term is approximated by a new linearization technique which is very efficient and significantly reduces the computational cost. The usual finite difference formulation is used to approximate the Caputo time fractional derivative while the derivative in space is discretized using cubic trigonometric B-spline functions. The method is proved to be globall… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

1
29
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
7

Relationship

3
4

Authors

Journals

citations
Cited by 35 publications
(30 citation statements)
references
References 38 publications
1
29
0
Order By: Relevance
“…Various numerical methods based on spline functions have also been employed by researchers in pursue of reliable solutions for fractional-order differential equations [29][30][31]. The B-spline functions provide decent approximations in contrast with rest of numerical schemes due to the nominal, compact support and C 2 continuity [32].…”
Section: Introductionmentioning
confidence: 99%
“…Various numerical methods based on spline functions have also been employed by researchers in pursue of reliable solutions for fractional-order differential equations [29][30][31]. The B-spline functions provide decent approximations in contrast with rest of numerical schemes due to the nominal, compact support and C 2 continuity [32].…”
Section: Introductionmentioning
confidence: 99%
“…where d i (t) are unknown functions to be determined and TB 3 i (x) 20,30,31 are twice differentiable cubic trigonometric basis functions given by…”
Section: Derivation Of the Schemementioning
confidence: 99%
“…The solution domain a ≤ x ≤ b is uniformly partitioned by knots x j into M subintervals [ x j , x j + 1 ] of equal length h , j = 0,1,2, … , M − 1, where a = x 0 < x 1 < … < x n − 1 < x M = b . Our scheme for solving () requires approximate solution U ( x , t ) to the exact solution u ( x , t ) in the following form: 25‐29 Ufalse(x,tfalse)=truei=1N1difalse(tfalse)TBi3false(xfalse), where d i ( t ) are unknown functions to be determined and TBi3false(xfalse) 20,30,31 are twice differentiable cubic trigonometric basis functions given by TBi3false(xfalse)=1w{left leftarrayy3(xi),arrayx[xi,xi+1],arrayy(xi)(y(xi)z(xi+2)+z(xi+3)y(xi+1))+z(xi+4)y2(xi+1),arrayx[xi+1,xi+2],array...…”
Section: Derivation Of the Schemementioning
confidence: 99%
“…There are a large number of studies related to B-splines for the solutions of FPDEs but only limited studies dealt to the solution of nonlinear KG equations. [25][26][27][28][29] Yaseen et al 30 solved time fractional diffusion wave equation numerically using trigonometric B-splines technique. Fractional Predator-Prey models have been numerically solved by Pitolli 31 using fractional Bspline approach.…”
Section: Introductionmentioning
confidence: 99%