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.     

A new collocation method for solution of mixed linear integro-differential-difference equations

Numerical solution of mixed linear integro-differential-difference equation is presented using Chebyshev collocation method. The aim of this article is to present an efficient numerical procedure for solving mixed linear integro-differential-difference equations. Our method depends mainly on a Chebyshev expansion approach. This method transforms mixed linear integro-differential-difference equations and the given conditions into matrix equation which corresponds to a system of linear algebraic equation. The reliability and efficiency of the proposed scheme are demonstrated by some numerical experiments and performed on the computer algebraic system Maple10.     

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.     

一类变系数分数阶微分方程的数值解法

本文研究了一类变系数分数阶微分方程的数值解法问题. 利用Cheyshev小波推导出的分数阶微分方程的算子矩阵把分数阶微分方程转换为代数方程组. 同时给出了Cheyshev小波基的收敛性和误差估计表达式, 并给出数值算例说明所提方法的精确性和有效性     

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.     

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.     

Wavelet analysis method for solving linear and nonlinear singular boundary value problems

In this paper, a robust and accurate algorithm for solving both linear and nonlinear singular boundary value problems is proposed. We introduce the Chebyshev wavelets operational matrix of derivative and product operation matrix. Chebyshev wavelets expansions together with operational matrix of derivative are employed to solve ordinary differential equations in which, at least, one of the coefficient functions or solution function is not analytic. Several examples are included to illustrate the efficiency and accuracy of the proposed method.     

Chebyshev operational matrix method for solving multi-order fractional ordinary differential equations

The aim of this article is to present an analytical approximation solution for linear and nonlinear multi-order fractional differential equations (FDEs) by extending the application of the shifted Chebyshev operational matrix. For this purpose, we convert FDE into a counterpart system and then using proposed method to solve the resultant system. Our results in solving four different linear and nonlinear FDE, confirm the accuracy of proposed method.     

The discrete linear restricted Chebyshev approximation

A numerically stable simplex algorithm for calculating the restricted Chebyshev solution of overdetermined systems of linear equations is described. In this algorithm minimum computer storage is required and no conditions are imposed on the coefficient matrix or on the right hand side of the system of equations. Also a new way of implementing a triangular decomposition method to the basis matrix is used. The ordinary Chebyshev solution, the one-sided Chebyshev solutions and the Chebyshev approximation by non-negative functions are obtained as special cases in this algorithm. Numerical results are given.     

Floquet theory for second order linear homogeneous difference equations

In this paper we provide a version of the Floquet’s theorem to be applied to any second order difference equations with quasi-periodic coefficients. To do this we extend to second order linear difference equations with quasi-periodic coefficients, the known equivalence between the Chebyshev equations and the second order linear difference equations with constant coefficients. So, any second order linear difference equations with quasi-periodic coefficients is essentially equivalent to a Chebyshev equation, whose parameter only depends on the values of the quasi-periodic coefficients and can be determined by a non-linear recurrence. Moreover, we solve this recurrence and obtaining a closed expression for this parameter. As a by-product we also obtain a Floquet’s type result; that is, the necessary and sufficient condition for the equation has quasi-periodic solutions.     

Rational Chebyshev collocation method for solving higher‐order linear ordinary differential equations

A collocation method to find an approximate solution of higher‐order linear ordinary differential equation with variable coefficients under the mixed conditions is proposed. This method is based on the rational Chebyshev (RC) Tau method and Taylor‐Chebyshev collocation methods. The solution is obtained in terms of RC functions. Also, illustrative examples are included to demonstrate the validity and applicability of the technique, and performed on the computer using a program written in maple9. © 2010 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 27: 1130–1142, 2011     

A computational matrix method for solving systems of high order fractional differential equations

