Electronic Resource
Chichester
:
Wiley-Blackwell
Communications in Numerical Methods in Engineering
11 (1995), S. 995-1003
ISSN:
1069-8299
Keywords:
bandwidth
;
ordering
;
finite elements
;
graphs
;
algorithms
;
sparsity
;
Engineering
;
Engineering General
Source:
Wiley InterScience Backfile Collection 1832-2000
Topics:
Mathematics
,
Technology
Notes:
Graph theoretical algorithms are presented for finite element nodal ordering to reduce the bandwidth of their stiffness matrices. Five different graphs are defined for representing the connectivity of FE models, and the problem of finite element nodal ordering is transformed into that of a graph nodal ordering. The efficiencies of these methods are compared through examples of two- and three-dimensional finite element models.
Additional Material:
9 Ill.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1002/cnm.1640111205
| Library |
Location |
Call Number |
Volume/Issue/Year |
Availability |
