<?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-18T21:11:21Z</responseDate><request verb="GetRecord" identifier="oai:dspace.mit.edu:1721.1/42456" metadataPrefix="dim">https://dspace.mit.edu/server/oai/request</request><GetRecord><record><header><identifier>oai:dspace.mit.edu:1721.1/42456</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">Jacob K. White.</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="author" lang="en_US">Leibman, Stephen Gerald</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">2008-09-03T15:43:22Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2008-09-03T15:43:22Z</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/42456</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="oclc" lang="en_US">240772597</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 (p. 117-119).</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en_US">Boundary Element Methods (BEM) can be ideal approaches for simulating the behavior of physical systems in which the volumes have homogeneous properties. These, especially the so-called "fast" or "accelerated" BEM approaches often have significant computational advantages over other well-known methods which solve partial differential equations on a volume domain. However, the implementation of techniques used to accelerate BEM approaches often comes at a loss of some generality, reducing their applicability to many problems and preventing engineers and researchers from easily building on a common, popular base of code. In this thesis we create a BEM solver which uses the Pre-Corrected FFT technique for accelerating computation, and uses a novel approach which allows users to provide arbitrary basis functions. We demonstrate its utility for both electrostatic and full-wave electromagnetic problems in volumes with homogeneous isotropic permittivity, bounded by arbitrarily complex surface geometries. The code is shown to have performance characteristics similar to the best known approaches for these problems. It also provides an increased level of generality, and is designed in such a way that should allow it to easily be extended by other researchers.</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="statementofresponsibility" lang="en_US">by Stephen Gerald Leibman.</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">119 p.</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 generalized precorrected-FFT method for electromagnetic analysis</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="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="39ba9df6-4da6-46c5-913a-bb873274c8ca">
	&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 generalized precorrected-FFT method for electromagnetic analysis&lt;/Title>
   	&lt;PublishedIn>
    	&lt;Publication>
      	&lt;/Publication>
   	&lt;/PublishedIn>
   	&lt;PublicationDate>2008&lt;/PublicationDate>
   	&lt;Authors>
      	&lt;Author>
        	&lt;DisplayName>Leibman, Stephen Gerald&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>Boundary Element Methods (BEM) can be ideal approaches for simulating the behavior of physical systems in which the volumes have homogeneous properties. These, especially the so-called &amp;quot;fast&amp;quot; or &amp;quot;accelerated&amp;quot; BEM approaches often have significant computational advantages over other well-known methods which solve partial differential equations on a volume domain. However, the implementation of techniques used to accelerate BEM approaches often comes at a loss of some generality, reducing their applicability to many problems and preventing engineers and researchers from easily building on a common, popular base of code. In this thesis we create a BEM solver which uses the Pre-Corrected FFT technique for accelerating computation, and uses a novel approach which allows users to provide arbitrary basis functions. We demonstrate its utility for both electrostatic and full-wave electromagnetic problems in volumes with homogeneous isotropic permittivity, bounded by arbitrarily complex surface geometries. The code is shown to have performance characteristics similar to the best known approaches for these problems. It also provides an increased level of generality, and is designed in such a way that should allow it to easily be extended by other researchers.&lt;/Abstract>
	&lt;Access xmlns="http://purl.org/coar/access_right" 
    >
    &lt;/Access>
&lt;/Publication>
</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>