Enhancing sparsity of Hermite polynomial expansions by iterative rotations
From MaRDI portal
Publication:729367
Abstract: Compressive sensing has become a powerful addition to uncertainty quantification in recent years. This paper identifies new bases for random variables through linear mappings such that the representation of the quantity of interest is more sparse with new basis functions associated with the new random variables. This sparsity increases both the efficiency and accuracy of the compressive sensing-based uncertainty quantification method. Specifically, we consider rotation-based linear mappings which are determined iteratively for Hermite polynomial expansions. We demonstrate the effectiveness of the new method with applications in solving stochastic partial differential equations and high-dimensional () problems.
Recommendations
- Subsampled Gauss quadrature nodes for estimating polynomial chaos expansions
- Divide and conquer: an incremental sparsity promoting compressive sampling approach for polynomial chaos expansions
- Compressive sensing with cross-validation and stop-sampling for sparse polynomial chaos expansions
- Data-driven compressive sensing and applications in uncertainty quantification
- A general framework of rotational sparse approximation in uncertainty quantification
Cites work
- scientific article; zbMATH DE number 49187 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 3321507 (Why is no real title available?)
- A Bayesian mixed shrinkage prior procedure for spatial-stochastic basis selection and evaluation of gPC expansions: applications to elliptic SPDEs
- A Stochastic Collocation Method for Elliptic Partial Differential Equations with Random Input Data
- A constructive approach to the estimation of dimension reduction directions
- A non-adapted sparse approximation of PDEs with stochastic inputs
- A weighted \(\ell_1\)-minimization approach for sparse polynomial chaos expansions
- Active subspace methods in theory and practice: applications to kriging surfaces
- Adaptive ANOVA decomposition of stochastic incompressible and compressible flows
- An adaptive hierarchical sparse grid collocation algorithm for the solution of stochastic differential equations
- An adaptive high-dimensional stochastic model representation technique for the solution of stochastic partial differential equations
- Atomic Decomposition by Basis Pursuit
- Compressed sensing
- Compressive sampling of polynomial chaos expansions: convergence analysis and sampling strategies
- Constructing surrogate models of complex systems with enhanced sparsity: quantifying the influence of conformational uncertainty in biomolecular solvation
- Decoding by Linear Programming
- Dimensionality reduction for complex models via Bayesian compressive sensing
- Enhancing \(\ell_1\)-minimization estimates of polynomial chaos expansions using basis selection
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- Generalized linear models and extensions.
- Gradient-based methods for uncertainty quantification in hypersonic flows
- Greed is Good: Algorithmic Results for Sparse Approximation
- High-Order Collocation Methods for Differential Equations with Random Inputs
- Interpolation via weighted \(\ell_{1}\) minimization
- Numerical studies of the stochastic Korteweg-de Vries equation
- On polynomial chaos expansion via gradient-enhanced \(\ell_1\)-minimization
- On sparse interpolation and the design of deterministic interpolation points
- Orthogonal bases for polynomial regression with derivative information in uncertainty quantification
- Orthogonal functionals of the Poisson process
- Probing the Pareto frontier for basis pursuit solutions
- Reweighted \(\ell_1\) minimization method for stochastic elliptic differential equations
- Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
- Sparse Legendre expansions via \(\ell_1\)-minimization
- Spectral polynomial chaos solutions of the stochastic advection equation
- Stable recovery of sparse overcomplete representations in the presence of noise
- Stable signal recovery from incomplete and inaccurate measurements
- Stochastic collocation algorithms using \(\ell_1\)-minimization
- 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
- The orthogonal development of non-linear functionals in series of Fourier-Hermite functionals
- The restricted isometry property and its implications for compressed sensing
Cited in
(23)- A general framework of rotational sparse approximation in uncertainty quantification
- Conditional Karhunen-Loève expansion for uncertainty quantification and active learning in partial differential equation models
- Optimal observations-based retrieval of topography in 2D shallow water equations using PC-EnKF
- A new bi-fidelity model reduction method for Bayesian inverse problems
- Calibration of reduced-order model for a coupled Burgers equations based on PC-EnKF
- Compressive sensing adaptation for polynomial chaos expansions
- Divide and conquer: an incremental sparsity promoting compressive sampling approach for polynomial chaos expansions
- A sparse multiresolution stochastic approximation for uncertainty quantification
- Hierarchical surrogate model with dimensionality reduction technique for high-dimensional uncertainty propagation
- Towards optimal sampling for learning sparse approximation in high dimensions
- High-dimensional nonlinear multi-fidelity model with gradient-free active subspace method
- Regression-based sparse polynomial chaos for uncertainty quantification of subsurface flow models
- Subsampled Gauss quadrature nodes for estimating polynomial chaos expansions
- Sparse polynomial chaos expansions via compressed sensing and D-optimal design
- Sparsity-promoting elastic net method with rotations for high-dimensional nonlinear inverse problem
- A data-driven framework for sparsity-enhanced surrogates with arbitrary mutually dependent randomness
- Artificial neural network based response surface for data-driven dimensional analysis
- A near-optimal sampling strategy for sparse recovery of polynomial chaos expansions
- Sliced-Inverse-Regression--Aided Rotated Compressive Sensing Method for Uncertainty Quantification
- A low-rank approximated multiscale method for PDEs with random coefficients
- Using automatic differentiation for compressive sensing in uncertainty quantification
- Data-driven compressive sensing and applications in uncertainty quantification
- Inverse regression-based uncertainty quantification algorithms for high-dimensional models: theory and practice
This page was built for publication: Enhancing sparsity of Hermite polynomial expansions by iterative rotations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q729367)
