An algorithm for partitioning of finite element meshes

Citation
A. Kaveh et Gr. Roosta, An algorithm for partitioning of finite element meshes, ADV EN SOFT, 30(9-11), 1999, pp. 857-865
Citations number
26
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
857 - 865
Database
ISI
SICI code
0965-9978(199909/11)30:9-11<857:AAFPOF>2.0.ZU;2-3
Abstract
An efficient algorithm is developed for partitioning unstructured finite el ement meshes. A new graph model is presented and employed for transforming the connectivity properties of meshes. This method leads to a load balance partitioning in which the number of interface nodes are confined to the sma llest possible, and aspect ratios of subdomains are desired values. Example s are included to illustrate the performance and efficiency of the presente d method. (C) 1999 Elsevier Science Ltd and Civil-Comp Ltd. All rights rese rved.