An Efficient Parallel Quarter-sweep Point Iterative Algorithm for Solving Poisson Equation on SMP Parallel Computer
A new point iterative algorithm which uses the quarter-sweep approach was shown to be much faster than the full-and half- sweep point iterative algorithms for solving two dimensional Poison equation (Othman el at. 1998». However, the last two algorithms were found to be suitable for parallel implem...
保存先:
| 主要な著者: | , |
|---|---|
| フォーマット: | 論文 |
| 言語: | English English |
| 出版事項: |
Universiti Putra Malaysia Press
2000
|
| オンライン･アクセス: | http://psasir.upm.edu.my/id/eprint/3501/1/An_Efficient_Parallel_Quarter-sweep_Point_Iterative_Algorithm.pdf http://psasir.upm.edu.my/id/eprint/3501/ |
| タグ: |
タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!
|
| 要約: | A new point iterative algorithm which uses the quarter-sweep approach was shown to be much faster than the full-and half- sweep point iterative algorithms
for solving two dimensional Poison equation (Othman el at. 1998». However, the last two algorithms were found to be suitable for parallel implementation (Evans 1984) and Ali el at. (1997». In this paper, the parallel implementation
of the new algorithm with the chessboard (CB) strategy on Symmetry Multi Processors (SMP) parallel computer was presented. The experimental results of a test problem were compared with the later two parallel algorithms. |
|---|