J. David Moulton

Lijian Jiang, J. David Moulton, Jia Wei

Stochastic modeling has become a popular approach to quantify uncertainty in flows through heterogeneous porous media. The uncertainty in heterogeneous structure properties is often parameterized by a high-dimensional random variable. This leads to a deterministic problem in a high-dimensional parameter space and the numerical computation becomes very challengeable as the dimension of the parameter space increases. To efficiently tackle the high-dimensionality, we propose a hybrid high dimensional model representation (HDMR) technique, through which the high-dimensional stochastic model is decomposed into a moderate-dimensional stochastic model in a most active random space and a few one-dimensional stochastic models. The derived low-dimensional stochastic models are solved by incorporating sparse grid stochastic collocation method into the proposed hybrid HDMR. The porous media properties such as permeability are often heterogeneous. To treat the heterogeneity, we use a mixed multiscale finite element method (MMsFEM) to simulate each of derived stochastic models. To capture the non-local spatial features of the porous media and the important effects of random variables, we can hierarchically incorporate the global information individually from each of random parameters. This significantly enhances the accuracy of the multiscale simulation. The synergy of the hybrid HDMR and the MMsFEM reduces the stochastic model of flows in both stochastic space and physical space, and significantly decreases the computation complexity. We carefully analyze the proposed HDMR technique and the derived stochastic MMsFEM. A few numerical experiments are carried out for two-phase flows in random porous media and support the efficiency and accuracy of the MMsFEM based on the hybrid HDMR.

Lijian Jiang, Dylan Copeland, J. David Moulton

We develop a family of expanded mixed Multiscale Finite Element Methods (MsFEMs) and their hybridizations for second-order elliptic equations. This formulation expands the standard mixed Multiscale Finite Element formulation in the sense that four unknowns (hybrid formulation) are solved simultaneously: pressure, gradient of pressure, velocity and Lagrange multipliers. We use multiscale basis functions for the both velocity and gradient of pressure. In the expanded mixed MsFEM framework, we consider both cases of separable-scale and non-separable spatial scales. We specifically analyze the methods in three categories: periodic separable scales, $G$- convergence separable scales, and continuum scales. When there is no scale separation, using some global information can improve accuracy for the expanded mixed MsFEMs. We present rigorous convergence analysis for expanded mixed MsFEMs. The analysis includes both conforming and nonconforming expanded mixed MsFEM. Numerical results are presented for various multiscale models and flows in porous media with shales to illustrate the efficiency of the expanded mixed MsFEMs.

Andrew Reisner, Luke N. Olson, J. David Moulton

The efficient solution of sparse, linear systems resulting from the discretization of partial differential equations is crucial to the performance of many physics-based simulations. The algorithmic optimality of multilevel approaches for common discretizations makes them a good candidate for an efficient parallel solver. Yet, modern architectures for high-performance computing systems continue to challenge the parallel scalability of multilevel solvers. While algebraic multigrid methods are robust for solving a variety of problems, the increasing importance of data locality and cost of data movement in modern architectures motivates the need to carefully exploit structure in the problem. Robust logically structured variational multigrid methods, such as Black Box Multigrid (BoxMG), maintain structure throughout the multigrid hierarchy. This avoids indirection and increased coarse-grid communication costs typical in parallel algebraic multigrid. Nevertheless, the parallel scalability of structured multigrid is challenged by coarse-grid problems where the overhead in communication dominates computation. In this paper, an algorithm is introduced for redistributing coarse-grid problems through incremental agglomeration. Guided by a predictive performance model, this algorithm provides robust redistribution decisions for structured multilevel solvers. A two-dimensional diffusion problem is used to demonstrate the significant gain in performance of this algorithm over the previous approach that used agglomeration to one processor. In addition, the parallel scalability of this approach is demonstrated on two large-scale computing systems, with solves on up to 500K+ cores.