Chebyshev Polynomials

Chebyshev Polynomials is a sequence of orthogonal polynomials defined on the interval $[-1, 1]$ that are distinguished by their minimal maximum deviation from zero among all polynomials with leading coefficient normalized to one, arising as solutions to the Chebyshev differential equation and characterized by their trigonometric definition $ T_n(x) = \cos(n \arccos x) $.

2.2K

Publications

86.7K

Citations

3.6K

Authors

1.5K

Institutions

Publications per year

2017–2026

493

Authors

3.6K

  1. WM
    W. M. Abd‐Elhameed

    Cairo University, Egypt

    30 publications · 995 citations

    22

    h-index

  2. JP
    John P. Boyd

    University of Michigan, United States

    25 publications · 1K citations

    19

    h-index

  3. YH
    Y. H. Youssri

    Cairo University, Egypt

    21 publications · 718 citations

    17

    h-index

  4. LN
    Lloyd N. Trefethen

    University of Oxford, United Kingdom

    14 publications · 1.4K citations

    14

    h-index

  5. DZ
    Ding Zhou

    Nanjing Tech University, China

    14 publications · 610 citations

    14

    h-index

1–5 of 3.6K

Venues

  1. SIAM Journal on Numerical Analysis

    58 publications · 2.7K citations

    30

    h-index

  2. 28

    h-index

  3. Mathematics of Computation

    MCOM · 73 publications · 4K citations

    28

    h-index

  4. Applied Mathematics and Computation

    40 publications · 1.5K citations

    25

    h-index

  5. Journal of Approximation Theory

    51 publications · 1.4K citations

    22

    h-index

1–5