Chebyshev Polynomial Representation

Chebyshev Polynomial Representation is a mathematical approximation method that uses orthogonal polynomials defined on the interval [-1, 1] with minimal maximum error to efficiently encode high-precision ephemeris data as a series of weighted Chebyshev basis functions.

844

Publications

37.4K

Citations

1.4K

Authors

675

Institutions

Publications per year

2017–2026

160

Authors

1.4K

  1. JP
    John P. Boyd

    University of Michigan, United States

    19 publications · 880 citations

    16

    h-index

  2. WM
    W. M. Abd‐Elhameed

    Cairo University, Egypt

    12 publications · 414 citations

    12

    h-index

  3. DS
    Dae San Kim

    Sogang University, South Korea

    11 publications · 185 citations

    10

    h-index

  4. TK
    Taekyun Kim

    Kwangwoon University, South Korea

    10 publications · 168 citations

    10

    h-index

  5. YH
    Y. H. Youssri

    Cairo University, Egypt

    7 publications · 238 citations

    7

    h-index

1–5 of 1.4K

Venues

  1. Mathematics of Computation

    MCOM · 42 publications · 1.8K citations

    23

    h-index

  2. Journal of Approximation Theory

    31 publications · 1.1K citations

    19

    h-index

  3. Journal of Computational and Applied Mathematics

    28 publications · 904 citations

    19

    h-index

  4. Applied Mathematics and Computation

    26 publications · 952 citations

    19

    h-index

  5. Journal of Computational Physics

    21 publications · 1.6K citations

    17

    h-index

1–5