Analysis of Discrete L2 Projection on Polynomial Spaces with Random Evaluations

Giovanni Migliorati, Fabio Nobile, Erik von Schwerin, Raul Tempone

Research output: Contribution to journalArticlepeer-review

50 Scopus citations

Abstract

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 L2 norm of the error committed by the random discrete projection is bounded with high probability from above by the best L∞ 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. © 2014 SFoCM.
Original languageEnglish (US)
Pages (from-to)419-456
Number of pages38
JournalFoundations of Computational Mathematics
Volume14
Issue number3
DOIs
StatePublished - Mar 5 2014

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Computational Mathematics
  • Theoretical Computer Science
  • Applied Mathematics
  • Mathematics(all)

Fingerprint Dive into the research topics of 'Analysis of Discrete L2 Projection on Polynomial Spaces with Random Evaluations'. Together they form a unique fingerprint.

Cite this