A Recursive Analysis of Dissection Strategies.

Abstract

A formalism for analyzing 'structurally recursive' (or 'divide and conquer') algorithms is developed, and give some examples of such algorithms in numerical algebra. In particular we analyze in detail nested dissection strategies for ordering sparse matrices arising from nxm grids in the plane. We then turn to issues of implementation and describe a software package for completely solving such sparse systems efficiently, paying particular attention to minimizing the list processing overhead. (Author)

Document Details

Document Type
Technical Report
Publication Date
Nov 01, 1975
Accession Number
ADA018138

Entities

People

  • Donald J. Rose
  • Gregory F. Whitten

Organizations

  • Harvard University

Tags

Communities of Interest

  • Air Platforms

DTIC Thesaurus Topics

  • Algebra
  • Algorithms
  • Linear Algebra
  • Mathematics
  • Sparse Matrix

Readers

  • Applied Combinatorial Optimization and Logic Circuit Design.
  • Parallel and Distributed Computing.
  • Theoretical Analysis.