AN EFFICIENT PROFILE REDUCTION ALGORITHM BASED ON THE FRONTAL ORDERING SCHEME AND THE GRAPH-THEORY

Cited 11 time in webofscience Cited 10 time in scopus
  • Hit : 265
  • Download : 0
A frontal ordering scheme is incorporated into the two step approach of finite element ordering. The algorithm involves ordering of the finite elements by the Cuthill-McKee algorithm and numbering of the nodes by a newly proposed scheme. The scheme is introduced for an efficient reduction of profiles of resulting stiffness matrices and is based on the concept of frontal ordering and the adjacency measure of the graph theory. A computer program is developed and many examples are tested. The results are compared with those of existing algorithms and demonstrate the efficiency and the reliability of the proposed algorithm.
Publisher
PERGAMON-ELSEVIER SCIENCE LTD
Issue Date
1992-09
Language
English
Article Type
Article
Keywords

BANDWIDTH; MATRIX

Citation

COMPUTERS STRUCTURES, v.44, no.6, pp.1339 - 1347

ISSN
0045-7949
DOI
10.1016/0045-7949(92)90376-B
URI
http://hdl.handle.net/10203/66198
Appears in Collection
ME-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 11 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0