A collocation method to solve higher order linear complex differential equations in rectangular domains

In this article, a collocation method is developed to find an approximate solution of higher order linear complex differential equations with variable coefficients in rectangular domains. This method is essentially based on the matrix representations of the truncated Taylor series of the expressions in equation and their derivates, which consist of collocation points defined in the given domain. Some numerical examples with initial and boundary conditions are given to show the properties of the method. All results were computed using a program written in scientific WorkPlace v5.5 and Maple v12. © 2009 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2010     

A Bessel collocation method for numerical solution of generalized pantograph equations

This article is concerned with a generalization of a functional differential equation known as the pantograph equation which contains a linear functional argument. In this article, we introduce a collocation method based on the Bessel polynomials for the approximate solution of the pantograph equations. The method is illustrated by studying the initial value problems. The results obtained are compared by the known results. © 2011 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2011     

Numerical solution of a class of complex differential equations by the Taylor collocation method in elliptic domains

An approximate method for solving higher‐order linear complex differential equations in elliptic domains is proposed. The approach is based on a Taylor collocation method, which consists of the matrix represantation of expressions in the differential equation and the collocation points defined in an elliptic domain. Illustrative examples are included to demonstrate the validity and applicability of the technique. © 2009 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 2010     

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.     

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.     

A numerical method to solve a class of linear integro‐differential equations with weakly singular kernel

In this paper, a collocation method based on the Bessel polynomials is introduced for the approximate solution of a class of linear integro‐differential equations with weakly singular kernel under the mixed conditions. The exact solution can be obtained if the exact solution is polynomial. In other cases, increasing number of nodes, a good approximation can be obtained with applicable errors. In addition, the method is presented with error and stability analysis. Copyright © 2012 John Wiley & Sons, Ltd.     

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.     

A Bernoulli polynomial approach with residual correction for solving mixed linear Fredholm integro-differential-difference equations

In this study, an approximate method based on Bernoulli polynomials and collocation points has been presented to obtain the solution of higher order linear Fredholm integro-differential-difference equations with the mixed conditions. The method we have used consists of reducing the problem to a matrix equation which corresponds to a system of linear algebraic equations. The obtained matrix equation is based on the matrix forms of Bernoulli polynomials and their derivatives by means of collocations. The solutions are obtained as the truncated Bernoulli series which are defined in the interval [a,b]. To illustrate the method, it is applied to the initial and boundary values. Also error analysis and numerical examples are included to demonstrate the validity and applicability of the technique.     

On the solution of the non-local parabolic partial differential equations via radial basis functions

In this paper, the problem of solving the one-dimensional parabolic partial differential equation subject to given initial and non-local boundary conditions is considered. The approximate solution is found using the radial basis functions collocation method. There are some difficulties in computing the solution of the time dependent partial differential equations using radial basis functions. If time and space are discretized using radial basis functions, the resulted coefficient matrix will be very ill-conditioned and so the corresponding linear system cannot be solved easily. As an alternative method for solution, we can use finite-difference methods for discretization of time and radial basis functions for discretization of space. Although this method is easy to use but an accurate solution cannot be provided. In this work an efficient collocation method is proposed for solving non-local parabolic partial differential equations using radial basis functions. Numerical results are presented and are compared with some existing methods.     

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     

A numerical scheme for solutions of the Chen system

In this paper, we will develop the Bessel collocation method to find approximate solutions of the Chen system, which is a three‐dimensional system of ODEs with quadratic nonlinearities. This scheme consists of reducing the problem to a nonlinear algebraic equation system by expanding the approximate solutions by means of the Bessel polynomials with unknown coefficients. By help of the collocation points and the matrix operations of derivatives, the unknown coefficients of the Bessel polynomials are calculated. The accuracy and efficiency of the proposed approach are demonstrated by two numerical examples and performed with the aid of a computer code written in MAPLE. In addition, comparisons between our method and the homotopy perturbation method numerical solutions are made with the accuracy of solutions. Copyright © 2012 John Wiley & Sons, Ltd.     

The Linear Rational Pseudospectral Method for Boundary Value Problems

