A preconditioning approach for improved estimation of sparse polynomial chaos expansions
From MaRDI portal
Publication:1986404
Abstract: Compressive sampling has been widely used for sparse polynomial chaos (PC) approximation of stochastic functions. The recovery accuracy of compressive sampling highly depends on the incoherence properties of the measurement matrix. In this paper, we consider preconditioning the underdetermined system of equations that is to be solved. Premultiplying a linear equation system by a non-singular matrix results in an equivalent equation system, but it can potentially improve the incoherence properties of the resulting preconditioned measurement matrix and lead to a better recovery accuracy. When measurements are noisy, however, preconditioning can also potentially result in a worse signal-to-noise ratio, thereby deteriorating recovery accuracy. In this work, we propose a preconditioning scheme that improves the incoherence properties of measurement matrix and at the same time prevents undesirable deterioration of signal-to-noise ratio. We provide theoretical motivations and numerical examples that demonstrate the promise of the proposed approach in improving the accuracy of estimated polynomial chaos expansions.
Recommendations
- A generalized sampling and preconditioning scheme for sparse approximation of polynomial chaos expansions
- Compressive sampling of polynomial chaos expansions: convergence analysis and sampling strategies
- A gradient enhanced \(\ell_{1}\)-minimization for sparse approximation of polynomial chaos expansions
- A weighted _1-minimization approach for sparse polynomial chaos expansions
- A near-optimal sampling strategy for sparse recovery of polynomial chaos expansions
Cites work
- A generalized sampling and preconditioning scheme for sparse approximation of polynomial chaos expansions
- A non-adapted sparse approximation of PDEs with stochastic inputs
- A weighted _1-minimization approach for sparse polynomial chaos expansions
- Adaptive Smolyak Pseudospectral Approximations
- Atomic decomposition by basis pursuit
- Coherence motivated sampling and convergence analysis of least squares polynomial chaos regression
- Compressive sampling of polynomial chaos expansions: convergence analysis and sampling strategies
- Compressive sensing and structured random matrices
- Designing robust sensing matrix for image compression
- High dimensional polynomial interpolation on sparse grids
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- L 1/2 regularization
- Minimization of \(\ell_{1-2}\) for compressed sensing
- Neighborliness of randomly projected simplices in high dimensions
- Nonadaptive quasi-optimal points selection for least squares linear regression
- Numerical methods for stochastic computations. A spectral method approach.
- On a near optimal sampling strategy for least squares polynomial regression
- On compressive sensing applied to radar
- On Projection Matrix Optimization for Compressive Sensing Systems
- Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
- Optimized Projections for Compressed Sensing
- Regression Shrinkage and Selection via The Lasso: A Retrospective
- Sensing Matrix Optimization for Block-Sparse Decoding
- Sparse and redundant representations. From theory to applications in signal and image processing.
- Sparse approximation using _1-_2 minimization and its application to stochastic collocation
- Sparse grids
- Sparse Legendre expansions via _1-minimization
- Sparse pseudospectral approximation method
- Sparse representation, modeling and learning in visual recognition. Theory, algorithms and applications
- Stable recovery of sparse overcomplete representations in the presence of noise
- Stable signal recovery from incomplete and inaccurate measurements
- Stochastic collocation algorithms using _1-minimization
- Stochastic collocation methods via \(\ell_1\) minimization using randomized quadratures
- Subsampled Gauss quadrature nodes for estimating polynomial chaos expansions
- The restricted isometry property and its implications for compressed sensing
Cited in
(8)- An efficient adaptive forward-backward selection method for sparse polynomial chaos expansion
- Optimal Bayesian experimental design for subsurface flow problems
- A multi-fidelity polynomial chaos-greedy Kaczmarz approach for resource-efficient uncertainty quantification on limited budget
- A weighted _1-minimization approach for sparse polynomial chaos expansions
- Sparse polynomial chaos expansions: literature survey and benchmark
- Sparse Approximation of Data-Driven Polynomial Chaos Expansions: An Induced Sampling Approach
- A generalized sampling and preconditioning scheme for sparse approximation of polynomial chaos expansions
- Tight-frame-like analysis-sparse recovery using nontight sensing matrices
This page was built for publication: A preconditioning approach for improved estimation of sparse polynomial chaos expansions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1986404)
