Enhancing \(\ell_1\)-minimization estimates of polynomial chaos expansions using basis selection
From MaRDI portal
Publication:729190
DOI10.1016/J.JCP.2015.02.025zbMath1352.65026arXiv1407.8093OpenAlexW2035665246MaRDI QIDQ729190
Publication date: 20 December 2016
Published in: Journal of Computational Physics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1407.8093
adaptivitysparsityuncertainty quantificationpolynomial chaosstochastic collocation\(\ell_1\)-minimizationbasis selection
Related Items (58)
Bayesian model inversion using stochastic spectral embedding ⋮ On polynomial chaos expansion via gradient-enhanced \(\ell_1\)-minimization ⋮ A General Framework of Rotational Sparse Approximation in Uncertainty Quantification ⋮ Compressive Sensing with Cross-Validation and Stop-Sampling for Sparse Polynomial Chaos Expansions ⋮ Uncertainty Propagation; Intrusive Kinetic Formulations of Scalar Conservation Laws ⋮ Efficient uncertainty quantification of stochastic CFD problems using sparse polynomial chaos and compressed sensing ⋮ Polynomial chaos expansions for dependent random variables ⋮ Multi-level multi-fidelity sparse polynomial chaos expansion based on Gaussian process regression ⋮ Adaptive weighted least-squares polynomial chaos expansion with basis adaptivity and sequential adaptive sampling ⋮ High-order spectral method of density estimation for stochastic differential equation driven by multivariate Gaussian random variables ⋮ Multi-fidelity non-intrusive polynomial chaos based on regression ⋮ Efficient Computation of Sobol' Indices for Stochastic Models ⋮ Compressive sensing Petrov-Galerkin approximation of high-dimensional parametric operator equations ⋮ A novel sparse polynomial chaos expansion technique with high adaptiveness for surrogate modelling ⋮ An hp‐adaptive multi‐element stochastic collocation method for surrogate modeling with information re‐use ⋮ Sensitivity-enhanced generalized polynomial chaos for efficient uncertainty quantification ⋮ Multifidelity uncertainty quantification with models based on dissimilar parameters ⋮ Nested polynomial trends for the improvement of Gaussian process-based predictors ⋮ An active sparse polynomial chaos expansion approach based on sequential relevance vector machine ⋮ A gradient enhanced \(\ell_{1}\)-minimization for sparse approximation of polynomial chaos expansions ⋮ Classifier-based adaptive polynomial chaos expansion for high-dimensional uncertainty quantification ⋮ Correcting for unknown errors in sparse high-dimensional function approximation ⋮ Basis adaptive sample efficient polynomial chaos (BASE-PC) ⋮ A near-optimal sampling strategy for sparse recovery of polynomial chaos expansions ⋮ Comparison of the performance and reliability between improved sampling strategies for polynomial chaos expansion ⋮ Compressed Sensing with Sparse Corruptions: Fault-Tolerant Sparse Collocation Approximations ⋮ Sliced-Inverse-Regression--Aided Rotated Compressive Sensing Method for Uncertainty Quantification ⋮ Calibration of reduced-order model for a coupled Burgers equations based on PC-EnKF ⋮ Compressive sensing adaptation for polynomial chaos expansions ⋮ Optimal observations-based retrieval of topography in 2D shallow water equations using PC-EnKF ⋮ 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 ⋮ Towards optimal sampling for learning sparse approximation in high dimensions ⋮ Sequential Design of Experiment for Sparse Polynomial Chaos Expansions ⋮ Multi-fidelity uncertainty quantification method with application to nonlinear structural response analysis ⋮ Sparse polynomial chaos expansions via compressed sensing and D-optimal design ⋮ Bayesian Inference Using Intermediate Distribution Based on Coarse Multiscale Model for Time Fractional Diffusion Equations ⋮ Sparsity-promoting elastic net method with rotations for high-dimensional nonlinear inverse problem ⋮ An efficient and robust adaptive sampling method for polynomial chaos expansion in sparse Bayesian learning framework ⋮ An adaptive WENO collocation method for differential equations with random coefficients ⋮ A Gradient-Enhanced L1 Approach for the Recovery of Sparse Trigonometric Polynomials ⋮ A hybrid sequential sampling strategy for sparse polynomial chaos expansion based on compressive sampling and Bayesian experimental design ⋮ Model order reduction and low-dimensional representations for random linear dynamical systems ⋮ Model order reduction for random nonlinear dynamical systems and low-dimensional representations for their quantities of interest ⋮ Efficient reliability analysis with a CDA-based dimension-reduction model and polynomial chaos expansion ⋮ Using automatic differentiation for compressive sensing in uncertainty quantification ⋮ Enhancing sparsity of Hermite polynomial expansions by iterative rotations ⋮ Convergence Analysis and Adaptive Order Selection for the Polynomial Chaos Approach to Direct Optimal Control under Uncertainties ⋮ Adaboost-based ensemble of polynomial chaos expansion with adaptive sampling ⋮ Divide and conquer: an incremental sparsity promoting compressive sampling approach for polynomial chaos expansions ⋮ An efficient multifidelity \(\ell_1\)-minimization method for sparse polynomial chaos ⋮ Data-driven compressive sensing and applications in uncertainty quantification ⋮ Gradient-based optimization for regression in the functional tensor-train format ⋮ A multi-fidelity polynomial chaos-greedy Kaczmarz approach for resource-efficient uncertainty quantification on limited budget ⋮ Sparse Polynomial Chaos Expansions: Literature Survey and Benchmark ⋮ Two-sided space-time \(L^1\) polynomial approximation of hypographs within polynomial optimal control ⋮ A Generalized Sampling and Preconditioning Scheme for Sparse Approximation of Polynomial Chaos Expansions
Uses Software
Cites Work
- 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
- Sparse Legendre expansions via \(\ell_1\)-minimization
- A non-adapted sparse approximation of PDEs with stochastic inputs
- Convergence rates of best \(N\)-term Galerkin approximations for a class of elliptic SPDEs
- Adaptive sparse polynomial chaos expansion based on least angle regression
- Sparse pseudospectral approximation method
- Multi-element probabilistic collocation method in high dimensions
- Sparse high order FEM for elliptic sPDEs
- An adaptive hierarchical sparse grid collocation algorithm for the solution of stochastic differential equations
- Random sampling of sparse trigonometric polynomials. II: Orthogonal matching pursuit versus basis pursuit
- Stochastic approaches to uncertainty quantification in CFD simulations
- Sparse grid collocation schemes for stochastic natural convection problems
- Atomic Decomposition by Basis Pursuit
- NESTA: A Fast and Accurate First-Order Method for Sparse Recovery
- ON THE OPTIMAL POLYNOMIAL APPROXIMATION OF STOCHASTIC PDES BY GALERKIN AND COLLOCATION METHODS
- Stable recovery of sparse overcomplete representations in the presence of noise
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- Probing the Pareto Frontier for Basis Pursuit Solutions
- An Anisotropic Sparse Grid Stochastic Collocation Method for Partial Differential Equations with Random Input Data
- A Compressed Sensing Approach for Partial Differential Equations with Random Input Data
- Galerkin Finite Element Approximations of Stochastic Elliptic Partial Differential Equations
- The Wiener--Askey Polynomial Chaos for Stochastic Differential Equations
- Compressed Sensing With Cross Validation
- DIMENSIONALITY REDUCTION FOR COMPLEX MODELS VIA BAYESIAN COMPRESSIVE SENSING
- Orthogonal Matching Pursuit for Sparse Signal Recovery With Noise
- Model-Based Compressive Sensing
- 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
This page was built for publication: Enhancing \(\ell_1\)-minimization estimates of polynomial chaos expansions using basis selection