Numerical solution of the delay differential equations of pantograph type via Chebyshev polynomials

In this article we propose a numerical scheme to solve the pantograph equation. The method consists of expanding the required approximate solution as the elements of the shifted Chebyshev polynomials. The Chebyshev pantograph operational matrix is introduced. The operational matrices of pantograph, derivative and product are utilized to reduce the problem to a set of algebraic equations. An error analysis is presented which allows the number of polynomials employed in the approximation to be selected in advance for a desired tolerance. Some examples are given to demonstrate the validity and applicability of the new method and a comparison is made with the existing results.     

The use of Chebyshev cardinal functions for solution of the second‐order one‐dimensional telegraph equation

A numerical technique is presented for the solution of the second order one‐dimensional linear hyperbolic equation. This method uses the Chebyshev cardinal functions. The method consists of expanding the required approximate solution as the elements of Chebyshev cardinal functions. Using the operational matrix of derivative, the problem is reduced to a set of algebraic equations. Some numerical examples are included to demonstrate the validity and applicability of the technique. The method is easy to implement and produces very accurate results. © 2008 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2009     

Numerical solution of time-varying delay systems by Chebyshev wavelets

The solution of time-varying delay systems is obtained by using Chebyshev wavelets. The properties of the Chebyshev wavelets consisting of wavelets and Chebyshev polynomials are presented. The method is based upon expanding various time functions in the system as their truncated Chebyshev wavelets. The operational matrix of delay is introduced. The operational matrices of integration and delay are utilized to reduce the solution of time-varying delay systems to the solution of algebraic equations. Illustrative examples are included to demonstrate the validity and applicability of the technique.     

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 use of Chebyshev cardinal functions for the solution of a partial differential equation with an unknown time-dependent coefficient subject to an extra measurement

A numerical technique is presented for the solution of a parabolic partial differential equation with a time-dependent coefficient subject to an extra measurement. The method is derived by expanding the required approximate solution as the elements of Chebyshev cardinal functions. Using the operational matrix of derivative, the problem can be reduced to a set of algebraic equations. From the computational point of view, the solution obtained by this method is in excellent agreement with those obtained by previous works and also it is efficient to use.     

A new numerical method for delay and advanced integro-differential equations

A general formulation is constructed for Jacobi operational matrices of integration, product, and delay on an arbitrary interval. The main purpose of this study is to improve Jacobi operational matrices for solving delay or advanced integro–differential equations. Some theorems are established and utilized to reduce the computational costs. All algorithms can be used for both linear and nonlinear Fredholm and Volterra integro-differential equations with delay. An error estimator is introduced to approximate the absolute error when the exact solution of a given problem is not available. The error of the proposed method is less compared to other common methods such as the Taylor collocation, Chebyshev collocation, hybrid Euler–Taylor matrix, and Boubaker collocation methods. The reliability and efficiency of the proposed scheme are demonstrated by some numerical experiments.     

Novel Chebyshev wavelets algorithms for optimal control and analysis of general linear delay models

A new efficient type of Chebyshev wavelet is used to find the optimal solutions of general linear, continuous-time, multi-delay systems with quadratic performance indices and also to obtain the responses of linear time-delay systems. According to the new definition of Chebyshev wavelets, the operational matrices of integration, product, delay and inverse time and the integration matrix are derived. Furthermore, new operational matrices as the piecewise delay operational matrix and the stretch operational matrix of the desired Chebyshev wavelets are introduced to analyze systems with, in turn, piecewise constant delays and stretched arguments or proportional delays. Two novel algorithms based on newly Chebyshev wavelet method are proposed for the optimal control and the analysis of delay models. Some examples are solved to establish that the accuracy and applicability of Chebyshev wavelet method in delay systems are increased.     

On the applicability of Genocchi wavelet method for different kinds of fractional‐order differential equations with delay

