Skip to main content
SpringerLink
Log in

Alternating methods for sets of linear equations

  • Published:
Numerische Mathematik Aims and scope Submit manuscript

Summary

A generalization of alternating methods for sets of linear equations is described and the number of operations calculated. It is shown that the lowest number of arithmetic operations is achieved in the SSOR algorithm.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Conrad, V., Wallach, Y.: Iterative solution of linear equations on a parallel processor system. Trans. IEEE (Computers),C-26, 838–847 (1977)

    Google Scholar 

  2. Conrad, V., Wallach, Y.: A faster SSOR Algorythm. Numer. Math.27, 371–372 (1977)

    Google Scholar 

  3. Niethammer, W.: Retaxation bei komplexen Matrizen. Math. Zeitschr.86, 34–40 (1964)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Electrical Engineering, Technion-Israel Institute of Technology, Haifa, Israel

    V. Conrad & Y. Wallach

Authors
  1. V. Conrad
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Y. Wallach
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Conrad, V., Wallach, Y. Alternating methods for sets of linear equations. Numer. Math. 32, 105–108 (1979). https://doi.org/10.1007/BF01397654

Download citation

  • Received:

  • Issue Date:

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

Subject Classifications

Search

Navigation