Open Access. Powered by Scholars. Published by Universities.®

Digital Commons Network

Open Access. Powered by Scholars. Published by Universities.®

Numerical Analysis and Computation

Dissertations and Theses

Theses/Dissertations

Galerkin methods

Articles 1 - 1 of 1

Full-Text Articles in Entire DC Network

Discrete Stability Of Dpg Methods, Ammar Harb May 2016

Discrete Stability Of Dpg Methods, Ammar Harb

Dissertations and Theses

This dissertation 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, for triangular meshes, 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. Finally, for rectangular meshes, the test space is …