A Recursive Analysis of Dissection Strategies.
Technical rept. Jun 74-Oct 75,
HARVARD UNIV CAMBRIDGE MASS AIKEN COMPUTATION LAB
Pagination or Media Count:
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
- Theoretical Mathematics