An algorithm for domain partitioning with load balancing

An algorithm domain partitioning with iterative load balancing is presented . A recursive graph labeling scheme is used to distribute elements among su bdomains at each iteration Both graph distance information and information about neighbor vertices are employed during the labeling process Element qu antities far balanced subdomains are predicted solving the algebraic load b alancing problem after each iteration. The same graph labeling scheme with slight modifications is applied to node renumbering inside subdomains. The proposed algorithm is especially suitable for load balancing when a direct method is used for subdomain condensation and the evaluation of cost functi on is time consuming Several examples of optimized partitioning of irregula r and regular meshes shaw that load balancing can be achieved with one to t hree iterations.