A Variant of Nested Dissection for Solving n by n Grid Problems.
Abstract
Nested dissection orderings are known to be very effective for solving the sparse positive definite linear systems which arise from n by n grid problems. In this paper nested dissection is shown to be the final step of incomplete nested dissection, an ordering which corresponds to the premature termination of dissection. Analyses of the arithmetic and storage requirements for incomplete nested dissection are given and the ordering is shown to be competitive with nested dissection under certain conditions.
Document Details
- Document Type
- Technical Report
- Publication Date
- Aug 01, 1976
- Accession Number
- ADA028709
Entities
People
- A. George
- R. G. Voigt
- W. G. Poole Jr.
Organizations
- College of William & Mary