v1v2 (latest)

A Near-Optimal Sampling Strategy for Sparse Recovery of Polynomial Chaos Expansions

25 February 2017

Papers citing "A Near-Optimal Sampling Strategy for Sparse Recovery of Polynomial Chaos Expansions"

3 / 3 papers shown

Title
Divide and Conquer: An Incremental Sparsity Promoting Compressive Sampling Approach for Polynomial Chaos Expansions Negin Alemazkoor Hadi Meidani 40 26 0 21 Jun 2016
Enhancing Sparsity of Hermite Polynomial Expansions by Iterative Rotations Xiu Yang H. Lei Nathan A. Baker Guang Lin 43 53 0 14 Jun 2015
Message Passing Algorithms for Compressed Sensing D. Donoho A. Maleki Andrea Montanari 106 2,357 0 21 Jul 2009