1999
DOI: 10.1137/s1064827597303370
|View full text |Cite
|
Sign up to set email alerts
|

New Parallel SOR Method by Domain Partitioning

Abstract: In this paper we propose and analyze a new parallel SOR method, the PSOR method, formulated by using domain partitioning and interprocessor data communication techniques. We prove that the PSOR method has the same asymptotic rate of convergence as the Red/Black (R/B) SOR method for the five-point stencil on both strip and block partitions, and as the four-color (R/B/G/O) SOR method for the nine-point stencil on strip partitions. We also demonstrate the parallel performance of the PSOR method on four different … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
21
0

Year Published

2000
2000
2015
2015

Publication Types

Select...
6
1

Relationship

1
6

Authors

Journals

citations
Cited by 34 publications
(21 citation statements)
references
References 28 publications
(31 reference statements)
0
21
0
Order By: Relevance
“…To avoid idle processors on the coarse grid levels of the multigrid algorithm, the U-cycle approach was employed in the parallel implementation [11]. In these tests, the coarsest grid linear system was solved by the PSOR method (a parallel SOR method by mesh partitioning, which has the same convergence rate as the sequential SOR method) [10]. Both the PSOR method and the JSOR smoother were defined on the 8-strips partitioning.…”
Section: Numerical Resultsmentioning
confidence: 99%
“…To avoid idle processors on the coarse grid levels of the multigrid algorithm, the U-cycle approach was employed in the parallel implementation [11]. In these tests, the coarsest grid linear system was solved by the PSOR method (a parallel SOR method by mesh partitioning, which has the same convergence rate as the sequential SOR method) [10]. Both the PSOR method and the JSOR smoother were defined on the 8-strips partitioning.…”
Section: Numerical Resultsmentioning
confidence: 99%
“…Since the conventional successive over relaxation (SOR) scheme is not suitable for parallel computation, the parallel SOR (PSOR) method has been proposed by Xie and Adams (1999). Current common methods in NWP models are the conjugate gradient method or conjugate residual method with appropriate preconditioners (e.g., Kapitza and Eppel 1987;Ajmani et al 1994).…”
Section: Relative Advantages In Three Methodsmentioning
confidence: 99%
“…Therefore, it is important to choose an algorithm that performs well for this task. Here, an adapted (3D) version of the Parallel Successive Overrelaxation (PSOR, see [10,11]) algorithm is used, because it has the least memory requirements, a good convergence rate and shows the most efficient parallelization. It is superior to gradient methods because of the lack of efficient parallel preconditioners for gradient methods.…”
Section: Iterative Numerical Solution (Simple Algorithm)mentioning
confidence: 99%