Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
471088 | Computers & Mathematics with Applications | 2014 | 12 Pages |
Abstract
This paper presents a duality theorem of the Aubin–Nitsche type for discontinuous Petrov–Galerkin (DPG) methods. This explains the numerically observed higher convergence rates in weaker norms. Considering the specific example of the mild-weak (or primal) DPG method for the Laplace equation, two further results are obtained. First, the DPG method continues to be solvable even when the test space degree is reduced, provided it is odd. Second, a non-conforming method of analysis is developed to explain the numerically observed convergence rates for a test space of reduced degree.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Timaeus Bouma, Jay Gopalakrishnan, Ammar Harb,