A Hermite collocation method for the approximate solutions of high‐order linear Fredholm integro‐differential equations

In this study, a Hermite matrix method is presented to solve high‐order linear Fredholm integro‐differential equations with variable coefficients under the mixed conditions in terms of the Hermite polynomials. The proposed method converts the equation and its conditions to matrix equations, which correspond to a system of linear algebraic equations with unknown Hermite coefficients, by means of collocation points on a finite interval. Then, by solving the matrix equation, the Hermite coefficients and the polynomial approach are obtained. Also, examples that illustrate the pertinent features of the method are presented; the accuracy of the solutions and the error analysis are performed. © 2010 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 27: 1707–1721, 2011     

Efficient Spectral Collocation Algorithm for a Two-Sided Space Fractional Boussinesq Equation with Non-local Conditions

A spectral shifted Legendre Gauss–Lobatto collocation method is developed and analyzed to solve numerically one-dimensional two-sided space fractional Boussinesq (SFB) equation with non-classical boundary conditions. The method depends basically on the fact that an expansion in a series of shifted Legendre polynomials \({P_{L,n}(x), \ x\in[0,L]}\) is assumed, for the function and its space-fractional derivatives occurring in the two-sided SFB equation. The Legendre–Gauss–Lobatto quadrature rule is established to treat the non-local conservation conditions, and then the problem with its non-local conservation conditions is reduced to a system of ordinary differential equations (ODEs) in time. Thereby, the expansion coefficients are then determined by reducing the two-sided SFB with its boundary and initial conditions to a system of ODEs for these coefficients. This system may be solved numerically in a step-by-step manner by using implicit Runge–Kutta method of order four. Numerical results indicating the high accuracy and effectiveness of this algorithm are presented.     

An exponential matrix method for solving systems of linear differential equations

This paper presents an exponential matrix method for the solutions of systems of high‐order linear differential equations with variable coefficients. The problem is considered with the mixed conditions. On the basis of the method, the matrix forms of exponential functions and their derivatives are constructed, and then by substituting the collocation points into the matrix forms, the fundamental matrix equation is formed. This matrix equation corresponds to a system of linear algebraic equations. By solving this system, the unknown coefficients are determined and thus the approximate solutions are obtained. Also, an error estimation based on the residual functions is presented for the method. The approximate solutions are improved by using this error estimation. To demonstrate the efficiency of the method, some numerical examples are given and the comparisons are made with the results of other methods. Copyright © 2012 John Wiley & Sons, Ltd.     

Legendre spectral method for the fractional Bratu problem

In this paper, the Legendre spectral collocation method (LSCM) is applied for the solution of the fractional Bratu's equation. It shows the high accuracy and low computational cost of the LSCM compared with some other numerical methods. The fractional Bratu differential equation is transformed into a nonlinear system of algebraic equations for the unknown Legendre coefficients and solved with some spectral collocation methods. Some illustrative examples are also given to show the validity and applicability of this method, and the obtained results are compared with the existing studies to highlight its high efficiency and neglectable error.     

A New Approach for Solving a Class of Delay Fractional Partial Differential Equations

In this article, a new numerical approach has been proposed for solving a class of delay time-fractional partial differential equations. The approximate solutions of these equations are considered as linear combinations of Müntz–Legendre polynomials with unknown coefficients. Operational matrix of fractional differentiation is provided to accelerate computations of the proposed method. Using Padé approximation and two-sided Laplace transformations, the mentioned delay fractional partial differential equations will be transformed to a sequence of fractional partial differential equations without delay. The localization process is based on the space-time collocation in some appropriate points to reduce the fractional partial differential equations into the associated system of algebraic equations which can be solved by some robust iterative solvers. Some numerical examples are also given to confirm the accuracy of the presented numerical scheme. Our results approved decisive preference of the Müntz–Legendre polynomials with respect to the Legendre polynomials.     

Two‐dimensional shifted Legendre polynomial collocation method for electromagnetic waves in dielectric media via almost operational matrices

In this paper, a numerical solution of fractional partial differential equations (FPDEs) for electromagnetic waves in dielectric media will be discussed. For the solution of FPDEs, we developed a numerical collocation method using an algorithm based on two‐dimensional shifted Legendre polynomials approximation, which is proposed for electromagnetic waves in dielectric media. By implementing the partial Riemann–Liouville fractional derivative operators, two‐dimensional shifted Legendre polynomials approximation and its operational matrix along with collocation method are used to convert FPDEs first into weakly singular fractional partial integro‐differential equations and then converted weakly singular fractional partial integro‐differential equations into system of algebraic equation. Some results concerning the convergence analysis and error analysis are obtained. Illustrative examples are included to demonstrate the validity and applicability of the technique. Copyright © 2017 John Wiley & Sons, Ltd.     