A novel collocation method based on Genocchi wavelet is presented for the numerical solution of fractional differential equations and time‐fractional partial differential equations with delay. In this work, to achieve the approximate solution with height accuracy, we employed the operational matrix of integer derivative and the pseudo‐operational matrix of fractional derivative in Caputo sense. Also, based on Genocchi function properties, we presented delay and pantograph operational matrices of Genocchi wavelet functions (GWFs). Due to operational and pseudo‐operational matrices, the equations under this study can be turned into nonlinear algebraic equations with the unknown GWF coefficients. For illustrating the upper bound of error for the proposed method, we estimate the error in the sense of Sobolev space. In addition, to demonstrate the efficacy of the pseudo‐operational matrix of fractional derivative, we investigate the upper bound of error for the mentioned matrix. Finally, the algorithm based on the proposed approach is implemented for some numerical experiments to confirm accuracy and applicability.     

Numerical solution of hyperbolic telegraph equation using the Chebyshev tau method

In this article we propose a numerical scheme to solve the one‐dimensional hyperbolic telegraph equation. The method consists of expanding the required approximate solution as the elements of shifted Chebyshev polynomials. Using the operational matrices of integral and derivative, we reduce the problem to a set of linear algebraic equations. Some numerical examples are included to demonstrate the validity and applicability of the technique. The method is easy to implement and produces very accurate results. © 2009 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2010     

Optimal Control of Delay Systems by Using a Hybrid Functions Approximation

In this paper, a new numerical method for solving the optimal control of linear time-varying delay systems with quadratic performance index is presented. The method is based upon hybrid functions approximation. The properties of hybrid functions, consisting of block-pulse functions and Bernoulli polynomials, are presented. The operational matrices of integration, product, delay and the integration of the cross product of two hybrid functions of block-pulse and Bernoulli polynomials vectors are given. These matrices are then utilized to reduce the solution of the optimal control of delay systems to the solution of algebraic equations. Illustrative examples are included to demonstrate the validity and applicability of the technique.     

Numerical Solution for a Variable-Order Fractional Nonlinear Cable Equation via Chebyshev Cardinal Functions

In this paper, a variable-order fractional derivative nonlinear cable equation is considered. It is commonly accepted that fractional differential equations play an important role in the explanation of many physical phenomena. For this reason we need a reliable and efficient technique for the solution of fractional differential equations. This paper deals with the numerical solution of class of fractional partial differential equation with variable coefficient of fractional differential equation in various continues functions of spatial and time orders. Our main aim is to generalize the Chebyshev cardinal operational matrix to the fractional calculus. Finally, illustrative examples are included to demonstrate the validity and applicability of the presented technique.     

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

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

Stability analysis of block boundary value methods for neutral pantograph equation

This paper deals with the convergence and stability properties of block boundary value methods (BBVMs) for the neutral pantograph equation. Due to its unbounded time lags and limited computer memory, a change in the independent variable is used to transform a pantograph equation into a non-autonomous differential equation with a constant delay but variable coefficients. It is shown under the classical Lipschitz condition that a BBVM is convergent of order p if the underlying boundary value method is consistent with order p. Furthermore, it is proved under a certain condition that BBVMs can preserve the asymptotic stability of exact solutions for the neutral pantograph equation. Meanwhile, some numerical experiments are given to confirm the main conclusions.     

Free vibration of non-uniform Euler–Bernoulli beam under various supporting conditions using Chebyshev wavelet collocation method

This paper proposes operational matrix of rth integration of Chebyshev wavelets. A general procedure of this matrix is given. Operational matrix of rth integration is taken as rth power of operational matrix of first integration in literature. But, this study removes this disadvantage of Chebyshev wavelets method. Free vibration problems of non-uniform Euler–Bernoulli beam under various supporting conditions are investigated by using Chebyshev Wavelet Collocation Method. The proposed method is based on the approximation by the truncated Chebyshev wavelet series. A homogeneous system of linear algebraic equations has been obtained by using the Chebyshev collocation points. The determinant of coefficients matrix is equated to the zero for nontrivial solution of homogeneous system of linear algebraic equations. Hence, we can obtain ith natural frequencies of the beam and the coefficients of the approximate solution of Chebyshev wavelet series that satisfied differential equation and boundary conditions. Mode shapes functions corresponding to the natural frequencies can be obtained by normalizing of approximate solutions. The computed results well fit with the analytical and numerical results as in the literature. These calculations demonstrate that the accuracy of the Chebyshev wavelet collocation method is quite good even for small number of grid points.     

