Analysis of discrete [L.sup.2] projection on polynomial spaces with random evaluations

We analyze the problem of approximating a multivariate function by discrete least-squares projection on a polynomial space starting from random, noise-free observations. An area of possible application of such technique is uncertainty quantification for computational models. We prove an optimal convergence estimate, up to a logarithmic factor, in the univariate case, when the observation points are sampled in a bounded domain from a probability density function bounded away from zero and bounded from above, provided the number of samples scales quadratically with the dimension of the polynomial space. Optimality is meant in the sense that the weighted [L.sup.2] norm of the error committed by the random discrete projection is bounded with high probability from above by the best [L.sup.∞] error achievable in the given polynomial space, up to logarithmic factors. Several numerical tests are presented in both the univariate and multivariate cases, confirming our theoretical estimates. The numerical tests also clarify how the convergence rate depends on the number of sampling points, on the polynomial degree, and on the smoothness of the target function. Keywords Approximation theory * Error analysis * Multivariate polynomial approximation * Nonparametric regression * Noise-free data * Generalized polynomial chaos * Point collocation Mathematical Subject Classification 41A10 * 41A25 * 65N12 * 65N15 * 65N35
1 Introduction Given a smooth multivariate function φ = φ([Y.sup.1], ..., [Y.sup.d]) depending on d random variables [Y.sup.1], ..., [Y.sup.d] we consider in this work the classical problem of approximating [...]