Geodesic
A necessary and sufficient criterion to guarantee feasibility of the interval Gaussian algorithm for a class of matrices
Applications of Mathematics, Tome 38 (1993) no. 3, pp. 205-220

Voir la notice de l'article provenant de la source Czech Digital Mathematics Library

MR Zbl
A necessary and sufficient to guarantee feasibility of the interval Gaussian algorithms for a class of matrices. We apply the interval Gaussian algorithm to an $n \times n$ interval matrix $[A]$ the comparison matrix $\left\langle [A]\right\rangle$ of which is irreducible and diagonally dominant. We derive a new necessary and sufficient criterion for the feasibility of this method extending a recently given sufficient criterion.
A necessary and sufficient to guarantee feasibility of the interval Gaussian algorithms for a class of matrices. We apply the interval Gaussian algorithm to an $n \times n$ interval matrix $[A]$ the comparison matrix $\left\langle [A]\right\rangle$ of which is irreducible and diagonally dominant. We derive a new necessary and sufficient criterion for the feasibility of this method extending a recently given sufficient criterion.
DOI : 10.21136/AM.1993.104547
Classification : 65F05, 65F10, 65G10, 65G30
Keywords: linear interval equations; Gaussian algorithm; interval Gaussian algorithm; linear systems of equations; criteria of feasibility; interval analysis 
Mayer, Günter; Pieper, Lars. A necessary and sufficient criterion to guarantee feasibility of the interval Gaussian algorithm for a class of matrices. Applications of Mathematics, Tome 38 (1993) no. 3, pp. 205-220. doi: 10.21136/AM.1993.104547
@article{10_21136_AM_1993_104547,
     author = {Mayer, G\"unter and Pieper, Lars},
     title = {A necessary and sufficient criterion to guarantee feasibility of the interval {Gaussian} algorithm for a class of matrices},
     journal = {Applications of Mathematics},
     pages = {205--220},
     year = {1993},
     volume = {38},
     number = {3},
     doi = {10.21136/AM.1993.104547},
     mrnumber = {1218026},
     zbl = {0782.65044},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.21136/AM.1993.104547/}
}
TY  - JOUR
AU  - Mayer, Günter
AU  - Pieper, Lars
TI  - A necessary and sufficient criterion to guarantee feasibility of the interval Gaussian algorithm for a class of matrices
JO  - Applications of Mathematics
PY  - 1993
SP  - 205
EP  - 220
VL  - 38
IS  - 3
UR  - http://geodesic.mathdoc.fr/articles/10.21136/AM.1993.104547/
DO  - 10.21136/AM.1993.104547
LA  - en
ID  - 10_21136_AM_1993_104547
ER  - 
%0 Journal Article
%A Mayer, Günter
%A Pieper, Lars
%T A necessary and sufficient criterion to guarantee feasibility of the interval Gaussian algorithm for a class of matrices
%J Applications of Mathematics
%D 1993
%P 205-220
%V 38
%N 3
%U http://geodesic.mathdoc.fr/articles/10.21136/AM.1993.104547/
%R 10.21136/AM.1993.104547
%G en
%F 10_21136_AM_1993_104547

[1] G. Alefeld: Über die Durchführbarkeit des Gaußschen Algorithmus bei Gleichungen mit Intervallen als Koeffizienten. Computing Suppl. 1 (1977), 15-19. | Zbl

[2] G. Alefeld, J. Herzberger: Introduction to Interval Computations. Academic Press, New York, 1983. | MR | Zbl

[3] H. Bauch K.-U. Jahn D. Oelschlägel H. Süsse, V. Wiebigke: Intervallmathematik. BSB B.G. Teubner Verlagsgesellschaft, 1987. | MR

[4] A. Berman, R. J. Plemmons: Nonnegative Matrices in the Mathematical Sciences. Academic Press, New York, 1979. | MR | Zbl

[5] A. Frommer, G. Mayer: A new criterion to guarantee the feasibility of the interval Gaussian algorithm. SIAM J. Matrix Anal. Appl., in press. | Zbl

[6] R. Klatte U. Kulisch M. Neaga D. Ratz, Ch. Ullrich: PASCAL-XSC, Sprachbeschreibung mit Beispielen. Springer, Berlin, 1991.

[7] G. Mayer: Old and new aspects of the interval Gaussian algorithm. Computer Arithmetic, Scientific Computation and Mathematical Modelling (E. Kaucher, S.M. Markov, G. Mayer, eds.), IMACS Annals on Computing and Applied Mathematics 12, Baltzer, Basel, 1991, pp. 329-349. | MR

[8] R.E. Moore: Interval Analysis. Prentice Hall, Englewood Cliffs, N.J., 1966. | MR | Zbl

[9] A. Neumaier: New techniques for the analysis of linear interval equations. Linear Algebra Appl. 58 (1984), 273-325. | DOI | MR | Zbl

[10] A. Neumaier: Interval Methods for Systems of Equations. Cambridge University Press, Cambridge, 1990. | MR | Zbl

[11] K. Reichmann: Abbruch beim Intervall-Gauss-Algorithmus. Computing 22 (1979), 355-361. | DOI | MR | Zbl

[12] R. S. Varga: Matrix Iterative Analysis. Prentice-Hall, Englewood Cliffs, N.J., 1963. | MR | Zbl

Cité par Sources :