An analysis of the practical DPG method
We give a complete error analysis of the Discontinuous Petrov Galerkin (DPG) method, accounting for all the approximations made in its practical implementation. Specifically, we consider the DPG method that uses a trial space consisting of polynomials of degree p, which when applied to the trial spa...
Saved in:
Published in: | Mathematics of computation Vol. 83; no. 286; pp. 537 - 552 |
---|---|
Main Authors: | , |
Format: | Journal Article |
Language: | English |
Published: |
American Mathematical Society
01-03-2014
|
Subjects: | |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | We give a complete error analysis of the Discontinuous Petrov Galerkin (DPG) method, accounting for all the approximations made in its practical implementation. Specifically, we consider the DPG method that uses a trial space consisting of polynomials of degree p, which when applied to the trial space, defines a test space that guarantees stability. In DPG formulations, this operator T. In practical computations, T on each mesh element. We show that this approximation maintains optimal convergence rates, provided that r\ge p+N is the space dimension (two or more), for the Laplace equation. We also prove a similar result for the DPG method for linear elasticity. Remarks on the conditioning of the stiffness matrix in DPG methods are also included. |
---|---|
ISSN: | 0025-5718 1088-6842 |
DOI: | 10.1090/S0025-5718-2013-02721-4 |