Approximating monomials using Chebyshev polynomials

arXiv2101.06818MaRDI QIDQ6358477FDOQ6358477

Publication date: 17 January 2021

Abstract: This paper considers the approximation of a monomial

x^{n}

over the interval

[- 1, 1]

by a lower-degree polynomial. This polynomial approximation can be easily computed analytically and is obtained by truncating the analytical Chebyshev series expansion of

x^{n}

. The error in the polynomial approximation in the supremum norm has an exact expression with an interesting probabilistic interpretation. We use this interpretation along with concentration inequalities to develop a useful upper bound for the error.

This page was built for publication: Approximating monomials using Chebyshev polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6358477)