Analysis of discrete \(L^2\) projection on polynomial spaces with random evaluations

DOI10.1007/s10208-013-9186-4zbMath1301.41005OpenAlexW2065120373MaRDI QIDQ404295

Erik von Schwerin, Fabio Nobile, Giovanni Migliorati, Raúl Tempone

Publication date: 4 September 2014

Published in: Foundations of Computational Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10208-013-9186-4

zbMATH Keywords

error analysisapproximation theorynonparametric regressionmultivariate polynomial approximationgeneralized polynomial chaosnoise-free datapoint collocation

Mathematics Subject Classification ID

Spectral, collocation and related methods for boundary value problems involving PDEs (65N35) Error bounds for boundary value problems involving PDEs (65N15) Stability and convergence of numerical methods for boundary value problems involving PDEs (65N12) Approximation by polynomials (41A10) Rate of convergence, degree of approximation (41A25)

Related Items (45)

Infinite-dimensional \(\ell ^1\) minimization and function approximation from pointwise data ⋮ Discrete least-squares approximations over optimized downward closed polynomial spaces in arbitrary dimension ⋮ Convergence bounds for empirical nonlinear least-squares ⋮ Near-Optimal Sampling Strategies for Multivariate Function Approximation on General Domains ⋮ On tensor product approximation of analytic functions ⋮ Weighted discrete least-squares polynomial approximation using randomized quadratures ⋮ Exploiting active subspaces to quantify uncertainty in the numerical simulation of the hyshot II scramjet ⋮ Parametrization of Random Vectors in Polynomial Chaos Expansions via Optimal Transportation ⋮ A Least-Squares Method for Sparse Low Rank Approximation of Multivariate Functions ⋮ Accelerating Stochastic Collocation Methods for Partial Differential Equations with Random Input Data ⋮ Hyperspherical Sparse Approximation Techniques for High-Dimensional Discontinuity Detection ⋮ Infinite-dimensional compressed sensing and function interpolation ⋮ A weighted \(\ell_1\)-minimization approach for sparse polynomial chaos expansions ⋮ On a near optimal sampling strategy for least squares polynomial regression ⋮ A fast discrete spectral method for stochastic partial differential equations ⋮ Compressive sensing Petrov-Galerkin approximation of high-dimensional parametric operator equations ⋮ High-dimensional adaptive sparse polynomial interpolation and applications to parametric PDEs ⋮ Convergence estimates in probability and in expectation for discrete least squares with noisy evaluations at random points ⋮ Error guarantees for least squares approximation with noisy samples in domain adaptation ⋮ Correcting for unknown errors in sparse high-dimensional function approximation ⋮ A Novel Variable-Separation Method Based on Sparse and Low Rank Representation for Stochastic Partial Differential Equations ⋮ Least Squares Approximation of Polynomial Chaos Expansions With Optimized Grid Points ⋮ APPROXIMATING SMOOTH, MULTIVARIATE FUNCTIONS ON IRREGULAR DOMAINS ⋮ Weighted Approximate Fekete Points: Sampling for Least-Squares Polynomial Approximation ⋮ A Christoffel function weighted least squares algorithm for collocation approximations ⋮ Stochastic Collocation vial₁-Minimisation on Low Discrepancy Point Sets with Application to Uncertainty Quantification ⋮ Multivariate Approximation in Downward Closed Polynomial Spaces ⋮ Towards optimal sampling for learning sparse approximation in high dimensions ⋮ Multivariate Markov-type and Nikolskii-type inequalities for polynomials associated with downward closed multi-index sets ⋮ Coherence motivated sampling and convergence analysis of least squares polynomial chaos regression ⋮ Effectively Subsampled Quadratures for Least Squares Polynomial Approximations ⋮ A hybrid sequential sampling strategy for sparse polynomial chaos expansion based on compressive sampling and Bayesian experimental design ⋮ Nonadaptive Quasi-Optimal Points Selection for Least Squares Linear Regression ⋮ Spectral likelihood expansions for Bayesian inference ⋮ Linear collective collocation approximation for parametric and stochastic elliptic PDEs ⋮ Optimal weighted least-squares methods ⋮ A Variable-Separation Method for Nonlinear Partial Differential Equations With Random Inputs ⋮ Error Estimates for Multivariate Regression on Discretized Function Spaces ⋮ Least squares polynomial chaos expansion: a review of sampling strategies ⋮ Compressive Hermite interpolation: sparse, high-dimensional approximation from gradient-augmented measurements ⋮ Adaptive Approximation by Optimal Weighted Least-Squares Methods ⋮ Function integration, reconstruction and approximation using rank-$1$ lattices ⋮ Stable high-order randomized cubature formulae in arbitrary dimension ⋮ Discrete least squares polynomial approximation with random evaluations − application to parametric and stochastic elliptic PDEs ⋮ Analysis of discrete least squares on multivariate polynomial spaces with evaluations at low-discrepancy point sets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the stability and accuracy of least squares approximations
• Convergence rates of best \(N\)-term Galerkin approximations for a class of elliptic SPDEs
• Adaptive sparse polynomial chaos expansion based on least angle regression
• Sparse polynomial chaos expansions and adaptive stochastic finite elements using a regression approach
• Nonlinear orthogonal series estimates for random design regression
• Inequalities for uniform deviations of averages from expectations with applications to nonparametric regression
• A distribution-free theory of nonparametric regression
• Universal algorithms for learning theory. II: Piecewise polynomial functions
• On the convergence of generalized polynomial chaos expansions
• Approximation of Quantities of Interest in Stochastic PDEs by the Random Discrete $L^2$ Projection on Polynomial Spaces
• Stochastic Spectral Galerkin and Collocation Methods for PDEs with Random Coefficients: A Numerical Comparison
• ANALYTIC REGULARITY AND POLYNOMIAL APPROXIMATION OF PARAMETRIC AND STOCHASTIC ELLIPTIC PDE'S
• ON THE OPTIMAL POLYNOMIAL APPROXIMATION OF STOCHASTIC PDES BY GALERKIN AND COLLOCATION METHODS
• DESIGN UNDER UNCERTAINTY EMPLOYING STOCHASTIC EXPANSION METHODS
• Spectral Methods for Uncertainty Quantification
• A Sparse Grid Stochastic Collocation Method for Partial Differential Equations with Random Input Data
• Approximation Results for Orthogonal Polynomials in Sobolev Spaces
• Order Statistics
• Numerical Challenges in the Use of Polynomial Chaos Representations for Stochastic Processes
• Probability: A Graduate Course
• The Wiener--Askey Polynomial Chaos for Stochastic Differential Equations
• Estimation of a Regression Function by Maxima of Minima of Linear Functions
• Stable signal recovery from incomplete and inaccurate measurements
• Compressed sensing
• A Stochastic Collocation Method for Elliptic Partial Differential Equations with Random Input Data

This page was built for publication: Analysis of discrete \(L^2\) projection on polynomial spaces with random evaluations