1986
DOI: 10.1090/s0025-5718-1986-0815828-4
|View full text |Cite
|
Sign up to set email alerts
|

An analysis of the discontinuous Galerkin method for a scalar hyperbolic equation

Abstract: We prove Lp stability and error estimates for the discontinuous Galerkin method when applied to a scalar linear hyperbolic equation on a convex polygonal plane domain. Using finite element analysis techniques, we obtain L2 estimates that are valid on an arbitrary locally regular triangulation of the domain and for an arbitrary degree of polynomials. L estimates for p =* 2 are restricted to either a uniform or piecewise uniform triangulation and to polynomials of not higher than first degree. The latter estimat… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2

Citation Types

3
144
0
6

Year Published

1997
1997
2014
2014

Publication Types

Select...
5
3
2

Relationship

0
10

Authors

Journals

citations
Cited by 405 publications
(166 citation statements)
references
References 8 publications
3
144
0
6
Order By: Relevance
“…Those types of schemes are referred to as Discontinuous Galerkin methods. They were proposed amongst others by REED and HILL in [11] with first analyses to be found in [6] and [4]. A…”
Section: Time-discontinuous Galerkin Methodsmentioning
confidence: 99%
“…Those types of schemes are referred to as Discontinuous Galerkin methods. They were proposed amongst others by REED and HILL in [11] with first analyses to be found in [6] and [4]. A…”
Section: Time-discontinuous Galerkin Methodsmentioning
confidence: 99%
“…The additional test function α · ∇u h , used by Johnson and Pitkäranta [4] provides additional stability and leads to an improvement in the error estimates originally obtained by Lesaint and Raviart [5].…”
Section: Introductionmentioning
confidence: 98%
“…Scheme 111 is third-order accurate in space and time.' This scheme can also be derived in a finite-element context (Johnson and Pitkaranta, 1986), and is referred to as the Discontinuous Galerkin (DG) method. It is the possibility of deriving schemes with improved order-of-accuracy that makes this approach potentially superior to using the extra storage for mesh refinement.…”
Section: Introductionmentioning
confidence: 99%