Orthogonal functions and polynomials have been used by many authors for solving various problems. The main idea of using orthogonal basis is that a problem reduces to solving a system of linear or nonlinear algebraic equations by truncated series of orthogonal basis functions for solution of problem and using the operational matrices. Here we use Legendre wavelets basis on interval [0, 1]. Some...

In this paper, we consider an approach based on the elementary matrix theory. other words, take into account generalized Gaussian Fibonacci numbers. context, a general tridiagonal family. Then, obtain determinants of family via Chebyshev polynomials. Moreover, one type matrix, whose are Horadam hybrid polynomials, i.e., most form its by means polynomials second kind. We provided several illustr...

In this paper, numerical solution of linear Fredholm integral equations of the second kind is considered by two methods. The methods are developed by means of the Sinc-collocation method and shifted Chebyshev polynomial method. Some numerical examples are presented to illustrate the method. Numerical solution of linear Fredholm integral equations. 1. Introduction Many initial and boundary value...

Several authors have examined connections between restricted permutations and Chebyshev polynomials of the second kind. In this paper we prove analogues of these results for colored permutations. First we define a distinguished set of length two and length three patterns, which contains only 312 when just one color is used. Then we give a recursive procedure for computing the generating functio...

In this paper, a collocation method for solving high-order linear partial differential equations (PDEs) with variable coefficients under more general form of conditions is presented. This method is based on the approximation of the truncated double exponential second kind Chebyshev (ESC) series. The definition of the partial derivative is presented and derived as new operational matrices of der...

We obtain a property which characterizes the Chebyshev orthogonal polynomials of first, second, third, and fourth kind. Indeed, we prove that the four Chebyshev sequences are the unique classical orthogonal polynomial families such that their linear combinations, with fixed length and constant coefficients, can be orthogonal polynomial sequences. 1. Introduction The classical orthogonal polynom...

We say that a digraph is essentially cyclic if its Laplacian spectrum is not completely real. The essential cyclicity implies the presence of directed cycles, but not vice versa. The problem of characterizing essential cyclicity in terms of graph topology is difficult and yet unsolved. Its solution is important for some applications of graph theory, including that in decentralized control. In t...