Analysis of discrete L^2 projection on polynomial spaces with random evaluations
From MaRDI portal
(Redirected from Publication:404295)
Analysis of discrete \(L^2\) projection on polynomial spaces with random evaluations
Analysis of discrete \(L^2\) projection on polynomial spaces with random evaluations
approximation theoryerror analysisgeneralized polynomial chaosmultivariate polynomial approximationnoise-free datanonparametric regressionpoint collocation
Approximation by polynomials (41A10) Rate of convergence, degree of approximation (41A25) 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)
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
- A distribution-free theory of nonparametric regression
- A posteriori error estimation in finite element analysis
- 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
- Adaptive sparse polynomial chaos expansion based on least angle regression
- Analytic regularity and polynomial approximation of parametric and stochastic elliptic PDE's
- Approximation of quantities of interest in stochastic PDEs by the random discrete L^2 projection on polynomial spaces
- Approximation Results for Orthogonal Polynomials in Sobolev 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
- 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?)
- 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
(61)- Infinite-dimensional compressed sensing and function interpolation
- On a near optimal sampling strategy for least squares polynomial regression
- A fast discrete spectral method for stochastic partial differential equations
- Coherence motivated sampling and convergence analysis of least squares polynomial chaos regression
- Stable high-order randomized cubature formulae in arbitrary dimension
- A hybrid sequential sampling strategy for sparse polynomial chaos expansion based on compressive sampling and Bayesian experimental design
- Least squares polynomial chaos expansion: a review of sampling strategies
- Compressive Hermite interpolation: sparse, high-dimensional approximation from gradient-augmented measurements
- Analysis of discrete least squares on multivariate polynomial spaces with evaluations at low-discrepancy point sets
- Infinite-dimensional \(\ell ^1\) minimization and function approximation from pointwise data
- Discrete least-squares approximations over optimized downward closed polynomial spaces in arbitrary dimension
- Weighted discrete least-squares polynomial approximation using randomized quadratures
- Exploiting active subspaces to quantify uncertainty in the numerical simulation of the hyshot II scramjet
- Correcting for unknown errors in sparse high-dimensional function approximation
- Nonadaptive quasi-optimal points selection for least squares linear regression
- On tensor product approximation of analytic functions
- Approximation of quantities of interest in stochastic PDEs by the random discrete L^2 projection on polynomial spaces
- Multivariate discrete least-squares approximations with a new type of collocation grid
- Compressive sensing Petrov-Galerkin approximation of high-dimensional parametric operator equations
- A Christoffel function weighted least squares algorithm for collocation approximations
- Accelerating stochastic collocation methods for partial differential equations with random input data
- Hyperspherical sparse approximation techniques for high-dimensional discontinuity detection
- Parametrization of Random Vectors in Polynomial Chaos Expansions via Optimal Transportation
- A least-squares method for sparse low rank approximation of multivariate functions
- A weighted _1-minimization approach for sparse polynomial chaos expansions
- High-dimensional adaptive sparse polynomial interpolation and applications to parametric PDEs
- A novel variable-separation method based on sparse and low rank representation for stochastic partial differential equations
- Weighted approximate Fekete points: sampling for least-squares polynomial approximation
- Multivariate approximation in downward closed polynomial spaces
- Effectively subsampled quadratures for least squares polynomial approximations
- Multivariate Markov-type and Nikolskii-type inequalities for polynomials associated with downward closed multi-index sets
- Linear collective collocation approximation for parametric and stochastic elliptic PDEs
- Optimal weighted least-squares methods
- Error Estimates for Multivariate Regression on Discretized Function Spaces
- Function integration, reconstruction and approximation using rank-\(1\) lattices
- Convergence bounds for empirical nonlinear least-squares
- Near-optimal sampling strategies for multivariate function approximation on general domains
- APPROXIMATING SMOOTH, MULTIVARIATE FUNCTIONS ON IRREGULAR DOMAINS
- A Variable-Separation Method for Nonlinear Partial Differential Equations With Random Inputs
- Adaptive approximation by optimal weighted least-squares methods
- 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
- Least squares approximation of polynomial chaos expansions with optimized grid points
- Stochastic Collocation vial1-Minimisation on Low Discrepancy Point Sets with Application to Uncertainty Quantification
- Error guarantees for least squares approximation with noisy samples in domain adaptation
- Towards optimal sampling for learning sparse approximation in high dimensions
- A non-intrusive model order reduction method based on nonlinear optimization for parameterized Stokes problems
- Optimal sampling for least-squares approximation
- Randomized greedy algorithms for neural network optimization in solving partial differential equations
- A multivariate Jacobi polynomials regression estimator associated with an ANOVA decomposition model
- An ensemble-based efficient iterative method for uncertainty quantification of partial differential equations with random inputs
- Multivariate sensitivity-adaptive polynomial chaos expansion for high-dimensional surrogate modeling and uncertainty quantification
- Noise-robust multi-fidelity surrogate modelling for parametric partial differential equations
- Stability of least squares approximation under random sampling
- Title not available (Why is no real title available?)
- Title not available (Why is no real title available?)
- Title not available (Why is no real title available?)
- Spectral likelihood expansions for Bayesian inference
- Title not available (Why is no real title available?)
- Title not available (Why is no real title available?)
- Convergence estimates in probability and in expectation for discrete least squares with noisy evaluations at random points
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)
