Approximating monomials using Chebyshev polynomials

01/18/2021
by   Arvind K. Saibaba, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/12/2020

Balancing Polynomials in the Chebyshev Norm

Given n polynomials p_1, …, p_n of degree at most n with p_i_∞≤ 1 for i ...
research
12/05/2018

On the Probabilistic Degree of OR over the Reals

We study the probabilistic degree over reals of the OR function on n var...
research
09/30/2021

Polynomial Approximation of Symmetric Functions

We study the polynomial approximation of symmetric multivariate function...
research
01/04/2023

Extremal polynomials on the n-grid

The n-grid E_n consists of n equally spaced points in [-1,1] including t...
research
04/23/2021

Bounds-constrained polynomial approximation using the Bernstein basis

A fundamental problem in numerical analysis and approximation theory is ...
research
08/01/2020

On the filtered polynomial interpolation at Chebyshev nodes

The paper deals with a special filtered approximation method, which orig...
research
05/15/2021

Polynomial degree reduction in the ℒ^2-norm on a symmetric interval for the canonical basis

In this paper, we develop a direct formula for determining the coefficie...

Please sign up or login with your details

Forgot password? Click here to reset