Abstract Classical electric circuits consists of resistors, inductors and capacitors which have irreversible lossy properties that are not taken into account in classical analysis. FDEs can be interpreted as basic memory operators generally used to model the or defects. Therefore, employing fractional differential terms circuit equations provides accurate modelling those elements. In this paper...

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

We present in this paper several extremely efficient and accurate spectral-Galerkin methods for secondand fourth-order equations in polar and cylindrical geometries. These methods are based on appropriate variational formulations which incorporate naturally the pole condition(s). In particular, the computational complexities of the Chebyshev–Galerkin method in a disk and the Chebyshev–Legendre–...

This paper improves error bounds for Gauss, Clenshaw-Curtis and Fejér’s first quadrature by using new error estimates for polynomial interpolation in Chebyshev points. We also derive convergence rates of Chebyshev interpolation polynomials of the first and second kind for numerical evaluation of highly oscillatory integrals. Preliminary numerical results show that the improved error bounds are ...

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

Efficient direct solvers based on the Chebyshev-Galerkin methods for second and fourth order equations are presented. They are based on appropriate base functions for the Galerkin formulation which lead to discrete systems with special structured matrices which can be efficiently inverted. Numerical results indicate that the direct solvers presented in this paper are significantly more accurate...

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

The main purpose of this article is to present an approximation method of for singular integrodifferential equations with Cauchy kernel in the most general form under the mixed conditions in terms of the second kind Chebyshev polynomials. This method transforms mixed singular integro-differential equations with Cauchy kernel and the given conditions into matrix equation and using the zeroes of ...

Several authors have examined connections between permutations which avoid 132, continued fractions, and Chebyshev polynomials of the second kind. In this paper we prove analogues of some of these results for permutations which avoid 1243 and 2143. Using tools developed to prove these analogues, we give enumerations and generating functions for permutations which avoid 1243, 2143, and certain a...