Abstract
In this work, we introduce an efficient scheme for the numerical solution of some Boundary and Initial Value Problems (BVPs-IVPs). By using an operational matrix, which was obtained from the first kind of Chebyshev polynomials, we construct the algebraic equivalent representation of the problem. We will show that this representation of BVPs and IVPs can be represented by a sparse matrix with sufficient precision. Sparse matrices that store data containing a large number of zero-valued elements have several advantages, such as saving a significant amount of memory and speeding up the processing of that data. In addition, we provide the convergence analysis and the error estimation of the suggested scheme. Finally, some numerical results are utilized to demonstrate the validity and applicability of the proposed technique, and also the presented algorithm is applied to solve an engineering problem which is used in a beam on elastic foundation.
Subject
Physics and Astronomy (miscellaneous),General Mathematics,Chemistry (miscellaneous),Computer Science (miscellaneous)
Reference28 articles.
1. Ordinary and Partial Differential Equations with Special Functions, Fourier Series, and Boundary Value Problems;Agarwal,2009
2. On numerical solutions of time-fraction generalized Hirota Satsuma coupled KdV equation
3. An application of improved Bernoulli sub-equation function method to the nonlinear time-fractional Burgers equation;Bulut;Turk. J. Math. Comput. Sci.,2016
4. Numerical Methods for Engineers;Chapra,2010
5. Numerical solution of Painleve' equation by Chebyshev polynomials
Cited by
16 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献