Divide and conquer: An incremental sparsity promoting compressive sampling approach for polynomial chaos expansions
Authors:
- Negin AlemazkoorNANegin Alemazkoor
- Hadi MeidaniHMHadi Meidani
- 1 May 2017
- journal article
- research article
- Published by Elsevier in Computer Methods in Applied Mechanics and Engineering
- Vol. 318, 937-956
Abstract
No abstract availableKeywords
All Related Versions
This publication has 50 references indexed in Scilit:
- Reweighted minimization method for stochastic elliptic differential equationsJournal of Computational Physics, 2013
- STOCHASTIC COLLOCATION ALGORITHMS USING l1-MINIMIZATIONInternational Journal for Uncertainty Quantification, 2012
- An adaptive high-dimensional stochastic model representation technique for the solution of stochastic partial differential equationsJournal of Computational Physics, 2010
- Sparse MRI: The application of compressed sensing for rapid MR imagingMagnetic Resonance in Medicine, 2007
- Compressive sampling2007
- $rm K$-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse RepresentationIEEE Transactions on Signal Processing, 2006
- Sparse representations in unions of basesIEEE Transactions on Information Theory, 2003
- Dimension?Adaptive Tensor?Product QuadratureComputing, 2003
- Global sensitivity indices for nonlinear mathematical models and their Monte Carlo estimatesMathematics and Computers in Simulation, 2001
- Monte Carlo and quasi-Monte Carlo methodsActa Numerica, 1998