Skip to main content
SpringerLink
Log in

A minimal residual class of algorithms for linear systems

Eine das Residuum minimierende Algorithmenklasse für lineare Gleichungen

  • Short Communication
  • Published:
Computing Aims and scope Submit manuscript

Abstract

A family of rapidly convergent algorithms to solve linear systems of equations are described. These methods are easy to implement. In an empirical comparison over a class of problems the presented algorithms were superior to several commonly used methods.

Zusammenfassung

Es wird eine Klasse von leicht zu, implementierenden Algorithmen vorgestellt. Diese werden anhand von praxisrelevanten Problemen mit prominenten Lösern verglichen. Speziell bei nichtsymmetrischen Aufgaben zeichnen sie sich gegenüber den konkurrierenden Verfahren durch ihr gutes Konvergenzverhalten aus.

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

References

  1. Atkinson, K.: An survey of numerical methods for the solution of Fredholm integral equations of the 2nd kind. SIAM, Philadelphia, p. 59 (1976).

    Google Scholar 

  2. Bank, R. E., Chan, T. F.: An analysis of the composite step biconjugate gradient method (Manuscript) (1993).

  3. Deuflhard, P., Freund, R., Walter, A.: Fast secant methods for the iterative solution of large nonsymmetric linear systems. IMPACT Comput. Sci. Eng.2, 244–276 (1990).

    Google Scholar 

  4. Kosmol, P.: Sekantenverfahren für lineare Gleichungen. Preprint 9205/92, Institut für Informatik und Praktische Mathematik, Universität Kiel, S. 7, 1992.

  5. Kosmol, P.: Methoden zur numerischen Behandlung nichtlinearer Gleichungen und Optimierungsaufgaben, 2. überarbeitete Auflage, S. 217. Stuttgart: Teubner 1993.

    Google Scholar 

  6. Vorst, H. A. van der: Bi-CGSTAB: a fast and smoothly converging variant of Bi-CG for the solution of nonsymmetric linear systems. SIAM J. Sci. Stat. Comput.13, 631–644 (1992).

    Google Scholar 

  7. Saad, Y., Schultz, M. H.: GMRES: A generalized minimal residual method for solving nonsymmetric linear systems. SIAM J. Sci. Statist. Comput.7, 860 (1986).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mathematisches Seminar Universität Kiel, D-24098, Kiel, Federal Republic of Germany

    P. Kosmol

  2. Institut für Informatik und Praktische Mathematik, Universität Kiel, D-24098, Kiel, Federal Republic of Germany

    I. Nissen

Authors
  1. P. Kosmol
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. I. Nissen
    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

Kosmol, P., Nissen, I. A minimal residual class of algorithms for linear systems. Computing 51, 335–343 (1993). https://doi.org/10.1007/BF02238540

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

AMS Subject Classifications

Key words

Search

Navigation