New parallel SOR method by domain partitioning

SIAM Journal of Scientific Computing

Volumn 20, Issue 6, 1999, Pages 2261-2281

  Xie, Dexuan ^a   Adams, Loyce ^b  

^a NEW YORK UNIVERSITY   (United States)

^b UNIVERSITY OF WASHINGTON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ASYMPTOTIC STABILITY; CONVERGENCE OF NUMERICAL METHODS; DATA COMMUNICATION SYSTEMS; PARALLEL ALGORITHMS; PARALLEL PROCESSING SYSTEMS; THEOREM PROVING;

DOMAIN PARTITIONING; NONMIGRATORY PERMUTATION; POISSON MODEL PROBLEM; SUCCESSIVE OVERRELAXATION METHOD;

ITERATIVE METHODS;

EID: 0033296725     PISSN: 10648275     EISSN: None     Source Type: None    
DOI: 10.1137/S1064827597303370     Document Type: Article

References (36)

1. L. M. ADAMS AND J. M. ORTEGA, A multi-color SOR method for parallel computation, in Proceedings of the 1982 International Conference on Parallel Processing, Bellaire, MI, pp. 53-58.
2. L. M. ADAMS AND H. F. JORDAN, Is SOR color-blind? SIAM J. Sci. Statist. Comput., 7 (1986), pp. 490-506.
3. L. M. ADAMS, R. J. LEVEQUE, AND D. M. YOUNG, Analysis of the SOR iteration for the 9-point Laplacian, SIAM J. Numer. Anal., 25 (1988), pp. 1156-1180.
4. B. BAGHERI, T. W. CLARK AND L. R. SCOTT, A parallel dialect of FORTRAN Fortran Forum, 11 (1992), pp. 20-31.
5. D. P. BERTSEKAS AND J. N. TSITSIKLIS, Parallel and Distributed Computation, Prentice-Hall, Englewood Cliffs, NJ, 1989.
6. U. BLOCK, A. FROMMER, AND G. MAYER, Block coloring schemes for the SOR method on local memory parallel computers, Parallel Comput., 14 (1990), pp. 61-75.
7. S. C. EISENSTAT, Comments on scheduling parallel iterative methods on multiprocessor systems II, Parallel Comput., 11 (1989), pp. 241-244.
8. L. ELSNER, Comparisons of weak regular splittings and multisplitting methods, Numer. Math., 56 (1989), pp. 283-289.
9. D. J. EVANS, Parallel SOR iterative methods, Parallel Comput., 1 (1984), pp. 3-18.
10. L. A. HAGEMAN AND D. M. YOUNG, Applied iterative methods, Academic Press, New York, 1981.
11. W. KAHAN, Gauss - Seidel Methods of Solving Large Systems of Linear Equations, Ph.D. thesis, University of Toronto, Toronto, ON, Canada, 1958.
12. W. HACKBUSCH, Iterative Solution of Large Sparse Systems of Equations, translated and revised from the 1991 German original, Appl. Math. Sci. 95, Springer-Verlag, New York, 1994.
13. D. L. HARRAR II, Orderings, multicoloring, and consistently ordered matrices, SIAM J. Matrix Anal. Appl., 14 (1993), pp. 259-278.
14. D. P. O'LEARY AND R. E. WHITE, Multi-splittings of matrices and parallel solution of linear systems, SIAM J. Alg. Discrete Methods, 6 (1985), pp. 630-640.
15. R. G. MELHEM, Determination of stripe structures for finite element matrices, SIAM J. Numer. Anal., 24 (1987), pp. 1419-1433.
16. R. G. MELHEM AND K. V. S. RAMARAO, Multicolor reordering of sparse matrices resulting from irregular grids, ACM Trans. Math. Software, 14 (1988), pp. 117-138.
17. N. M. MISSIRLIS, Scheduling parallel iterative methods on multiprocessor systems, Parallel Comput., 5 (1987), pp. 295-302.
18. M. NEUMANN AND R. J. PLEMMONS, Convergence of parallel multisplitting iterative methods for M-matrices, Linear Algebra Appl., 88/89 (1987), pp. 559-573.
19. W. NIETHAMMER, The SOR method on parallel computers. Numer. Math, 56 (1989), pp. 247-254.
20. J. M. ORTEGA, Orderings for conjugate gradient preconditionings, SIAM J. Optim., 1 (1991), pp. 565-582.
21. J. M. ORTEGA AND R. G. VOIGT, Solution of partial differential equations on vector and parallel computers, SIAM Rev., 27 (1985), pp. 149-270.
22. A. M. OSTROWSKI, On the linear iteration procedures for symmetric matrices, Rend. Mat. Appl., 14 (1954), pp. 140-163.
23. N. R. PATEL AND H. F. JORDAN, A parallelized point row-wise successive over-relaxation method on a multiprocessor, Parallel Comput., 1 (1984), pp. 207-222.
24. M. J. QUINN, Designing Efficient Algorithms for Parallel Computers, McGraw-Hill, New York, 1987.
25. Y. ROBERT AND D. TRYSTRAM, Comments on scheduling parallel iterative methods on multi-processor systems, Parallel Comput., 7 (1988), pp. 253-255.
26. K. STÜEN AND U. TROTTENBERG, Multigrid methods: fundamental algorithms, model problem analysis and applications, in Multigrid Methods, Lecture Notes in Math. 960, Springer-Verlag, Berlin, New York, 1982, pp. 1-176.
27. UNIVERSITY OF TENNESSEE, MPI: A Message-Passing Interface Standard, Version 1.0, May 5, 1994.
28. R. VARGA, Matrix Iterative Analysis, Prentice-Hall, Englewood Cliffs, NJ, 1962.
29. J. WANG, Convergence analysis without regularity assumptions for multigrid algorithms based on SOR smoothing, SIAM J. Numer. Anal., 29 (1992), pp. 987-1001.
30. R. E. WHITE: Multisplittings and parallel iterative methods, Comput. Methods Appl. Mech. Engrg., 64 (1987), pp. 567-577.
31. R. E. WHITE, Multisplitting with different weighting schemes, SIAM J. Matrix Anal. Appl., 10 (1989), pp. 481-493.
32. R. E. WHITE, Multisplitting of a symmetric positive definite matrix, SIAM J. Matrix Anal. Appl., 11 (1990), pp. 69-82.
33. D. XIE AND L. R. SCOTT, The Parallel U-Cylce Multigrid Method, UH/MD Technical report 240, University of Houston, Houston, TX, 1997.
34. D. XIE, New Parallel Iteration Methods, New Nonlinear Multigrid Analysis, and Application in Computational Chemistry, Ph.D. thesis, UH/MD Research report 208, University of Houston, Houston, TX, 1995.
35. I. YAVNEH, On red-black SOR smoothing in multigrid, SIAM J. Sci. Comput., 17 (1996), pp. 180-192.
36. D. M. YOUNG, Iterative Solution of Large Linear System, Academic Press, New York, 1971.