论文信息 - A parallel domain reduction method

A parallel domain reduction method

Abstract: We relate a particular version of a parallel multigrid method analyzed by C. Douglas, W. L. Miranker, and B. F. Smith ([4, 6]) to the domain decomposition method of D. Funaro, L. D. Marini, A. Quarteroni, and P. Zanolli ([7, 8]). We show that the parallel multigrid method is reducing computation to a small portion of the domain and then extending the solution to the entire domain using the correct re ections to get the exact solution. We extend a particular example to double the parallelism in a nonobvious manner. While the techniques of this paper are applied to two dimensional problems, they can be applied to higher dimensional problems in an obvious manner.

Franco Brezzi | L. Donatella Marini | Cralg C. Douglas

[1] Barry F. Smith,et al. Using symmetrics and antisymmetrics to analyze a parallel multigrid algorithm: the elliptic boundary value problem case , 1989 .

[2] Stephen Fahrney McCormick. Multigrid methods, theory applications, and supercomputing , 1990 .

[3] C. Douglas. Multi-Grid Algorithms with Applications to Elliptic Boundary Value Problems , 1984 .

[4] Alfio Quarteroni,et al. A relaxation procedure for domain decomposition methods using finite elements , 1989 .

[5] Craig Carl Douglas,et al. Multi-grid algorithms for elliptic boundary-value problems , 1982 .

[6] Alfio Quarteroni,et al. An Iterative Procedure with Interface Relaxation for Domain Decomposition Methods , 1988 .

[7] W. Miranker,et al. Constructive interference in parallel algorithms , 1988 .