Analysis of Discrete L2 Projection on Polynomial Spaces with Random Evaluations

We analyse 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 (UQ) for computational models. We prove an optimal convergence estimate, up to a logarithmic factor, in the monovariate case, when the observation points are sampled in a bounded domain from a probability density function bounded away from zero, provided the number of samples scales quadratically with the dimension of the polynomial space. Several numerical tests are presented both in the monovariate and multivariate case, 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


Published in:
Foundations of Computational Mathematics, 14, 3, 419-456
Year:
2014
Publisher:
New York, Springer Verlag
ISSN:
1615-3375
Keywords:
Laboratories:


Note: The status of this file is: EPFL only


 Record created 2014-02-05, last modified 2018-03-13

n/a:
Download fulltext
PDF

Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)