Linked from

The 14 pages that link to Chebyshev polynomials, each with the reason it gives.

• Polynomial interpolationRelated: Their roots and extrema provide node choices with favorable interpolation behavior.

• Cyclotomic polynomialCompared with: Chebyshev polynomials encode cosine values, while cyclotomic polynomials encode exact root orders.

• CosineRelated: They turn cosine’s angle-multiplication rule into polynomial identities.

• Rational approximationRelated: They underpin efficient polynomial bases and comparison methods for approximation.

• Spectral methodRelated: They give accurate polynomial expansions and useful interpolation points.

• Weierstrass approximation theoremRelated: They provide efficient polynomial approximants with small maximum error.

• Legendre polynomialsCompared with: Their endpoint-weighted orthogonality differs from Legendre polynomials’ constant weight.

• Lucas sequenceRelated: Their recurrence identities connect them to special Lucas sequences.

• Polynomial evaluationBroader topic: Chebyshev expansions can improve approximation behavior and numerical stability over some input ranges.

• Pafnuty ChebyshevBroader topic: Their extremal behavior makes them effective tools for polynomial approximation.

• Matching polynomialRelated: Matching polynomials of paths can be expressed using Chebyshev polynomials.

• Inverse hyperbolic functionsRelated: Their identities connect inverse hyperbolic cosine to polynomial growth outside [−1,1].

• Markov brothers' inequalityRelated: Chebyshev polynomials attain equality in Markov’s first-derivative bound.

• Niven's theoremRelated: Their recurrence relations can turn rational-angle trigonometric identities into polynomial constraints.