Electronic Resource
Chichester
:
Wiley-Blackwell
Communications in Numerical Methods in Engineering
9 (1993), S. 259-267
ISSN:
1069-8299
Keywords:
Engineering
;
Engineering General
Source:
Wiley InterScience Backfile Collection 1832-2000
Topics:
Mathematics
,
Technology
Notes:
Two graph-theoretical algorithms are developed for bandwidth reduction of rectangular matrices. A K-total graph is defined for a selected cycle basis, generalized cycle basis and cut set basis of a graph. This transforms a simultaneous ordering of the elements of a basis and members of a graph into that of a nodal numbering of its K-total graph.The first algorithm uses the K-total graph and results in banded equilibrium and self-stress matrices. The second employs a nodal ordering algorithm followed by a member ordering process. This algorithm can be used for optimizing the bandwidth of member-cocycle incidence matrices, resulting in banded equilibrium matrices.
Additional Material:
6 Ill.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1002/cnm.1640090310
|
Location |
Call Number |
Expected |
Availability |
