Skip to main content

Advertisement

Springer Nature Link
Log in

A geometric approach for computing a posteriori error bounds for the solution of a linear system

Ein geometrischer Zugang zur Berechnung von a posteriori Fehlerschranken für die Lösung eines linearen Gleichungssystems

  • Published:
Computing Aims and scope Submit manuscript

Abstract

A geometric approach for calculating guaranteed error bounds for the solution of a linear system is presented. The error bounds are derived by simple geometric properties of the theory of convex polyhedrons. This approach basically differs from other well-known techniques and gives an optimal geometric characterization of the error bounds.

Zusammenfassung

Zur Berechnung von a posteriori Fehlerschranken für die Lösung linearer Gleichungssysteme wird eine Methode, basierend auf der Theorie konvexer Polyeder, vorgestellt. Dieser Zugang erlaubt eine optimale geometrische Charakterisierung der berechneten Fehlerschranken.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. Alefeld, G., Herzberger, J.: Introduction to interval computations. Academic Press 1983.

  2. Bauch, H., Jahn, K.-U., Oelschlägel, D., Süsse, H., Wiebigke, VI: Intervallmathematik, Theorie und Anwendungen, Mathematisch-Naturwissenschaftliche Bibliothek, Band 72, Leipzig: B. G. Teubner, 1987.

    Google Scholar 

  3. Krawczyk, R.: Newton-Algorithmen zur Bestimmung von Nullstellen mit Fehlerschranken, Computing,4, 187–201 (1969).

    Google Scholar 

  4. Kulisch, U. W.: Computer arithmetic in theory and practice. Academic Press 1981.

  5. McMullan, P., Sheppard, G. C.: Convex polytopes and the upper bound conjecture. Cambridge 1971.

  6. Moore, R. E.: Methods and applications of interval analysis. SIAM Philadelphia 1979.

  7. Neumaier, A.: Interval methods for systems of equations. Cambridge: University Press 1990.

    Google Scholar 

  8. Rump, S. M.: Solving algebraic problems with high accuracy, Habilitationsschrift in: Kulisch Miranker (eds.) A new approach to scientific computation. Academic Press 1983.

  9. Rump, S. M.: Estimation of the sensitivity of linear and nonlinear algebraic problems. Linear Algebra and its Applications151, 85–109 (1991).

    Google Scholar 

  10. Stoer, J., Wilzgall, G.: Convexity and optimization in finite dimensions I. Berlin Heidelberg New York Tokyo: Springer 1970.

    Google Scholar 

  11. Stoer, J.: Einführung in die Numerische Mathematik I, 4. Aufl., Berlin Heidelberg New York Tokyo: Springer 1983.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Informatik III, Technische Universität, Eißendorfer Straße 38, D-W-2100, Hamburg-Harburg 90, Federal Republic of Germany

    C. Jansson

Authors
  1. C. Jansson
    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

Jansson, C. A geometric approach for computing a posteriori error bounds for the solution of a linear system. Computing 47, 1–9 (1991). https://doi.org/10.1007/BF02242018

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

AMS subject Classifications

Key words