In mathematics, discrete Chebyshev polynomials, or Gram polynomials, are a type of discrete orthogonal polynomials used in approximation theory.

The Chebyshev polynomials form a complete orthogonal system. · The Chebyshev series converges to f(x) if the function is piecewise smooth and continuous. · At a ... Relations between the two... · Properties · As a basis set

Note that Chebyshev polynomials are ORTHOGONAL , but not. ORTHONORMAL. Page 5 ... Note similarity to the corresponding DISCRETE ORTHOGONALITY. RELATION ...

In this paper, we present explicit formulas for discrete orthogonal polynomials over the so-called Gauss–Lobatto Chebyshev points.

This paper introduces a new set of moment functions based on Chebyshev polynomials which are orthogonal in the discrete domain of the image coordinate space. ...

This paper introduces a new set of moment functions based on Chebyshev polynomials which are orthogonal in the discrete domain of the image coordinate space ...

29 авг. 2018 г. · In this approach, the fractional derivative of the state function in the dynamic constraint of TDFOCPs is approximated by orthogonal polynomials ...

In this article we consider the problem of constructing polynomials, ortho- gonal in Sobolev sence on the finite uniform net and associated with classical.

The orthonormal shifted discrete Chebyshev polynomials are generated and used for constructing a computational matrix method to solve the defined system.

Продолжительность: 9:12
Опубликовано: 5 сент. 2020 г.