In this paper, we introduced an accurate computational matrix method for solving systems of high order fractional differential equations. The proposed method is based on the derived relation between the Chebyshev coefficient matrix A of the truncated Chebyshev solution u(t)$\mathbf{u}(\mathbf{t})$ and the Chebyshev coefficient matrix A^(ν)${\mathbf{A}}^{(\nu )}$ of the fractional derivative u^(ν)${\mathbf{u}}^{(\nu )}$. The fractional derivatives are presented in terms of Caputo sense. The matrix method for the approximate solution for the systems of high order fractional differential equations (FDEs) in terms of Chebyshev collocation points is presented. The systems of FDEs and their conditions (initial or boundary) are transformed to matrix equations, which corresponds to system of algebraic equations with unknown Chebyshev coefficients. The remaining set of algebraic equations is solved numerically to yield the Chebyshev coefficients. Several numerical examples for real problems are provided to confirm the accuracy and effectiveness of the present method.     

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     

On the solution of the Abel equation of the second kind by the shifted Chebyshev polynomials

This paper presents a new approximate method of Abel differential equation. By using the shifted Chebyshev expansion of the unknown function, Abel differential equation is approximately transformed to a system of nonlinear equations for the unknown coefficients. A desired solution can be determined by solving the resulting nonlinear system. This method gives a simple and closed form of approximate solution of Abel differential equation. The solution is calculated in the form of a series with easily computable components. The numerical results show the effectiveness of the method for this type of equation. Comparing the methodology with some known techniques shows that the present approach is relatively easy and highly accurate.     

Wavelets method for solving systems of nonlinear singular fractional Volterra integro-differential equations

This paper presents a computational method for solving a class of system of nonlinear singular fractional Volterra integro-differential equations. First, existences of a unique solution for under studying problem is proved. Then, shifted Chebyshev polynomials and their properties are employed to derive a general procedure for forming the operational matrix of fractional derivative for Chebyshev wavelets. The application of this operational matrix for solving mentioned problem is explained. In the next step, the error analysis of the proposed method is investigated. Finally, some examples are included for demonstrating the efficiency of the proposed method.     

Second order linear difference equations

We provide the explicit solution of a general second order linear difference equation via the computation of its associated Green function. This Green function is completely characterized and we obtain a closed expression for it using functions of two–variables, that we have called Chebyshev functions due to its intimate relation with the usual one–variable Chebyshev polynomials. In fact, we show that Chebyshev functions become Chebyshev polynomials if constant coefficients are considered.     

The strict Chebyshev solution of overdetermined systems of linear equations with rank deficient matrix

The Chebyshev solution of an overdetermined system of linear equations is considered, with special reference to the case when the matrix of coefficients is column-rank deficient. The procedure described is an ascent exchange algorithm in which at each iteration use is made of a numerically stable decomposition of a submatrix to evaluate its rank and null space. It is shown how results can be achieved by this method in cases where other algorithms fail.     

Application of a block modified Chebyshev algorithm to the iterative solution of symmetric linear systems with multiple right hand side vectors

Summary. An adaptive Richardson iteration method is described for the solution of large sparse symmetric positive definite linear systems of equations with multiple right-hand side vectors. This scheme ``learns' about the linear system to be solved by computing inner products of residual matrices during the iterations. These inner products are interpreted as block modified moments. A block version of the modified Chebyshev algorithm is presented which yields a block tridiagonal matrix from the block modified moments and the recursion coefficients of the residual polynomials. The eigenvalues of this block tridiagonal matrix define an interval, which determines the choice of relaxation parameters for Richardson iteration. Only minor modifications are necessary in order to obtain a scheme for the solution of symmetric indefinite linear systems with multiple right-hand side vectors. We outline the changes required. Received April 22, 1993     

Application of orthogonal expansions for approximate integration of ordinary differential equations

An approximate method to solve the Cauchy problem for normal and canonical systems of second-order ordinary differential equations is proposed. The method is based on the representation of a solution and its derivative at each integration step in the form of partial sums of series in shifted Chebyshev polynomials of the first kind. A Markov quadrature formula is used to derive the equations for the approximate values of Chebyshev coefficients in the right-hand sides of systems. Some sufficient convergence conditions are obtained for the iterative method solving these equations. Several error estimates for the approximate Chebyshev coefficients and for the solution are given with respect to the integration step size.     

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

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