arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2109.14771math.NAcs.NA
收藏

对称函数的多项式逼近

Polynomial Approximation of Symmetric Functions

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

摘要:

本文研究对称多元函数和多集函数的多项式逼近。具体来说,我们考虑$f(x_1, \dots, x_N)$,其中$x_i \in \mathbb{R}^d$和$f$在其$N$参数的排列下是不变的。我们演示了如何利用这些对称性,以提高成本与误差比的函数$f$的多项式逼近,特别是研究该比率对$d, N$和多项式的程度的依赖。然后,这些结果被用来构建近似和证明逼近率定义的多个集合上的功能,其中$N$成为一个参数的输入。

英文摘要:

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 used to construct approximations and prove approximation rates for functions defined on multi-sets where $N$ becomes a parameter of the input.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