Enhancing<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:msub><mml:mrow><mml:mi>ℓ</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:math>-minimization estimates of polynomial chaos expansions using basis selection
Tóm tắt
Từ khóa
Tài liệu tham khảo
Babuska, 2004, Galerkin finite element approximations of stochastic elliptic partial differential equations, SIAM J. Numer. Anal., 42, 800, 10.1137/S0036142902418680
Babuska, 2007, A stochastic collocation method for elliptic partial differential equations with random input data, SIAM J. Numer. Anal., 45, 1005, 10.1137/050645142
Baraniuk, 2010, Model-based compressive sensing, IEEE Trans. Inf. Theory, 56, 1982, 10.1109/TIT.2010.2040894
Beck, 2012, On the optimal polynomial approximation of stochastic PDEs by Galerkin and collocation methods, Math. Models Methods Appl. Sci., 22, 1250023, 10.1142/S0218202512500236
Becker, 2011, Nesta: a fast and accurate first-order method for sparse recovery, SIAM J. Imaging Sci., 4, 1, 10.1137/090756855
Bieri, 2009, Sparse high order {FEM} for elliptic sPDEs, Comput. Methods Appl. Mech. Eng., 198, 1149, 10.1016/j.cma.2008.08.019
Blatman, 2011, Adaptive sparse polynomial chaos expansion based on least angle regression, J. Comput. Phys., 230, 2345, 10.1016/j.jcp.2010.12.021
Boufounos, 2007, Sparse signal reconstruction from noisy compressive measurements using cross validation, 299
Breiman, 1992, Submodel selection and evaluation in regression. The x-random case, Int. Stat. Rev., 60, 291, 10.2307/1403680
Cai, 2011, Orthogonal matching pursuit for sparse signal recovery with noise, IEEE Trans. Inf. Theory, 57, 4680, 10.1109/TIT.2011.2146090
Candes, 2006, Near-optimal signal recovery from random projections: universal encoding strategies?, IEEE Trans. Inf. Theory, 52, 5406, 10.1109/TIT.2006.885507
Candés, 2006, Stable signal recovery from incomplete and inaccurate measurements, Commun. Pure Appl. Math., 59, 1207, 10.1002/cpa.20124
Candes, 2006, Stable signal recovery from incomplete and inaccurate measurements, Commun. Pure Appl. Math., 59, 1207, 10.1002/cpa.20124
Cohen, 2010, Convergence rates of best n-term Galerkin approximations for a class of elliptic sPDEs, Found. Comput. Math., 10, 615, 10.1007/s10208-010-9072-2
Conrad, 2013, Adaptive Smolyak pseudospectral approximations, SIAM J. Sci. Comput., 35, 10.1137/120890715
Constantine, 2012, Sparse pseudospectral approximation method, Comput. Methods Appl. Mech. Eng., 229–232, 1, 10.1016/j.cma.2012.03.019
Donoho, 2006, Stable recovery of sparse overcomplete representations in the presence of noise, IEEE Trans. Inf. Theory, 52, 6, 10.1109/TIT.2005.860430
Doostan, 2011, A non-adapted sparse approximation of PDEs with stochastic inputs, J. Comput. Phys., 230, 3015, 10.1016/j.jcp.2011.01.002
Duarte, 2005, Fast reconstruction of piecewise smooth signals from random projections
Foo, 2010, Multi-element probabilistic collocation method in high dimensions, J. Comput. Phys., 229, 1536, 10.1016/j.jcp.2009.10.043
Ganapathysubramanian, 2007, Sparse grid collocation schemes for stochastic natural convection problems, J. Comput. Phys., 225, 652, 10.1016/j.jcp.2006.12.014
Genz, 1987, A package for testing multiple integration subroutines, 337
Ghanem, 1991
Hastie, 2001
Jakeman, 2013, Local and dimension adaptive stochastic collocation for uncertainty quantification, vol. 88, 181
Kohavi, 1995, A study of cross-validation and bootstrap for accuracy estimation and model selection, 1137
Kunis, 2008, Random sampling of sparse trigonometric polynomials, II. Orthogonal matching pursuit versus basis pursuit, Found. Comput. Math., 8, 737, 10.1007/s10208-007-9005-x
La, 2006, Tree-based orthogonal matching pursuit algorithm for signal reconstruction, 1277
Ma, 2009, An adaptive hierarchical sparse grid collocation algorithm for the solution of stochastic differential equations, J. Comput. Phys., 228, 3084, 10.1016/j.jcp.2009.01.006
Mathelin, 2012, A compressed sensing approach for partial differential equations with random input data, Commun. Comput. Phys., 12, 919, 10.4208/cicp.151110.090911a
Mathelin, 2005, Stochastic approaches to uncertainty quantification in CFD simulations, Numer. Algorithms, 38, 209, 10.1007/s11075-004-2866-z
Needell, 2010, Cosamp: iterative signal recovery from incomplete and inaccurate samples, Commun. ACM, 53, 93, 10.1145/1859204.1859229
Nobile, 2008, An anisotropic sparse grid stochastic collocation method for partial differential equations with random input data, SIAM J. Numer. Anal., 46, 2411, 10.1137/070680540
Peng, 2014, A weighted-minimization approach for sparse polynomial chaos expansions, J. Comput. Phys., 267, 92, 10.1016/j.jcp.2014.02.024
Rauhut, 2012, Sparse Legendre expansions via ℓ1-minimization, J. Approx. Theory, 164, 517, 10.1016/j.jat.2012.01.008
Sargsyan, 2014, Dimensionality reduction for complex models via Bayesian Compressive Sensing, Int. J. Uncertain. Quantificat., 4, 63, 10.1615/Int.J.UncertaintyQuantification.2013006821
Sudret, 2008, Global sensitivity analysis using polynomial chaos expansions, Reliab. Eng. Syst. Saf., 93, 964, 10.1016/j.ress.2007.04.002
Tatang, 1997, An efficient method for parametric uncertainty analysis of numerical geophysical model, J. Geophys. Res., 102, 21925, 10.1029/97JD01654
Tibshirani, 1996, Regression shrinkage and selection via the Lasso, J. R. Stat. Soc., Ser. B, Methodol., 58, 267, 10.1111/j.2517-6161.1996.tb02080.x
van den Berg, 2008, Probing the Pareto frontier for basis pursuit solutions, SIAM J. Sci. Comput., 31, 890, 10.1137/080714488
Ward, 2009, Compressed sensing with cross validation, IEEE Trans. Inf. Theory, 55, 5773, 10.1109/TIT.2009.2032712
Xiu, 2005, High-order collocation methods for differential equations with random inputs, SIAM J. Sci. Comput., 27, 1118, 10.1137/040615201
Xiu, 2002, The Wiener–Askey polynomial chaos for stochastic differential equations, SIAM J. Sci. Comput., 24, 619, 10.1137/S1064827501387826
Xu, 2015, On sparse interpolation and the design of deterministic interpolation points, SIAM J. Sci. Comput.
Yan, 2012, Stochastic collocation algorithms using ℓ1-minimization, Int. J. Uncertain. Quantificat., 2, 279, 10.1615/Int.J.UncertaintyQuantification.2012003925