TY - JOUR

T1 - Parallel Domain Decomposition Strategies for Stochastic Elliptic Equations. Part A: Local Karhunen--Loève Representations

AU - Contreras, Andres A.

AU - Mycek, Paul

AU - Le Maître, Olivier P.

AU - Rizzi, Francesco

AU - Debusschere, Bert

AU - Knio, Omar

N1 - KAUST Repository Item: Exported on 2020-10-01
Acknowledgements: This work was supported by the US DOE, Office of Science, Office of Advanced Scientific Computing Research, under award DE-SC0010540. Sandia National Laboratories is a multimission laboratory managed and operated by National Technology and Engineering Solutions of Sandia, LLC, a wholly owned subsidiary of Honeywell International, Inc., for the US DOE's National Nuclear Security Administration under contract DE-NA-0003525. Support of the King Abdullah University of Science and Technology is also acknowledged.

PY - 2018/7/18

Y1 - 2018/7/18

N2 - This work presents a method to efficiently determine the dominant Karhunen--Loève (KL) modes of a random process with known covariance function. The truncated KL expansion is one of the most common techniques for the approximation of random processes, primarily because it is an optimal representation, in the mean squared error sense, with respect to the number of random variables in the representation. However, finding the KL expansion involves solving integral problems, which tends to be computationally demanding. This work addresses this issue by means of a work-subdivision strategy based on a domain decomposition approach, enabling the efficient computation of a possibly large number of dominant KL modes. Specifically, the computational domain is partitioned into smaller nonoverlapping subdomains, over which independent local KL decompositions are performed to generate local bases which are subsequently used to discretize the global modes over the entire domain. The latter are determined by means of a Galerkin projection. The procedure leads to the resolution of a reduced Galerkin problem, whose size is not related to the dimension of the underlying discretization space but is actually determined by the desired accuracy and the number of subdomains. It can also be easily implemented in parallel. Extensive numerical tests are used to validate the methodology and assess its serial and parallel performance. The resulting expansion is exploited in Part B to accelerate the solution of the stochastic partial differential equations using a Monte Carlo approach.

AB - This work presents a method to efficiently determine the dominant Karhunen--Loève (KL) modes of a random process with known covariance function. The truncated KL expansion is one of the most common techniques for the approximation of random processes, primarily because it is an optimal representation, in the mean squared error sense, with respect to the number of random variables in the representation. However, finding the KL expansion involves solving integral problems, which tends to be computationally demanding. This work addresses this issue by means of a work-subdivision strategy based on a domain decomposition approach, enabling the efficient computation of a possibly large number of dominant KL modes. Specifically, the computational domain is partitioned into smaller nonoverlapping subdomains, over which independent local KL decompositions are performed to generate local bases which are subsequently used to discretize the global modes over the entire domain. The latter are determined by means of a Galerkin projection. The procedure leads to the resolution of a reduced Galerkin problem, whose size is not related to the dimension of the underlying discretization space but is actually determined by the desired accuracy and the number of subdomains. It can also be easily implemented in parallel. Extensive numerical tests are used to validate the methodology and assess its serial and parallel performance. The resulting expansion is exploited in Part B to accelerate the solution of the stochastic partial differential equations using a Monte Carlo approach.

UR - http://hdl.handle.net/10754/628497

UR - https://epubs.siam.org/doi/10.1137/17M1132185

UR - http://www.scopus.com/inward/record.url?scp=85053661715&partnerID=8YFLogxK

U2 - 10.1137/17m1132185

DO - 10.1137/17m1132185

M3 - Article

VL - 40

SP - C520-C546

JO - SIAM Journal on Scientific Computing

JF - SIAM Journal on Scientific Computing

SN - 1064-8275

IS - 4

ER -