Accession Number:

AD0779863

Title:

Automatic Nested Dissection,

Descriptive Note:

Corporate Author:

HARVARD UNIV CAMBRIDGE MASS CENTER FOR RESEARCH IN COMPUTING TECHNOLOGY

Personal Author(s):

Report Date:

1974-05-01

Pagination or Media Count:

13.0

Abstract:

Nested dissection is an ordering technique used to order the sparse symmetric positive definite systems of linear equations arising from discretizations to elliptic boundary value problems yielding regular n X n grids. By taking a recursive view of nested dissection an ordering strategy is developed which is particularly simple and efficient when n 2 sup l. A FORTRAN 4 subroutine of the algorithm is included and some experiments are presented. Author

Subject Categories:

  • Theoretical Mathematics
  • Computer Programming and Software

Distribution Statement:

APPROVED FOR PUBLIC RELEASE