{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,6]],"date-time":"2022-04-06T02:42:35Z","timestamp":1649212955883},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2005,4,1]],"date-time":"2005-04-01T00:00:00Z","timestamp":1112313600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Reliable Comput"],"published-print":{"date-parts":[[2005,4]]},"DOI":"10.1007\/s11155-005-3033-5","type":"journal-article","created":{"date-parts":[[2005,5,4]],"date-time":"2005-05-04T06:24:22Z","timestamp":1115187862000},"page":"129-135","source":"Crossref","is-referenced-by-count":0,"title":["Linear Interval Equations: Midpoint Preconditioning May Produce a 100% Overestimation for Arbitrarily Narrow Data Even in Case n = 4"],"prefix":"10.1007","volume":"11","author":[{"given":"Ji\u0159\u00ed","family":"Rohn","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","volume-title":"Computer Methods for Design Automation","author":"C. Bliek","year":"1992","unstructured":"Bliek, C.: Computer Methods for Design Automation, Ph.D. thesis, Massachusetts Institute of Technology, Cambridge, 1992."},{"key":"CR2","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 Interval Linear Equations, SIAM Journal on Numerical Analysis 29(1992), pp. 1493\u20131503.","journal-title":"SIAM Journal on Numerical Analysis"},{"issue":"2","key":"CR3","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1023\/A:1009997221089","volume":"5","author":"A. Neumaier","year":"1999","unstructured":"Neumaier, A.: A Simple Derivation of the Hansen-Bliek-Rohn-Ning-Kearfott Enclosure for Linear Interval Equations, Reliable Computing 5(2) (1999), pp. 131\u2013136.","journal-title":"Reliable Computing"},{"key":"CR4","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 Journal on Numerical Analysis 34(1997), pp. 1289\u20131305.","journal-title":"SIAM Journal on Numerical Analysis"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1007\/BF01386090","volume":"6","author":"W. Oettli","year":"1964","unstructured":"Oettli, W. and Prager, W.: Compatibility of Approximate Solution of Linear Equations with Given Error Bounds for Coefficients and Right-Hand Sides, Numerische Mathematik 6(1964), pp. 405\u2013409.","journal-title":"Numerische Mathematik"},{"key":"CR6","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 and Its Applications 126(1989), pp. 39\u201378.","journal-title":"Linear Algebra and Its Applications"},{"key":"CR7","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"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1080\/03081080008818644","volume":"47","author":"J. Rohn","year":"2000","unstructured":"Rohn, J.: Computing the Norm ||A||\u221e,1 Is NP-Hard, Linear and Multilinear Algebra 47(2000), pp. 195\u2013204.","journal-title":"Linear and Multilinear Algebra"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1137\/S0895479893251198","volume":"16","author":"J. Rohn","year":"1995","unstructured":"Rohn, J. and Kreinovich, V.: Computing Exact Componentwise Bounds on Solutions of Linear Systems with Interval Data Is NP-Hard, SIAM Journal on Matrix Analysis and Applications 16(1995), pp. 415\u2013420.","journal-title":"SIAM Journal on Matrix Analysis and Applications"}],"container-title":["Reliable Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11155-005-3033-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11155-005-3033-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11155-005-3033-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T04:31:34Z","timestamp":1559363494000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11155-005-3033-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,4]]},"references-count":9,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2005,4]]}},"alternative-id":["3033"],"URL":"https:\/\/doi.org\/10.1007\/s11155-005-3033-5","relation":{},"ISSN":["1385-3139","1573-1340"],"issn-type":[{"value":"1385-3139","type":"print"},{"value":"1573-1340","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,4]]}}}