Polynomial approximation of symmetric functions
From MaRDI portal
Publication:6140849
DOI10.1090/mcom/3868arXiv2109.14771MaRDI QIDQ6140849
Geneviève Dusson, Jack Thomas, Markus Bachmayr, Christoph Ortner
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
polynomial approximation; convergence rate; number of parameters; multi-set function; multivariate symmetric function; reduction of curse of dimensionality
41A63: Multidimensional problems
41A29: Approximation with constraints
41A10: Approximation by polynomials
41A25: Rate of convergence, degree of approximation
65D40: Numerical approximation of high-dimensional functions; sparse grids
Related Items
Cites Work
- On tensor product approximation of analytic functions
- Computational invariant theory. With two appendices by Vladimir L. Popov and an addendum by Nobert A. Campo and Vladimir L. Popov
- Tractability of multivariate problems. Volume I: Linear information
- Near-best multivariate approximation by Fourier series, Chebyshev series and Chebyshev interpolation
- The complexity of linear tensor product problems in (anti)symmetric Hilbert spaces
- Atomic cluster expansion: completeness, efficiency and stability
- Universal approximation of symmetric and anti-symmetric functions
- On an elementary proof of some asymptotic formulas in the theory of partitions
- Body-ordered approximations of atomic properties
- QM/MM Methods for Crystalline Defects. Part 1: Locality of the Tight Binding Model
- Approximation of high-dimensional parametric PDEs
- Multivariate polynomial approximation in the hypercube
- Lower and Upper Bounds for the Number of Lattice Points in a Simplex
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
