Prediction and numerical validation of optimal number of subdomains on balancing domain decomposition method

Yamada, Tomonori; Ogino, Masao*; Yoshimura, Shinobu*

Computation efficiency of the balancing domain decomposition method is investigated in this paper. An iterative substructuring method with coarse grid correction is one of the most effective methods for parallel computing of large scale structural finite element analyses. In this study, a prediction curve of parallel computation cost of the balancing domain decomposition method is proposed, and the optimal number of subdomains is estimated. Numerical validation of the optimal number of subdomains is conducted and the measured computation time with the optimal number of subdomains shows better computation performance than those with other numbers of subdomains.