18,024 research outputs found

    Convergence Analysis of the Lowest Order Weakly Penalized Adaptive Discontinuous Galerkin Methods

    Full text link
    In this article, we prove convergence of the weakly penalized adaptive discontinuous Galerkin methods. Unlike other works, we derive the contraction property for various discontinuous Galerkin methods only assuming the stabilizing parameters are large enough to stabilize the method. A central idea in the analysis is to construct an auxiliary solution from the discontinuous Galerkin solution by a simple post processing. Based on the auxiliary solution, we define the adaptive algorithm which guides to the convergence of adaptive discontinuous Galerkin methods

    Well-balanced rr-adaptive and moving mesh space-time discontinuous Galerkin method for the shallow water equations

    Get PDF
    In this article we introduce a well-balanced discontinuous Galerkin method for the shallow water equations on moving meshes. Particular emphasis will be given on rr-adaptation in which mesh points of an initially uniform mesh move to concentrate in regions where interesting behaviour of the solution is observed. Obtaining well-balanced numerical schemes for the shallow water equations on fixed meshes is nontrivial and has been a topic of much research. In [S. Rhebergen, O. Bokhove, J.J.W. van der Vegt, Discontinuous Galerkin finite element methods for hyperbolic nonconservative partial differential equations, J. Comput. Phys. 227 (2008) 1887–1922] we introduced a well-balanced discontinuous Galerkin method using the theory of weak solutions for nonconservative products introduced in [G. Dal Maso, P.G. LeFloch, F. Murat, Definition and weak stability of nonconservative products, J. Math. Pures Appl. 74 (1995) 483–548]. In this article we continue this approach and prove well-balancedness of a discontinuous Galerkin method for the shallow water equations on moving meshes. Numerical simulations are then performed to verify the rr-adaptive method in combination with the space-time discontinuous Galerkin method against analytical solutions and showing its robustness on more complex problems

    A domain decomposition method for solving the three-dimensional time-harmonic Maxwell equations discretized by discontinuous Galerkin methods

    Get PDF
    We present here a domain decomposition method for solving the three-dimensional time-harmonic Maxwell equations discretized by a discontinuous Galerkin method. In order to allow the treatment of irregularly shaped geometries, the discontinuous Galerkin method is formulated on unstructured tetrahedral meshes. The domain decomposition strategy takes the form of a Schwarz-type algorithm where a continuity condition on the incoming characteristic variables is imposed at the interfaces between neighboring subdomains. A multifrontal sparse direct solver is used at the subdomain level. The resulting domain decomposition strategy can be viewed as a hybrid iterative/direct solution method for the large, sparse and complex coefficients algebraic system resulting from the discretization of the time-harmonic Maxwell equations by a discontinuous Galerkin method

    High order discontinuous Galerkin methods on surfaces

    Get PDF
    We derive and analyze high order discontinuous Galerkin methods for second-order elliptic problems on implicitely defined surfaces in R3\mathbb{R}^{3}. This is done by carefully adapting the unified discontinuous Galerkin framework of Arnold et al. [2002] on a triangulated surface approximating the smooth surface. We prove optimal error estimates in both a (mesh dependent) energy norm and the L2L^2 norm.Comment: 23 pages, 2 figure

    hp-version interior penalty DGFEMs for the biharmonic equation

    Get PDF
    We construct hp-version interior penalty discontinuous Galerkin finite element methods (DGFEMs) for the biharmonic equation, including symmetric and nonsymmetric interior penalty discontinuous Galerkin methods and their combinations: semisymmetric methods. Our main concern is to establish the stability and to develop the a priori error analysis of these methods. We establish error bounds that are optimal in h and slightly suboptimal in p. The theoretical results are confirmed by numerical experiments

    hp-adaptive discontinuous Galerkin solver for elliptic equations in numerical relativity

    No full text
    A considerable amount of attention has been given to discontinuous Galerkin methods for hyperbolic problems in numerical relativity, showing potential advantages of the methods in dealing with hydrodynamical shocks and other discontinuities. This paper investigates discontinuous Galerkin methods for the solution of elliptic problems in numerical relativity. We present a novel hp-adaptive numerical scheme for curvilinear and non-conforming meshes. It uses a multigrid preconditioner with a Chebyshev or Schwarz smoother to create a very scalable discontinuous Galerkin code on generic domains. The code employs compactification to move the outer boundary near spatial infinity. We explore the properties of the code on some test problems, including one mimicking Neutron stars with phase transitions. We also apply it to construct initial data for two or three black holes
    corecore