arXiv Analytics

Sign in

arXiv:2109.14771 [math.NA]AbstractReferencesReviewsResources

Polynomial Approximation of Symmetric Functions

Markus Bachmayr, Geneviève Dusson, Christoph Ortner, Jack Thomas

Published 2021-09-30, updated 2022-03-09Version 2

We study the polynomial approximation of symmetric multivariate functions and of multi-set functions. Specifically, we consider $f(x_1, \dots, x_N)$, where $x_i \in \mathbb{R}^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. These results are then exploited to construct approximations and prove approximation rates for functions defined on multi-sets where $N$ becomes a parameter of the input.

Related articles: Most relevant | Search more
arXiv:2401.12415 [math.NA] (Published 2024-01-23)
On enforcing non-negativity in polynomial approximations in high dimensions
arXiv:2106.01926 [math.NA] (Published 2021-06-03)
A new framework for polynomial approximation to differential equations
arXiv:1602.05823 [math.NA] (Published 2016-02-18)
Polynomial approximation via compressed sensing of high-dimensional functions on lower sets