A Comparison of Several Bandwidth and Profile Reduction Algorithms.

Abstract

This paper compares and analyzes six algorithms which have been suggested recently for use in reducing, by permutations, the bandwidth and profile of sparse matrices. This problem arises in many different areas of scientific computation such as in the finite element method for approximating solutions of partial differential equations and in analyzing large-scale power transmission systems.

Document Details

Document Type
Technical Report
Publication Date
Mar 01, 1975
Accession Number
ADA006661

Entities

People

  • Norman E. Gibbs
  • Paul K. Stockmeyer
  • William G. Poole Jr.

Organizations

  • College of William & Mary

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Bandwidth
  • Computations
  • Differential Equations
  • Equations
  • Finite Element Analysis
  • Mathematical Analysis
  • Mathematics
  • Partial Differential Equations
  • Permutations
  • Sparse Matrix

Readers

  • Finite Element Method (FEM) for solving Partial Differential Equations (PDEs)
  • Parallel and Distributed Computing.
  • Spectroscopy.