Citation
A. Kaveh et R. Roosta, A graph theoretical method for frontwidth reduction, ADV EN SOFT, 30(9-11), 1999, pp. 789-797
Citations number
43
Categorie Soggetti
Computer Science & Engineering
Journal title
ADVANCES IN ENGINEERING SOFTWARE
ISSN journal
09659978
→ ACNP
Volume
30
Issue
9-11
Year of publication
1999
Pages
789 - 797
Database
ISI
SICI code
0965-9978(199909/11)30:9-11<789:AGTMFF>2.0.ZU;2-G
Abstract
A graph theoretical approach is designed for element renumbering of finite
element meshes for frontwidth reduction of sparse matrices with symmetric s
tructures. In this heuristic, the problem is transformed into that of a gra
ph nodal ordering. The incidence graph of a mesh is used for representing i
ts connectivity. The efficiency of the method is illustrated through worst-
case analysis and examples of unstructured finite element models. (C) 1999
Elsevier Science Ltd and Civil-Comp Ltd. All rights reserved.