this paper presents an efficient modification of the variational iteration method for solvingboundary value problems using the chebyshev polynomials. the proposed method can be applied to linearand nonlinear models. the scheme is tested for some examples and the obtained results demonstrate thereliability and efficiency of the proposed method.

The history of genus distributions began with J. Gross et al. in 1980s. Since then, a lot of study has given to this parameter, and the explicit formulas are obtained for various kinds of graphs. In this paper, we find a new usage of Chebyshev polynomials in the study of genus distribution, using the overlap matrix, we obtain homogeneous recurrence relation for rank distribution polynomial, whi...

for n ≥ 2, it can be shown that fn counts the number of ways to tile a 1 × n board with squares and dominoes. This interpretation of the Fibonacci numbers admits clever counting proofs of many Fibonacci identities. When we consider more complex combinatorial objects, we find that simply counting the number of tilings is not quite enough, and that we must consider instead weighted tilings. For e...

Chebyshev polynomials are utilized to obtain solutions of a set of pth order linear differential equations with periodic coefficients. For this purpose, the operational matrix of differentiation associated with the shifted Chebyshev polynomials of the first kind is derived. Utilizing the properties of this matrix, the solution of a system of differential equations can be found by solving a set ...

This article proposes a numerical algorithm utilizing the spectral Tau method for numerically handling Kawahara partial differential equation. The double basis of fifth-kind Chebyshev polynomials and their shifted ones are used as functions. Some theoretical results in deriving our proposed algorithm. nonlinear term equation is linearized using new product formula with first derivative polynomi...

In this paper, a new approach for solving the system of fractional integro-differential equation with weakly singular kernels is introduced. The method based on class symmetric orthogonal polynomials called shifted sixth-kind Chebyshev polynomials. First, operational matrices are constructed, and after that, described. This reduces equations (WSFIDEs) by collocation into algebraic equations. Th...

We provide a detailed description of numerical approach that makes use the shifted Chebyshev polynomials sixth kind to approximate solution some fractional order differential equations. Specifically, we choose Fisher–Kolmogorov–Petrovskii–Piskunov equation (FFKPPE) describe this method. write our in product form, which consists unknown coefficients and polynomials. To compute values coefficient...

Formulae expressing explicitly the coefficients of an expansion of double Jacobi polynomials which has been partially differentiated an arbitrary number of times with respect to its variables in terms of the coefficients of the original expansion are stated and proved. Extension to expansion of triple Jacobi polynomials is given. The results for the special cases of double and triple ultraspher...

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