In this paper we propose a novel staggered discontinuous Galerkin method for the Brinkman problem on general quadrilateral and polygonal meshes. The proposed method is robust in the Stokes and Darcy limits, in addition, hanging nodes can be automatically incorporated in the construction of the method, which are desirable features in practical applications. There are three unknowns involved in our formulation, namely velocity gradient, velocity and pressure. Unlike the original staggered DG formulation proposed for the Stokes equations in [30], we relax the tangential continuity of velocity and enforce different staggered continuity properties for the three unknowns, which is tailored to yield an optimal L 2 error estimates for velocity gradient, velocity and pressure independent of the viscosity coefficient. Moreover, by choosing suitable projection, superconvergence can be proved for L 2 error of velocity. Finally, several numerical results illustrating the good performances of the proposed method and confirming the theoretical findings are presented.

No abstract

In this paper, we consider the balancing domain decomposition by constraints (BDDC) algorithm with adaptive coarse spaces for a class of stochastic elliptic problems. The key ingredient in the construction of the coarse space is the solutions of local spectral problems, which depend on the coefficient of the PDE. This poses a significant challenge for stochastic coefficients as it is computationally expensive to solve the local spectral problems for every realization of the coefficient. To tackle this computational burden, we propose a machine learning approach. Our method is based on the use of a deep neural network (DNN) to approximate the relation between the stochastic coefficients and the coarse spaces. For the input of the DNN, we apply the Karhunen–Loève expansion and use the first few dominant terms in the expansion. The output of the DNN is the resulting coarse space, which is then applied with the standard adaptive BDDC algorithm. We will present some numerical results with oscillatory and high contrast coefficients to show the efficiency and robustness of the proposed scheme.

No abstract

In this paper, we consider the balancing domain decomposition by constraints (BDDC) algorithm with adaptive coarse spaces for a class of stochastic elliptic problems. The key ingredient in the construction of the coarse space is the solutions of local spectral problems, which depend on the coefficient of the PDE. This poses a significant challenge for stochastic coefficients as it is computationally expensive to solve the local spectral problems for every realisation of the coefficient. To tackle this computational burden, we propose a machine learning approach. Our method is based on the use of a deep neural network (DNN) to approximate the relation between the stochastic coefficients and the coarse spaces. For the input of the DNN, we apply the Karhunen-Loève expansion and use the first few dominant terms in the expansion. The output of the DNN is the resulting coarse space, which is then applied with the standard adaptive BDDC algorithm. We will present some numerical results with oscillatory and high contrast coefficients to show the efficiency and robustness of the proposed scheme.