Accession Number : ADA018138

Title :   A Recursive Analysis of Dissection Strategies.

Descriptive Note : Technical rept. Jun 74-Oct 75,

Corporate Author : HARVARD UNIV CAMBRIDGE MASS AIKEN COMPUTATION LAB

Personal Author(s) : Rose,Donald J. ; Whitten,Gregory F.

Report Date : NOV 1975

Pagination or Media Count : 30

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)

Descriptors :   *Recursive functions, *Algorithms, *Algebraic functions, Numerical analysis, Computer programs, Fortran, Dissection, Computer graphics, Applied mathematics

Subject Categories : Theoretical Mathematics

Distribution Statement : APPROVED FOR PUBLIC RELEASE