抄録
Iterative domain decomposition method (DDM) is one of effective methods for large scale problems for its excellent parallelism and variety of studies have already been done. As DDM needs iterative calculations between subdomains, it is important to reduce the number of iterations for its speed-up. In this research, we consider the use of Balancing Domain Decomposition (BDD) proposed by Mandel for DDM based on CG method which is adapted to arbitrary domain decomposition.
