Chebyshev Approximation

Chebyshev Approximation is a curve fitting method that minimizes the maximum error between the target function and the approximating polynomial by utilizing orthogonal Chebyshev polynomials as basis functions.

1.3K

Publications

56.2K

Citations

1.9K

Authors

877

Institutions

Publications per year

2017–2026

191

Variants

Chebyshev Approximation MethodMinimax Approximation

Authors

1.9K

  1. JP
    John P. Boyd

    University of Michigan, United States

    22 publications · 1K citations

    18

    h-index

  2. CB
    Charles B. Dunham

    Western University, Canada

    21 publications · 400 citations

    14

    h-index

  3. LN
    Lloyd N. Trefethen

    University of Oxford, United Kingdom

    14 publications · 1.1K citations

    13

    h-index

  4. DE
    David Elliott

    University of Tasmania, Australia

    10 publications · 366 citations

    10

    h-index

  5. GH
    Gene H. Golub

    Stanford University, United States

    8 publications · 703 citations

    8

    h-index

1–5 of 1.9K

Venues

  1. Applied Mathematics and Computation

    51 publications · 2.2K citations

    28

    h-index

  2. Mathematics of Computation

    MCOM · 67 publications · 3K citations

    28

    h-index

  3. SIAM Journal on Numerical Analysis

    54 publications · 2.1K citations

    26

    h-index

  4. Journal of Approximation Theory

    57 publications · 1.7K citations

    25

    h-index

  5. Journal of Computational and Applied Mathematics

    42 publications · 1.4K citations

    22

    h-index

1–5