Please use this identifier to cite or link to this item:
Title: Parallel hydrodynamic finite element model with an N-Best refining partition scheme
Authors: Zhang, Z
Hong, H
Wai, OW 
Jiang, Y
Zhou, C
Keywords: Domain decomposition
Finite element method (FEM)
Graph partitioning
Parallel computation
Issue Date: 2010
Publisher: Science Press
Source: Chinese journal of oceanology and limnology, 2010, v. 28, no. 6, p. 1340-1349 How to cite?
Journal: Chinese Journal of Oceanology and Limnology 
Abstract: We enhance a robust parallel finite element model for coasts and estuaries cases with the use of N-Best refinement algorithms, in multilevel partitioning scheme. Graph partitioning is an important step to construct the parallel model, in which computation speed is a big concern. The partitioning strategy includes the division of the research domain into several semi-equal-sized sub-domains, minimizing the sum weight of edges between different sub-domains. Multilevel schemes for graph partitioning are divided into three phases: coarsening, partitioning, and uncoarsening. In the uncoarsening phase, many refinement algorithms have been proposed previously, such as KL, Greedy, and Boundary refinements. In this study, we propose an N-Best refinement algorithm and show its advantages in our case study of Xiamen Bay. Compared with original partitioning algorithm in previous models, the N-Best algorithm can speed up the computation by 1.9 times, and the simulation results are in a good match with the in-situ data.
ISSN: 0254-4059
DOI: 10.1007/s00343-010-9937-x
Appears in Collections:Journal/Magazine Article

View full-text via PolyU eLinks SFX Query
Show full item record

Page view(s)

Last Week
Last month
Citations as of Aug 13, 2018

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.