Hostname: page-component-7b7567c8c-7pwfn Total loading time: 0 Render date: 2026-11-12T20:04:12.278Z Has data issue: false hasContentIssue false

An Adaptive ANOVA-Based Data-Driven Stochastic Method for Elliptic PDEs with Random Coefficient

Published online by Cambridge University Press:  03 June 2015

Zhiwen Zhang
Affiliation:
Computing and Mathematical Sciences, California Institute of Technology, Pasadena, CA 91125, USA
Xin Hu
Affiliation:
Computing and Mathematical Sciences, California Institute of Technology, Pasadena, CA 91125, USA
Thomas Y. Hou*
Affiliation:
Computing and Mathematical Sciences, California Institute of Technology, Pasadena, CA 91125, USA
Guang Lin*
Affiliation:
Pacific Northwest National Laboratory, Richland, WA 99352, USA
Mike Yan
Affiliation:
Computing and Mathematical Sciences, California Institute of Technology, Pasadena, CA 91125, USA
*
Corresponding author.Email:hou@cms.caltech.edu
Corresponding author.Email:Guang.Lin@pnnl.gov
Get access

Abstract

In this paper, we present an adaptive, analysis of variance (ANOVA)-based data-driven stochastic method (ANOVA-DSM) to study the stochastic partial differential equations (SPDEs) in the multi-query setting. Our new method integrates the advantages of both the adaptive ANOVA decomposition technique and the data-driven stochastic method. To handle high-dimensional stochastic problems, we investigate the use of adaptive ANOVA decomposition in the stochastic space as an effective dimension-reduction technique. To improve the slow convergence of the generalized polynomial chaos (gPC) method or stochastic collocation (SC) method, we adopt the data-driven stochastic method (DSM) for speed up. An essential ingredient of the DSM is to construct a set of stochastic basis under which the stochastic solutions enjoy a compact representation for a broad range of forcing functions and/or boundary conditions.

Our ANOVA-DSM consists of offline and online stages. In the offline stage, the original high-dimensional stochastic problem is decomposed into a series of low-dimensional stochastic subproblems, according to the ANOVA decomposition technique. Then, for each subproblem, a data-driven stochastic basis is computed using the Karhunen-Loève expansion (KLE) and a two-level preconditioning optimization approach. Multiple trial functions are used to enrich the stochastic basis and improve the accuracy. In the online stage, we solve each stochastic subproblem for any given forcing function by projecting the stochastic solution into the data-driven stochastic basis constructed offline. In our ANOVA-DSM framework, solving the original highdimensional stochastic problem is reduced to solving a series of ANOVA-decomposed stochastic subproblems using the DSM. An adaptive ANOVA strategy is also provided to further reduce the number of the stochastic subproblems and speed up our method. To demonstrate the accuracy and efficiency of our method, numerical examples are presented for one- and two-dimensional elliptic PDEs with random coefficients.

Information

Type
Research Article
Copyright
Copyright © Global Science Press Limited 2014

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable