2026-09-19T04:27:59Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/356242021-07-05T14:03:20Zcom_1721.1_7582com_1721.1_7581col_1721.1_131022
Jamie Peraire.
Wong, Joseph S. H. (Joseph Sze Hsuan)
Massachusetts Institute of Technology. Dept. of Mechanical Engineering.
Massachusetts Institute of Technology. Department of Mechanical Engineering
2008-02-12T16:50:11Z
2008-02-12T16:50:11Z
2006
2006
http://hdl.handle.net/1721.1/35624
76272525
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mechanical Engineering, 2006.
Includes bibliographical references (p. 127-132).
In this thesis, we extend current capabilities in producing error bounds on the exact linear functionals of linear partial differential equations in a number of ways. Unlike previous approaches, we base our method on the Discontinuous Galerkin finite element method. For equations such as the convection-diffusion equation, the convection term is handled by the standard DG method for hyperbolic problems while the diffusion operator is discretized by the LDG scheme. This choice allows for the effective bounding of outputs associated with high Peclect number problems without resolving all of the details of the solution. In addition to the ability to manage convection dominated problems, we expand the scope of our error bounding algorithm beyond present capabilities to include saddle problems such as the incompressible Stokes equations. Apart from the aforementioned advantages, the DG discretization employed here also produces associated numerical fluxes, which make the complicated "equilibration" procedure that is often necessary in implicit a-posteriori algorithms, unnecessary.
by Joseph S.H. Wong.
Ph.D.
132 p.
eng
Massachusetts Institute of Technology
M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission.
http://dspace.mit.edu/handle/1721.1/7582
Mechanical Engineering.
A-Posteriori bounds on linear functionals of coercive 2nd order PDEs using discontinuous Galerkin methods
Thesis
application/pdf
false
Publication
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="33c459e6-f54f-4740-b11a-03b30ea5818a">
<Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type>
<Language>eng</Language>
<Title>A-Posteriori bounds on linear functionals of coercive 2nd order PDEs using discontinuous Galerkin methods</Title>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>2006</PublicationDate>
<Authors>
<Author>
<DisplayName>Wong, Joseph S. H. (Joseph Sze Hsuan)</DisplayName>
<Affiliation>
<OrgUnit>
</OrgUnit>
</Affiliation>
</Author>
</Authors>
<Editors>
</Editors>
<Publishers>
<Publisher>
<DisplayName>Massachusetts Institute of Technology</DisplayName>
<OrgUnit />
</Publisher>
</Publishers>
<License>http://dspace.mit.edu/handle/1721.1/7582</License>
<Keyword>Mechanical Engineering.</Keyword>
<Abstract>In this thesis, we extend current capabilities in producing error bounds on the exact linear functionals of linear partial differential equations in a number of ways. Unlike previous approaches, we base our method on the Discontinuous Galerkin finite element method. For equations such as the convection-diffusion equation, the convection term is handled by the standard DG method for hyperbolic problems while the diffusion operator is discretized by the LDG scheme. This choice allows for the effective bounding of outputs associated with high Peclect number problems without resolving all of the details of the solution. In addition to the ability to manage convection dominated problems, we expand the scope of our error bounding algorithm beyond present capabilities to include saddle problems such as the incompressible Stokes equations. Apart from the aforementioned advantages, the DG discretization employed here also produces associated numerical fluxes, which make the complicated "equilibration" procedure that is often necessary in implicit a-posteriori algorithms, unnecessary.</Abstract>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>