This pa per suggests a simple method based on Chebyshev approximation at Chebyshev nodes to approximate partial differential equations. The methodology simply consists in determining the value function by using a set of nodes and basis functions. We provide two examples. Pricing an European option and determining the best policy for chatting down a machinery. The suggested method is flexible, e...

We determine which (ordinary) Riordan arrays are the coefficient arrays of a family of orthogonal polynomials. In so doing, we are led to introduce a family of polynomials, which includes the Boubaker polynomials, and a scaled version of the Chebyshev polynomials, using the techniques of Riordan arrays. We classify these polynomials in terms of the Chebyshev polynomials of the first and second ...

A high order staggered-grid Chebyshev multidomain method is used to compute the Euler gas-dynamics equations on unstructured quadrilateral meshes. New results show that the method reduces to the first order upwind scheme when zeroth order polynomial approximations are used, and that by a simple reconstruction procedure the standard Chebyshev collocation method can be recovered. Local time-stepp...

In this paper we introduce an algorithm for computing nonlinear continuous Chebyshev approximations. The algorithm is based on successive linearizations within adaptively adjusted neighborhoods. The convergence of the algorithm is proven under some general assumptions such that it is applicable for many Chebyshev approximation problems discussed in the literature. It, like the Remez exchange me...

It is an important fact that general families of Chebyshev and L-splines can be locally represented, i.e. there exists a basis of B-splines which spans the entire space. We develop a special technique to calculate with 4 order Chebyshev splines of minimum deficiency on nonuniform meshes, which leads to a numerically stable algorithm, at least in case one special Hermite interpolant can be const...

Interpolation polynomial pn at the Chebyshev nodes cosπj/n (0 ≤ j ≤ n) for smooth functions is known to converge fast as n → ∞. The sequence {pn} is constructed recursively and efficiently in O(n log2 n) flops for each pn by using the FFT, where n is increased geometrically, n = 2i (i = 2, 3, . . . ), until an estimated error is within a given tolerance of ε. This sequence {2j}, however, grows ...

Chebyshev polynomial has wide applications in applied Mathematics. The Three Pass Protocol is a cryptographic protocol that used for the encryption and decryption of data without need to exchange keys. We propose this paper new cryptosystem based on applying Protocol. proposed structured as asymmetric provides high level security transmit data. This depends fact forms semigroup composition prop...