MIT Libraries logoDSpace@MIT

MIT
View Item 
  • DSpace@MIT Home
  • MIT Libraries
  • MIT Theses
  • Graduate Theses
  • View Item
  • DSpace@MIT Home
  • MIT Libraries
  • MIT Theses
  • Graduate Theses
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

A fast enriched FEM for Poisson equations involving interfaces

Author(s)
Huynh, Thanh Le Ngoc
Thumbnail
DownloadFull printable version (3.998Mb)
Alternative title
Fast enriched finite element method for Poisson equations involving interfaces
Other Contributors
Massachusetts Institute of Technology. Computation for Design and Optimization Program.
Advisor
Jamie Peraire.
Terms of use
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
Metadata
Show full item record
Abstract
We develop a fast enriched finite element method for solving Poisson equations involving complex geometry interfaces by using regular Cartesian grids. The presence of interfaces is accounted for by developing suitable jump conditions. The immersed boundary method (IBM) and the immersed interface method (IIM) are successfully used to solve these problems when combined with a fast Fourier transform. However, the IBM and the IIM, which are developed from the finite difference method, have several disadvantages including the characterization of the null spaces and the inability to treat complex geometries accurately. We propose a solution to these difficulties by employing the finite element method. The continuous Galerkin solution approximations at the interface elements are modified using the enriched basis functions to make sure that the optimal convergence rates are obtained. Here, the FFT is applied in the fast Poisson solver to significantly accelerate the computational processes for solving the global matrix system. With reasonably small interfaces, the operational cost is almost linearly proportional to the number of the Cartesian grid points. The method is further extended to solve problems involving multi-materials while preserving the optimal accuracy. Several benchmark examples are shown to demonstrate the performance of the method.
Description
Thesis (S.M.)--Massachusetts Institute of Technology, Computation for Design and Optimization Program, 2008.
 
Includes bibliographical references (leaves 55-56).
 
Date issued
2008
URI
http://hdl.handle.net/1721.1/45278
Department
Massachusetts Institute of Technology. Computation for Design and Optimization Program
Publisher
Massachusetts Institute of Technology
Keywords
Computation for Design and Optimization Program.

Collections
  • Graduate Theses

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

Login

Statistics

OA StatisticsStatistics by CountryStatistics by Department
MIT Libraries
PrivacyPermissionsAccessibilityContact us
MIT
Content created by the MIT Libraries, CC BY-NC unless otherwise noted. Notify us about copyright concerns.