The Chebyshev polynomials have many beautiful properties and countless applications, arising in a variety of continuous settings. They are a sequence of orthogonal polynomials appearing in approximation theory, numerical integration, and differential equations. In this paper we approach them instead as discrete objects, counting the sum of weighted tilings. Using this combinatorial approach, on...

We examine to what extent finite-dimensional spaces defined on locally compact subsets of the line and possessing various weak Chebyshev properties (involving sign changes, zeros, alternation of best approximations, and peak points) can be uniformly approximated by a sequence of spaces having related properties. r 2003 Elsevier Science (USA). All rights reserved.

New Runge–Kutta methods for method of lines solution of systems of ordinary differential equations arising from discretizations of spatial derivatives in hyperbolic equations, by Chebyshev or modified Chebyshev methods, are introduced. These Runge–Kutta methods optimize the time step necessary for stable solutions, while holding dispersion and dissipation fixed. It is found that maximizing disp...

When a function is singular at the ends of its expansion interval, its Chebyshev coefficients a, converge very poorly. We analyze three numerical strategies for coping with such singularities of the form (1 + x)~ log(1 f x), and in the process make some modest additions to the theory of Chebyshev expansions. The first two numerical methods are the convergence-improving changes of coordinate x =...

in this paper, we introduce a family of fractional-order chebyshev functions based on the classical chebyshev polynomials. we calculate and derive the operational matrix of derivative of fractional order $gamma$ in the caputo sense using the fractional-order chebyshev functions. this matrix yields to low computational cost of numerical solution of fractional order differential equations to the ...

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 usual way of the implementation of on-line discrete Hilbert transformers is the design of linear phase finite impulse response (FIR) filters. Recently, a method has been published for the design of infinite impulse response (IIR) Hilbert transformers as well. The paper introduces a new method for the design of both FIR and IIR Hilbert transformers, based on a parameter estimation method for...

The classical Hurwitz theorem says that if n first “harmonics” (2n+1 Fourier coefficients) of a continuous function f(x) on the unit circle are zero, then f(x) changes sign at least 2n + 1 times. We show that similar facts and its converse hold for any function that are orthogonal to a Chebyshev system. These theorems can be extended for convex curves in d-dimensional Euclidean space. Namely, i...

This paper presents an effective method for solving stochastic problems commonly encountered in structural engineering and applied mechanics. Design of experiments is conducted to obtain the response values of interest, where Chebyshev nodes are applied to collect discrete samples. Then Chebyshev polynomials are applied to approximate the univariate functional relationship between each variable...