Computing Atlas

How Computing Was Built
Sign In
Text size
100%
Theme
Algorithm

Discontinuous Galerkin method

Numerical Algorithm

Discontinuous Galerkin methods, usually shortened to DG methods, are a class of numerical methods for solving differential equations that combine features of the finite element and the finite volume frameworks. Like the continuous Galerkin finite element method they start from a weak formulation of the model problem, but they search for the solution in a space of functions that are only piecewise continuous, with polynomial pieces defined on each element of a mesh, so the numerical solution may jump across element boundaries. This makes them well suited to problems with a dominant first-order part, such as those in electrodynamics, fluid mechanics and plasma physics, where solutions can have strong gradients or even discontinuities that defeat classical finite element methods while finite volume methods stay limited to low order. The first DG method was introduced in 1973 by Reed and Hill for the hyperbolic neutron transport equation, and variants for elliptic problems developed gradually through the 1970s onward.

Connections

In Field

Source Discontinuous Galerkin method (Wikipedia)
Sources
Discontinuous Galerkin method (Wikipedia)
  • In Group: Numerical Integration and Differential Equations, Lead
    discontinuous Galerkin methods (DG methods) form a class of numerical methods for solving differential equations
  • In Field: Numerical analysis, Lead, field
    form a class of numerical methods for solving differential equations
View the Source
Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.