An Approach to Overcome Division by Zero in the Interval Gauss Algorithm

1. Alefeld, G. and Herzberger, J.: Introduction to Interval Computations, Academic Press, New York, 1983.

   Google Scholar 

2. Ando, T.: Totally Positive Matrices, Linear Algebra and Its Applications 90 (1987), pp. 165–219.

   Google Scholar 

3. Craven, T. and Csordas, G.: A Sufficient Condition for Strict Total Positivity of a Matrix, Linear and Multilinear Algebra 45 (1998), pp. 19–34.

   Google Scholar 

4. Gantmacher, F.: Matrizentheorie, Springer Verlag, Berlin, 1986.

   Google Scholar 

5. Gasca, M. and Micchelli, C.: Total Positivity and Its Applications, Kluwer Academic Publishers, Dordrecht, 1996.

   Google Scholar 

6. Gasca, M. and Peña, J. M.: Total Positivity and Neville Elimination, Linear Algebra and Its Applications 165 (1992), pp. 25–44.

   Google Scholar 

7. Garloff, J.: Totally Nonnegative Interval Matrices, in: Nickel, K., Interval Mathematics 1980, Academic Press, New York, 1980, pp. 317–327.

   Google Scholar 

8. Karlin, S.: Total Positivity, Stanford University Press, Stanford, 1968.

   Google Scholar 

9. Mayer, G.: Old and New Aspects of the Interval Gaussian Algorithm, in: Kaucher, E., Markov, S., and Mayer, G., IMACS Annals on Computing and Applied Mathematics, Baltzer, Basel, 1992, pp. 329–349.

   Google Scholar 

10. Reichmann, K.: Abbruch beim Interval-Gauss-Algorithmus, Computing 22 (1979), pp. 355–361.

    Google Scholar 

Download references