A new approach of the Chebyshev wavelets method for partial differential equations with boundary conditions of the telegraph type

In this paper, we develop an accurate and efficient Chebyshev wavelets method for solution of partial differential equations with boundary conditions of the telegraph type. In the proposed method we have employed mutually the operational matrices of integration and differentiation to get numerical solutions of such equations. The power of this manageable method is confirmed. Moreover the use of Chebyshev wavelet is found to be accurate, simple and fast.     

Numerical Solution of the Two-Sided Space–Time Fractional Telegraph Equation Via Chebyshev Tau Approximation

The operational matrices of left Caputo fractional derivative, right Caputo fractional derivative, and Riemann–Liouville fractional integral, for shifted Chebyshev polynomials, are presented and derived. We propose an accurate and efficient spectral algorithm for the numerical solution of the two-sided space–time Caputo fractional-order telegraph equation with three types of non-homogeneous boundary conditions, namely, Dirichlet, Robin, and non-local conditions. The proposed algorithm is based on shifted Chebyshev tau technique combined with the derived shifted Chebyshev operational matrices. We focus primarily on implementing the novel algorithm both in temporal and spatial discretizations. This algorithm reduces the problem to a system of algebraic equations greatly simplifying the problem. This system can be solved by any standard iteration method. For confirming the efficiency and accuracy of the proposed scheme, we introduce some numerical examples with their approximate solutions and compare our results with those achieved using other methods.     

Numerical treatment of a well-posed Chebyshev Tau method for Bagley-Torvik equation with high-order of accuracy

The main purpose of this study is to develop and analyze a new high-order operational Tau method based on the Chebyshev polynomials as basis functions for obtaining the numerical solution of Bagley-Torvik equation which has a important role in the fractional calculus. It is shown that some derivatives of the solutions of these equations have a singularity at origin. To overcome this drawback we first change the original equation into a new equation with a better regularity properties by applying a regularization process and thereby the operational Chebyshev Tau method can be applied conveniently. Our proposed method has two main advantages. First, the algebraic form of the Tau discretization of the problem has an upper triangular structure which can be solved by forward substitution method. Second, Tau approximation of the problem converges to the exact ones with a highly rate of convergence under a more general regularity assumptions on the input data in spite of the singularity behavior of the exact solution. Numerical results are presented which confirm the theoretical results obtained and efficiency of the proposed method.     

The th moment stability for the stochastic pantograph equation

In this paper, we investigate the αth moment asymptotical stability of the analytic solution and the numerical methods for the stochastic pantograph equation by using the Razumikhin technique. Especially the linear stochastic pantograph equations and the semi-implicit Euler method applying them are considered. The convergence result of the semi-implicit Euler method is obtained. The stability conditions of the analytic solution of those equations and the numerical method are given. Finally, some experiments are given.     

Numerical solution for the weakly singular Fredholm integro-differential equations using Legendre multiwavelets

An effective method based upon Legendre multiwavelets is proposed for the solution of Fredholm weakly singular integro-differential equations. The properties of Legendre multiwavelets are first given and their operational matrices of integral are constructed. These wavelets are utilized to reduce the solution of the given integro-differential equation to the solution of a sparse linear system of algebraic equations. In order to save memory requirement and computational time, a threshold procedure is applied to obtain the solution to this system of algebraic equations. Through numerical examples, performance of the present method is investigated concerning the convergence and the sparseness of the resulted matrix equation.     

Efficient Implementation of a Spectral-Tau Method for a Class of Two-Point Boundary-Value and Initial-Boundary-Value Problems

A simple and efficient spectral method for solving the second, third order and fourth order elliptic equations with variable coefficients and nonlinear differential equations is presented. It is different from spectral-collocation method which leads to dense, ill-conditioned matrices. The spectral method in this paper solves for the coefficients of the solution in a Chebyshev series, leads to discrete systems with special structured matrices which can be factorized and solved efficiently. We also extend the method to boundary value problems in two space dimensions and solve 2-D separable equation with variable coefficients. As an application, we solve Cahn-Hilliard equation iteratively via first-order implicit time discretization scheme. Ample numerical results indicate that the proposed method is extremely accurate and efficient.