Automatic Nested Dissection,

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)

Document Details

Document Type
Technical Report
Publication Date
May 01, 1974
Accession Number
AD0779863

Entities

People

  • Donald J. Rose
  • Gregory F. Whitten

Organizations

  • Harvard University

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Automatic
  • Boundaries
  • Boundary Value Problems
  • Differential Equations
  • Equations
  • Mathematics
  • Procedures (Computers)

Fields of Study

  • Mathematics

Readers

  • Approximation Theory.
  • Calculus or Mathematical Analysis
  • Psychological Intervention/Treatment for Stress, Anxiety, PTSD, and Related Emotional and Cognitive Health Symptoms.