<?xml version="1.0" encoding="UTF-8"?>
<?xml-stylesheet type="text/xsl" href="/oai-pmh.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-19T22:49:33Z</responseDate>
  <request identifier="oai:www.ideals.illinois.edu:2142/80985" metadataPrefix="etdms" verb="GetRecord">https://www.ideals.illinois.edu/oai-pmh</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:www.ideals.illinois.edu:2142/80985</identifier>
        <datestamp>2023-07-11</datestamp>
        <setSpec>col_2142_5131</setSpec>
        <setSpec>col_2142_8888</setSpec>
        <setSpec>com_2142_5130</setSpec>
        <setSpec>com_2142_8887</setSpec>
        <setSpec>com_2142_234</setSpec>
      </header>
      <metadata>
        <thesis xmlns="http://www.ndltd.org/standards/metadata/etdms/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:dc="http://purl.org/dc/elements/1.1/" xsi:schemaLocation="http://www.ndltd.org/standards/metadata/etdms/1.1/ http://www.ndltd.org/standards/metadata/etdms/1.1/etdms11.xsd http://purl.org/dc/elements/1.1/ http://www.ndltd.org/standards/metadata/etdms/1.1/etdmsdc.xsd">
          <dc:description>Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs</dc:description>
          <dc:description>U of I Only</dc:description>
          <dc:contributor>Chew, Weng Cho</dc:contributor>
          <dc:creator>Saville, Michael Andrew</dc:creator>
          <dc:date>2015-09-25T20:09:06Z</dc:date>
          <dc:date>2015-09-25T20:09:06Z</dc:date>
          <dc:date>10000-01-01</dc:date>
          <dc:date>2006</dc:date>
          <dc:date>2006</dc:date>
          <dc:description>In addition, comparison of the memory usage and simulation time is presented for FIPWA and MF-FIPWA for moderate to large scale problems. Various alternate approaches to implementing MF-FIPWA are discussed in terms of how the fast algorithms set up translation matrices and where gains can be made. Finally, details of the advantages of using nonuniform sampling are provided. Results show 30% savings in memory usage and up to 20% savings in computing the matrix-vector product.</dc:description>
          <dc:description>Made available in DSpace on 2015-09-25T20:09:06Z (GMT). No. of bitstreams: 2
license.txt: 4848 bytes, checksum: 96035ab3f5e1c23cc7138a224ce498bd (MD5)
3242985.pdf: 3636188 bytes, checksum: 7d126d20277362c25895fe23781015cb (MD5)
  Previous issue date: 2006</dc:description>
          <dc:description>Embargo set by: Seth Robbins for item 82267
Lift date: Forever
Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs</dc:description>
          <dc:description>147 p.</dc:description>
          <dc:description>Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2006.</dc:description>
          <dc:identifier>http://hdl.handle.net/2142/80985</dc:identifier>
          <dc:identifier>(MiAaPQ)AAI3242985</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:subject>Physics, Electricity and Magnetism</dc:subject>
          <dc:title>Multilevel Multipole -Free Fast Algorithm for Electromagnetic Scattering Problems in Layered Media</dc:title>
          <dc:type>text</dc:type>
          <degree>
            <department>Electrical and Computer Engineering</department>
            <discipline>Electrical and Computer Engineering</discipline>
            <grantor>University of Illinois at Urbana-Champaign</grantor>
            <level>Dissertation</level>
            <name>Ph.D.</name>
          </degree>
        </thesis>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
