band width minimization

Article View: sci.math.research

Article #103

#103

From: Doug Scott
Date: Sun, 27 Sep 1992 21:00

15 lines
1122 bytes

I am presently developing a bandwidth/profile minimization
algorithm that will hopefully be superior to the Gibbs-Poole-
Stockmeyer algorithm, faster than B.Armstrongs or Burgess-Lai.

I would like to talk to anyone else doing research in this field.

Also, If you have some good test problems <1000 nodes or elements
I would be interested in using them also.

Doug G. Scott
Dept. Mechanical Engr.
U. of Manitoba
Winnipeg Manitoba

dscott@ccu.umanitoba.ca

Technical Details

Message-ID: <1992Sep27.210040.4153@ccu.umanitoba.ca>

Path: arc1-ca.pugleaf.net!sparky!uunet!sun-barr!cs.utexas.edu!sdd.hp.com!ux1.cso.uiuc.edu!news.cso.uiuc.edu!usenet

Show Full Headers

Complete Article Headers

Newsgroups: sci.math.research
Path: arc1-ca.pugleaf.net!sparky!uunet!sun-barr!cs.utexas.edu!sdd.hp.com!ux1.cso.uiuc.edu!news.cso.uiuc.edu!usenet
From: dscott@ccu.umanitoba.ca (Doug Scott)
Subject: band width minimization
Nntp-Posting-Host: ccu.umanitoba.ca
Message-ID: <1992Sep27.210040.4153@ccu.umanitoba.ca>
Summary: band width minimitation?
Sender: Daniel Grayson <dan@math.uiuc.edu>
X-Submissions-To: sci-math-research@uiuc.edu
Organization: University of Manitoba, Winnipeg, Canada
X-Administrivia-To: sci-math-research-request@uiuc.edu
Approved: Daniel Grayson <dan@math.uiuc.edu>
Date: Sun, 27 Sep 1992 21:00:40 GMT
Keywords: band width
Lines: 18