Polynomial Approximation of Symmetric Functions

09/30/2021
by   Markus Bachmayr, et al.
0

We study the polynomial approximation of symmetric multivariate functions. Specifically, we consider f(x_1, …, x_N), where x_i ∈ℝ^d, and f is invariant under permutations of its N arguments. We demonstrate how these symmetries can be exploited to improve the cost versus error ratio in a polynomial approximation of the function f, and in particular study the dependence of that ratio on d, N and the polynomial degree.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/16/2020

A Note on Optimizing the Ratio of Monotone Supermodular Functions

We show that for the problem of minimizing (or maximizing) the ratio of ...
research
02/28/2021

On the Approximation Ratio of the 3-Opt Algorithm for the (1,2)-TSP

The (1,2)-TSP is a special case of the TSP where each edge has cost eith...
research
12/22/2022

Multivariate Polynomial Regression of Euclidean Degree Extends the Stability for Fast Approximations of Trefethen Functions

We address classic multivariate polynomial regression tasks from a novel...
research
01/18/2021

Approximating monomials using Chebyshev polynomials

This paper considers the approximation of a monomial x^n over the interv...
research
09/03/2019

Symmetric Triangle Quadrature Rules for Arbitrary Functions

Despite extensive research on symmetric polynomial quadrature rules for ...
research
04/24/2009

Better Global Polynomial Approximation for Image Rectification

When using images to locate objects, there is the problem of correcting ...
research
02/14/2023

Polynomial argmin for recovery and approximation of multivariate discontinuous functions

We propose to approximate a (possibly discontinuous) multivariate functi...

Please sign up or login with your details

Forgot password? Click here to reset