A new approach to solve Chance constrained Portfolio Optimization Problems (CPOPs) without using the Monte Carlo simulation is proposed. Specifically, according to Chebyshev inequality, the prediction interval of a stochastic function value included in CPOP is estimated from a set of samples. By using the prediction interval, CPOP is transformed into Lower-bound Portfolio Optimization Problem (...

A numerical technique is presented for the solution of Falkner-Skan equation. The nonlinear ordinary differential equation is solved using Chebyshev cardinal functions. The method have been derived by first truncating the semi-infinite physical domain of the problem to a finite domain and expanding the required approximate solution as the elements of Chebyshev cardinal functions. Using the oper...

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

In a recent article, the first and second kinds of multivariate Chebyshev polynomials fractional degree, relevant integral repesentations, have been studied. this we introduce pseudo-Lucas functions show possible applications these new functions. For kind, compute Newton sum rules any orthogonal polynomial set starting from entries Jacobi matrix. representation formulas for powers r×r matrix, a...

The primary goal of this paper is the study of polynomials with integer coefficients that minimize the sup norm on the set E. In particular, we consider the asymptotic behavior of these polynomials and of their zeros. Let Pn(C) and Pn(Z) be the classes of algebraic polynomials of degree at most n, respectively with complex and with integer coefficients. The problem of minimizing the uniform nor...

The theorem in question asserts that, if n > k, then, in the set of integers n, n+1, n-J-2, . . ., n +k-1, there is a number containing a prime divisor greater than k . If n = k+ 1, we obtain the well-known theorem of Chebyshev . The theorem was first asserted and proved by Sylvester t about forty-five years ago . Recently Schurt has rediscovered and again proved the theorem . The following pro...

Several authors have examined connections among restricted permutations, continued fractions, and Chebyshev polynomials of the second kind. In this paper we prove analogues of these results for involutions which avoid 3412. Our results include a recursive procedure for computing the generating function for involutions which avoid 3412 and any set of additional patterns. We use our results to gi...

Using works of Franz Peherstorfer, we examine how close the nth Chebyshev number for a set E of finitely many intervals can get to the theoretical lower limit 2cap(E)n.

We characterize the generalized Chebyshev polynomials of the second kind (Chebyshev-II), and then we provide a closed form of the generalized Chebyshev-II polynomials using the Bernstein basis. These polynomials can be used to describe the approximation of continuous functions by Chebyshev interpolation and Chebyshev series and how to efficiently compute such approximations. We conclude the pap...

For the Hahn and Krawtchouk polynomials orthogonal on the set {0, . . . , N} new identities for the sum of squares are derived which generalize the trigonometric identity for the Chebyshev polynomials of the first and second kind. These results are applied in order to obtain conditions (on the degree of the polynomials) such that the polynomials are bounded (on the interval [0, N ]) by their va...