Due to the nonlinearity and fractional order of equation, there are a few efficient numerical methods in the literature with stability and convergence analysis for the solution of nonlinear time… Click to show full abstract
Due to the nonlinearity and fractional order of equation, there are a few efficient numerical methods in the literature with stability and convergence analysis for the solution of nonlinear time fractional partial differential equations. The aim of this paper is to construct and analyze an efficient numerical method for the solution of time fractional Burgers equation. The proposed method is based on a finite difference scheme in time and the Chebyshev spectral collocation method in space. We discuss the stability and convergence of the proposed method and show that the method is unconditionally stable and convergent with order $${\mathcal {O}}(\tau ^2+N^{-s})$$O(τ2+N-s) where $$\tau $$τ, N, and s are time step size, number of collocation points, and regularity of exact solution, respectively. The numerical results are reported in terms of accuracy, computational order, and CPU time to confirm the efficiency of proposed method. It is illustrated that the numerical results are in good agreement with the theoretical ones.
               
Click one of the above tabs to view related content.