We study the problem of reconstructing a sparse polynomial in a basis of Chebyshev polynomials (Chebyshev basis in short) from given samples on a Chebyshev grid of [−1, 1]. A polynomial is called M -sparse in a Chebyshev basis, if it can be represented by a linear combination of M Chebyshev polynomials. For a polynomial with known and unknown Chebyshev sparsity, respectively, we present efficie...

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

In the paper, the authors establish two identities to express higher order derivatives and integer powers of the generating function of the Chebyshev polynomials of the second kind in terms of integer powers and higher order derivatives of the generating function of the Chebyshev polynomials of the second kind respectively, find an explicit formula and an identity for the Chebyshev polynomials ...

in this paper we introduce a type of fractional-order polynomials basedon the classical chebyshev polynomials of the second kind (fcss). also we construct the operationalmatrix of fractional derivative of order $ gamma $ in the caputo for fcss and show that this matrix with the tau method are utilized to reduce the solution of some fractional-order differential equations.

The Chebyshev polynomials have many beautiful properties and countless applications, arising in a variety of continuous settings. They are a sequence of orthogonal polynomials appearing in approximation theory, numerical integration, and differential equations. In this paper we approach them instead as discrete objects, counting the sum of weighted tilings. Using this combinatorial approach, on...

In this paper, the wavelet method based on the Chebyshev polynomials of the second kind is introduced and used to solve systems of integral equations. Operational matrices of integration, product, and derivative are obtained for the second kind Chebyshev wavelets which will be used to convert the system of integral equations into a system of algebraic equations. Also, the error is analyzed and ...

The Chebyshev-Boubaker polynomials are the orthogonal polynomials whose coefficient arrays are defined by ordinary Riordan arrays. Examples include the Chebyshev polynomials of the second kind and the Boubaker polynomials. We study the connection coefficients of this class of orthogonal polynomials, indicating how Riordan array techniques can lead to closed-form expressions for these connection...

In this paper we introduce a type of fractional-order polynomials based on the classical Chebyshev polynomials of the second kind (FCSs). Also we construct the operational matrix of fractional derivative of order $ gamma $ in the Caputo for FCSs and show that this matrix with the Tau method are utilized to reduce the solution of some fractional-order differential equations.

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

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