A SOR ITERATIVE ALGORITHM FOR THE FINITE-DIFFERENCE AND THE FINITE-ELEMENT METHODS THAT IS EFFICIENT AND PARALLELIZABLE

An efficient and simple parallel SOR iterative algorithm is presented for the finite difference and finite element methods. Based on domain subdividing and computing sequence reordering, this algorithm has been proven to be efficient and simple to implement. No coloring scheme an d no overlapping blocks are required. With this parallel algorithm, no t only computations for the mesh points in the subdomain but also comp utations for the mesh points on the interface are carried out parallel ly. In addition, programming efforts to implement the parallel algorit hm are simplified. When compared with the results using the convention al sequential algorithm, excellent efficiencies are obtained using the parallel algorithm.