Weighted discrete least-squares polynomial approximation using randomized quadratures
From MaRDI portal
(Redirected from Publication:2374682)
Recommendations
- Multivariate discrete least-squares approximations with a new type of collocation grid
- Analysis of discrete L^2 projection on polynomial spaces with random evaluations
- Discrete least squares polynomial approximation with random evaluations - application to parametric and stochastic elliptic PDEs
- Stochastic collocation methods via \(\ell_1\) minimization using randomized quadratures
- Adaptive polynomial approximation by means of random discrete least squares
Cites work
- scientific article; zbMATH DE number 1262778 (Why is no real title available?)
- scientific article; zbMATH DE number 1955474 (Why is no real title available?)
- scientific article; zbMATH DE number 2172949 (Why is no real title available?)
- A Stochastic Collocation Method for Elliptic Partial Differential Equations with Random Input Data
- A domain adaptive stochastic collocation approach for analysis of MEMS under uncertainties
- A non-adapted sparse approximation of PDEs with stochastic inputs
- An Anisotropic Sparse Grid Stochastic Collocation Method for Partial Differential Equations with Random Input Data
- An adaptive hierarchical sparse grid collocation algorithm for the solution of stochastic differential equations
- An asymptotic expansion for the weights of Gaussian quadrature formulae
- Analysis of discrete \(L^2\) projection on polynomial spaces with random evaluations
- 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
- Compressive sampling of polynomial chaos expansions: convergence analysis and sampling strategies
- Design of Comparative Experiments
- Discrete least squares polynomial approximation with random evaluations - application to parametric and stochastic elliptic PDEs
- Efficient collocational approach for parametric uncertainty analysis
- Experiments. Planning, analysis and optimization.
- Generalized Jacobi Weights, Christoffel Functions, and Jacobi Polynomials
- Géza Freud, orthogonal polynomials and Christoffel functions. A case study
- High-Order Collocation Methods for Differential Equations with Random Inputs
- Multivariate discrete least-squares approximations with a new type of collocation grid
- Numerical methods for stochastic computations. A spectral method approach.
- On Discrete Least-Squares Projection in Unbounded Domain with Random Evaluations and its Application to Parametric Uncertainty Quantification
- On sparse interpolation and the design of deterministic interpolation points
- On the Choice of Design Points for Least Square Polynomial Approximations with Application to Uncertainty Quantification
- On the stability and accuracy of least squares approximations
- Optimal Design of Experiments
- Optimum experimental designs, with SAS
- Reweighted \(\ell_1\) minimization method for stochastic elliptic differential equations
- Sparse grid collocation schemes for stochastic natural convection problems
- Spectral methods. Algorithms, analysis and applications.
- Stochastic collocation algorithms using \(\ell_1\)-minimization
- Stochastic collocation methods on unstructured grids in high dimensions via interpolation
- Subsampled Gauss quadrature nodes for estimating polynomial chaos expansions
- The Wiener--Askey Polynomial Chaos for Stochastic Differential Equations
- The multi-element probabilistic collocation method (ME-PCM): Error analysis and applications
Cited in
(24)- Adaptive polynomial approximation by means of random discrete least squares
- An adaptive least-squares global sensitivity method and application to a plasma-coupled combustion prediction with parametric correlation
- Numerical aspects for approximating governing equations using data
- Analysis of discrete least squares on multivariate polynomial spaces with evaluations at low-discrepancy point sets
- Data-driven polynomial chaos expansions: a weighted least-square approximation
- Weighted approximate Fekete points: sampling for least-squares polynomial approximation
- Analysis of discrete \(L^2\) projection on polynomial spaces with random evaluations
- A gradient enhanced \(\ell_{1}\)-minimization for sparse approximation of polynomial chaos expansions
- Constructing least-squares polynomial approximations
- PLS-based adaptation for efficient PCE representation in high dimensions
- Towards optimal sampling for learning sparse approximation in high dimensions
- A randomized tensor quadrature method for high dimensional polynomial approximation
- Adaptive multi-fidelity polynomial chaos approach to Bayesian inference in inverse problems
- Multilevel weighted least squares polynomial approximation
- Multivariate discrete least-squares approximations with a new type of collocation grid
- A low-rank approximated multiscale method for PDEs with random coefficients
- Stochastic collocation methods via \(\ell_1\) minimization using randomized quadratures
- APPROXIMATING SMOOTH, MULTIVARIATE FUNCTIONS ON IRREGULAR DOMAINS
- Effectively subsampled quadratures for least squares polynomial approximations
- Least squares polynomial chaos expansion: a review of sampling strategies
- The algebraic method in quadrature for uncertainty quantification
- Data dependent weights in discontinuous weighted least-squares approximation with anisotropic support
- 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: Weighted discrete least-squares polynomial approximation using randomized quadratures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2374682)
