SEMINAR
New Parallel SOR Methods by Domain Decomposition
Dexuan Xie
Department of Mathematics
University of Southern Mississippi
ABSTRACT
The successive over-relaxation (SOR) iterative method is an important solver for a class of large linear systems arising from finite element and finite difference approximation of partial differential equations. It is also a robust smoother as well as an efficient solver of the coarsest grid equations in the multigrid method (an optimal solver of the linear systems). However, the SOR method is essentially sequential in its original form. With the increasing use of parallel computers, it becomes important to parallelize SOR. Several parallel versions of the SOR method have been proposed and studied, and the red-black (or multicolor) SOR method is a widely-used parallel version of SOR.
This talk will present a new parallel SOR method, the PSOR method, formulated by using domain partitioning and interprocessor data communication techniques. PSOR is shown to have the same asymptotic rate of convergence as SOR and red-black SOR. Numerical results on MIMD multiprocessors indicate that PSOR is more efficient than red-black SOR in both computation and interprocessor data communication. Being defined on a domain paritioning, PSOR can be more easily applied to solving complicated problems (such as irregular geometries, high orders of discretization, and local grid refinement) than multicolor SOR.
WHERE: TEC 251
WHEN(day): Friday, September 3rd, 1999
WHEN(time): 2:00 PM
EVERYBODY IS INVITED