Minimizing the Profile of a Symmetric Matrix

@article{Hager2002MinimizingTP,
  title={Minimizing the Profile of a Symmetric Matrix},
  author={William W. Hager},
  journal={SIAM J. Scientific Computing},
  year={2002},
  volume={23},
  pages={1799-1816}
}
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. 
9 Citations
27 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 27 references

Two improved algorithms for reducing the envelope and wavefront

  • G. Kumfert, A. Pothen
  • BIT, 37
  • 1997
Highly Influential
5 Excerpts

The use of profile reduction algorithms with a frontal code

  • I. S. Duff, J. K. Reid, J. A. Scott
  • Internat. J. Numer. Methods Engrg., 28
  • 1989
Highly Influential
4 Excerpts

Ordering symmetric sparse matrices for small profile and wavefront , Internat

  • J. K. Reid, J. A. Scott
  • J . Numer . Methods Engrg .
  • 1999

Similar Papers

Loading similar papers…