{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T13:31:16Z","timestamp":1758807076032,"version":"3.43.0"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1998,8,1]],"date-time":"1998-08-01T00:00:00Z","timestamp":901929600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1998,8,1]],"date-time":"1998-08-01T00:00:00Z","timestamp":901929600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Reliable Computing"],"published-print":{"date-parts":[[1998,8]]},"DOI":"10.1023\/a:1009997411503","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T19:25:11Z","timestamp":1040585111000},"page":"205-222","source":"Crossref","is-referenced-by-count":14,"title":["On the Applicability of the Interval Gaussian Algorithm"],"prefix":"10.1007","volume":"4","author":[{"given":"G\u00fcnter","family":"Mayer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ji\u0159\u00ed","family":"Rohn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"182508_CR1","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/978-3-7091-8471-4_2","volume":"1","author":"G. Alefeld","year":"1977","unstructured":"Alefeld, G.: \u00dcber die Durchf\u00fchrbarkeit des Gau\u00dfschen Algorithmus bei Gleichungen mit Intervallen als Koeffizienten, Computing Suppl.\n1 (1977), pp. 15\u201319.","journal-title":"Computing Suppl."},{"key":"182508_CR2","volume-title":"Introduction to Interval Computations","author":"G. Alefeld","year":"1983","unstructured":"Alefeld, G. and Herzberger, J.: Introduction to Interval Computations, Academic Press, New York, 1983."},{"key":"182508_CR3","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/BF02260368","volume":"12","author":"W. Barth","year":"1974","unstructured":"Barth, W. and Nuding, E.: Optimale L\u00f6sung von Intervallgleichungssystemen, Computing\n12 (1974), pp. 117\u2013125.","journal-title":"Computing"},{"key":"182508_CR4","doi-asserted-by":"crossref","first-page":"T208","DOI":"10.1002\/zamm.197405412118","volume":"54","author":"H. Beeck","year":"1974","unstructured":"Beeck, H.: Zur scharfen Au\u00dfenabsch\u00e4tzung der L\u00f6sungsmenge bei linearen Intervallgleichungssystemen, Z. Angew. Math. Mech.\n54 (1974), pp. T208\u2013T209.","journal-title":"Z. Angew. Math. Mech."},{"key":"182508_CR5","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/BF01303967","volume":"62","author":"K. Fan","year":"1958","unstructured":"Fan, K.: Topological Proof for Certain Theorems on Matrices with Non-Negative Elements, Monatsh. Math.\n62 (1958), pp. 219\u2013237.","journal-title":"Monatsh. Math."},{"key":"182508_CR6","doi-asserted-by":"crossref","first-page":"408","DOI":"10.1137\/0614029","volume":"14","author":"A. Frommer","year":"1993","unstructured":"Frommer, A. and Mayer, G.: A New Criterion to Guarantee the Feasibility of the Interval Gaussian Algorithm, SIAM J. Matrix Anal. Appl.\n14 (1993), pp. 408\u2013419.","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"182508_CR7","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/0024-3795(93)90289-Z","volume":"186","author":"A. Frommer","year":"1993","unstructured":"Frommer, A. and Mayer, G.: Linear Systems with \u03a9-diagonally Dominant Matrices and Related Ones, Linear Algebra Appl.\n186 (1993), pp. 165\u2013181.","journal-title":"Linear Algebra Appl."},{"key":"182508_CR8","volume-title":"Matrix Computations","author":"H. G. Golub","year":"1996","unstructured":"Golub, H. G. and van Loan, C. F.: Matrix Computations. Third Edition, The Johns Hopkins University Press, Baltimore, 1996.","edition":"Third Edition"},{"key":"182508_CR9","doi-asserted-by":"crossref","first-page":"1493","DOI":"10.1137\/0729086","volume":"29","author":"E. R. Hansen","year":"1992","unstructured":"Hansen, E. R.: Bounding the Solution of Linear Interval Equations, SIAM J. Numer. Anal.\n29 (1992), pp. 1493\u20131503.","journal-title":"SIAM J. Numer. Anal."},{"key":"182508_CR10","unstructured":"Hansen, E. R.: Gaussian Elimination in Interval Systems, Preprint, 1997."},{"key":"182508_CR11","first-page":"329","volume-title":"Computer Arithmetic, Scientific Computation and Mathematical Modelling. IMACS Annals on Computing and Applied Mathematics","author":"G. Mayer","year":"1991","unstructured":"Mayer, G.: Old and New Aspects of the Interval Gaussian Algorithm, in: Kaucher, E., Markov, S. M., and Mayer, G. (eds), Computer Arithmetic, Scientific Computation and Mathematical Modelling. IMACS Annals on Computing and Applied Mathematics\n12, Baltzer, Basel, 1991, pp. 329\u2013349."},{"key":"182508_CR12","doi-asserted-by":"crossref","first-page":"205","DOI":"10.21136\/AM.1993.104547","volume":"38","author":"G. Mayer","year":"1993","unstructured":"Mayer, G. and Pieper, L.: A Necessary and Sufficient Criterion to Guarantee the Feasibility of the Interval Gaussian Algorithm for Some Class of Matrices, Appl. Math.\n38 (1993), pp. 205\u2013220.","journal-title":"Appl. Math."},{"key":"182508_CR13","volume-title":"Interval Methods for Systems of Equations","author":"A. Neumaier","year":"1990","unstructured":"Neumaier, A.: Interval Methods for Systems of Equations, Cambridge University Press, Cambridge, 1990."},{"key":"182508_CR14","doi-asserted-by":"crossref","unstructured":"Neumaier, A.: The Wrapping Effect, Ellipsoid Arithmetic, Stability and Confidence Regions. in: Albrecht, R., Alefeld, G., and Stetter, H. J. (eds): Validation Numerics. Theory and Applications. Computing Supplementum\n9 (1993), pp. 175\u2013190.","DOI":"10.1007\/978-3-7091-6918-6_14"},{"key":"182508_CR15","unstructured":"Neumaier, A.: Personal Communication, 1997."},{"key":"182508_CR16","doi-asserted-by":"crossref","first-page":"1289","DOI":"10.1137\/S0036142994270995","volume":"34","author":"S. Ning","year":"1997","unstructured":"Ning, S. and Kearfott, R. B.: A Comparison of Some Methods for Solving Linear Interval Equations, SIAM J. Numer. Anal.\n34 (1997), pp. 1289\u20131305.","journal-title":"SIAM J. Numer. Anal."},{"key":"182508_CR17","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/0024-3795(89)90004-9","volume":"126","author":"J. Rohn","year":"1989","unstructured":"Rohn, J.: Systems of Linear Interval Equations, Linear Algebra Appl.\n126 (1989), pp. 39\u201378.","journal-title":"Linear Algebra Appl."},{"key":"182508_CR18","first-page":"13","volume":"4","author":"J. Rohn","year":"1993","unstructured":"Rohn, J.: Cheap and Tight Bounds: The Recent Result by E. Hansen Can Be Made More Efficient, Interval Computations 4 (1993), pp. 13\u201321.","journal-title":"Interval Computations"},{"issue":"4","key":"182508_CR19","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1023\/A:1009993319560","volume":"3","author":"J. Rohn","year":"1997","unstructured":"Rohn, J.: On Overestimations Produced by the Interval Gaussian Algorithm, Reliable Computing\n3(4) (1997), pp. 363\u2013368.","journal-title":"Reliable Computing"},{"key":"182508_CR20","doi-asserted-by":"crossref","unstructured":"Rump, S. M.: Validated Solution of Large Linear Systems, in: Albrecht, R., Alefeld, G., and Stetter, H. J. (eds): Validation Numerics. Theory and Applications. Computing Supplementum\n9 (1993), pp. 191\u2013212.","DOI":"10.1007\/978-3-7091-6918-6_15"},{"key":"182508_CR21","volume-title":"Matrix Iterative Analysis","author":"R. S. Varga","year":"1962","unstructured":"Varga, R. S.: Matrix Iterative Analysis, Prentice-Hall, Englewood Cliffs, N.J., 1962."}],"container-title":["Reliable Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1009997411503.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1009997411503\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1009997411503.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,6]],"date-time":"2025-08-06T09:40:35Z","timestamp":1754473235000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1009997411503"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,8]]},"references-count":21,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1998,8]]}},"alternative-id":["182508"],"URL":"https:\/\/doi.org\/10.1023\/a:1009997411503","relation":{},"ISSN":["1385-3139","1573-1340"],"issn-type":[{"type":"print","value":"1385-3139"},{"type":"electronic","value":"1573-1340"}],"subject":[],"published":{"date-parts":[[1998,8]]}}}