Analysis of Dissection Algorithms for Vector Computers.
Abstract
Recently two dissection algorithms (one-way and incomplete nested dissection) have been developed for sloving the sparse positive definite linear systems arising from n by n grid problems. Concurrently, vector computers (such as the CDC STAR-100 and TI ASC) have been developed for large scientific applications. An analysis of the use of dissection algorithms on vector computers dictates that vectors of maximum length be utilized thereby implying little or no dissection; on the other hand, minimizing multiplication counts suggests that considerable dissection be performed. In this paper we discuss the resolution of this conflict by minimizing the total time required by vectorized versions of the two algorithms. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Aug 01, 1976
- Accession Number
- ADA029679
Entities
People
- A. George
- R. G. Voigt
- W. G. Poole Jr.
Organizations
- College of William & Mary