Reweighted ℓ1 minimization method for stochastic elliptic differential equations

Journal of Computational Physics

Volumn 248, Issue , 2013, Pages 87-108

  Yang, Xiu ^a   Karniadakis, George Em ^a  

^a BROWN UNIVERSITY   (United States)

Author keywords

Chebyshev probability measure; Compressive sensing; Generalized polynomial chaos; High dimensions

Indexed keywords

PARTIAL DIFFERENTIAL EQUATIONS; POLYNOMIALS; STOCHASTIC SYSTEMS;

CHEBYSHEV; CHEBYSHEV PROBABILITY MEASURE; COMPRESSIVE SENSING; GENERALIZED POLYNOMIAL CHAOS; GENERALIZED POLYNOMIALS; HIGHER DIMENSIONS; L1 MINIMIZATIONS; MINIMIZATION METHODS; POLYNOMIAL CHAOS; PROBABILITY MEASURES;

COMPRESSED SENSING;

EID: 84877881686     PISSN: 00219991     EISSN: 10902716     Source Type: Journal    
DOI: 10.1016/j.jcp.2013.04.004     Document Type: Article

References (40)

1. Ghanem R.G., Spanos P.D. Stochastic Finite Elements: A Spectral Approach 1991, Springer-Verlag, New York.
2. Xiu D., Karniadakis G.E. The Wiener-Askey polynomial chaos for stochastic differential equations. SIAM J. Sci. Comput. 2002, 24(2):619-644.
3. Wan X., Karniadakis G.E. Multi-element generalized polynomial chaos for arbitrary probability measures. SIAM J. Sci. Comput. 2006, 28(3):901-928.
4. Wan X., Karniadakis G.E. An adaptive multi-element generalized polynomial chaos method for stochastic differential equations. J. Comput. Phys. 2005, 209(2):617-642.
5. L. Mathelin, M. Hussaini, A stochastic collocation algorithm for uncertainty analysis, Tech. Rep. Technical Report NAS 1.26:212153; NASA/CR-2003-212153, NASA Langley Research Center, 2003.
6. Xiu D., Hesthaven J.S. High-order collocation methods for differential equations with random inputs. SIAM J. Sci. Comput. 2005, 27(3):1118-1139.
7. Nobile F., Tempone R., Webster C.G. A sparse grid stochastic collocation method for partial differential equations with random input data. SIAM J. Numer. Anal. 2008, 46(5):2309-2345.
8. Foo J., Wan X., Karniadakis G.E. The multi-element probabilistic collocation method (ME-PCM): error analysis and applications. J. Comput. Phys. 2008, 227(22):9572-9595.
9. Ma X., Zabaras N. An adaptive hierarchical sparse grid collocation algorithm for the solution of stochastic differential equations. J. Comput. Phys. 2009, 228(8):3084-3113.
10. Nobile F., Tempone R., Webster C.G. An anisotropic sparse grid stochastic collocation method for partial differential equations with random input data. SIAM J. Numer. Anal. 2008, 46(5):2411-2442.
11. Zhang Z., Choi M., Karniadakis G.E. Error estimates for the ANOVA method with polynomial chaos interpolation: tensor product functions. SIAM J. Sci. Comput. 2012, 34(2):A1165-A1186.
12. Foo J., Karniadakis G.E. Multi-element probabilistic collocation method in high dimensions. J. Comput. Phys. 2010, 229(5):1536-1557.
13. Ma X., Zabaras N. An adaptive high-dimensional stochastic model representation technique for the solution of stochastic partial differential equations. J. Comput. Phys. 2010, 229(10):3884-3915.
14. Yang X., Choi M., Lin G., Karniadakis G.E. Adaptive ANOVA decomposition of stochastic incompressible and compressible flows. J. Comput. Phys. 2012, 231(4):1587-1614.
15. Lucor D., Karniadakis G.E. Adaptive generalized polynomial chaos for nonlinear random oscillators. SIAM J. Sci. Comput. 2004, 26(2):720-735.
16. Venturi D., Wan X., Karniadakis G.E. Stochastic low-dimensional modelling of a random laminar wake past a circular cylinder. J. Fluid Mech. 2008, 606:339-367.
17. Todor R.A., Schwab C. Convergence rates for sparse chaos approximations of elliptic problems with stochastic coefficients. IMA J. Numer. Anal. 2007, 27(2):232-261.
18. Bieri M., Schwab C. Sparse high order FEM for elliptic SPDEs. Comput. Methods Appl. Mech. Eng. 2009, 198(13-14):1149-1170.
19. M. Hansen, C. Schwab, Analytic regularity and best N-term approximation of high dimensional parametric initial value problems, Tech. Rep. 2011-64, Seminar for Applied Mathematics, ETHZ, 2011.
20. V.H. Hoang, C. Schwab, N-term Galerkin Wiener chaos approximations of elliptic PDEs with lognormal Gaussian random inputs, Tech. Rep. 2011-59, Seminar for Applied Mathematics, ETHZ, 2011.
21. Doostan A., Owhadi H. A non-adapted sparse approximation of PDEs with stochastic inputs. J. Comput. Phys. 2011, 230(8):3015-3034.
22. Candès E.J., Wakin M.B., Boyd S.P. Enhancing sparsity by reweighted l1 minimization. J. Fourier Anal. Appl. 2008, 14(5-6):877-905.
23. M. Khajehnejad, W. Xu, A. Avestimehr, B. Hassibi, Improved sparse recovery thresholds with two-step reweighted l1 minimization, in: 2010 IEEE International Symposium on Information Theory Proceedings (ISIT), 2010, pp. 1603 -1607.
24. W. Xu, M. Khajehnejad, A. Avestimehr, B. Hassibi, Breaking through the thresholds: an analysis for iterative reweighted l1 minimization via the grassmann angle framework, in: 2010 IEEE International Conference on Acoustics Speech and Signal Processing (ICASSP), 2010, pp. 5498-5501.
25. Rauhut H., Ward R. Sparse legendre expansions via l1-minimization. J. Approx. Theory 2012, 164(5):517-533.
26. Bruckstein A.M., Donoho D.L., Elad M. From sparse solutions of systems of equations to sparse modeling of signals and images. SIAM Rev. 2009, 51(1):34-81.
27. DeVore R.A., Temlyakov V.N. Some remarks on greedy algorithms. Adv. Comput. Math. 1996, 5(2-3):173-187.
28. Temlyakov V.N. Greedy algorithms and m-term approximation with regard to redundant dictionaries. J. Approx. Theory 1999, 98(1):117-145.
29. Temlyakov V.N. Weak greedy algorithms. Adv. Comput. Math. 2000, 12(2-3):213-227.
30. Donoho D.L., Elad M., Temlyakov V.N. Stable recovery of sparse overcomplete representations in the presence of noise. IEEE Trans. Inform. Theory 2006, 52(1):6-18.
31. Candès E.J., Tao T. Decoding by linear programming. IEEE Trans. Inform. Theory 2005, 51(12):4203-4215.
32. Candès E.J. The restricted isometry property and its implications for compressed sensing. C.R. Math. Acad. Sci. Paris 2008, 346(9-10):589-592.
33. Foucart S. A note on guaranteed sparse recovery via l1-minimization. Appl. Comput. Harmon. Anal. 2010, 29(1):97-103.
34. Foucart S., Lai M.-J. Sparsest solutions of underdetermined linear systems via lq-minimization for 0 < q ≤ 1. Appl. Comput. Harmon. Anal. 2009, 26(3):395-407.
35. D. Needell, Noisy signal recovery via iterative reweighted l1 minimization, in: Proceedings Asilomar Conference on Signal Systems and Computers, Pacific Grove, CA, 2009.
36. Yan L., Guo L., Xiu D. Stochastic collocation algorithms using l1-minimization. Int. J. Uncertainty Quantif. 2012, 2(3):279-293.
37. Needell D., Tropp J.A. CoSaMP: iterative signal recovery from incomplete and inaccurate samples. Appl. Comput. Harmon. Anal. 2009, 26(3):301-321.
38. Blumensath T., Davies M.E. Iterative hard thresholding for compressed sensing. Appl. Comput. Harmon. Anal. 2009, 27(3):265-274.
39. van den Berg E., Friedlander M.P. Probing the Pareto frontier for basis pursuit solutions. SIAM J. Sci. Comput. 2008, 31(2):890-912.
40. Blanchard J.D., Cartis C., Tanner J. Compressed sensing: how sharp is the restricted isometry property?. SIAM Rev. 2011, 53(1):105-125.