<?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-11-22T15:54:51Z</responseDate><request verb="GetRecord" identifier="oai:uwspace.uwaterloo.ca:10012/2925" metadataPrefix="dim">https://dspacemainprd01.lib.uwaterloo.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:uwspace.uwaterloo.ca:10012/2925</identifier><datestamp>2017-03-21T19:53:37Z</datestamp><setSpec>com_10012_9924</setSpec><setSpec>com_10012_1</setSpec><setSpec>col_10012_9926</setSpec><setSpec>col_10012_6</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:doc="http://www.lyncode.com/xoai" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="author" lang="en" authority="eadd47a1-93d8-4b67-bede-a907af83943e" confidence="600">Butler, Jeffrey</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2007-05-08T14:01:01Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2007-05-08T14:01:01Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued" lang="en">2006</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="submitted" lang="en">2006</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/10012/2925</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en">Algebraic multigrid (AMG) is one of the most efficient algorithms for solving large  sparse linear systems on unstructured grids.   Classical coarsening schemes such as the  standard Ruge-St&amp;amp;uuml;ben method [14] can lead to adverse effects on computation time  and memory usage that affect scalability.   Memory and execution time complexity  growth is remedied for various large three-dimensional problems using the parallel modified independent set (PMIS) coarsening strategy developed by De Sterck,  Yang, and Heys [18].   However, this coarsening strategy often leads to erratic grids  without a regular structure that diminish convergence.    &amp;lt;br /&amp;gt;&amp;lt;br /&amp;gt;  This thesis looks at two modifications of the PMIS algorithm that aim to improve  scalability.   These include a greedy implementation of PMIS and restricting PMIS  coarsening to finer grid levels while Cleary-Jones-Luby-Plassman coarsening (based  on the standard Ruge-St&amp;amp;uuml;ben method) is performed on all other grids.   It is shown  that, for a variety of problems, the greedy PMIS algorithm does little to improve  convergence, while the second modification can improve convergence.   However, it is  also shown that the second modification can result in increased memory usage that  is unfavorable to scalability.    &amp;lt;br /&amp;gt;&amp;lt;br /&amp;gt;  The PMIS based algorithm can be improved by redefining interpolation.   As shown  by De Sterck and Yang [17], PMIS coarsening combined with &amp;lt;em&amp;gt;F-F&amp;lt;/em&amp;gt; interpolation dramatically improves convergence, but often has negative effects on computation time  per iteration and memory usage that affect scalability.   A third modification is proposed that aims to remedy this problem by altering &amp;lt;em&amp;gt;F-F&amp;lt;/em&amp;gt; interpolation.   The new  algorithm is called &amp;lt;em&amp;gt;F-F1&amp;lt;/em&amp;gt; interpolation, and is shown to reduce computation time per  iteration and memory usage compared to &amp;lt;em&amp;gt;F-F&amp;lt;/em&amp;gt; interpolation, while maintaining fast  convergence and good scalability, for a variety of problems.</dim:field>
   <dim:field mdschema="dc" element="format" lang="en">application/pdf</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="extent">4064328 bytes</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="mimetype">application/pdf</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso" lang="en">en</dim:field>
   <dim:field mdschema="dc" element="publisher" lang="en">University of Waterloo</dim:field>
   <dim:field mdschema="dc" element="rights" lang="en">Copyright: 2006, 
  Butler, Jeffrey. All rights reserved.</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Mathematics</dim:field>
   <dim:field mdschema="dc" element="title" lang="en">Improving Coarsening and Interpolation for Algebraic Multigrid</dim:field>
   <dim:field mdschema="dc" element="type" lang="en">Master Thesis</dim:field>
   <dim:field mdschema="dc" element="pending" lang="en">false</dim:field>
   <dim:field mdschema="uws-etd" element="degree" qualifier="department" lang="en">Applied Mathematics</dim:field>
   <dim:field mdschema="uws-etd" element="degree" lang="en">Master of Mathematics</dim:field>
   <dim:field mdschema="uws" element="typeOfResource" lang="en">Text</dim:field>
   <dim:field mdschema="uws" element="peerReviewStatus" lang="en">Unreviewed</dim:field>
   <dim:field mdschema="uws" element="scholarLevel" lang="en">Graduate</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>