Polynomial approximation of symmetric functions

DOI10.1090/MCOM/3868MaRDI QIDQ6140849zbMATH OpenFDO

Authors Markus Bachmayr, Geneviève Dusson, C. Ortner, Jack Thomas

Publication date 2 January 2024

Published in Mathematics of Computation (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2109.14771

zbMATH Keywords

convergence ratemulti-set functionmultivariate symmetric functionnumber of parameterspolynomial approximationreduction of curse of dimensionality

Mathematics Subject Classification ID

Approximation by polynomials (41A10) Rate of convergence, degree of approximation (41A25) Approximation with constraints (41A29) Multidimensional problems (41A63) Numerical approximation of high-dimensional functions; sparse grids (65D40)

Abstract: 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}inmathbb{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.

Recommendations

• Universal approximation of symmetric and anti-symmetric functions
• Sampling of homogeneous polynomials and approximating multivariate functions
• Polynomial approximation of anisotropic analytic functions of several variables
• scientific article; zbMATH DE number 852148
• Symmetric multivariate Chebyshev polynomials

Cites work

• Approximation of high-dimensional parametric PDEs
• Atomic cluster expansion: completeness, efficiency and stability
• Body-ordered approximations of atomic properties
• Computational invariant theory. With two appendices by Vladimir L. Popov and an addendum by Nobert A. Campo and Vladimir L. Popov
• scientific article; zbMATH DE number 1601795 (Why is no real title available?)
• scientific article; zbMATH DE number 1716480 (Why is no real title available?)
• scientific article; zbMATH DE number 5767933 (Why is no real title available?)
• scientific article; zbMATH DE number 3261482 (Why is no real title available?)
• scientific article; zbMATH DE number 2229032 (Why is no real title available?)
• Lower and Upper Bounds for the Number of Lattice Points in a Simplex
• Multivariate polynomial approximation in the hypercube
• Near-best multivariate approximation by Fourier series, Chebyshev series and Chebyshev interpolation
• On an elementary proof of some asymptotic formulas in the theory of partitions
• On tensor product approximation of analytic functions
• QM/MM methods for crystalline defects. I: Locality of the tight binding model
• The complexity of linear tensor product problems in (anti)symmetric Hilbert spaces
• Tractability of multivariate problems. Volume I: Linear information
• Universal approximation of symmetric and anti-symmetric functions

Cited in

(5)

• A Multilevel Method for Many-Electron Schrödinger Equations Based on the Atomic Cluster Expansion
• Atomic cluster expansion without self-interaction
• Optimal evaluation of symmetry-adapted n-correlations via recursive contraction of sparse symmetric tensors
• Surrogate models for vibrational entropy based on a spatial decomposition
• Approximation of functions: optimal sampling and complexity

This page was built for publication: Polynomial approximation of symmetric functions

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