Convergence of adaptive hybridizable discontinuous Galerkin methods for second-order elliptic equations.

Loading...
Thumbnail Image

Persistent link to this item

Statistics
View Statistics

Journal Title

Journal ISSN

Volume Title

Title

Convergence of adaptive hybridizable discontinuous Galerkin methods for second-order elliptic equations.

Published Date

2012-08

Publisher

Type

Thesis or Dissertation

Abstract

We present several a posteriori error estimators for the so-called hybridizable discontinuous Galerkin (HDG) methods, as well as an a posteriori error estimator for variabledegree, hybridized version of the Raviart-Thomas method on nonconforming meshes, for second-order elliptic equations. We show that the error estimators provide a reliable upper and lower bound for the true error of the flux in the L2-norm. Moreover, we establish the convergence and quasi-optimality of adaptive hybridizable discontinuous Galerkin (AHDG) methods. We prove that the so-called quasi-error, that is, the sum of an energy-like error and a suitably scaled error estimator, is a contraction between two consecutive loops. We also show that the AHDG methods achieve optimal rates of convergence.

Description

University of Minnesota Ph.D. dissertation. August 2012. Major: Mathematics. Advisor: Professor Bernardo Cockburn. 1 computer file (PDF); viii, 122 pages.

Related to

Replaces

License

Collections

Series/Report Number

Funding information

Isbn identifier

Doi identifier

Previously Published Citation

Suggested citation

Zhang, Wujun. (2012). Convergence of adaptive hybridizable discontinuous Galerkin methods for second-order elliptic equations.. Retrieved from the University Digital Conservancy, https://hdl.handle.net/11299/139870.

Content distributed via the University Digital Conservancy may be subject to additional license and use restrictions applied by the depositor. By using these files, users agree to the Terms of Use. Materials in the UDC may contain content that is disturbing and/or harmful. For more information, please see our statement on harmful content in digital repositories.