An analysis of the practical DPG method

Mathematics – Numerical Analysis

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

In this work 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$ on each mesh element. Earlier works showed that there is a "trial-to-test" operator $T$, which when applied to the trial space, defines a test space that guarantees stability. In DPG formulations, this operator $T$ is local: it can be applied element-by-element. However, an infinite dimensional problem on each mesh element needed to be solved to apply $T$. In practical computations, $T$ is approximated using polynomials of some degree $r > p$ on each mesh element. We show that this approximation maintains optimal convergence rates, provided that $r\ge p+N$, where $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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

An analysis of the practical DPG method does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with An analysis of the practical DPG method, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An analysis of the practical DPG method will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-688081

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.