A weighted ℓ1-minimization approach for sparse polynomial chaos expansions

Journal of Computational Physics

Volumn 267, Issue , 2014, Pages 92-111

  Peng, Ji ^a   Hampton, Jerrad ^a   Doostan, Alireza ^a  

^a UCB 450   (United States)

Author keywords

Basis pursuit denoising (BPDN); Compressive sampling; Polynomial chaos; Sparse approximation; Stochastic PDEs; Uncertainty quantification

Indexed keywords

BOUNDARY CONDITIONS; BOUNDARY VALUE PROBLEMS; NUMERICAL METHODS; POLYNOMIAL APPROXIMATION; STOCHASTIC SYSTEMS;

BASE PURSUIT DENOISING; BASIS PURSUIT DE-NOISING (BPDN); COMPRESSIVE SAMPLING; MINIMISATION; POLYNOMIAL CHAOS; SPARSE APPROXIMATIONS; SPARSE POLYNOMIALS; STOCHASTIC PDE'S; STOCHASTIC PDES; UNCERTAINTY QUANTIFICATIONS;

COMPRESSED SENSING;

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

References (69)

1. Ghanem R., Sarkar A. Mid-frequency structural dynamics with parameter uncertainty. Comput. Methods Appl. Mech. Eng. 2002, 191:5499-5513.
2. Xiu D., Karniadakis G. The Wiener-Askey polynomial chaos for stochastic differential equations. SIAM J. Sci. Comput. 2002, 24(2):619-644.
3. Reagan M., Najm H., Ghanem R., Knio O. Uncertainty quantification in reacting-flow simulations through non-intrusive spectral projection. Combust. Flame 2003, 132(3):545-555.
4. Mathelin L., Hussaini M. A stochastic collocation algorithm for uncertainty analysis 2003, Tech. Rep. NAS 1.26:212153 NASA/CR-2003-212153, NASA Langley Research Center.
5. Xiu D., Hesthaven J. High-order collocation methods for differential equations with random inputs. SIAM J. Sci. Comput. 2005, 27(3):1118-1139.
6. Babuška I., Nobile F., Tempone R. A stochastic collocation method for elliptic partial differential equations with random input data. SIAM J. Numer. Anal. 2007, 45(3):1005-1034.
7. Constantine P.G., Eldred M., Phipps E. Sparse pseudospectral approximation method. Comput. Methods Appl. Mech. Eng. 2012, 229:1-12.
8. Hosder S., Walters R., Perez R. A non-intrusive polynomial chaos method for uncertainty propagation in CFD simulations. 44th AIAA Aerospace Sciences Meeting and Exhibit, AIAA-2006-891, Reno (NV) 2006.
9. Maitre O.L., Knio O. Spectral Methods for Uncertainty Quantification with Applications to Computational Fluid Dynamics 2010, Springer.
10. Xiu D. Numerical Methods for Stochastic Computations: A Spectral Method Approach 2010, Princeton University Press.
11. Doostan A., Iaccarino G., Etemadi N. A least-squares approximation of high-dimensional uncertain systems 2007, Tech. Rep., Annual Research Brief, Center for Turbulence Research, Stanford University.
12. Doostan A., Iaccarino G. A least-squares approximation of partial differential equations with high-dimensional random inputs. J. Comput. Phys. 2009, 228(12):4332-4345.
13. Doostan A., Validi A., Iaccarino G. Non-intrusive low-rank separated approximation of high-dimensional stochastic models. Comput. Methods Appl. Mech. Eng. 2013, 263(1):42-55.
14. Doostan A., Owhadi H., Lashgari A., Iaccarino G. Non-adapted sparse approximation of PDEs with stochastic inputs 2009, Tech. Rep., Annual Research Brief, Center for Turbulence Research, Stanford University.
15. Blatman G., Sudret B. An adaptive algorithm to build up sparse polynomial chaos expansions for stochastic finite element analysis. Probab. Eng. Mech. 2010, 25(2):183-197.
16. Doostan A., Owhadi H. A non-adapted sparse approximation of PDEs with stochastic inputs. J. Comput. Phys. 2011, 230:3015-3034.
17. Blatman G., Sudret B. Adaptive sparse polynomial chaos expansion based on least angle regression. J. Comput. Phys. 2011, 230:2345-2367.
18. Mathelin L., Gallivan K. A compressed sensing approach for partial differential equations with random input data. Commun. Comput. Phys. 2012, 12:919-954.
19. ℓ1-minimization. Int. J. Uncert. Quantif. 2012, 2(3). 10.1615/Int.J.UncertaintyQuantification.2012003925.
20. ℓ1 minimization method for stochastic elliptic differential equations. J. Comput. Phys. 2013, 248:87-108.
21. Chen S., Donoho D., Saunders M. Atomic decomposition by basis pursuit. SIAM J. Sci. Comput. 1998, 20:33-61.
22. Chen S., Donoho D., Saunders M. Atomic decomposition by basis pursuit. SIAM Rev. 2001, 43(1):129-159.
23. Donoho D. Compressed sensing. IEEE Trans. Inf. Theory 2006, 52(4):1289-1306.
24. Candès E., Romberg J., Tao T. Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information. IEEE Trans. Inf. Theory 2006, 52(2):489-509.
25. Candès E., Romberg J. Quantitative robust uncertainty principles and optimally sparse decompositions. Found. Comput. Math. 2006, 6(2):227-254.
26. Candès E., Tao T. Near optimal signal recovery from random projections: Universal encoding strategies?. IEEE Trans. Inf. Theory 2006, 52(12):5406-5425.
27. Candès E., Romberg J. Sparsity and incoherence in compressive sampling. Inverse Probl. 2007, 23(3):969-985.
28. Candès E., Wakin M. An introduction to compressive sampling. IEEE Signal Process. Mag. 2008, 25(2):21-30.
29. Bruckstein A., Donoho D., Elad M. From sparse solutions of systems of equations to sparse modeling of signals and images. SIAM Rev. 2009, 51(1):34-81.
30. Osborne M.R., Presnell B., Turlach B.A. A new approach to variable selection in least squares problems. IMA J. Numer. Anal. 2000, 20(3):389-403.
31. Daubechies I., Defrise M., Mol C.D. An iterative thresholding algorithm for linear inverse problems with a sparsity constraint. Commun. Pure Appl. Math. 2004, 57(11):1413-1457.
32. Combettes P.L., Wajs V.R. Signal recovery by proximal forward-backward splitting. Multiscale Model. Simul. 2005, 4(4):1168-1200.
33. Figueiredo M., Nowak R.D., Wright S.J. Gradient projection for sparse reconstruction: Application to compressed sensing and other inverse problems. IEEE J. Sel. Top. Signal Process. 2007, 1(4):586-597.
34. ℓ1-regularized least squares. IEEE J. Sel. Top. Signal Process. 2007, 1(4):606-617.
35. v.Berg E., Friedlander M.P. SPGL1: A solver for large-scale sparse reconstruction available from. http://www.cs.ubc.ca/labs/scl/spgl1.
36. Donoho D., Maleki A., Montanari A. Message-passing algorithms for compressed sensing. Proc. Natl. Acad. Sci. USA 2009, 106(45):18914-18919.
37. Babuška I., Tempone R., Zouraris G. Galerkin finite element approximations of stochastic elliptic partial differential equations. SIAM J. Numer. Anal. 2004, 42(2):800-825.
38. Cohen A., DeVore R., Schwab C. Convergence rates of best n-term Galerkin approximations for a class of elliptic sPDEs. Found. Comput. Math. 2010, 10(6):615-646.
39. Beck J., Nobile F., Tamellini L., Tempone R. On the optimal polynomial approximation of stochastic PDEs by Galerkin and collocation methods. Math. Models Methods Appl. Sci. 2012, 22(09):1250023.
40. Escoda O., Granai L., Vandergheynst P. On the use of a priori information for sparse signal approximations. IEEE Trans. Signal Process. 2006, 9:3468-3482.
41. ℓ1 minimization. J. Fourier Anal. Appl. 2008, 14(5):877-905.
42. Chartrand R., Yin W. Iteratively reweighted algorithms for compressive sensing. 33rd International Conference on Acoustics, Speech, and Signal Processing (ICASSP) 2008.
43. ℓ1 minimization. Proceedings of 2010 IEEE International Symposium on Information Theory (ISIT) 2010, 1603-1607. IEEE.
44. Candès E., Tao T. Decoding by linear programming. IEEE Trans. Inf. Theory 2005, 51(12):4203-4215.
45. Candès E., Romberg J., Tao T. Stable signal recovery from incomplete and inaccurate measurements. Commun. Pure Appl. Math. 2006, LIX:1207-1223.
46. ℓ1-minimization. J. Approx. Theory 2012, 164(5):517-533.
47. Logg A., Mardal K.-A., Wells G.N., et al. Automated Solution of Differential Equations by the Finite Element Method 2012, Springer. 10.1007/978-3-642-23099-8.
48. Askey R.A., Arthur W.J. Some Basic Hypergeometric Orthogonal Polynomials that Generalize Jacobi Polynomials, vol. 319 1985, AMS, Providence RI.
49. Hansen P.C. Rank-deficient and Discrete ill-posed Problems: Numerical Aspects of Linear Inversion 1998, Society for Industrial and Applied Mathematics, Philadelphia, PA, USA.
50. ℓ1-minimization. Proc. Asilomar Conf. on Signals, Systems, and Computers, Pacific Grove, CA 2009.
51. Hansen M., Schwab C. Analytic regularity and nonlinear approximation of a class of parametric semilinear elliptic PDEs. Math. Nachr. 2013, 286(8-9):832-860. 10.1002/mana.201100131.
52. Hoang V.H., Schwab C. Sparse tensor Galerkin discretization of parametric and random parabolic PDEs-analytic regularity and generalized polynomial chaos approximation. SIAM J. Math. Anal. 2013, 45(5):3050-3083.
53. Kunoth A., Schwab C. Analytic regularity and GPC approximation for control problems constrained by linear parametric elliptic and parabolic PDEs. SIAM J. Control Optim. 2013, 51(3):2442-2471.
54. van den Berg E., Friedlander M.P. Probing the Pareto frontier for basis pursuit solutions. SIAM J. Sci. Comput. 2008, 31(2):890-912.
55. ℓ1-recovery. IEEE Trans. Inf. Theory 2011, 57:7818-7839.
56. ℓ1 minimization. Math. Program. 2011, 127(1):57-88.
57. Gribonval R., Nielsen M. Sparse representations in unions of bases. IEEE Trans. Inf. Theory 2003, 49(12):3320-3325.
58. Cohen A., Dahmen W., DeVore R. Compressed sensing and best k-term approximation. J. Am. Math. Soc. 2009, 22:211-231.
59. δ2k. Appl. Comput. Harmon. Anal. 2011, 31(3):460-468.
60. Andersson J., Strömberg J. On the theorem of uniform recovery of random sampling matrices arxiv:1206.5986.
61. Candès E.J. The restricted isometry property and its implications for compressed sensing. C. R. Math. 2008, 346(9):589-592.
62. Bieri M., Andreev R., Schwab C. Sparse tensor discretization of elliptic sPDEs 2009, Tech. Rep. Research Report No. 2009-07, Seminar für Angewandte Mathematik, SAM, Zürich, Switzerland.
63. L2 projection on polynomial spaces with random evaluations 2011, Tech. Rep., Mathematics Institute of Computational Science and Engineering, Lausanne, Switzerland.
64. Tipping M.E. Sparse Bayesian learning and the relevance vector machine. J. Mach. Learn. Res. 2001, 1:211-244.
65. Ji S., Xue Y., Carin L. Bayesian compressive sensing. IEEE Trans. Signal Process. 2008, 56(6):2346-2356.
66. LeMaitre O., Reagan M., Najm H., Ghanem R., Knio O. A stochastic projection method for fluid flow. II: Random process. J. Comput. Phys. 2002, 181:9-44.
67. Quéré P.L. Accurate solutions to the square thermally driven cavity at high Rayleigh number. Comput. Fluids 1991, 20(1):29-41.
68. Ghanem R., Spanos P. Stochastic Finite Elements: A Spectral Approach 2002, Dover.
69. Volterra V. Theory of Functionals and of Integral and Integro-Differential Equations 1959, Dover.