Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
140 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

An Efficient Computational Technique based on Cubic Trigonometric B-splines for Time Fractional Burgers' Equation (1709.01336v1)

Published 5 Sep 2017 in math.NA

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 globally unconditionally stable. To measure the accuracy of the solution, a convergence analysis is also provided. A convergence analysis is Computational experiments are performed to further establish the accuracy and stability of the method. Numerical results are compared with those obtained by a scheme based on parametric spline functions. The comparison reveal that the proposed scheme is quite accurate and effective.

Summary

We haven't generated a summary for this paper yet.