Divide and Conquer: An Incremental Sparsity Promoting Compressive Sampling Approach for Polynomial Chaos Expansions
Authors:
Preprint
Abstract
This paper introduces an efficient sparse recovery approach for Polynomial Chaos (PC) expansions, which promotes the sparsity by breaking the dimensionality of the problem. The proposed algorithm incrementally explores sub-dimensional expansions for a sparser recovery, and shows success when removal of uninfluential parameters that results in a lower coherence for measurement matrix, allows for a higher order and/or sparser expansion to be recovered. The incremental algorithm effectively searches for the sparsest PC approximation, and not only can it decrease the prediction error, it can also reduce the dimensionality of PCE model. Four numerical examples are provided to demonstrate the validity of the proposed approach. The results from these examples show that the incremental algorithm substantially outperforms conventional compressive sampling approaches for PCE, in terms of both solution sparsity and prediction error.Keywords
All Related Versions
This publication has 42 references indexed in Scilit:
- Sparse pseudospectral approximation methodComputer Methods in Applied Mechanics and Engineering, 2012
- Compressed sensing with coherent and redundant dictionariesApplied and Computational Harmonic Analysis, 2011
- Multi-element probabilistic collocation method in high dimensionsJournal of Computational Physics, 2010
- Enhancing Sparsity by Reweighted ℓ 1 MinimizationJournal of Fourier Analysis and Applications, 2008
- Sparse MRI: The application of compressed sensing for rapid MR imagingMagnetic Resonance in Medicine, 2007
- Sparse grid collocation schemes for stochastic natural convection problemsJournal of Computational Physics, 2007
- Monte Carlo Strategies in Scientific Computing2004
- Dimension?Adaptive Tensor?Product QuadratureComputing, 2003
- Stochastic Finite Elements: A Spectral Approach1991
- Introduction to Shannon Sampling and Interpolation Theory1991