Sparse grids vs. random points for high-dimensional polynomial approximation

Cites work

A sharp upper bound for sampling numbers in \(L_2\)
Analysis of discrete L^2 projection on polynomial spaces with random evaluations
APPROXIMATION OF PERIODIC FUNCTIONS OF SEVERAL VARIABLES BY TRIGONOMETRIC POLYNOMIALS, AND WIDTHS OF SOME CLASSES OF FUNCTIONS
Auswertung der Normen von Interpolationsoperatoren
Constructing least-squares polynomial approximations
Constructive subsampling of finite frames with applications in optimal function recovery
Dimension-free discretizations of the uniform norm by small product sets
Discrete least squares polynomial approximation with random evaluations - application to parametric and stochastic elliptic PDEs
Error guarantees for least squares approximation with noisy samples in domain adaptation
Explicit cost bounds of algorithms for multivariate tensor product problems
Fekete points as norming sets
Function values are enough for \(L_2\)-approximation
Function values are enough for \(L_2\)-approximation. II
Geometric weakly admissible meshes, discrete least squares approximations and approximate Fekete points
High dimensional integration of smooth functions over cubes
High dimensional polynomial interpolation on sparse grids
scientific article; zbMATH DE number 3770219 (Why is no real title available?)
scientific article; zbMATH DE number 3477793 (Why is no real title available?)
scientific article; zbMATH DE number 3321507 (Why is no real title available?)
Hyperbolic cross approximation. Lecture notes given at the courses on constructive approximation and harmonic analysis, Barcelona, Spain, May 30 -- June 3, 2016
LAPACK Users' Guide
Multivariate approximation
On optimal designs for a d-cube
On optimal polynomial meshes
On optimal recovery in L₂
On polynomial approximation in the uniform norm by the discrete least squares method
On Sobolev orthogonal polynomials
On the power of iid information for linear approximation
On the stability and accuracy of least squares approximations
On the worst-case error of least squares algorithms for L₂-approximation with high probability
Optimal pointwise sampling for \(L^2\) approximation
Optimal polynomial meshes exist on any multivariate convex domain
Optimal weighted least-squares methods
Randomized least-squares with minimal oversampling and interpolation in general spaces
Randomized weakly admissible meshes
Sampling discretization and related problems
Sampling discretization of the uniform norm
Sampling projections in the uniform norm
Sampling, Marcinkiewicz-Zygmund inequalities, approximation, and quadrature rules
Simple cubature formulas with high polynomial exactness
Smolyak method for solving dynamic economic models: Lagrange interpolation, anisotropic grid and adaptive domain
Sparse grids
Tent-transformed lattice rules for integration and approximation of multivariate non-periodic functions
Theory of function spaces. IV
Uniform approximation by discrete least squares polynomials
Worst-case recovery guarantees for least squares approximation using random samples
Über die Genauigkeit der Annäherung stetiger Funktionen durch ganze rationale Funktionen gegebenen Grades und trigonometrische Summen gegebener Ordnung.

This page was built for publication: Sparse grids vs. random points for high-dimensional polynomial approximation

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