Parallel schwarz algorithm with under-relaxed pseudo-boundary conditions in domain decomposition method

International Journal of Computer Mathematics

Volumn 48, Issue 3-4, 1993, Pages 203-218

  Kim, Yong Hee ^a   Cho, Nam Zin ^a  

^a Korea Advanced Institute of Science and Technology (KAIST)   (South Korea)

Author keywords

domain decomposition; inner outer iterations; pseudo boundary underrelaxation; SAP (Schwarz Alternating Procedure)

Indexed keywords

BOUNDARY ELEMENT METHOD; BOUNDARY VALUE PROBLEMS; CONVERGENCE OF NUMERICAL METHODS; DIFFERENTIAL EQUATIONS; ITERATIVE METHODS; RELAXATION PROCESSES;

DOMAIN DECOMPOSITION METHOD; INNER/OUTER ITERATION; OPTIMAL RELAXATION FACTOR; OVER RELAXATION; PARALLEL SCHWARZ ALGORITHM; PSEUDO BOUNDARY CONDITION; SCHWARZ ALTERNATING PROCEDURE; UNDER RELAXATION;

ALGORITHMS;

EID: 0027848331     PISSN: 00207160     EISSN: 10290265     Source Type: Journal    
DOI: 10.1080/00207169308804203     Document Type: Article

References (5)

1. Kang Li-Shan, Domain Decomposition Method and Parallel Algorithm, Proc. of the Second Int. Symposium on Domain Decomposition Methods, edited by T. F. Chan et al, SIAM, 1988.
2. D. J. Evans et al., The convergence rate of the Schwarz alternating procedure (IV): With pseudo-boundary relaxation factor, Int. J. Computer Math., 21 (1987), 185–203.
3. Richard M. Stein, T800 and Counting, Nov., BYTE, (1988), 287–296.
4. G. Rodrigue and S. Shah, Pseudo-Boundary Conditions to Accelerate Parallel Schwarz Methods, Parallel Super computing: Methods, Algorithms and Applications, edited by G. F. Carey, John Wiley & Sons Ltd., Chichester, England, 1989.
5. E. L. Wachspress, Iterative Solution of Elliptic Systems, Prentice-Hall, Inc., Englewood Cliffs, N. J., 1966.