Abstract
Let A = (a ij ) ∈ ||Rnxn n x n be an interval matrix, i.e. each entry is a compact real interval. ‘Usual’ matrices A ∈ |Rnxn n x n with real coefficients will be called point matrices in this paper, and a similar notation and terminology is adopted for vectors. Let b ∈ ||Rnxn n be an interval vector. We are interested in computing an interval vector containing the solution set
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alefeld, G. (1977): Über die Durchführbarkeit des Gaussehen Algorithmus bei Gleichungen mit Intervallen als Koeffizienten. Computing Suppl. 1:15–19
Alefeld, G. and Herzberger, J. (1983): Introduction to Interval Computations. Academic Press, New York
Alefeld, G. and Mayer, G. (1993): The Cholesky method for interval data. Linear Algebra Appl. 194:161–182
Barth, W. and Nuding, E. (1974): Optimale Lösung von Intervallgleichungssystemen. Computing 12:117–125
Berman, A. and Plemmons, R. (1994): Nonnegative Matrices in the Mathematical Sciences, volume 9 of Classics in Applied Mathematics. SIAM, Philadelphia
Cormen, T., Leiserson, C. and Rivest, R. (1989): Introduction to Aigorithms. The MIT Press, Cambridge Mass.
Duff, I., Erisman, A. and Reid, J. (1989): Direct Methods for Sparse Matrices. Oxford Science Publications, Oxford
Frommer, A. and Mayer, G. (1993a): Linear systems with Ω-diagonally dominant matrices and related ones. Linear Algebra Appl. 186:165–181
Frommer, A. and Mayer, G. (1993b): A new criterion to guarantee the feasibility of the interval Gaussian algorithm. SIAM J. Matrix Anal. Appl. 14:408–419
Frommer, A. and Weinberg, A. (1999): Verified error bounds for linear systems through the Lanczos process. Reliable Computing 5:255–267
Mayer, G. (1991): Old and new aspects for the interval Gaussian algorithm. In: Kaucher, E., Markov, S. and Mayer, G. (eds.): Computer Arithmetic, Scientific Computation and Mathematical Modelling, Baltzer, Basel, pp. 329–349
Reichmann, K. (1975): Ein hinreichendes Kriterium für die Durchführbarkeit des Intervall-Gauss-Algorithmus bei Intervall-Hessenberg-Matrizen ohne Pivotsuche. Z. Angew. Math. Mech. 59:373–379
Reichmann, K. (1979): Abbruch beim Intervall-Gauss-Algorithmus. Computing 22:335–361
Schüfer, U. (1996): Talk presented at the workshop on scientific computing, Riezlern, october 1996.
Schüfer, U. (2000): The feasibility of the interval Gaussian algorithm for arrowhead matrices. Reliable Computing, to appear
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Wien
About this paper
Cite this paper
Frommer, A. (2001). A Feasibility Result for Interval Gaussian Elimination Relying on Graph Structure. In: Alefeld, G., Rohn, J., Rump, S., Yamamoto, T. (eds) Symbolic Algebraic Methods and Verification Methods. Springer, Vienna. https://doi.org/10.1007/978-3-7091-6280-4_8
Download citation
DOI: https://doi.org/10.1007/978-3-7091-6280-4_8
Publisher Name: Springer, Vienna
Print ISBN: 978-3-211-83593-7
Online ISBN: 978-3-7091-6280-4
eBook Packages: Springer Book Archive