<?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-19T21:12:24Z</responseDate>
  <request identifier="oai:www.ideals.illinois.edu:2142/17044" metadataPrefix="etdms" verb="GetRecord">https://www.ideals.illinois.edu/oai-pmh</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:www.ideals.illinois.edu:2142/17044</identifier>
        <datestamp>2023-07-10</datestamp>
        <setSpec>col_2142_5131</setSpec>
        <setSpec>col_2142_10761</setSpec>
        <setSpec>com_2142_5130</setSpec>
        <setSpec>com_2142_10755</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:contributor>Olson, Luke N.</dc:contributor>
          <dc:contributor>Olson, Luke N.</dc:contributor>
          <dc:contributor>Gropp, William D.</dc:contributor>
          <dc:contributor>Heath, Michael T.</dc:contributor>
          <dc:contributor>Tuminaro, Raymond S.</dc:contributor>
          <dc:creator>Schroder, Jacob B.</dc:creator>
          <dc:date>2010-08-31T20:30:25Z</dc:date>
          <dc:date>2010-08-31T20:30:25Z</dc:date>
          <dc:date>2012-09-07T16:43:38Z</dc:date>
          <dc:date>2010-08-31T20:30:25Z</dc:date>
          <dc:date>2010-08</dc:date>
          <dc:description>Smoothed aggregation-based (SA) algebraic multigrid (AMG) is a popular and
effective solver for systems of linear equations that arise from discretized
partial differential equations.  While SA has been effective over a broad class
of problems, it has several limitations and weaknesses that this thesis is
intended to address. This includes the development of a more robust
strength-of-connection measure which guides coarsening and the
choice of interpolation sparsity patterns. Unfortunately, the classic strength
measure is only well-founded for M-matrices, leading us to develop a new
measure based on local knowledge of both algebraically smooth error and the
behavior of interpolation.  Another limitation is that classic SA is only formally
defined for Hermitian positive definite problems.  For non-Hermitian
operators, the operator-induced energy-norm does not exist, which impacts the
complementary relationship between relaxation and interpolation.  This requires
a redesign of SA, such that restriction and prolongation operators approximate
the left and right near null-spaces, respectively.  As a result, we develop general SA
setup algorithms for both the Hermitian positive-definite and the non-Hermitian
cases.  To realize these algorithms, we develop general prolongation smoothing
methods so that restriction and prolongation target the left and right near null-spaces,
respectively.  Overall, the proposed methods do not assume any user-input
beyond what standard SA does and the result is a new direction for multigrid
methods for non-Hermitian systems.  Several problem areas motivate our
development.  For example, rotated anisotropic diffusion and linearized
elasticity problems using standard discretizations can easily generate
non-M-matrices that prove difficult for standard SA and AMG.  High- and
low-order discontinuous Galerkin discretizations also generate difficult non-M-matrices for elliptic
problems.  Target non-Hermitian problems include flow problems and
wave-like problems, e.g., Helmholtz.  Additionally for wave-like
problems, there is a rich non-standard wave-like near null-space, which must be captured
by the coarse levels—a task beyond the scope of traditional AMG
or SA coarsening techniques.</dc:description>
          <dc:description>Item withdrawn by Mark Zulauf (zulauf@illinois.edu) on 2010-05-28T20:49:46Z
Item was in collections:
University of Illinois Theses &amp; Dissertations (ID: 1)
No. of bitstreams: 1
Schroder_Jacob.pdf: 4166896 bytes, checksum: 690ee904ff70049ee8fe5e76dc835a6b (MD5)</dc:description>
          <dc:description>Made available in DSpace on 2010-08-31T20:30:25Z (GMT). No. of bitstreams: 2
Schroder_Jacob.pdf: 4166896 bytes, checksum: 690ee904ff70049ee8fe5e76dc835a6b (MD5)
license.txt: 4064 bytes, checksum: 342a962b1cda329aedb2f0a2dfcd4478 (MD5)</dc:description>
          <dc:description>Item marked as restricted to the 'Administrator' Group (id=1) by William Ingram (wingram2@illinois.edu) on 2010-08-31T20:32:53Z
Item is restricted until 2012-08-31T20:32:49Z</dc:description>
          <dc:description>Item reinstated by Sarah Shreeves (sshreeve@illinois.edu) on 2012-09-07T16:43:38Z
Item was in collections:
University of Illinois Dissertations and Theses (ID: 204)
Dissertations and Theses - Computer Science (ID: 587)
No. of bitstreams: 3
Schroder_Jacob.pdf: 4166896 bytes, checksum: 690ee904ff70049ee8fe5e76dc835a6b (MD5)
license.txt: 4064 bytes, checksum: 342a962b1cda329aedb2f0a2dfcd4478 (MD5)
Schroder_Jacob.pdf.txt: 260845 bytes, checksum: 5154726544219a0269ce5bd1400777ab (MD5)</dc:description>
          <dc:description>Item released from any restrictions by Sarah Shreeves (sshreeve@illinois.edu) on 2012-09-07T16:43:38Z</dc:description>
          <dc:identifier>http://hdl.handle.net/2142/17044</dc:identifier>
          <dc:language>en</dc:language>
          <dc:rights>Copyright 2010 Jacob B. Schroder</dc:rights>
          <dc:subject>smoothed aggregation</dc:subject>
          <dc:subject>algebraic multigrid</dc:subject>
          <dc:subject>Helmholtz</dc:subject>
          <dc:subject>indefinite</dc:subject>
          <dc:subject>nonsymmetric</dc:subject>
          <dc:subject>algebraic coarsening</dc:subject>
          <dc:subject>discontinuous Galerkin</dc:subject>
          <dc:subject>high-order</dc:subject>
          <dc:subject>prolongation smoothing</dc:subject>
          <dc:subject>strength-of-connection</dc:subject>
          <dc:title>Generalizing smoothed aggregation-based algebraic multigrid</dc:title>
          <degree>
            <department>Computer Science</department>
            <departmentCode>1434</departmentCode>
            <discipline>Computer Science</discipline>
            <disciplineCode>0112</disciplineCode>
            <grantor>University of Illinois at Urbana-Champaign</grantor>
            <level>Dissertation</level>
            <name>Ph.D.</name>
            <program>PHD:Computer Science -UIUC</program>
            <programCode>10KS0112PHD</programCode>
          </degree>
        </thesis>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
