A Generalized Sampling and Preconditioning Scheme for Sparse Approximation of Polynomial Chaos Expansions
From MaRDI portal
Publication:5275042
DOI10.1137/16M1063885zbMath1368.65025arXiv1602.06879OpenAlexW2280506408MaRDI QIDQ5275042
John D. Jakeman, Tao Zhou, Akil C. Narayan
Publication date: 7 July 2017
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1602.06879
algorithmpreconditioningnumerical resultuncertainty quantificationcompressed sensingpolynomial chaosrecovering sparse polynomials
Related Items
Optimal design for kernel interpolation: applications to uncertainty quantification ⋮ A stochastic collocation method based on sparse grids for a stochastic Stokes-Darcy model ⋮ A General Framework of Rotational Sparse Approximation in Uncertainty Quantification ⋮ Compressive Sensing with Cross-Validation and Stop-Sampling for Sparse Polynomial Chaos Expansions ⋮ Infinite-dimensional compressed sensing and function interpolation ⋮ Polynomial chaos expansions for dependent random variables ⋮ A survey of unsupervised learning methods for high-dimensional uncertainty quantification in black-box-type problems ⋮ Analysis of sparse recovery for Legendre expansions using envelope bound ⋮ A gradient enhanced \(\ell_{1}\)-minimization for sparse approximation of polynomial chaos expansions ⋮ A near-optimal sampling strategy for sparse recovery of polynomial chaos expansions ⋮ Constructing Least-Squares Polynomial Approximations ⋮ An adaptive ANOVA stochastic Galerkin method for partial differential equations with high-dimensional random inputs ⋮ Weighted Approximate Fekete Points: Sampling for Least-Squares Polynomial Approximation ⋮ Stochastic Collocation Methods via $\ell_1$ Minimization Using Randomized Quadratures ⋮ Compressed Sensing with Sparse Corruptions: Fault-Tolerant Sparse Collocation Approximations ⋮ Data-driven polynomial chaos expansions: a weighted least-square approximation ⋮ Computation of induced orthogonal polynomial distributions ⋮ PLS-based adaptation for efficient PCE representation in high dimensions ⋮ Some greedy algorithms for sparse polynomial chaos expansions ⋮ An iterative polynomial chaos approach for solution of structural mechanics problem with Gaussian material property ⋮ Adaptive sparse polynomial dimensional decomposition for derivative-based sensitivity ⋮ Towards optimal sampling for learning sparse approximation in high dimensions ⋮ Non-intrusive framework of reduced-order modeling based on proper orthogonal decomposition and polynomial chaos expansion ⋮ Sparse polynomial chaos expansions via compressed sensing and D-optimal design ⋮ A preconditioning approach for improved estimation of sparse polynomial chaos expansions ⋮ An efficient adaptive forward-backward selection method for sparse polynomial chaos expansion ⋮ A Gradient-Enhanced L1 Approach for the Recovery of Sparse Trigonometric Polynomials ⋮ Variance-based adaptive sequential sampling for polynomial chaos expansion ⋮ Model order reduction for random nonlinear dynamical systems and low-dimensional representations for their quantities of interest ⋮ A mixed ℓ1 regularization approach for sparse simultaneous approximation of parameterized PDEs ⋮ Ensemble time-stepping algorithm for the convection-diffusion equation with random diffusivity ⋮ Data-driven compressive sensing and applications in uncertainty quantification ⋮ A multi-fidelity polynomial chaos-greedy Kaczmarz approach for resource-efficient uncertainty quantification on limited budget ⋮ Rank adaptive tensor recovery based model reduction for partial differential equations with high-dimensional random inputs ⋮ Sparse Polynomial Chaos Expansions: Literature Survey and Benchmark ⋮ Sparse polynomial chaos expansions using variational relevance vector machines
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Reweighted \(\ell_1\) minimization method for stochastic elliptic differential equations
- A weighted \(\ell_1\)-minimization approach for sparse polynomial chaos expansions
- Enhancing adaptive sparse grid approximations and improving refinement strategies using adjoint-based a posteriori error estimates
- Compressive sampling of polynomial chaos expansions: convergence analysis and sampling strategies
- A mathematical introduction to compressive sensing
- Sparse Legendre expansions via \(\ell_1\)-minimization
- An orthogonality property of the Legendre polynomials
- A non-adapted sparse approximation of PDEs with stochastic inputs
- Orthogonal polynomials for exponential weights \(x^{2\rho} e^{-2Q(x)}\) on [0,\(d\))
- Adaptive sparse polynomial chaos expansion based on least angle regression
- Fekete points and convergence towards equilibrium measures on complex manifolds
- Sparse pseudospectral approximation method
- Enhancing \(\ell_1\)-minimization estimates of polynomial chaos expansions using basis selection
- Bernstein's inequality in \(L^p\) for \(0<p<1\) and \((C,1)\) bounds for orthogonal polynomials
- Sparse high order FEM for elliptic sPDEs
- Where does the sup norm of a weighted polynomial live? (A generalization of incomplete polynomials)
- Generalized Jacobi weights, Christoffel functions, and zeros of orthogonal polynomials
- Orthonormal polynomials with generalized Freud-type weights.
- Least angle regression. (With discussion)
- High dimensional polynomial interpolation on sparse grids
- Orthogonal polynomials for exponential weights \(x^{2\rho} e^{-2Q(x)}\) on \([0,d)\). II.
- Atomic Decomposition by Basis Pursuit
- 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 Collocation Methods on Unstructured Grids in High Dimensions via Interpolation
- Subsampled Gauss Quadrature Nodes for Estimating Polynomial Chaos Expansions
- On Discrete Least-Squares Projection in Unbounded Domain with Random Evaluations and its Application to Parametric Uncertainty Quantification
- Stochastic Collocation Methods via $\ell_1$ Minimization Using Randomized Quadratures
- A Christoffel function weighted least squares algorithm for collocation approximations
- Bergman kernels for weighted polynomials and weighted equilibrium measures of $\mathbb{C}^{n}$
- Decoding by Linear Programming
- Stable recovery of sparse overcomplete representations in the presence of noise
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- ON ASYMPTOTIC PROPERTIES OF POLYNOMIALS ORTHOGONAL ON THE REAL AXIS
- Generalized Jacobi Weights, Christoffel Functions, and Jacobi Polynomials
- The Wiener--Askey Polynomial Chaos for Stochastic Differential Equations
- Adaptive Leja Sparse Grid Constructions for Stochastic Collocation and High-Dimensional Approximation
- Adaptive Smolyak Pseudospectral Approximations
- STOCHASTIC COLLOCATION ALGORITHMS USING l1-MINIMIZATION
- High-Order Collocation Methods for Differential Equations with Random Inputs
- Stable signal recovery from incomplete and inaccurate measurements
- A Stochastic Collocation Method for Elliptic Partial Differential Equations with Random Input Data
- Compressed sensing
- Orthogonal polynomials for exponential weights
