Nonadaptive Quasi-Optimal Points Selection for Least Squares Linear Regression
From MaRDI portal
Publication:2790089
DOI10.1137/15M1015868OpenAlexW2290709430MaRDI QIDQ2790089
Publication date: 2 March 2016
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/15m1015868
Orthogonal functions and polynomials, general theory of nontrigonometric harmonic analysis (42C05) Numerical interpolation (65D05) Approximation by polynomials (41A10)
Related Items (18)
Bayesian model inversion using stochastic spectral embedding ⋮ Adaptive weighted least-squares polynomial chaos expansion with basis adaptivity and sequential adaptive sampling ⋮ On a near optimal sampling strategy for least squares polynomial regression ⋮ An active sparse polynomial chaos expansion approach based on sequential relevance vector machine ⋮ A near-optimal sampling strategy for sparse recovery of polynomial chaos expansions ⋮ Constructing Least-Squares Polynomial Approximations ⋮ Weighted Approximate Fekete Points: Sampling for Least-Squares Polynomial Approximation ⋮ Towards optimal sampling for learning sparse approximation in high dimensions ⋮ Sequential Design of Experiment for Sparse Polynomial Chaos Expansions ⋮ Sparse polynomial chaos expansions via compressed sensing and D-optimal design ⋮ A preconditioning approach for improved estimation of sparse polynomial chaos expansions ⋮ An efficient and robust adaptive sampling method for polynomial chaos expansion in sparse Bayesian learning framework ⋮ A hybrid sequential sampling strategy for sparse polynomial chaos expansion based on compressive sampling and Bayesian experimental design ⋮ On the stability and accuracy of the empirical interpolation method and gravitational wave surrogates ⋮ Adaboost-based ensemble of polynomial chaos expansion with adaptive sampling ⋮ Least squares polynomial chaos expansion: a review of sampling strategies ⋮ A multi-fidelity polynomial chaos-greedy Kaczmarz approach for resource-efficient uncertainty quantification on limited budget ⋮ Sparse Polynomial Chaos Expansions: Literature Survey and Benchmark
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Reweighted \(\ell_1\) minimization method for stochastic elliptic differential equations
- On the stability and accuracy of least squares approximations
- Analysis of discrete \(L^2\) projection on polynomial spaces with random evaluations
- A non-adapted sparse approximation of PDEs with stochastic inputs
- A least-squares approximation of partial differential equations with high-dimensional random inputs
- A distribution-free theory of nonparametric regression
- Analysis of discrete least squares on multivariate polynomial spaces with evaluations at low-discrepancy point sets
- Sparse grid collocation schemes for stochastic natural convection problems
- Approximation of Quantities of Interest in Stochastic PDEs by the Random Discrete $L^2$ Projection on Polynomial Spaces
- Constructing Nested Nodal Sets for Multivariate Polynomial Interpolation
- On Discrete Least-Squares Projection in Unbounded Domain with Random Evaluations and its Application to Parametric Uncertainty Quantification
- Multivariate Discrete Least-Squares Approximations with a New Type of Collocation Grid
- Computing Multivariate Fekete and Leja Points by Numerical Linear Algebra
- Design of Comparative Experiments
- Stochastic finite element: a non intrusive approach by regression
- The Wiener--Askey Polynomial Chaos for Stochastic Differential Equations
- Optimal Design of Experiments
- On the Choice of Design Points for Least Square Polynomial Approximations with Application to Uncertainty Quantification
- STOCHASTIC COLLOCATION ALGORITHMS USING l1-MINIMIZATION
- High-Order Collocation Methods for Differential Equations with Random Inputs
- A Stochastic Collocation Method for Elliptic Partial Differential Equations with Random Input Data
This page was built for publication: Nonadaptive Quasi-Optimal Points Selection for Least Squares Linear Regression
