نتایج جستجو برای: second kind chebyshev polynomials

تعداد نتایج: 734458  

2007
M. G. Blyth

A simple strategy for constructing a sequence of increasingly refined interpolation grids over the triangle or the tetrahedron is discussed with the goal of achieving uniform convergence and ensuring high interpolation accuracy. The interpolation nodes are generated based on a one-dimensional master grid comprised of the zeros of the Lobatto, Legendre, Chebyshev, and second-kind Chebyshev polyn...

Journal: :Electronic Transactions on Numerical Analysis 2023

Orthogonal polynomials on the semicircle were introduced by Gautschi and Milovanović in [Rend. Sem. Mat. Univ. Politec. Torino, Special Issue (July 1985), pp. 179-185] [J. Approx. Theory, 46 (1986), 230-250]. In this paper we give an account of kind orthogonality, weighted generalizations mainly oriented to Chebyshev weights first second kinds, including several interesting properties such pol...

Journal: :computational methods for differential equations 0
mehdi ramezani tafresh university

the main purpose of this paper is to propose a new numerical method for solving the optimal control problems based on state parameterization. here, the boundary conditions and the performance index are first converted into an algebraic equation or in other words into an optimization problem. in this case, state variables will be approximated by a new hybrid technique based on new second kind ch...

2017
FENG QI

In the paper, the authors establish two identities to express the generating function of the Chebyshev polynomials of the second kind and its higher order derivatives in terms of the generating function and its derivatives each other, deduce an explicit formula and an identities for the Chebyshev polynomials of the second kind, derive the inverse of an integer, unit, and lower triangular matrix...

Journal: :CoRR 2009
Rafig P. Agaev Pavel Yu. Chebotarev

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

2012
Howard S. COHL Hans VOLKMER

We obtain definite integrals for products of associated Legendre functions with Bessel functions, associated Legendre functions, and Chebyshev polynomials of the first kind using orthogonality and integral transforms.

2012
Kenan Kaygisiz

In this paper, we give some determinantal and permanental representations of generalized bivariate Lucas p-polynomials by using various Hessenberg matrices. The results that we obtained are important since generalized bivariate Lucas p-polynomials are general forms of, for example, bivariate Jacobsthal-Lucas, bivariate Pell-Lucas ppolynomials, Chebyshev polynomials of the first kind, Jacobsthal...

Journal: :Mathematics 2021

The goal of this paper is to derive Hermite–Hadamard–Fejér-type inequalities for higher-order convex functions and a general three-point integral formula involving harmonic sequences polynomials w-harmonic functions. In special cases, estimates are derived various classical quadrature formulae such as the Gauss–Legendre Gauss–Chebyshev first second kind.

Journal: :Graphs and Combinatorics 2012
Yichao Chen Toufik Mansour Qian Zou

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

2009
Bob Chen Arthur T. Benjamin Larry Ericksen Pallavi Jayawant

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

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید