The mathematical theory of closed form functions for calculating LSFs on the basis of generating functions is presented. Exploiting recurrence relationships in the series expansion of Chebyshev polynomials of the first kind makes it possible to bootstrap iterative LSF-search from a set of characteristic polynomial zeros. The theoretical analysis is based on decomposition of sequences into symme...

This note presents a Markov-type inequality for polynomials in two variables where the Chebyshev polynomials of the second kind in either one of the variables are extremal. We assume a bound on a polynomial at the set of even or odd Chebyshev nodes with the boundary nodes omitted and obtain bounds on its even or odd order directional derivatives in a critical direction. Previously, the author h...

In this paper, we will introduce a method to find a numerical solution of nonlinear age-structured population model using second-kind Chebyshev polynomials. This method convert the nonlinear age-structured population models to an equivalent differential equation. We introduce two variable second-kind Chebyshev polynomials and their basic properties. These properties will be used to reduce the o...

This manuscript presents a method for the numerical solution of the Cauchy type singular integral equations of the first kind, over a finite segment which is bounded at the end points of the finite segment. The Chebyshev polynomials of the second kind with the corresponding weight function have been used to approximate the density function. The force function is approximated by using the Chebys...

Algebraic properties of Chebyshev polynomials are presented. The complete factorization of Chebyshev polynomials of the rst kind (Tn(x)) and second kind (Un(x)) over the integers are linked directly to divisors of n and n + 1 respectively. For any odd integer n, it is shown that the polynomial Tn(x)=x is irreducible over the integers i n is prime. The result leads to a generalization of Fermat'...

The main purpose of this article is to solve the connection problems between (p, q)−Fibonacci polynomials and the two polynomials, namely Chebyshev polynomials of third and fourth kinds which are considered as two nonsymmetric polynomials of the Jacobi polynomials. Moreover, the inversion connection formulae for the latter formulae are given. We show that all the connection coefficients are exp...

We present approximation kernels for orthogonal expansions with respect to Bernstein-Szegö polynomials. The construction is derived from known results for Chebyshev polynomials of the first kind and does not pose any restrictions on the Bernstein-Szegö polynomials.

In paper [4], transformation matrices mapping the Legendre and Bernstein forms of a polynomial of degree n into each other are derived and examined. In this paper, we derive a matrix of transformation of Chebyshev polynomials of the first kind into Bernstein polynomials and vice versa. We also study the stability of these linear maps and show that the Chebyshev–Bernstein basis conversion is rem...

Permutable Chebyshev polynomials (T polynomials) defined over the field of real numbers are suitable for creating a Diffie-Hellman-like key exchange algorithm that is able to withstand attacks using quantum computers. The algorithm takes advantage of the commutative properties of Chebyshev polynomials of the first kind. We show how T polynomial values can be computed faster and how the underlyi...