Sparse Approximation of Data-Driven Polynomial Chaos Expansions: An Induced Sampling Approach

Sparse Approximation of Data-Driven Polynomial Chaos Expansions: An Induced Sampling Approach

Year:    2020

Author:    Ling Guo, Akil Narayan, Yongle Liu, Tao Zhou

Communications in Mathematical Research , Vol. 36 (2020), Iss. 2 : pp. 128–153

Abstract

One of the open problems in the field of forward uncertainty quantification (UQ) is the ability to form accurate assessments of uncertainty having only incomplete information about the distribution of random inputs. Another challenge is to efficiently make use of limited training data for UQ predictions of complex engineering problems, particularly with high dimensional random parameters. We address these challenges by combining data-driven polynomial chaos expansions with a recently developed preconditioned sparse approximation approach for UQ problems. The first task in this two-step process is to employ the procedure developed in [1] to construct an "arbitrary" polynomial chaos expansion basis using a finite number of statistical moments of the random inputs. The second step is a novel procedure to effect sparse approximation via $ℓ$1 minimization in order to quantify the forward uncertainty. To enhance the performance of the preconditioned $ℓ$1 minimization problem, we sample from the so-called induced distribution, instead of using Monte Carlo (MC) sampling from the original, unknown probability measure. We demonstrate on test problems that induced sampling is a competitive and often better choice compared with sampling from asymptotically optimal measures (such as the equilibrium measure) when we have incomplete information about the distribution. We demonstrate the capacity of the proposed induced sampling algorithm via sparse representation with limited data on test functions, and on a Kirchoff plating bending problem with random Young's modulus.

You do not have full access to this article.

Already a Subscriber? Sign in as an individual or via your institution

Journal Article Details

Publisher Name:    Global Science Press

Language:    English

DOI:    https://doi.org/10.4208/cmr.2020-0010

Communications in Mathematical Research , Vol. 36 (2020), Iss. 2 : pp. 128–153

Published online:    2020-01

AMS Subject Headings:    Global Science Press

Copyright:    COPYRIGHT: © Global Science Press

Pages:    26

Keywords:    Uncertainty quantification data-driven polynomial chaos expansions sparse approximation equilibrium measure induced measure.

Author Details

Ling Guo

Akil Narayan

Yongle Liu

Tao Zhou

  1. Non-intrusive framework of reduced-order modeling based on proper orthogonal decomposition and polynomial chaos expansion

    Sun, Xiang | Pan, Xiaomin | Choi, Jung-Il

    Journal of Computational and Applied Mathematics, Vol. 390 (2021), Iss. P.113372

    https://doi.org/10.1016/j.cam.2020.113372 [Citations: 15]
  2. Sparse Polynomial Chaos Expansions: Literature Survey and Benchmark

    Lüthen, Nora | Marelli, Stefano | Sudret, Bruno

    SIAM/ASA Journal on Uncertainty Quantification, Vol. 9 (2021), Iss. 2 P.593

    https://doi.org/10.1137/20M1315774 [Citations: 130]
  3. Uncertainty quantification analysis with arbitrary polynomial chaos method: Application in slipstream effect of propeller aircraft

    Li, Yao | Si, Haiqing | Wu, Xiaojun | Zhao, Wei | Li, Gen | Qiu, Jingxuan

    Modern Physics Letters B, Vol. 37 (2023), Iss. 20

    https://doi.org/10.1142/S0217984923500495 [Citations: 0]
  4. Optimal design for kernel interpolation: Applications to uncertainty quantification

    Narayan, Akil | Yan, Liang | Zhou, Tao

    Journal of Computational Physics, Vol. 430 (2021), Iss. P.110094

    https://doi.org/10.1016/j.jcp.2020.110094 [Citations: 6]