A Generic Mesh Data Structure with Parallel Applications

Autor/in	Cochran, William Kenneth, Jr.
Titel	A Generic Mesh Data Structure with Parallel Applications
Quelle	(2009), (190 Seiten) PDF als Volltext Verfügbarkeit Ph.D. Dissertation, University of Illinois at Urbana-Champaign
Sprache	englisch
Dokumenttyp	gedruckt; online; Monographie
ISBN	978-1-1095-7154-7
Schlagwörter	Hochschulschrift; Dissertation; Data; Computer Simulation; Matrices; Algebra + Suchen Sie Ihr Suchwort? Thesis; Dissertations; Academic thesis; Daten; Computergrafik; Computersimulation; Matrizenrechnung
Abstract	High performance, massively-parallel multi-physics simulations are built on efficient mesh data structures. Most data structures are designed from the bottom up, focusing on the implementation of linear algebra routines. In this thesis, we explore a top-down approach to design, evaluating the various needs of many aspects of simulation, not just the implementation of a matrix-vector product. With this as motivation, we have developed a generic data structure that both provides efficient linear algebra subroutines by optimizing the computation at a fine-grained level and allows for rapid, reusable implementations of complex geometric algorithms. We demonstrate both through various experiments including directly measuring the efficiency of matrix-vector multiplication; implementation and analysis of a multi-frontal indefinite direct solver; approximation of the medial axis; and the development of a hybrid, two-phase mesh partitioner. The efficiency of matrix-vector multiplication is compared against a theoretical value derived from a simple model of computing hardware. The direct solver uses our data structure to remove a search step normally required for pivoting in indefinite solvers. We demonstrate pairwise pivoting may have advantages over partial pivoting for ill-conditioned sparse matrices arising from meshes. We also present a novel, parallel algorithm that consistently approximates the medial axis of a domain of arbitrary dimension. By leveraging our data structure, a single implementation can be used for any type of mesh (e.g., 2-D, 3-D, space-time, and mixed element). Finally, we develop a hybrid approach to mesh partitioning in parallel. Using the medial axis of the mesh, large features are separated and partitioned independently using a geometric partitioner. In this way, complex domains are broken down into pieces that are better suited for geometric partitioning. [The dissertation citations contained here are published with the permission of ProQuest LLC. Further reproduction is prohibited without permission. Copies of dissertations may be obtained by Telephone (800) 1-800-521-0600. Web page: http://www.proquest.com/en-US/products/dissertations/individuals.shtml.] (As Provided).
Anmerkungen	ProQuest LLC. 789 East Eisenhower Parkway, P.O. Box 1346, Ann Arbor, MI 48106. Tel: 800-521-0600; Web site: http://www.proquest.com/en-US/products/dissertations/individuals.shtml
Erfasst von	ERIC (Education Resources Information Center), Washington, DC
Update	2017/4/10