WIT Press


Invited Paper An Efficient Fully Parallel Finite Difference SOR Algorithm For The Solution Of A Free Boundary Seepage Problem

Price

Free (open access)

Paper DOI

10.2495/MB930051

Volume

6

Pages

12

Published

1993

Size

1,122 kb

Author(s)

K.P. Wang & J.C. Bruch, Jr.

Abstract

Invited Paper An efficient fully parallel finite difference SOR algorithm for the solution of a free boundary seepage problem K.P. Wang, J.C. Bruch, Jr. Department of Mechanical and Environmental Engineering, University of California, Santa CVL ABSTRACT A fully parallel SOR algorithm is presented for the finite difference method. Also, techniques for domain decomposition are discussed. This parallel SOR iterative algorithm requires no overlapping blocks and no coloring scheme. By using domain decomposition and reordering the computation sequence, the inherently sequential SOR scheme is altered into a fully parallel iterative scheme. With this parallel SOR iterative scheme, not only computations for the mesh points in the subdomain but also computations for the mesh points on the interface are carried out parallelly. In addition, implementations of this scheme on an iPSC/2 D5 Hypercube concurrent Computer are presented. INTRODUCTION The SOR (succe

Keywords