A Legendre–Galerkin Chebyshev collocation method for the Burgers equation with a random perturbation on boundary condition

In the paper, we apply the generalized polynomial chaos expansion and spectral methods to the Burgers equation with a random perturbation on its left boundary condition. Firstly, the stochastic Galerkin method combined with the Legendre–Galerkin Chebyshev collocation scheme is adopted, which means that the original equation is transformed to the deterministic nonlinear equations by the stochastic Galerkin method and the Legendre–Galerkin Chebyshev collocation scheme is used to deal with the resulting nonlinear equations. Secondly, the stochastic Legendre–Galerkin Chebyshev collocation scheme is developed for solving the stochastic Burgers equation; that is, the stochastic Legendre–Galerkin method is used to discrete the random variable meanwhile the nonlinear term is interpolated through the Chebyshev–Gauss points. Then a set of deterministic linear equations can be obtained, which is in contrast to the other existing methods for the stochastic Burgers equation. The mean square convergence of the former method is analyzed. Numerical experiments are performed to show the effectiveness of our two methods. Both methods provide alternative approaches to deal with the stochastic differential equations with nonlinear terms.     

A collocation approach for solving linear complex differential equations in rectangular domains

In this paper, a collocation method is presented to find the approximate solution of high‐order linear complex differential equations in rectangular domain. By using collocation points defined in a rectangular domain and the Bessel polynomials, this method transforms the linear complex differential equations into a matrix equation. The matrix equation corresponds to a system of linear equations with the unknown Bessel coefficients. The proposed method gives the analytic solution when the exact solutions are polynomials. Numerical examples are included to demonstrate the validity and applicability of the technique and the comparisons are made with existing results. The results show the efficiency and accuracy of the present work. All of the numerical computations have been performed on a computer using a program written in MATLAB v7.6.0 (R2008a). Copyright © 2012 John Wiley & Sons, Ltd.     

Legendre Wavelets Direct Method for the Numerical Solution of Time-Fractional Order Telegraph Equations

In this paper, a Legendre wavelet collocation method for solving a class of time-fractional order telegraph equation defined by Caputo sense is discussed. Fractional integral formula of a single Legendre wavelet in the Riemann–Liouville sense is derived by means of shifted Legendre polynomials. The main characteristic behind this approach is that it reduces equations to those of solving a system of algebraic equations which greatly simplifies the problem. The convergence analysis and error analysis of the proposed method are investigated. Several examples are presented to show the applicability and accuracy of the proposed method.     

Numerical solutions of integro-differential equations and application of a population model with an improved Legendre method

In this paper, an improved Legendre collocation method is presented for a class of integro-differential equations which involves a population model. This improvement is made by using the residual function of the operator equation. The error differential equation, gained by residual function, has been solved by the Legendre collocation method (LCM). By summing the approximate solution of the error differential equation with the approximate solution of the problem, a better approximate solution is obtained. We give the illustrative examples to demonstrate the efficiency of the method. Also we compare our results with the results of the known some methods. In addition, an application of the population model is made.     

A new Chebyshev polynomial approximation for solving delay differential equations

The purpose of this study is to give a Chebyshev polynomial approximation for the solution of mth-order linear delay differential equations with variable coefficients under the mixed conditions. For this purpose, a new Chebyshev collocation method is introduced. This method is based on taking the truncated Chebyshev expansion of the function in the delay differential equations. Hence, the resulting matrix equation can be solved, and the unknown Chebyshev coefficients can be found approximately. In addition, examples that illustrate the pertinent features of the method are presented, and the results of this investigation are discussed.     

Numerical solution of multiterm variable‐order fractional differential equations via shifted Legendre polynomials

In this paper, shifted Legendre polynomials will be used for constructing the numerical solution for a class of multiterm variable‐order fractional differential equations. In the proposed method, the shifted Legendre operational matrix of the fractional variable‐order derivatives will be investigated. The fundamental problem is reduced to an algebraic system of equations using the constructed matrix and the collocation technique, which can be solved numerically. The error estimate of the proposed method is investigated. Some numerical examples are presented to prove the applicability, generality, and accuracy of the suggested method.     

An efficient pseudo‐spectral Legendre–Galerkin method for solving a nonlinear partial integro‐differential equation arising in population dynamics

