Abstract
We propose a non-intrusive reduced-order modeling method for space–time-dependent parameterized problems in the context of uncertainty quantification. In the offline stage, proper orthogonal decomposition (POD) is used to extract the spatial modes based on a set of high-fidelity time-parameter-dependent snapshots and then to extract the temporal modes of the projection coefficients of the spatial modes. Finally, parameter-dependent combination coefficients are approximated using polynomial chaos expansions (PCEs). Cubic spline interpolation is used to evaluate the temporal modes at any other given time. In the online stage, a fast evaluation is provided at any given time and parameter by simply estimating the values of the polynomials and temporal modes. To validate the numerical performance of the proposed method, three time-dependent parameterized problems are tested: a one-dimensional (1-D) forced Burger's equation with a random force term, a 1-D diffusion–reaction equation with a random field force term, and a two-dimensional incompressible fluid flow over a cylinder with a random inflow boundary condition. The results indicate that the proposed method is able to approximate the full-order model very inexpensively with a reasonable loss of accuracy for problems with uncorrelated or correlated input parameters. Furthermore, the proposed method is effective in estimating low-order moments, indicating that it has great potential for use in uncertainty quantification analysis of space–time-dependent problems.
Original language | English |
---|---|
Pages (from-to) | 50-64 |
Number of pages | 15 |
Journal | Computers and Mathematics with Applications |
Volume | 87 |
DOIs | |
Publication status | Published - 2021 Apr 1 |
Bibliographical note
Funding Information:This work was supported by the National Research Foundation of Korea (NRF) grant funded by the Korea government (Ministry of Science and ICT) ( NRF-2017R1E1A1A0-3070161 and NRF-20151009350 ) and in part by the Yonsei University, Republic of Korea Research Fund (Post Doc. Researcher Supporting Program) of 2019 (No.: 2019-12-0136 ). Finally, we thank the anonymous reviewers for their valuable comments and suggestions that improved the quality of the paper.
Funding Information:
This work was supported by the National Research Foundation of Korea (NRF) grant funded by the Korea government (Ministry of Science and ICT) (NRF-2017R1E1A1A0-3070161 and NRF-20151009350) and in part by the Yonsei University, Republic of Korea Research Fund (Post Doc. Researcher Supporting Program) of 2019 (No.: 2019-12-0136). Finally, we thank the anonymous reviewers for their valuable comments and suggestions that improved the quality of the paper.
Publisher Copyright:
© 2021 Elsevier Ltd
All Science Journal Classification (ASJC) codes
- Modelling and Simulation
- Computational Theory and Mathematics
- Computational Mathematics