dc.contributor.author Zmijewski, Earl en_US dc.contributor.author Gilbert, John R. en_US dc.date.accessioned 2007-04-23T17:09:01Z dc.date.available 2007-04-23T17:09:01Z dc.date.issued 1985-04 en_US dc.identifier.citation http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR85-673 en_US dc.identifier.uri https://hdl.handle.net/1813/6513 dc.description.abstract In 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.extent 1532305 bytes dc.format.extent 453107 bytes dc.format.mimetype application/pdf dc.format.mimetype application/postscript dc.language.iso en_US en_US dc.publisher Cornell University en_US dc.subject computer science en_US dc.subject technical report en_US dc.title Wide Quotient Trees for Finite Element Problems en_US dc.type technical report en_US
﻿