Chebyshev polynomials

Known as: Chebyshev polynomials/Proofs, Tchebyscheff polynomial, Chebyshev root 
In mathematics the Chebyshev polynomials, named after Pafnuty Chebyshev, are a sequence of orthogonal polynomials which are related to de Moivre's… (More)
Wikipedia

Related topics

Related topics

36 relations
Analogue filterApproximation theoryBasis functionChebfun
(More)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2011
Highly Cited
2011
Chebyshev polynomial approximation for distributed signal processing
Unions of graph Fourier multipliers are an important class of linear operators for processing signals defined on graphs. We… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Security of public-key cryptosystems based on Chebyshev polynomials
Chebyshev polynomials have been recently proposed for designing public-key systems. Indeed, they enjoy some nice chaotic… (More)
  • figure 1
Is this relevant?
Highly Cited
2004
Highly Cited
2004
Indexing Spatio-Temporal Trajectories with Chebyshev Polynomials
In this paper, we attempt to approximate and index a d- dimensional (d ≥ 1) spatio-temporal trajectory with a low order… (More)
  • figure 3.1
  • figure 4.1
  • figure 4.2
  • figure 4.3
  • table 4.1
Is this relevant?
2004
2004
Cryptography using Chebyshev polynomials
We consider replacing the monomial xn with the Chebyshev polynomial Tn(x) in the Diffie-Hellman and RSA cryptography algorithms… (More)
Is this relevant?
2002
2002
Restricted permutations and Chebyshev polynomials.
We study generating functions for the number of permutations in Sn subject to two restrictions. One of the restrictions belongs… (More)
  • figure 2
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1999
Highly Cited
1999
Forbidden subsequences and Chebyshev polynomials
In (West, Discrete Math. 157 (1996) 363-374) it was shown using transfer matrices that the number [Sn(123; 3214)1 of permutations… (More)
Is this relevant?
1999
1999
sigma-Automata and Chebyshev-Polynomials
A σ-automaton is an additive, binary cellular automaton on a graph. For product graphs such as a grids and cylinders… (More)
  • figure 1
  • table 1
  • table 2
  • table 3
Is this relevant?
Highly Cited
1998
Highly Cited
1998
The Chebyshev Polynomials of a Matrix
A Chebyshev polynomial of a square matrix A is a monic polynomial p of specified degree that minimizes ‖p(A)‖2. The study of such… (More)
  • figure 12
  • figure 13
  • figure 14
  • figure 9
  • figure 10
Is this relevant?
Highly Cited
1995
Highly Cited
1995
Efficient Spectral-Galerkin Method II. Direct Solvers of Second- and Fourth-Order Equations Using Chebyshev Polynomials
  • Jie Shen
  • SIAM J. Scientific Computing
  • 1995
Efficient direct solvers based on the Chebyshev-Galerkin methods for second and fourth order equations are presented. They are… (More)
  • table I
  • table III
  • table V
Is this relevant?
Highly Cited
1986
Highly Cited
1986
The computation of line spectral frequencies using Chebyshev polynomials
Line spectral frequencies provide an alternate parameterization of the analysis and synthesis filters used in linear predictive… (More)
  • figure 1
  • figure 2
  • figure 3
  • table I
  • figure 4
Is this relevant?