Minimizing the Profile of a Symmetric Matrix

  • Authors:

  • William W. Hager

  • Affiliations:

  • -

  • Venue:
  • SIAM Journal on Scientific Computing
  • Year:
  • 2001

Quantified Score

Hi-index 0.01

Visualization

Abstract

New approaches are developed for minimizing the profile of a sparse, symmetric matrix. The heuristic approaches seek to minimize the profile growth, either absolutely or in a weighted sense. The exchange methods make a series of permutations in an initial ordering to strictly improve the profile. Comparisons with the spectral algorithm, a level structure method, and a wave front method are presented.