The pseudo‐spectral Legendre–Galerkin method (PS‐LGM) is applied to solve a nonlinear partial integro‐differential equation arising in population dynamics. This equation is a competition model in which similar individuals are competing for the same resources. It is a kind of reaction–diffusion equation with integral term corresponding to nonlocal consumption of resources. The proposed method is based on the Legendre–Galerkin formulation for the linear terms and interpolation operator at the Chebyshev–Gauss–Lobatto (CGL) points for the nonlinear terms. Also, the integral term, which is a kind of convolution, is directly computed by a fast and accurate method based on CGL interpolation operator, and thus, the use of any quadrature formula in its computation is avoided. The main difference of the PS‐LGM presented in the current paper with the classic LGM is in treating the nonlinear terms and imposing boundary conditions. Indeed, in the PS‐LGM, the nonlinear terms are efficiently handled using the CGL points, and also the boundary conditions are imposed strongly as collocation methods. Combination of the PS‐LGM with a semi‐implicit time integration method such as second‐order backward differentiation formula and Adams‐Bashforth method leads to reducing the complexity of computations and obtaining a linear algebraic system of equations with banded coefficient matrix. The desired equation is considered on one and two‐dimensional spatial domains. Efficiency, accuracy, and convergence of the proposed method are demonstrated numerically in both cases. Copyright © 2012 John Wiley & Sons, Ltd.     

Chebyshev polynomial approximation for high‐order partial differential equations with complicated conditions

In this article, a new method is presented for the solution of high‐order linear partial differential equations (PDEs) with variable coefficients under the most general conditions. The method is based on the approximation by the truncated double Chebyshev series. PDE and conditions are transformed into the matrix equations, which corresponds to a system of linear algebraic equations with the unknown Chebyshev coefficients, via Chebyshev collocation points. Combining these matrix equations and then solving the system yields the Chebyshev coefficients of the solution function. Some numerical results are included to demonstrate the validity and applicability of the method. © 2008 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2009     

A new Euler matrix method for solving systems of linear Volterra integral equations with variable coefficients

This article develops an efficient solver based on collocation points for solving numerically a system of linear Volterra integral equations (VIEs) with variable coefficients. By using the Euler polynomials and the collocation points, this method transforms the system of linear VIEs into the matrix equation. The matrix equation corresponds to a system of linear equations with the unknown Euler coefficients. A small number of Euler polynomials is needed to obtain a satisfactory result. Numerical results with comparisons are given to confirm the reliability of the proposed method for solving VIEs with variable coefficients.     

A collocation method based on Bernoulli operational matrix for numerical solution of generalized pantograph equation

This paper presents a direct solution technique for solving the generalized pantograph equation with variable coefficients subject to initial conditions, using a collocation method based on Bernoulli operational matrix of derivatives. Only small dimension of Bernoulli operational matrix is needed to obtain a satisfactory result. Numerical results with comparisons are given to confirm the reliability of the proposed method for generalized pantograph equations.     

The solution of high-order nonlinear ordinary differential equations by Chebyshev Series

By the use of the Chebyshev series, a direct computational method for solving the higher order nonlinear differential equations has been developed in this paper. This method transforms the nonlinear differential equation into the matrix equation, which corresponds to a system of nonlinear algebraic equations with unknown Chebyshev coefficients, via Chebyshev collocation points. The solution of this system yields the Chebyshev coefficients of the solution function. An algorithm for this nonlinear system is also proposed in this paper. The method is valid for both initial-value and boundary-value problems. Several examples are presented to illustrate the accuracy and effectiveness of the method.     

The Sinc–Legendre collocation method for a class of fractional convection–diffusion equations with variable coefficients

This paper deals with the numerical solution of classes of fractional convection–diffusion equations with variable coefficients. The fractional derivatives are described based on the Caputo sense. Our approach is based on the collocation techniques. The method consists of reducing the problem to the solution of linear algebraic equations by expanding the required approximate solution as the elements of shifted Legendre polynomials in time and the Sinc functions in space with unknown coefficients. The properties of Sinc functions and shifted Legendre polynomials are then utilized to evaluate the unknown coefficients. Several examples are given and the numerical results are shown to demonstrate the efficiency of the newly proposed method.     

Numerical solution of the Bagley–Torvik equation by the Bessel collocation method

In this article, a numerical technique is presented for the approximate solution of the Bagley–Torvik equation, which is a class of fractional differential equations. The basic idea of this method is to obtain the approximate solution in a generalized form of the Bessel functions of the first kind. For this purpose, by using the collocation points, the matrix operations and a generalization of the Bessel functions of the first kind, this technique transforms the Bagley–Torvik equation into a system of the linear algebraic equations. Hence, by solving this system, the unknown Bessel coefficients are computed. The reliability and efficiency of the proposed scheme are demonstrated by some numerical examples. Copyright © 2012 John Wiley & Sons, Ltd.     

Bessel collocation approach for solving continuous population models for single and interacting species

In this paper, we present a collocation method to obtain the approximate solutions of continuous population models for single and interacting species. By using the Bessel polynomials and collocation points, this method transforms population model into a matrix equation. The matrix equation corresponds to a system of nonlinear equations with the unknown Bessel coefficients. The reliability and efficiency of the proposed scheme are demonstrated by two numerical examples and performed on the computer algebraic system Maple.