# zbMATH — the first resource for mathematics

On the solution of interval linear systems. (English) Zbl 0753.65030
This paper is concerned with one of the standard problems in numerical linear algebra: to compute lower and upper bounds for the solution of a system of linear equations in the presence of rounding errors and/or tolerances in the input data. Here iterative methods are considered. The author presents an algorithm for solving the stated problem with interval input data and interval operations. In particular practicable stopping criteria are discussed.
This algorithm is compared with an algorithm of A. Neumaier [Interval methods for systems of equations (1990; Zbl 0715.65030)]. A suitable combination of both yields tight bounds for input intervals of small and large diameter. In addition, tolerance regions different from intervals are considered, namely simplices. Some interesting examples show the difference between using intervals and using simplices.

##### MSC:
 65F10 Iterative numerical methods for linear systems 65G30 Interval and finite arithmetic
ACRITH-XSC
Full Text:
##### References:
 [1] ACRITH High-Accuracy Arithmetic Subroutine Library: General Information Manual, IBM Publications, GC33-6163 (1985). [2] Alefeld, G., Herzberger, J.: Introduction to interval computations. New York: Academic Press 1983. · Zbl 0552.65041 [3] Hansen, E.: Interval arithmetic in matrix computations, Part I. SIAM J. Numer. Anal.2, 308–320 (1965). · Zbl 0135.37303 [4] Hansen, E.: Interval arithmetic in matrix computations, Part II. SIAM J. Numer. Anal.4, 1–9 (1967). · Zbl 0209.46601 [5] IEEE 754 Standard for Floating-Point Arithmetic (1986). [6] Jansson, C.: A geometric approach for computing a posteriori error bounds for the solution of a linear system. Computing47, 1–9 (1991). · Zbl 0738.65040 [7] Jansson, C.: Guaranteed error bounds for the solution of linear systems, Contributions to Computer Arithmetic and Self-Validating Numerical Methods (C. Ullrich editor), J. C. Baltzer AG, Scientific Publishing Co. IMACS, S. 103–110 (1990). · Zbl 0784.65019 [8] Krawczyk, R.: Newton-Algorithmen zur Besimmung von Nullstellen mit Fehlerschranken. Computing4, 187–220 (1969). · Zbl 0187.10001 [9] Kulisch, U., Miranker, W. L.: Computer arithmetic in theory and practice. New York: Academic Press 1981. · Zbl 0487.65026 [10] Moore, R. E.: Interval analysis. Englewood Cliffs, New Jersey: Prentice Hall 1966. · Zbl 0176.13301 [11] Neumaier, A.: Interval methods for systems of equations. Cambridge University Press (1990). · Zbl 0715.65030 [12] Rump, S. M.: Kleine Fehlerschranken bei Matrixproblemen, Dissertation Universität Karlsruhe (1980). · Zbl 0437.65036 [13] Rump, S. M.: New results on verified inclusions, in: Miranker, W. L., R. Toupin (eds.): Accurate scientific computations. Springer Lecture Notes in Computer Science235, 31–69 (1986). [14] Siemens AG: Arithmos (BS2000). Benutzerhandbuch, (1986). [15] Varga, R. S.: Matrix iterative analysis. Englewood Cliffs, New Jersey: Prentice Hall 1962. · Zbl 0133.08602 [16] Rump, S. M.: Rigorous sensitivity analysis for systems of systems of linear and nonlinear equations. MATH. of Comp.54, (190) 721–736 (1990). · Zbl 0701.65039
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.