Refining technique for multilevel graph k-partitioning and its application on domain decomposition non overlapping Schwarz technique for urban acoustic pollution

2009-06-01
Faucard, B.
Sorguç, Arzu
F., Magoules
I., Hagiwara
It is known that convergence rate of Domain Decomposition Method for finite element analysis depends on the mesh decomposition quality. In this study, a new approach for refinement algorithm to be employed in mesh segmentation is presented Method is based on multilevel quadrisection and octasection graph partitioning. In this method, the connection is guaranteed first by detecting the disconnected parts and then through the algorithm, assigning them to the domain which mostly contain the mesh of interest. Hence the resulting mesh structure has an improved quality with less number of nodes at the interface of subdomains yielding a decrease in the computational time. Method proposed in the paper is illustrated on a large scale urban noise pollution. The noise pollution model of the neighborhood of Tokyo Shibuya Train Station is obtained by using non-overlapping optimized Schwarz and it is seen that the proposed method reduce number of iterations and thus computation time significantly.
Citation Formats
B. Faucard, A. Sorguç, M. F., and H. I., “Refining technique for multilevel graph k-partitioning and its application on domain decomposition non overlapping Schwarz technique for urban acoustic pollution,” pp. 17–27, 2009, Accessed: 00, 2021. [Online]. Available: https://hdl.handle.net/11511/84403.