<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-09-19T10:38:28Z</responseDate><request verb="GetRecord" identifier="oai:dspace.mit.edu:1721.1/45278" metadataPrefix="dim">https://dspace.mit.edu/server/oai/request</request><GetRecord><record><header><identifier>oai:dspace.mit.edu:1721.1/45278</identifier><datestamp>2022-01-13T07:54:53Z</datestamp><setSpec>com_1721.1_7582</setSpec><setSpec>com_1721.1_7581</setSpec><setSpec>col_1721.1_131023</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:doc="http://www.lyncode.com/xoai" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="advisor" lang="en_US">Jamie Peraire.</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="author" lang="en_US">Huynh, Thanh Le Ngoc</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="other" lang="en_US">Massachusetts Institute of Technology. Computation for Design and Optimization Program.</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="department">Massachusetts Institute of Technology. Computation for Design and Optimization Program</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2009-04-29T17:19:36Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2009-04-29T17:19:36Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="copyright" lang="en_US">2008</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued" lang="en_US">2008</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/1721.1/45278</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="oclc" lang="en_US">310976551</dim:field>
   <dim:field mdschema="dc" element="description" lang="en_US">Thesis (S.M.)--Massachusetts Institute of Technology, Computation for Design and Optimization Program, 2008.</dim:field>
   <dim:field mdschema="dc" element="description" lang="en_US">Includes bibliographical references (leaves 55-56).</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en_US">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.</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="statementofresponsibility" lang="en_US">by Thanh Le Ngoc Huynh.</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="degree" lang="en_US">S.M.</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="extent" lang="en_US">56 leaves</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso" lang="en_US">eng</dim:field>
   <dim:field mdschema="dc" element="publisher" lang="en_US">Massachusetts Institute of Technology</dim:field>
   <dim:field mdschema="dc" element="rights" lang="en_US">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.</dim:field>
   <dim:field mdschema="dc" element="rights" qualifier="uri" lang="en_US">http://dspace.mit.edu/handle/1721.1/7582</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">Computation for Design and Optimization Program.</dim:field>
   <dim:field mdschema="dc" element="title" lang="en_US">A fast enriched FEM for Poisson equations involving interfaces</dim:field>
   <dim:field mdschema="dc" element="title" qualifier="alternative" lang="en_US">Fast enriched finite element method for Poisson equations involving interfaces</dim:field>
   <dim:field mdschema="dc" element="type" lang="en_US">Thesis</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="mimetype">application/pdf</dim:field>
   <dim:field mdschema="dspace" element="authorsordered">false</dim:field>
   <dim:field mdschema="dspace" element="entity" qualifier="type">Publication</dim:field>
   <dim:field mdschema="others" element="access-status">unknown</dim:field>
   <dim:field mdschema="others" element="access-status">unknown</dim:field>
   <dim:field mdschema="cerif" element="openaire" authority="" confidence="-1">&lt;Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="4ba9fd35-f555-464b-8368-5494b656019e">
	&lt;Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843&lt;/Type>
	&lt;Language>eng&lt;/Language>
   	&lt;Title>A fast enriched FEM for Poisson equations involving interfaces&lt;/Title>
   	&lt;Subtitle>Fast enriched finite element method for Poisson equations involving interfaces&lt;/Subtitle>
   	&lt;PublishedIn>
    	&lt;Publication>
      	&lt;/Publication>
   	&lt;/PublishedIn>
   	&lt;PublicationDate>2008&lt;/PublicationDate>
   	&lt;Authors>
      	&lt;Author>
        	&lt;DisplayName>Huynh, Thanh Le Ngoc&lt;/DisplayName>
         	&lt;Affiliation>
         		&lt;OrgUnit>
         		&lt;/OrgUnit>
         	&lt;/Affiliation>
      	&lt;/Author>
	&lt;/Authors>
   	&lt;Editors>
	&lt;/Editors>
    &lt;Publishers>
        &lt;Publisher>
            &lt;DisplayName>Massachusetts Institute of Technology&lt;/DisplayName>
            &lt;OrgUnit />
        &lt;/Publisher>
    &lt;/Publishers>
    &lt;License>http://dspace.mit.edu/handle/1721.1/7582&lt;/License>
    &lt;Keyword>Computation for Design and Optimization Program.&lt;/Keyword>
   	&lt;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.&lt;/Abstract>
	&lt;Access xmlns="http://purl.org/coar/access_right" 
    >
    &lt;/Access>
&lt;/Publication>
</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>