Skip to main content
Log in

The SOR method on parallel computers

  • Published:
Numerische Mathematik Aims and scope Submit manuscript

Summary

The Jacobi Overrelaxation (JOR) method is usually cited as a “perfect” parallel algorithm, whereas the Successive Overrelaxation (SOR) method is considered as quite the opposite. For linear systems with dense matrices, an algorithm for the SOR method is presented which is suited for parallelization nearly in the same way as JOR. For systems with band matrices, an algorithm is described which, using a pipeline principle, yields a speedupS=p(1+(p−1)p/m) −1, wherep denotes the number of processors andm the number of SOR iterations. Thus form=p, there is no speedup whereas the speedup tends to its maximal valuep ifm tends to infinity.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Bonomo, J.P., Dyksen, W.R.: Pipelined iterative methods for shared memory machines. Techn. Rep. 688. Computer Science Department, Purdue University 1987

  2. Duff, I.S.: The influence of vector and parallel processors on numerical analysis. In: Iserles, A., Powell, J.D. (eds.) The state of the art in numerical analysis, pp. 359–407. Oxford: Clarendon Press 1987

    Google Scholar 

  3. Elsner, L.: Comparisons of weak regular splittings and multisplitting methods. Numer. Math.56, 283–289 (1989)

    Google Scholar 

  4. Frommer, A., Mayer, G.: Parallel interval multisplittings. Numer. Math.56, 255–267 (1989)

    Google Scholar 

  5. Heller, D.: A survey of parallel algorithms in numerical linear algebra. SIAM Rev.20, 740–777 (1978)

    Google Scholar 

  6. Missirlis, N.M.: Scheduling parallel iterative methods on multiprocessor systems. Parallel Comput.5, 295–302 (1987)

    Google Scholar 

  7. Neumann, M., Plemmons, R.J.: Convergence of parallel multisplitting iterative methods forM-matrices. Linear Algebra Appl.88/89, 559–573 (1987)

    Google Scholar 

  8. O'Leary, D.P., White, R.E.: Multi-splittings of matrices and parallel solution of linear systems. SIAM J. Algebra Disc. Method6, 630–640 (1985)

    Google Scholar 

  9. Ortega, J.M., Rheinboldt, W.C.: Iterative Solution of Nonlinear Equations in Several Variables, 1st Ed. New York: Academic Press 1970

    Google Scholar 

  10. Ortega, J.M., Voigt, R.G.: Solution of partial differential equations on vector and parallel computers. SIAM Rev.27, 149–270 (1985)

    Google Scholar 

  11. Patel, N.R., Jordan, H.F.: A parallelized point rowwise successive over-relaxation method on a multiprocessor. Parallel Comput.1, 207–222 (1984)

    Google Scholar 

  12. Robert, Y., Trystram, D.: Comments on scheduling parallel iterative methods on multiprocessor systems. Parallel Comput.7, 253–255 (1988)

    Google Scholar 

  13. Schönauer, W.: Scientific computing on vector computers, 1st Ed. Amsterdam: North Holland 1987

    Google Scholar 

  14. Varga, R.S.: Matrix iterative analysis, 1st Ed. Englewood Cliffs: Prentice Hall 1962

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

Dedicated to the memory of Peter Henrici

Research supported by the Air Force Office of Scientific Research

Rights and permissions

Reprints and permissions

About this article

Cite this article

Niethammer, W. The SOR method on parallel computers. Numer. Math. 56, 247–254 (1989). https://doi.org/10.1007/BF01409787

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01409787

Subject Classifications

Navigation