We consider the version of the pseudospectral method for solving boundary value problems which replaces the differential operator with a matrix constructed from the elementary differentiation matrices whose elements are the derivatives of the Lagrange fundamental polynomials at the collocation points. The iterative solution of the resulting system of equations then requires the recurrent application of that differentiation matrix. Since global polynomial interpolation on the interval only gives useful approximants for points which accumulate in the vicinity of the extremities, the matrix is ill-conditioned. To reduce this drawback, we use Kosloff and Tal-Ezer's suggestion to shift the collocation points closer to equidistant by a conformal map. However, instead of applying their change of variable setting, we extend to stationary equations the linear rational collocation method introduced in former work on partial differential equations. Numerically about as efficient, this does not require any new coding if one starts from an efficient program for the polynomial differentiation matrices.This revised version was published online in October 2005 with corrections to the Cover Date.     

A numerical approach to solve the model for HIV infection of CD4+T cells

In this study, we will obtain the approximate solutions of the HIV infection model of CD4⁺T by developing the Bessel collocation method. This model corresponds to a class of nonlinear ordinary differential equation systems. Proposed scheme consists of reducing the problem to a nonlinear algebraic equation system by expanding the approximate solutions by means of the Bessel polynomials with unknown coefficients. The unknown coefficients of the Bessel polynomials are computed using the matrix operations of derivatives together with the collocation method. The reliability and efficiency of the proposed approach are demonstrated in the different time intervals by a numerical example. All computations have been made with the aid of a computer code written in Maple 9.     

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.     

Tanh Jacobi spectral collocation method for the numerical simulation of nonlinear Schrödinger equations on unbounded domain

We present a class of orthogonal functions on infinite domain based on Jacobi polynomials. These functions are generated by applying a tanh transformation to Jacobi polynomials. We construct interpolation and projection error estimates using weighted pseudo-derivatives tailored to the involved mapping. Then, using the nodes of the newly introduced tanh Jacobi functions, we develop an efficient spectral tanh Jacobi collocation method for the numerical simulation of nonlinear Schrödinger equations on the infinite domain without using artificial boundary conditions. The applicability and accuracy of the solution method are demonstrated by two numerical examples for solving the nonlinear Schrödinger equation and the nonlinear Ginzburg–Landau equation.     

混合广义Jacobi和Chebyshev谱配置法求解时间分数阶对流扩散方程

研究时间Caputo分数阶对流扩散方程的高效高阶数值方法.对于给定的时间分数阶偏微分方程,在时间和空间方向分别采用基于移位广义Jacobi函数为基底和移位Chebyshev多项式运算矩阵的谱配置法进行数值求解.这样得到的数值解可以很好地逼近一类在时间方向非光滑的方程解.最后利用一些数值例子来说明该数值方法的有效性和准确性.     

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 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 polynomial solutions of high-order linear Fredholm integro-differential equations

In this study, a Legendre collocation matrix method is presented to solve high-order Linear Fredholm integro-differential equations under the mixed conditions in terms of Legendre polynomials. The proposed method converts the equation and conditions to matrix equations, by means of collocation points on the interval [−1, 1], which corresponding to systems of linear algebraic equations with Legendre coefficients. Thus, by solving the matrix equation, Legendre coefficients and polynomial approach are obtained. Also examples that illustrate the pertinent features of the method are presented and by using the error analysis, the results are discussed.     

An adaptive spectral least-squares scheme for the Burgers equation

A least-squares spectral collocation method for the one-dimensional inviscid Burgers equation is proposed. This model problem shows the stability and high accuracy of these schemes for nonlinear hyperbolic scalar equations. Here we make use of a least-squares spectral approach which was already used in an earlier paper for discontinuous and singular perturbation problems (Heinrichs, J. Comput. Appl. Math. 157:329–345, 2003). The domain is decomposed in subintervals where continuity is enforced at the interfaces. Equal order polynomials are used on all subdomains. For the spectral collocation scheme Chebyshev polynomials are employed which allow the efficient implementation with Fast Fourier Transforms (FFTs). The collocation conditions and the interface conditions lead to an overdetermined system which can be efficiently solved by least-squares. The solution technique will only involve symmetric positive definite linear systems. The scheme exhibits exponential convergence where the exact solution is smooth. In parts of the domain where the solution contains discontinuities (shocks) the spectral solution displays a Gibbs-like behavior. Here this is overcome by some suitable exponential filtering at each time level. Here we observe that by over-collocation the results remain stable also for increasing filter parameters and also without filtering. Furthermore by an adaptive grid refinement we were able to locate the precise position of the discontinuity. Numerical simulations confirm the high accuracy of our spectral least-squares scheme.