2026-09-20T06:56:54Z https://www.ideals.illinois.edu/oai-pmh

oai:www.ideals.illinois.edu:2142/81758 2023-07-11 col_2142_5131 col_2142_10761 com_2142_5130 com_2142_10755 com_2142_234

Olson, Luke N. Alber, David Michael 2015-09-25T20:20:19Z 2015-09-25T20:20:19Z 10000-01-01 2007 2007 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. Made available in DSpace on 2015-09-25T20:20:19Z (GMT). No. of bitstreams: 2 license.txt: 4848 bytes, checksum: 96035ab3f5e1c23cc7138a224ce498bd (MD5) 3269829.pdf: 3931294 bytes, checksum: 8b948e492160bbefe0a3586a2a4a93fe (MD5) Previous issue date: 2007 Embargo set by: Seth Robbins for item 83039 Lift date: Forever Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs U of I Only 160 p. Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2007. http://hdl.handle.net/2142/81758 (MiAaPQ)AAI3269829 eng Computer Science Efficient Setup Algorithms for Parallel Algebraic Multigrid text Computer Science Computer Science University of Illinois at Urbana-Champaign Dissertation Ph.D.