On the Chebyshev approximation of a function with two variables

2015/04/18 by Ernest Scheiber, Scheiber, Ernest
Computer Science · Engineering · Mathematics · #40-04 (Secondary) #65D15(Primary) #Advanced Computational Techniques in Science and Engineering #Differential Equations and Boundary Problems #Elasticity and Wave Propagation #FOS: Mathematics #Numerical Analysis (math.NA)

paper · pdf · doi:10.48550/arxiv.1504.04693

openalex publication_date 2015/04/18 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/01

Abstract

There is presented an approach to find an approximation polynomial of a function with two variables based on the two dimensional discrete Fourier transform. The approximation polynomial is expressed through Chebyshev polynomials. There is given an uniform convergence result.

Related

• Exploring Chebyshev Polynomial Approximations: Error Estimates for Functions of Bounded Variation
• Chebyshev and The Fast Fourier Transform Methods for Signal Interpolation
• An adaptive partition of unity method for multivariate Chebyshev\n polynomial approximations
• Rigorous uniform approximation of D-finite functions using Chebyshev expansions
• Chebyshev approximation by non-Chebyshev systems