Analysis of discrete L^2 projection on polynomial spaces with random evaluations
From MaRDI portal
Publication:404295
nonparametric regressionerror analysisapproximation theorymultivariate polynomial approximationgeneralized polynomial chaosnoise-free datapoint collocation
Approximation by polynomials (41A10) Stability and convergence of numerical methods for boundary value problems involving PDEs (65N12) Error bounds for boundary value problems involving PDEs (65N15) Spectral, collocation and related methods for boundary value problems involving PDEs (65N35) Rate of convergence, degree of approximation (41A25)
Recommendations
- Weighted discrete least-squares polynomial approximation using randomized quadratures
- Discrete least squares polynomial approximation with random evaluations - application to parametric and stochastic elliptic PDEs
- Adaptive polynomial approximation by means of random discrete least squares
- Analysis of discrete least squares on multivariate polynomial spaces with evaluations at low-discrepancy point sets
- On Discrete Least-Squares Projection in Unbounded Domain with Random Evaluations and its Application to Parametric Uncertainty Quantification
Cites work
- scientific article; zbMATH DE number 3539473 (Why is no real title available?)
- scientific article; zbMATH DE number 1262778 (Why is no real title available?)
- scientific article; zbMATH DE number 1878659 (Why is no real title available?)
- A Sparse Grid Stochastic Collocation Method for Partial Differential Equations with Random Input Data
- A Stochastic Collocation Method for Elliptic Partial Differential Equations with Random Input Data
- A distribution-free theory of nonparametric regression
- A posteriori error estimation in finite element analysis
- Adaptive sparse polynomial chaos expansion based on least angle regression
- Analytic regularity and polynomial approximation of parametric and stochastic elliptic PDE's
- Approximation Results for Orthogonal Polynomials in Sobolev Spaces
- Approximation of quantities of interest in stochastic PDEs by the random discrete \(L^2\) projection on polynomial spaces
- Compressed sensing
- Convergence rates of best \(N\)-term Galerkin approximations for a class of elliptic SPDEs
- Design under uncertainty employing stochastic expansion methods
- Estimation of a Regression Function by Maxima of Minima of Linear Functions
- Fast numerical methods for stochastic computations: a review
- Inequalities for uniform deviations of averages from expectations with applications to nonparametric regression
- Nonlinear orthogonal series estimates for random design regression
- Numerical Challenges in the Use of Polynomial Chaos Representations for Stochastic Processes
- On the convergence of generalized polynomial chaos expansions
- On the optimal polynomial approximation of stochastic PDEs by Galerkin and collocation methods
- On the stability and accuracy of least squares approximations
- Order Statistics
- Probability: A Graduate Course
- Sparse polynomial chaos expansions and adaptive stochastic finite elements using a regression approach
- Spectral Methods for Uncertainty Quantification
- Stable signal recovery from incomplete and inaccurate measurements
- Stochastic Spectral Galerkin and Collocation Methods for PDEs with Random Coefficients: A Numerical Comparison
- The Wiener--Askey Polynomial Chaos for Stochastic Differential Equations
- Universal algorithms for learning theory. I: Piecewise constant functions.
- Universal algorithms for learning theory. II: Piecewise polynomial functions
Cited in
(48)- Adaptive polynomial approximation by means of random discrete least squares
- Accelerating stochastic collocation methods for partial differential equations with random input data
- Adaptive approximation by optimal weighted least-squares methods
- Analysis of discrete least squares on multivariate polynomial spaces with evaluations at low-discrepancy point sets
- Approximation of quantities of interest in stochastic PDEs by the random discrete \(L^2\) projection on polynomial spaces
- Coherence motivated sampling and convergence analysis of least squares polynomial chaos regression
- Weighted approximate Fekete points: sampling for least-squares polynomial approximation
- Nonadaptive quasi-optimal points selection for least squares linear regression
- A weighted \(\ell_1\)-minimization approach for sparse polynomial chaos expansions
- Compressive Hermite interpolation: sparse, high-dimensional approximation from gradient-augmented measurements
- On tensor product approximation of analytic functions
- Towards optimal sampling for learning sparse approximation in high dimensions
- Multivariate approximation in downward closed polynomial spaces
- A hybrid sequential sampling strategy for sparse polynomial chaos expansion based on compressive sampling and Bayesian experimental design
- A novel variable-separation method based on sparse and low rank representation for stochastic partial differential equations
- A least-squares method for sparse low rank approximation of multivariate functions
- Multivariate discrete least-squares approximations with a new type of collocation grid
- Compressive sensing Petrov-Galerkin approximation of high-dimensional parametric operator equations
- Hyperspherical sparse approximation techniques for high-dimensional discontinuity detection
- Convergence estimates in probability and in expectation for discrete least squares with noisy evaluations at random points
- Discrete least-squares approximations over optimized downward closed polynomial spaces in arbitrary dimension
- Near-optimal sampling strategies for multivariate function approximation on general domains
- A fast discrete spectral method for stochastic partial differential equations
- Stable high-order randomized cubature formulae in arbitrary dimension
- APPROXIMATING SMOOTH, MULTIVARIATE FUNCTIONS ON IRREGULAR DOMAINS
- A Variable-Separation Method for Nonlinear Partial Differential Equations With Random Inputs
- Spectral likelihood expansions for Bayesian inference
- Convergence bounds for empirical nonlinear least-squares
- Parametrization of Random Vectors in Polynomial Chaos Expansions via Optimal Transportation
- On a near optimal sampling strategy for least squares polynomial regression
- Correcting for unknown errors in sparse high-dimensional function approximation
- Infinite-dimensional \(\ell ^1\) minimization and function approximation from pointwise data
- Effectively subsampled quadratures for least squares polynomial approximations
- Stochastic Collocation vial1-Minimisation on Low Discrepancy Point Sets with Application to Uncertainty Quantification
- Error Estimates for Multivariate Regression on Discretized Function Spaces
- Least squares polynomial chaos expansion: a review of sampling strategies
- Weighted discrete least-squares polynomial approximation using randomized quadratures
- Function integration, reconstruction and approximation using rank-\(1\) lattices
- Error guarantees for least squares approximation with noisy samples in domain adaptation
- Exploiting active subspaces to quantify uncertainty in the numerical simulation of the hyshot II scramjet
- Optimal weighted least-squares methods
- Least squares approximation of polynomial chaos expansions with optimized grid points
- Linear collective collocation approximation for parametric and stochastic elliptic PDEs
- High-dimensional adaptive sparse polynomial interpolation and applications to parametric PDEs
- Infinite-dimensional compressed sensing and function interpolation
- Multivariate Markov-type and Nikolskii-type inequalities for polynomials associated with downward closed multi-index sets
- A Christoffel function weighted least squares algorithm for collocation approximations
- Discrete least squares polynomial approximation with random evaluations - application to parametric and stochastic elliptic PDEs
This page was built for publication: Analysis of discrete \(L^2\) projection on polynomial spaces with random evaluations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q404295)
