Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Related topics

Related topics

37 relations
Analogue filterApproximation theoryBasis functionChebfun
Expand

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
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… Expand
  • figure 1
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… Expand
  • figure 1
  • figure 2
  • figure 5
  • figure 3
  • figure 6
Highly Cited
2004
Highly Cited
2004
Stability of linear time-periodic delay-differential equations via Chebyshev polynomials
This paper presents a new technique for studying the stability properties of dynamic systems modeled by delay-differential… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Highly Cited
2003
Highly Cited
2003
Integration Using Chebyshev Polynomials
In this chapter we show how Chebyshev polynomials and some of their fundamental properties can be made to play an important part… Expand
Highly Cited
2000
Highly Cited
2000
High dimensional polynomial interpolation on sparse grids
We study polynomial interpolation on a d-dimensional cube, where d is large. We suggest to use the least solution at sparse grids… Expand
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. Sci. Comput.
  • 1995
    • Corpus ID: 1378774
Efficient direct solvers based on the Chebyshev–Galerkin methods for second- and fourth-order equations are presented. They are… Expand
  • table I
  • table III
  • table V
1993
1993
Chebyshev polynomials of the second, third and fourth kinds in approximation, indefinite integration, and integral transforms
Abstract Chebyshev polynomials of the third and fourth kinds, orthogonal with respect to (1 + x) 1 2 (1 − x)− 1 2 and (1 − x) 1 2… Expand
Highly Cited
1989
Highly Cited
1989
Chebyshev and Fourier Spectral Methods
A computation is a temptation that should be resisted as long as possible. " 
  • figure 1.1
  • table 1.1
  • figure 1.2
  • figure 1.3
  • figure 1.4
Highly Cited
1970
Highly Cited
1970
Chebyshev polynomials in numerical analysis
 
Highly Cited
1963
Highly Cited
1963
Probability Theory I
These notes cover the basic definitions of discrete probability theory, and then present some results including Bayes' rule… Expand
  • figure 1
  • figure 2
  • figure 3
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE