We systematically investigate the farthest distance function, farthest points, Klee sets, and Chebyshev centers, with respect to Bregman distances induced by Legendre functions. These objects are of considerable interest in Information Geometry and Machine Learning; when the Legendre function is specialized to the energy, one obtains classical notions from Approximation Theory and Convex Analys...

The classical Chebyshev theory of best uniform approximation to continuous functions by polynomials of degree <n was initiated by Chebyshev in [2]. This theory has a distinct advantage over the corresponding ones for L4-norms, 1 < q < co, in that the unique best approximant is characterized by a remarkable geometric property. Let f be a realvalued function, continuous on [0, 11, and, for n = 0,...

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...

We study the possible Hausdorff limits of Julia sets and filled subsequences sequence dual Chebyshev polynomials a non-polar compact set $$K\subset {\mathbb C}$$ compare such to K. Moreover, we prove that measures maximal entropy for K converges weak* equilibrium measure on

ll rights reserved. Recently the Chebyshev kernel has been proposed for SVM and it has been proven that it is a valid kernel for scalar valued inputs in [11]. However in pattern recognition, many applications require multidimensional vector inputs. Therefore there is a need to extend the previous work onto vector inputs. In [11], although it is not stated explicitly, the authors recommend evalu...

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 ...