Abstract
An automatic algorithm is presented for reducing the bandwidth of symmetric interconnectivity matrices. The technique takes an arbitrary input scheme and reorders the nodes so as to reduce the bandwidth. A large number of examples is presented to illustrate the reliability and cost-effectiveness of the method.
| Original language | English |
|---|---|
| Pages (from-to) | 1139-1152 |
| Number of pages | 14 |
| Journal | International Journal for Numerical Methods in Engineering |
| Volume | 19 |
| Issue number | 8 |
| DOIs | |
| Publication status | Published - Aug 1983 |
| MoE publication type | A1 Journal article-refereed |