Files in this item

FilesDescriptionFormat

application/pdf

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

Description

Title:A Framework for Grid Solvers
Author(s):Vidwans, Akhil Jayant
Doctoral Committee Chair(s):Heath, Michael T.
Department / Program:Computer Science
Discipline:Computer Science
Degree Granting Institution:University of Illinois at Urbana-Champaign
Degree:Ph.D.
Genre:Dissertation
Subject(s):Mathematics
Abstract:The design and implementation of an object-oriented framework for grid solvers is presented. Unlike conventional sparse solvers, a grid solver solves the sparse linear system embedded in a computational grid without creating the sparse matrix explicitly at any stage of the solution process. This allows it to take advantage of additional information about the problem that is available within the grid data structure. Such an approach leads to an optimal parallel algorithm for matrix reordering by cartesian nested dissection. It also facilitates the efficient computation of the elimination tree and factorization of the sparse system by the multi-frontal method in a high-performance computing environment. In addition, it enables the construction of a structural preconditioner that is highly effective in accelerating the rates of convergence of iterative methods. The problem of non-universality of grid data structures is addressed by designing and implementing the grid solver as an object-oriented framework that can be used by a wide variety of applications through instantiation and customization. Such a framework can encompass diverse grid representations in different spatial dimensions without any loss of functionality.
Issue Date:1999
Type:Text
Language:English
Description:119 p.
Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1999.
URI:http://hdl.handle.net/2142/81967
Other Identifier(s):(MiAaPQ)AAI9953169
Date Available in IDEALS:2015-09-25
Date Deposited:1999


This item appears in the following Collection(s)

Item Statistics