Show simple item record

dc.contributor.authorZmijewski, Earlen_US
dc.contributor.authorGilbert, John R.en_US
dc.date.accessioned2007-04-23T17:09:01Z
dc.date.available2007-04-23T17:09:01Z
dc.date.issued1985-04en_US
dc.identifier.citationhttp://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR85-673en_US
dc.identifier.urihttps://hdl.handle.net/1813/6513
dc.description.abstractIn solving the system of linear equations $Ax = b$ where $A$ is an $n \times n$ large sparse symmetric positive definite matrix, one important objective is to minimize fill. One approach is to partition the matrix so that its corresponding quotient graph is a tree and then use block factorization techniques to solve the system. We examine several methods for generating valid quotient tree partitionings of grid graphs and find that those producing short wide quotient trees are superior for large enough graphs. We then give an algorithm for generating wide quotient tree partitionings of a more general class of graphs. Bounds on its storage and computational requirements are provided and compared to those of a generalized nested dissection algorithm.en_US
dc.format.extent1532305 bytes
dc.format.extent453107 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypeapplication/postscript
dc.language.isoen_USen_US
dc.publisherCornell Universityen_US
dc.subjectcomputer scienceen_US
dc.subjecttechnical reporten_US
dc.titleWide Quotient Trees for Finite Element Problemsen_US
dc.typetechnical reporten_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record

Statistics