Skip to search formSkip to main contentSkip to account menu

Discrete Chebyshev polynomials

Known as: Discrete Tchebichef polynomial, Discrete Tchebyscheff polynomial, Discrete Cheyshev polynomials 
In mathematics, discrete Chebyshev polynomials, or Gram polynomials, are a type of discrete orthogonal polynomials used in approximation theory… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
The discrete periodic extension is a technique for augmenting a given set of uniformly spaced samples of a smooth function with… 
2013
2013
This paper presents an instrument for the measurement of the 3D surface geometry of disks, which enables the quantification of… 
2013
2013
A new methodology is introduced for use in discrete periodic extension of non-periodic functions. The methodology is based on a… 
2013
2013
— In this paper we introduce a new approach to heart sounds biometric recognition based on Gram polynomials and probabilistic… 
2011
2011
This paper presents a new approach to non-rigid registration. A hierarchical subdivision approach is applied, with local… 
2011
2011
This paper presents a new approach to non-rigid elastic registration. The method is applied to hyper spectral imaging data for… 
2006
2006
Moment functions based on Tchebichef polynomials have been used recently in pattern recognition applications. Such functions have… 
1997
1997
Abstract. We derive a new upper bound on the covering radius of a code as a function of its dual distance. This bound improves on… 
1993
1993
Discrete time orthogonal polynomials such as Gram polynomials have been used In the past to control shape on steel rolling mills…