We give two recursive expressions for both MacWilliams and Chebyshev matrices. The expressions give rise to simple recursive algorithms for constructing the matrices. In order to derive the second recursion for the Chebyshev matrices we find out the Krawtchouk coefficients of the Discrete Chebyshev polynomials, a task interesting on its own.

A method for calculating the strict Chebyshev solution of overdetermined systems of linear equations using linear programming techniques is described. This method provides: (1) a way to determine, for the majority of cases, all the equations belonging to the characteristic set, (2) an efficient method to obtain the inverse of the matrix needed to calculate the strict Chebyshev solution, and (3)...

in this paper, an effective direct method to determine the numerical solution of linear and nonlinear fredholm and volterra integral and integro-differential equations is proposed. the method is based on expanding the required approximate solution as the elements of chebyshev cardinal functions. the operational matrices for the integration and product of the chebyshev cardinal functions are des...

The use of Chebyshev polynomials in solving finite horizon optimal control problems associated with general linear time-varying systems with constant delay is well known in the literature. The technique is modified in the present paper for the finite horizon control of dynamical systems with time periodic coefficients and constant delay. The governing differential equations of motion are conver...

Tthis paper, is concerned with obtaining numerical solutions for a class of convection-diffusion equations (CDEs) with variable coefficients. Our approaches are based on collocation methods. These approaches implementing all four kinds of shifted Chebyshev polynomials in combination with Sinc functions to introduce an approximate solution for CDEs . This approximate solution can be expressed as...

We study a new method in reducing the roundo error in computing derivatives using Chebyshev collocation methods. By using a grid mapping derived by Koslo and Tal-Ezer, and the proper choice of the parameter , the roundo error of the k-th derivative can be reduced from O(N2k) to O((N jln j)k), where is the machine precision and N is the number of collocation points. This drastic reduction of rou...

We study a new method in reducing the roundo error in computing derivatives using Chebyshev collocation methods. By using a grid mapping derived by Koslo and Tal-Ezer, and the proper choice of the parameter , the roundo error of the k-th derivative can be reduced from O(N) to O((N jln j)k), where is the machine precision and N is the number of collocation points. This drastic reduction of round...

In this paper, the Chebyshev spectral collocation method(CSCM) for one-dimensional linear hyperbolic telegraph equation is presented. Chebyshev spectral collocation method have become very useful in providing highly accurate solutions to partial differential equations. A straightforward implementation of these methods involves the use of spectral differentiation matrices. Firstly, we transform ...

The IBM Power4 processor uses series approximation to calculate square root. We formally verified the correctness of this algorithm using the ACL2(r) theorem prover. The proof requires the analysis of the approximation error on a Chebyshev series. This is done by proving Taylor’s theorem, and then analyzing the Chebyshev series using Taylor series. Taylor’s theorem is proved by way of non-stand...