A recently proposed public key cryptosystem based on Chebyshev polynomials suggests a new approach to data encryption. But the security of the cryptosystem has not been investigated in depth, for lack of an appropriate analysis method. In this paper, a new representation of Chebyshev polynomial is introduced to study security issues of the cryptosystem. The properties of Chebyshev polynomial se...

We show that every rational knot K of crossing number N admits a polynomial parametrization x = Ta(t), y = Tb(t), z = C(t) where Tk(t) are the Chebyshev polynomials, a = 3 and b + degC = 3N. We show that every rational knot also admits a polynomial parametrization with a = 4. If C(t) = Tc(t) is a Chebyshev polynomial, we call such a knot a harmonic knot. We give the classification of harmonic k...

In this paper, a special technique is studied by using the orthogonal Chebyshev polynomials to get approximate solutions for singular and hyper-singular integral equations of the first kind. A singular integral equation is converted to a system of algebraic equations based on using special properties of Chebyshev series. The error bounds are also stated for the regular part of approximate solut...

Gordon G Johnson* ([email protected]), Department of Mathematics, University of Houston, Houston, TX 77204-3008. The Closure in a Hilbert Space of a PreHilbert Space CHEBYSHEV Set Fails to be a CHEBYSHEV Set. Preliminary report. E is the real inner product space that is union of all finite-dimensional Euclidean spaces, S is a certain bounded nonconvex set in the E having the property that every...

Chebyshev polynomials of the first and the second kind in n variables z. , Zt , ... , z„ are introduced. The variables z, , z-,..... z„ are the characters of the representations of SL(n + 1, C) corresponding to the fundamental weights. The Chebyshev polynomials are eigenpolynomials of a second order linear partial differential operator which is in fact the radial part of the Laplace-Beltrami op...

We present a Chebyshev-Davidson method to compute a few smallest positive eigenvalues and corresponding eigenvectors of the linear response eigenvalue problem. The method is actually applicable to the slightly more general linear response eigenvalue problem where purely imaginary eigenvalues may occur. For the Chebyshev filter, a tight upper bound is obtained by a computable bound estimator con...

This pa per suggests a simple valuation method based on Chebyshev approximation at Chebyshev nodes to value American put options. It is similar to the approach taken in Sullivan (2000), where the option`s continuation region function is estimated by using a Chebyshev polynomial. However, in contrast to Sullivan (2000), the functional is fitted by using Chebyshev nodes. The suggested method is f...

Stable polynomial evaluation and interpolation at n Chebyshev or adjusted (expanded) Chebyshev points is performed using O(nlog’ n) arithmetic operations, to be compared with customary algorithms either using on the order of n* operations or being unstable. We also evaluate a polynomial of degree d at the sets of n Chebyshev or adjusted (expanded) Chebyshev points using O(dlog d log n) if n 5 d...

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, we study the Chebyshev property of the 3-dimentional vector space $E =langle I_0, I_1, I_2rangle$, where $I_k(h)=int_{H=h}x^ky,dx$ and $H(x,y)=frac{1}{2}y^2+frac{1}{2}(e^{-2x}+1)-e^{-x}$ is a non-algebraic Hamiltonian function. Our main result asserts that $E$ is an extended complete Chebyshev space for $hin(0,frac{1}{2})$. To this end, we use the criterion and tools developed by...