784 research outputs found

    An agglomeration-based massively parallel non-overlapping additive Schwarz preconditioner for high-order discontinuous Galerkin methods on polytopic grids

    Full text link
    In this article we design and analyze a class of two-level non-overlapping additive Schwarz preconditioners for the solution of the linear system of equations stemming from discontinuous Galerkin discretizations of second-order elliptic partial differential equations on polytopic meshes. The preconditioner is based on a coarse space and a non-overlapping partition of the computational domain where local solvers are applied in parallel. In particular, the coarse space can potentially be chosen to be non-embedded with respect to the finer space; indeed it can be obtained from the fine grid by employing agglomeration and edge coarsening techniques. We investigate the dependence of the condition number of the preconditioned system with respect to the diffusion coefficient and the discretization parameters, i.e., the mesh size and the polynomial degree of the fine and coarse spaces. Numerical examples are presented which confirm the theoretical bounds

    A Unified Analysis of Balancing Domain Decomposition by Constraints for Discontinuous Galerkin Discretizations

    Get PDF
    The BDDC algorithm is extended to a large class of discontinuous Galerkin (DG) discretizations of second order elliptic problems. An estimate of C(1 + log(H/h))2 is obtained for the condition number of the preconditioned system where C is a constant independent of h or H or large jumps in the coefficient of the problem. Numerical simulations are presented which confirm the theoretical results. A key component for the development and analysis of the BDDC algorithm is a novel perspective presenting the DG discretization as the sum of element-wise “local” bilinear forms. The element-wise perspective allows for a simple unified analysis of a variety of DG methods and leads naturally to the appropriate choice for the subdomain-wise local bilinear forms. Additionally, this new perspective enables a connection to be drawn between the DG discretization and a related continuous finite element discretization to simplify the analysis of the BDDC algorithm.Boeing CompanyMassachusetts Institute of Technology (Zakhartchenko Fellowship

    Multigrid algorithms for hp-version interior penalty discontinuous Galerkin methods on polygonal and polyhedral meshes

    Get PDF
    In this paper we analyze the convergence properties of two-level and W-cycle multigrid solvers for the numerical solution of the linear system of equations arising from hp-version symmetric interior penalty discontinuous Galerkin discretizations of second-order elliptic partial differential equations on polygonal/polyhedral meshes. We prove that the two-level method converges uniformly with respect to the granularity of the grid and the polynomial approximation degree p, provided that the number of smoothing steps, which depends on p, is chosen sufficiently large. An analogous result is obtained for the W-cycle multigrid algorithm, which is proved to be uniformly convergent with respect to the mesh size, the polynomial approximation degree, and the number of levels, provided the latter remains bounded and the number of smoothing steps is chosen sufficiently large. Numerical experiments are presented which underpin the theoretical predictions; moreover, the proposed multilevel solvers are shown to be convergent in practice, even when some of the theoretical assumptions are not fully satisfied

    High-order Discontinuous Galerkin methods for the elastodynamics equation on polygonal and polyhedral meshes

    Get PDF
    We propose and analyze a high-order Discontinuous Galerkin Finite Element Method for the approximate solution of wave propagation problems modeled by the elastodynamics equations on computational meshes made by polygonal and polyhedral elements. We analyze the well posedness of the resulting formulation, prove hp-version error a-priori estimates, and present a dispersion analysis, showing that polygonal meshes behave as classical simplicial/quadrilateral grids in terms of dispersion properties. The theoretical estimates are confirmed through various two-dimensional numerical verifications
    corecore