Abstract

The principal aim of this paper is to analyze and implement two numerical algorithms for solving two kinds of space fractional linear advection-dispersion problems. The proposed numerical solutions are spectral and they are built on assuming the approximate solutions to be certain double shifted Tchebyshev basis. The two typical collocation and Petrov-Galerkin spectral methods are applied to obtain the desired numerical solutions. The special feature of the two proposed methods is that their applications enable one to reduce, through integration, the fractional problem under investigation into linear systems of algebraic equations, which can be efficiently solved via any suitable solver. The convergence and error analysis of the double shifted Tchebyshev basis are carefully investigated, aiming to illustrate the correctness and feasibility of the proposed double expansion. Finally, the efficiency, applicability, and high accuracy of the suggested algorithms are demonstrated by presenting some numerical examples accompanied with comparisons with some other existing techniques discussed in the literature.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call