A GENERAL FRAMEWORK FOR ENHANCING SPARSITY OF GENERALIZED POLYNOMIAL CHAOS EXPANSIONS

被引:2
|
作者
Yang, Xiu [1 ]
Wan, Xiaoliang [2 ,3 ]
Lin, Lin [4 ,5 ]
Lei, Huan [1 ]
机构
[1] Pacific Northwest Natl Lab, Adv Comp Math & Data Div, Richland, WA 99352 USA
[2] Louisiana State Univ, Dept Math, Baton Rouge, LA 70803 USA
[3] Louisiana State Univ, Ctr Computat & Technol, Baton Rouge, LA 70803 USA
[4] Univ Calif Berkeley, Dept Math, Berkeley, CA 94720 USA
[5] Lawrence Berkeley Natl Lab, Computat Res Div, Berkeley, CA 94720 USA
关键词
uncertainty quantification; generalized polynomial chaos; compressive sensing; iterative rotation; alternating direction; SLICED-INVERSE-REGRESSION; DIFFERENTIAL-EQUATIONS; INTERPOLATION; MINIMIZATION; CONVERGENCE; ADAPTATION; RECOVERY; ANOVA;
D O I
10.1615/Int.J.UncertaintyQuantification.2019027864
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
Compressive sensing has become a powerful addition to uncertainty quantification when only limited data are available. In this paper, we provide a general framework to enhance the sparsity of the representation of uncertainty in the form of generalized polynomial chaos expansion. We use an alternating direction method to identify new sets of random variables through iterative rotations so the new representation of the uncertainty is sparser. Consequently, we increase both the efficiency and accuracy of the compressive-sensing-based uncertainty quantification method. We demonstrate that the previously developed rotation-based methods to enhance the sparsity of Hermite polynomial expansion is a special case of this general framework. Moreover, we use Legendre and Chebyshev polynomial expansions to demonstrate the effectiveness of this method with applications in solving stochastic partial differential equations and high-dimensional (O(100)) problems.
引用
收藏
页码:221 / 243
页数:23
相关论文
共 50 条
  • [1] GENERALIZED POLYNOMIAL CHAOS EXPANSIONS WITH WEIGHTS
    Obermaier, Josef
    Stavropoulou, Faidra
    [J]. JOURNAL OF COMPUTATIONAL ANALYSIS AND APPLICATIONS, 2015, 18 (01) : 30 - 45
  • [2] ON THE CONVERGENCE OF GENERALIZED POLYNOMIAL CHAOS EXPANSIONS
    Ernst, Oliver G.
    Mugler, Antje
    Starkloff, Hans-Joerg
    Ullmann, Elisabeth
    [J]. ESAIM-MATHEMATICAL MODELLING AND NUMERICAL ANALYSIS, 2012, 46 (02) : 317 - 339
  • [3] Enhancing sparsity of Hermite polynomial expansions by iterative rotations
    Yang, Xiu
    Lei, Huan
    Baker, Nathan A.
    Lin, Guang
    [J]. JOURNAL OF COMPUTATIONAL PHYSICS, 2016, 307 : 94 - 109
  • [4] A Posteriori Validation of Generalized Polynomial Chaos Expansions*
    Breden, Maxime
    [J]. SIAM JOURNAL ON APPLIED DYNAMICAL SYSTEMS, 2023, 22 (02): : 765 - 801
  • [5] Generalized polynomial chaos expansions for the random fractional Bateman equations
    Jornet, Marc
    [J]. APPLIED MATHEMATICS AND COMPUTATION, 2024, 479
  • [6] Divide and conquer: An incremental sparsity promoting compressive sampling approach for polynomial chaos expansions
    Alemazkoor, Negin
    Meidani, Hadi
    [J]. COMPUTER METHODS IN APPLIED MECHANICS AND ENGINEERING, 2017, 318 : 937 - 956
  • [7] Computation of higher-order moments of generalized polynomial chaos expansions
    Savin, E.
    Faverjon, B.
    [J]. INTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN ENGINEERING, 2017, 111 (12) : 1192 - 1200
  • [8] A GENERALIZED SAMPLING AND PRECONDITIONING SCHEME FOR SPARSE APPROXIMATION OF POLYNOMIAL CHAOS EXPANSIONS
    Jakeman, John D.
    Narayan, Akil
    Zhou, Tao
    [J]. SIAM JOURNAL ON SCIENTIFIC COMPUTING, 2017, 39 (03): : A1114 - A1144
  • [9] A STATISTICAL IMPUTATION METHOD FOR HANDLING MISSING VALUES IN GENERALIZED POLYNOMIAL CHAOS EXPANSIONS
    Andrews, Mark
    Jones, Gavin
    Leyde, Brian
    Xiong, Lie
    Xu, Max
    Chien, Peter
    [J]. PROCEEDINGS OF THE ASME TURBO EXPO: TURBOMACHINERY TECHNICAL CONFERENCE AND EXPOSITION, 2019, VOL 2D, 2019,
  • [10] On the guaranteed accuracy of Polynomial Chaos Expansions
    Fagiano, L.
    Khammash, M.
    Novara, C.
    [J]. 2011 50TH IEEE CONFERENCE ON DECISION AND CONTROL AND EUROPEAN CONTROL CONFERENCE (CDC-ECC), 2011, : 728 - 733