The paper shows that in the analysis of a queuing system with fixed-size batch arrivals, there emerges a set of polynomials which are a generalization of Chebyshev polynomials of the second kind. The paper uses these polynomials in assessing the transient behaviour of the overflow (equivalently call blocking) probability in the system. A key figure to note is the proportion of the overflow (or ...

In this article, an accurate Chebyshev spectral method for solving high order non-linear ODEs is presented. Properties of the Chebyshev polynomials are utilized to reduce the computation of the problem to a set of algebraic equations. Some examples are given to verify and illustrate the efficiency and simplicity of the method. We compared our numerical results against the Adomian decomposition ...

Abstract. This paper discusses a method based on Laguerre polynomials combined with a Filtered Conjugate Residual (FCR) framework to compute the product of the exponential of a matrix by a vector. The method implicitly uses an expansion of the exponential function in a series of orthogonal Laguerre polynomials, much like existing methods based on Chebyshev polynomials do. Owing to the fact that...

Data clustering is one of the important data mining methods. It is a process of finding classes of a data set with most similarity in the same class and most dissimilarity between different classes. The well known hard clustering algorithm (K -means) and Fuzzy clustering algorithm (FCM) are mostly based on Euclidean distance measure. In this paper, a comparative study of these algorithms with d...

‎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 a class of fractional differential‎ ‎equation‎. ‎The fractional derivatives are described...

A Chebyshev or Fourier series may be evaluated on the standard collocation grid by the Fast Fourier Transform (FFT). Unfortunately, the FFT does not apply when one needs to sum a spectral series at N points which are spaced irregularly. The cost becomes O(N2) operations instead of the FFT's O(N log N). This sort of "off-grid" interpolation is needed by codes which dynamically readjust the grid ...

Amongst satisfactory techniques for the numerical solution of differential equations, the use of Chebyshev series is often avoided because of the tedious nature of the calculations. A systematic application of the Chebyshev method is given for certain fourth order boundary value problems in which the derivatives have polynomial coefficients. Numerical results for various problems using the Cheb...

In this paper, a super spectral viscosity method using the Chebyshev differential operator of high order Ds = ( √ 1− x2∂x) is developed for nonlinear conservation laws. The boundary conditions are treated by a penalty method. Compared with the second-order spectral viscosity method, the super one is much weaker while still guaranteeing the convergence of the bounded solution of the Chebyshev–Ga...

In this paper, we propose a method to approximate the solution of a linear Fredholm integro-differential equation by using the Chebyshev wavelet of the first kind as basis. For this purpose, we introduce the first Chebyshev operational matrix of integration. Chebyshev wavelet approximating method is then utilized to reduce the integro-differential equation to a system of algebraic equations. Il...

presents a modiied Chebyshev pseudospec-tral method, involving mapping of the Chebyshev points, for solving rst-order hyperbolic initial boundary value problems. It is conjectured that the time step restriction for the modiied method is O(N ?1) compared to O(N ?2) for the standard Chebyshev pseudospectral method, where N is the number of discretization points in space. In the present paper we s...