摘要
A domain decomposition method with many subregions and cross points is discussed.At each cross point, a subregion is selected to cover it, called a covering subdomain. Thecovering subdomains of different cross points do not intersect each other. The decompositionmethod in this paper is realized through a procedure of a combination of solving Dirichletproblems, mixed problems on subdomains and Dirichlet problems on the covering sub-domains. The idea of the two-subdomain Schwarz alternating method and two-subdomain paralleliterative decomposition method is used. There is no continuous counterpart of this algorithm,and only the discrete problem is discussed. This algorithm is highly parallel and has localcommunication property, and it suits to arbitrarily many subdomains decomposition.
A domain decomposition method with many subregions and cross points is discussed.At each cross point, a subregion is selected to cover it, called a covering subdomain. Thecovering subdomains of different cross points do not intersect each other. The decompositionmethod in this paper is realized through a procedure of a combination of solving Dirichletproblems, mixed problems on subdomains and Dirichlet problems on the covering sub-domains. The idea of the two-subdomain Schwarz alternating method and two-subdomain paralleliterative decomposition method is used. There is no continuous counterpart of this algorithm,and only the discrete problem is discussed. This algorithm is highly parallel and has localcommunication property, and it suits to arbitrarily many subdomains decomposition.
