In this paper, we propose a new method to design an observer and control the linear singular systems described by Chebyshev wavelets. The idea of the proposed approach is based on solving the generalized Sylvester equations. An example is also given to illustrate the procedure.

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

For a fixed prime p, we consider the set of maps Z/pZ → Z/pZ of the form a 7→ Tn(a), where Tn(x) is the degree-n Chebyshev polynomial of the first kind. We observe that these maps form a semigroup, and we determine its size and structure.

Let ψK be the Chebyshev function of a number field K. Let ψ K (x) := ∫ x 0 ψK(t) dt and ψ (2) K (x) := 2 ∫ x 0 ψ (1) K (t) dt. We prove under GRH (Generalized Riemann Hypothesis) explicit inequalities for the differences |ψ K (x) − x 2 | and |ψ K (x) − x 3 |. We deduce an efficient algorithm for the computation of the residue of the Dedekind zeta function and a bound on small-norm prime ideals....

We obtain a closed form of generating functions of RNA substructure using hermitian matrix model with the Chebyshev polynomial of the second kind, which turns out to be the hypergeometric function. To match the experimental findings of the statistical behavior, we regard the substructure as a grand canonical ensemble and find its fugacity value. We also suggest a hierarchical picture based on t...

This paper focuses on the construction of continuous approximation scheme for the solution of first order initial value problems in ordinary differential equations. We exploit here the elegant properties of the Chebyshev polynomials and derive from the continuous scheme, an implicit hybrid block method through some selected points. The self-starting method was implemented on three test problems...

Advanced speech mformatlon processmg systems require further research on speakerdependent mformatlon Recently, a specific system of discrete orthogonal polynomials {4:(l), 1 = 1,2, ,L },“=, has been encountered to play a dommant role m a segmental probability model recently proposed m the speaker-dependent feature extra&on from speech waves and apphed to text-independent speaker verlficatlon He...

We show that every two-bridge knot K of crossing number N admits a polynomial parametrization x = T3(t), y = Tb(t), z = C(t) where Tk(t) are the Chebyshev polynomials and b + degC = 3N . If C(t) = Tc(t) is a Chebyshev polynomial, we call such a knot a harmonic knot. We give the classification of harmonic knots for a ≤ 3. Most results are derived from continued fractions and their matrix represe...

A fast, simple, and numerically stable transform for converting between Legendre and Chebyshev coefficients of a degree N polynomial in O(N(logN)2/ log logN) operations is derived. The basis of the algorithm is to rewrite a well-known asymptotic formula for Legendre polynomials of large degree as a weighted linear combination of Chebyshev polynomials, which can then be evaluated by using the di...

We introduce Chebyshev measures. We generalize the representation theorem concerning both measures admitting a density function which is a T–system and oriented measures.