band width minimization

Thread View: sci.math.research

1 messages

[T] Back to Threads [V] Tree View [G] Group Articles

1 total messages Started by Doug Scott Sun, 27 Sep 1992 21:00

#103

Author: 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

Thread Navigation

This is a paginated view of messages in the thread with full content displayed inline.

Messages are displayed in chronological order, with the original post highlighted in green.

Use pagination controls to navigate through all messages in large threads.

Back to All Threads