Skip to main content

Solving large sparse linear systems with guaranteed accuracy

  • Conference paper
  • First Online:
Accurate Scientific Computations

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 235))

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliography

  1. Bohlender, G. (1977), Genaue Summation von Gleitkommazahlen. Pp.21–32 in: Computing Supplementum 1 Grundlagen der Computer Arithmetik (Springer, Berlin-Heidelberg-New York).

    Google Scholar 

  2. Collatz, L. (1964), Funktionalanalysis und numerische Mathematik. (Springer, Berlin-Heidelberg-New York).

    Google Scholar 

  3. Dekker, T.J. (1971), A floating-point technique for extending the available precision. Pp.224–242 in: Numerische Mathematik 18 (Springer, Berlin-Heidelberg-New York).

    Google Scholar 

  4. Gustavson, F. G. (1972), Some basic techniques for solving sparse systems of linear equations. Pp. 41–52 in: Rose, D.J., Willoughby, R.A. eds. Sparse matrices and their applications. Proceedings of a Symposium 1971 (Plenum Press, New York).

    Google Scholar 

  5. Hahn, W., Mohr, K., Schauer, U. (1983), Some techniques for solving linear equation systems with guarantee. (IBM technical note TN 83.01) to appear in Computing.

    Google Scholar 

  6. Hestenes, M. R. (1984), Conjugate direction methods in optimization. (Springer, Berlin-Heidelberg-New York).

    Google Scholar 

  7. ACRITH High accuracy arithmetic subroutine library. General information manual, IBM-GC33-6163. Program description and users guide, IBM-SC33-6164.

    Google Scholar 

  8. Johnson, O. G., Michelli, C. A., Paul, G.(1982), Polynomial preconditioners for conjugate gradient calculations. (IBM technical report RC9208).

    Google Scholar 

  9. Kahan, W.(1965), Further remarks on reducing truncation errors. P.40 in: Communications of the ACM Vol.8.

    Google Scholar 

  10. Kulisch, U., Miranker, W.L. (1980), Computer arithmetic in theory and practice. (Academic Press, London-New York-San Francisco).

    Google Scholar 

  11. Meijerink, J. A., Vorst, H. A.(1977), An iterative solution method for linear systems of which the coefficient matrix is a symmetric M-matrix. Pp. 148–162 in: Mathematics of computation 31,137.

    Google Scholar 

  12. Nickel, K. (1977), Interval analysis. Pp. 193–222 in: Jacobs, D. ed The state of the art in numerical analysis, Proceedings of a conference 1976 (Academic Press, London-New York-San Francisco).

    Google Scholar 

  13. Schek, H., Steidler, F., Schauer, U. (1977), Ausgleichung grosser geodätischer Netze mit Verfahren für schwach besetzte Matrizen. Theoretische Geodäsie 87 (Bayrische Akademie der Wissenschaften).

    Google Scholar 

  14. Rump, S. M. (1983), Solving Algebraic Problems with high accuracy. Pp. 53–118 in: Kulisch, U., Miranker, W.L. eds. A new approach to scientific computation, Proceedings of a symposium 1982. (Academic Press, London-New York-San Francisco).

    Google Scholar 

Download references

Authors

Editor information

Willard L. Miranker Richard A. Toupin

Rights and permissions

Reprints and permissions

Copyright information

© 1986 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Schauer, U., Toupin, R.A. (1986). Solving large sparse linear systems with guaranteed accuracy. In: Miranker, W.L., Toupin, R.A. (eds) Accurate Scientific Computations. Lecture Notes in Computer Science, vol 235. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16798-6_8

Download citation

  • DOI: https://doi.org/10.1007/3-540-16798-6_8

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-16798-3

  • Online ISBN: 978-3-540-47118-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics