This paper discusses the optimal preconditioning in the domain decomposition method for Wilson element. The process of the preconditioning is composed of the resolution of a small scale global problem based on a coars...This paper discusses the optimal preconditioning in the domain decomposition method for Wilson element. The process of the preconditioning is composed of the resolution of a small scale global problem based on a coarser grid and a number of independent local subproblems, which can be chosen arbitrarily. The condition number of the preconditioned system is estimated by some characteristic numbers related to global and local subproblems. With a proper selection, the optimal preconditioner can be obtained, while the condition number is independent of the scale of the problem and the number of subproblems.展开更多
In most domain decomposition (DD) methods, a coarse grid solve is employed to provide the global coupling required to produce an optimal method. The total cost of a method can depend sensitively on the choice of the c...In most domain decomposition (DD) methods, a coarse grid solve is employed to provide the global coupling required to produce an optimal method. The total cost of a method can depend sensitively on the choice of the coaxse grid size H. In this paper, we give a simple analysis of this phenomenon for a model elliptic problem and a variant of Smith's vertex space domain decomposition method [11, 3]. We derive the optimal value Hopt which asymptotically minimises the total cost of method (number of floating point operations in the sequential case and execution time in the parallel case), for subdomain solvers with different complekities. Using the value of Hopt, we derive the overall complexity of the DD method, which can be significantly lower than that of the subdomain solver展开更多
文摘This paper discusses the optimal preconditioning in the domain decomposition method for Wilson element. The process of the preconditioning is composed of the resolution of a small scale global problem based on a coarser grid and a number of independent local subproblems, which can be chosen arbitrarily. The condition number of the preconditioned system is estimated by some characteristic numbers related to global and local subproblems. With a proper selection, the optimal preconditioner can be obtained, while the condition number is independent of the scale of the problem and the number of subproblems.
文摘In most domain decomposition (DD) methods, a coarse grid solve is employed to provide the global coupling required to produce an optimal method. The total cost of a method can depend sensitively on the choice of the coaxse grid size H. In this paper, we give a simple analysis of this phenomenon for a model elliptic problem and a variant of Smith's vertex space domain decomposition method [11, 3]. We derive the optimal value Hopt which asymptotically minimises the total cost of method (number of floating point operations in the sequential case and execution time in the parallel case), for subdomain solvers with different complekities. Using the value of Hopt, we derive the overall complexity of the DD method, which can be significantly lower than that of the subdomain solver
