Files in this item



application/pdf3269829.pdf (4MB)Restricted to U of Illinois
(no description provided)PDF


Title:Efficient Setup Algorithms for Parallel Algebraic Multigrid
Author(s):Alber, David Michael
Doctoral Committee Chair(s):Olson, Luke N.
Department / Program:Computer Science
Discipline:Computer Science
Degree Granting Institution:University of Illinois at Urbana-Champaign
Subject(s):Computer Science
Abstract:The experimental results motivate the design of new coarsening algorithms to improve the performance of coarse-grid selection itself. A new algorithm labeled Bucket Sorted Independent Sets (BSIS) is developed and contributes two major advances. First, the cost of selecting independent sets while coarsening is substantially less expensive, with experiments demonstrating 23% savings over CLJP-c. Second, theory is developed proving that all generalized forms of the coarsening algorithms studied in this thesis using the same selection and update parameters choose identical coarse grids, given the same initial weights. The theory is powerful because it provides insight and enables the development of more efficient algorithms without affecting convergence properties.
Issue Date:2007
Description:160 p.
Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2007.
Other Identifier(s):(MiAaPQ)AAI3269829
Date Available in IDEALS:2015-09-25
Date Deposited:2007

This item appears in the following Collection(s)

Item Statistics